Related papers: The local geometry of testing in ellipses: Tight c…
The Gaussian width is a fundamental quantity in probability, statistics and geometry, known to underlie the intrinsic difficulty of estimation and hypothesis testing. In this work, we show how the Gaussian width, when localized to any given…
Robust statistical inference often faces a severe computational-statistical gap when dealing with complex parameter spaces. We investigate minimax signal detection in the Gaussian sequence model under strong $\epsilon$-contamination, where…
We consider a compound testing problem within the Gaussian sequence model in which the null and alternative are specified by a pair of closed, convex cones. Such cone testing problem arise in various applications, including detection of…
We construct new testing procedures for spherical and elliptical symmetry based on the characterization that a random vector $X$ with finite mean has a spherical distribution if and only if $\Ex[u^\top X | v^\top X] = 0$ holds for any two…
We consider a Gaussian sequence model that contains ill-posed inverse problems as special cases. We assume that the associated operator is partially unknown in the sense that its singular functions are known and the corresponding singular…
In this paper, we investigate the approximation problem for functions in Gaussian Sobolev spaces $W^s_p(\mathbb{R}^d, \gamma)$ of smoothness $s > 0$, where the approximation error is measured in the Gaussian Lebesgue space…
In a circular convolution model, we aim to infer on the density of a circular random variable using observations contaminated by an additive measurement error. We highlight the interplay of the two problems: optimal testing and quadratic…
Ellipsoid fitting is of general interest in machine vision, such as object detection and shape approximation. Most existing approaches rely on the least-squares fitting of quadrics, minimizing the algebraic or geometric distances, with…
In this paper, a novel technique for tight outer-approximation of the intersection region of a finite number of ellipses in 2-dimensional (2D) space is proposed. First, the vertices of a tight polygon that contains the convex intersection…
We study the problem of finding the Lowner-John ellipsoid, i.e., an ellipsoid with minimum volume that contains a given convex set. We reformulate the problem as a generalized copositive program, and use that reformulation to derive…
We consider the problem of learning uncertainty regions for parameter estimation problems. The regions are ellipsoids that minimize the average volumes subject to a prescribed coverage probability. As expected, under the assumption of…
A mesh-free numerical method for solving linear elliptic PDE's using the local kernel theory that was developed for manifold learning is proposed. In particular, this novel approach exploits the local kernel theory which allows one to…
Consider the standard Gaussian linear regression model $Y=X\theta+\epsilon$, where $Y\in R^n$ is a response vector and $ X\in R^{n*p}$ is a design matrix. Numerous work have been devoted to building efficient estimators of $\theta$ when $p$…
The presence of outliers can significantly degrade the performance of ellipse fitting methods. We develop an ellipse fitting method that is robust to outliers based on the maximum correntropy criterion with variable center (MCC-VC), where a…
In this paper we completely solve the problem of finding the (upper) approximation order with respect to the Kolmogorov, Gel'fand, and linear widths for the embedding of the Sobolev spaces $W^{\alpha,p}$ and $W_{0}^{\alpha,p}$ in the…
In the inverse Gaussian sequence space model with additional noisy observations of the operator, we derive nonasymptotic minimax radii of testing for ellipsoid-type alternatives simultaneously for both the signal detection problem (testing…
Our contribution in this paper is two folded. We consider first the case of linear programming with real coefficients and give a method which allows the computation of a new upper bound on the distance from the origin to a feasible point.…
This short communication addresses the problem of elliptic localization with outlier measurements. Outliers are prevalent in various location-enabled applications, and can significantly compromise the positioning performance if not…
Ellipse and ellipsoid fitting has been extensively researched and widely applied. Although traditional fitting methods provide accurate estimation of ellipse parameters in the low-noise case, their performance is compromised when the noise…
This paper studies the problem of robust signal detection in Gaussian noise under quadratically convex orthosymmetric (QCO) constraints. We consider a minimax testing framework where the signal belongs to a QCO set and is separated from…