English
Related papers

Related papers: A Note on High-Dimensional Confidence Regions

200 papers

In the setup of i.i.d.~observations and a real valued differentiable functional~$T$, locally asymptotic upper bounds are derived for the power of one-sided tests (simple, versus large values of~$T$)and for the confidence probability of…

Statistics Theory · Mathematics 2014-12-05 Helmut Rieder

We build confidence balls for the common density $s$ of a real valued sample $X_1,...,X_n$. We use resampling methods to estimate the projection of $s$ onto finite dimensional linear spaces and a model selection procedure to choose an…

Statistics Theory · Mathematics 2010-07-27 Matthieu Lerasle

In this note we link symplectic and convex geometry by relating two seemingly different open conjectures: a symplectic isoperimetric-type inequality for convex domains, and Mahler's conjecture on the volume product of centrally symmetric…

Metric Geometry · Mathematics 2015-01-14 Shiri Artstein-Avidan , Roman Karasev , Yaron Ostrover

We derive concentration inequalities for the supremum norm of the difference between a kernel density estimator (KDE) and its point-wise expectation that hold uniformly over the selection of the bandwidth and under weaker conditions on the…

Statistics Theory · Mathematics 2020-01-01 Jisu Kim , Jaehyeok Shin , Alessandro Rinaldo , Larry Wasserman

This paper is concerned with testing global null hypotheses about population mean vectors of high-dimensional data. Current tests require either strong mixing (independence) conditions on the individual components of the high-dimensional…

Statistics Theory · Mathematics 2023-09-06 Alexander Giessing , Jianqing Fan

We study the problem of finding confidence ellipsoids for an arbitrary distribution in high dimensions. Given samples from a distribution $D$ and a confidence parameter $\alpha$, the goal is to find the smallest volume ellipsoid $E$ which…

Data Structures and Algorithms · Computer Science 2026-05-12 Chao Gao , Liren Shan , Vaidehi Srinivas , Aravindan Vijayaraghavan

We provide a new version of delta theorem, that takes into account of high dimensional parameter estimation. We show that depending on the structure of the function, the limits of functions of estimators have faster or slower rate of…

Statistics Theory · Mathematics 2017-01-24 Mehmet Caner

We consider inference for high-dimensional separately and jointly exchangeable arrays where the dimensions may be much larger than the sample sizes. For both exchangeable arrays, we first derive high-dimensional central limit theorems over…

Econometrics · Economics 2021-07-13 Harold D. Chiang , Kengo Kato , Yuya Sasaki

The approximability of a convex body is a number which measures the difficulty to approximate that body by polytopes. We prove that twice the approximability is equal to the volume entropy for a Hilbert geometry in dimension two end three…

Metric Geometry · Mathematics 2017-03-01 Constantin Vernicos

This article studies statistical estimation of $\pi$ based on the fact that the ratio of the volumes of a $d$-dimensional hypersphere and a $d$-dimensional hypercube is a certain function of $\pi$, and the function depends on the dimension…

Other Statistics · Statistics 2025-10-29 Syon Bhattacharjee , Subhra Sankar Dhar

Confidence limits are common place in physics analysis. Great care must be taken in their calculation and use, especially in cases of limited statistics when often one-sided limits are quoted. In order to estimate the stability of the…

Data Analysis, Statistics and Probability · Physics 2007-05-23 Rajendran Raja

We prove a pointwise version of the multi-dimensional central limit theorem for convex bodies. Namely, let X be an isotropic random vector in R^n with a log-concave density. For a typical subspace E in R^n of dimension n^c, consider the…

Metric Geometry · Mathematics 2007-08-21 Ronen Eldan , Bo'az Klartag

It is shown that the volume entropy of a Hilbert geometry associated to an $n$-dimensional convex body of class $C^{1,1}$ equals $n-1$. To achieve this result, a new projective invariant of convex bodies, similar to the centro-affine area,…

Differential Geometry · Mathematics 2010-05-21 Gautier Berck , Andreas Bernig , Constantin Vernicos

The trust-region problem, which minimizes a nonconvex quadratic function over a ball, is a key subproblem in trust-region methods for solving nonlinear optimization problems. It enjoys many attractive properties such as an exact…

Optimization and Control · Mathematics 2013-09-13 V. Jeyakumar , G. Li

Consider the hyperplanes at a fixed distance $t$ from the center of the hypercube $[0,1]^d$. Significant attention has been given to determining the hyperplanes $H$ among these such that the $(d-1)$-dimensional volume of $H\cap[0,1]^d$ is…

Metric Geometry · Mathematics 2024-06-25 Lionel Pournin

The "Mahler volume" is, intuitively speaking, a measure of how "round" a centrally symmetric convex body is. In one direction this intuition is given weight by a result of Santalo, who in the 1940s showed that the Mahler volume is…

Metric Geometry · Mathematics 2018-11-07 Matthew Tointon

This paper proposes a theory for $\ell_1$-norm penalized high-dimensional $M$-estimators, with nonconvex risk and unrestricted domain. Under high-level conditions, the estimators are shown to attain the rate of convergence…

Statistics Theory · Mathematics 2022-04-14 Jad Beyhum , François Portier

In the nonparametric Gaussian sequence space model an $\ell^2$-confidence ball $C_n$ is constructed that adapts to unknown smoothness and Sobolev-norm of the infinite-dimensional parameter to be estimated. The confidence ball has exact and…

Statistics Theory · Mathematics 2015-07-10 Richard Nickl , Botond Szabó

In a linear regression model of fixed dimension $p \leq n$, we construct confidence regions for the unknown parameter vector based on the Lasso estimator that uniformly and exactly hold the prescribed in finite samples as well as in an…

Statistics Theory · Mathematics 2018-10-08 Karl Ewald , Ulrike Schneider

Let X be a data matrix of rank \rho, whose rows represent n points in d-dimensional space. The linear support vector machine constructs a hyperplane separator that maximizes the 1-norm soft margin. We develop a new oblivious dimension…

Machine Learning · Computer Science 2014-04-18 Saurabh Paul , Christos Boutsidis , Malik Magdon-Ismail , Petros Drineas