Certifying Random Polynomials over the Unit Sphere via Sum of Squares Hierarchy
نویسندگان
چکیده
Given a random n-variate degree-d homogeneous polynomial f , we study the following problem:
منابع مشابه
Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere
For an n-variate order-d tensor A, define Amax := sup‖x‖2=1〈A, x ⊗d〉 to be the maximum value taken by the tensor on the unit sphere. It is known that for a random tensor with i.i.d. ±1 entries, Amax . √ n · d · log d w.h.p. We study the problem of efficiently certifying upper bounds on Amax via the natural relaxation from the Sum of Squares (SoS) hierarchy. Our results include: When A is a rand...
متن کاملAssociation schemes, non-commutative polynomial concentration, and sum-of-squares lower bounds for planted clique
Finding cliques in random graphs and the closely related “planted” clique variant, where a clique of size t is planted in a random G(n, 1/2) graph, have been the focus of substantial study in algorithm design. Despite much effort, the best known polynomialtime algorithms only solve the problem for t = Θ( √ n). Here we show that beating √ n would require substantially new algorithmic ideas, by p...
متن کاملDecomposition of High Angular Resolution Diffusion Images into a Sum of Self-Similar Polynomials on the Sphere
We propose a tensorial expansion of high resolution diffusion imaging (HARDI) data on the unit sphere into a sum of self-similar polynomials, i.e. polynomials that retain their form up to a scaling under the act of lowering resolution via the diffusion semigroup generated by the Laplace-Beltrami operator on the sphere. In this way we arrive at a hierarchy of HARDI degrees of freedom into contra...
متن کاملNumerical solution of the spread of infectious diseases mathematical model based on shifted Bernstein polynomials
The Volterra delay integral equations have numerous applications in various branches of science, including biology, ecology, physics and modeling of engineering and natural sciences. In many cases, it is difficult to obtain analytical solutions of these equations. So, numerical methods as an efficient approximation method for solving Volterra delay integral equations are of interest to many res...
متن کاملEfficient Inference of Continuous Markov Random Fields with Polynomial Potentials
In this paper, we prove that every multivariate polynomial with even degree can be decomposed into a sum of convex and concave polynomials. Motivated by this property, we exploit the concave-convex procedure to perform inference on continuous Markov random fields with polynomial potentials. In particular, we show that the concave-convex decomposition of polynomials can be expressed as a sum-of-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1605.00903 شماره
صفحات -
تاریخ انتشار 2016