Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe Moment-SOS hierarchy and the Christoffel-Darboux kernel
99
0
0.0
(
0
)
Authors
Jean-Bernard Lasserre
Ask ChatGPT about the research
No Arabic abstract
We consider the global minimization of a polynomial on a compact set B. We show that each step of the Moment-SOS hierarchy has a nice and simple interpretation that complements the usual one. Namely, it computes coefficients of a polynomial in an orthonormal basis of L 2 (B, $mu$) where $mu$ is an arbitrary reference measure whose support is exactly B. The resulting polynomial is a certain density (with respect to $mu$) of some signed measure on B. When some relaxation is exact (which generically takes place) the coefficients of the optimal polynomial density are values of orthonormal polynomials at the global minimizer and the optimal (signed) density is simply related to the Christoffel-Darboux (CD) kernel and the Christoffel function associated with $mu$. In contrast to the hierarchy of upper bounds which computes positive densities, the global optimum can be achieved exactly as integration against a polynomial (signed) density because the CD-kernel is a reproducing kernel, and so can mimic a Dirac measure (as long as finitely many moments are concerned).
rate research
Read More
We introduce from an analytic perspective Christoffel-Darboux kernels associated to bounded, tracial noncommutative distributions. We show that properly normalized traces, respectively norms, of evaluations of such kernels on finite dimensional matrices yield classical plurisubharmonic functions as the degree tends to infinity, and show that they are comparable to certain noncommutati
The Clopper-Pearson confidence interval has ever been documented as an exact approach in some statistics literature. More recently, such approach of interval estimation has been introduced to probabilistic control theory and has been referred as non-conservative in control community. In this note, we clarify the fact that the so-called exact approach is actually conservative. In particular, we derive analytic results demonstrating the extent of conservatism in the context of probabilistic robustness analysis. This investigation encourages seeking better methods of confidence interval construction for robust control purpose.
We extend balloon and sample-smoothing estimators, two types of variable-bandwidth kernel density estimators, by a shift parameter and derive their asymptotic properties. Our approach facilitates the unified study of a wide range of density estimators which are subsumed under these two general classes of kernel density estimators. We demonstrate our method by deriving the asymptotic bias, variance, and mean (integrated) squared error of density estimators with gamma, log-normal, Birnbaum-Saunders, inverse Gaussian and reciprocal inverse Gaussian kernels. We propose two new density estimators for positive random variables that yield properly-normalised density estimates. Plugin expressions for bandwidth estimation are provided to facilitate easy exploratory data analysis.
Outlier detection methods have become increasingly relevant in recent years due to increased security concerns and because of its vast application to different fields. Recently, Pauwels and Lasserre (2016) noticed that the sublevel sets of the inverse Christoffel function accurately depict the shape of a cloud of data using a sum-of-squares polynomial and can be used to perform outlier detection. In this work, we propose a kernelized variant of the inverse Christoffel function that makes it computationally tractable for data sets with a large number of features. We compare our approach to current methods on 15 different data sets and achieve the best average area under the precision recall curve (AUPRC) score, the best average rank and the lowest root mean square deviation.
The $hat B_n^{(1)}$-hierarchy is constructed from the standard splitting of the affine Kac-Moody algebra $hat B_n^{(1)}$, the Drinfeld-Sokolov $hat B_n^{(1)}$-KdV hierarchy is obtained by pushing down the $hat B_n^{(1)}$-flows along certain gauge orbit to a cross section of the gauge action. In this paper, we (1) use loop group factorization to construct Darboux transforms (DTs) for the $hat B_n^{(1)}$-hierarchy, (2) give a Permutability formula and scaling transform for these DTs, (3) use DTs of the $hat B_{n}^{(1)}$-hierarchy to construct DTs for the $hat B_n^{(1)}$-KdV and the isotropic curve flows of B-type, (4) give algorithm to construct soliton solutions and write down explicit soliton solutions for the third $hat B_1^{(1}$-KdV, $hat B_2^{(1)}$-KdV flows and isotropic curve flows on $mathbb{R}^{2,1}$ and $mathbb{R}^{3,2}$ of B-type.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
