English
Related papers

Related papers: Spherical Cap Packing Asymptotics and Rank-Extreme…

200 papers

We study the spherical cap packing problem with a probabilistic approach. Such probabilistic considerations result in an asymptotic sharp universal uniform bound on the maximal inner product between any set of unit vectors and a…

Statistics Theory · Mathematics 2017-05-08 Kai Zhang

Inspired by the boolean discrepancy problem, we study the following optimization problem which we term \textsc{Spherical Discrepancy}: given $m$ unit vectors $v_1, \dots, v_m$, find another unit vector $x$ that minimizes $\max_i \langle x,…

Computational Complexity · Computer Science 2019-11-19 Chris Jones , Matt McPartlon

Motivated by the fact that circular or spherical data are often much concentrated around a location $\pmb\theta$, we consider inference about $\pmb\theta$ under "high concentration" asymptotic scenarios for which the probability of any…

Statistics Theory · Mathematics 2019-06-11 Davy Paindaveine , Thomas Verdebout

This paper studies the asymptotic behaviors of the pairwise angles among n randomly and uniformly distributed unit vectors in R^p as the number of points n -> infinity, while the dimension p is either fixed or growing with n. For both…

Statistics Theory · Mathematics 2013-06-04 Tony Cai , Jianqing Fan , Tiefeng Jiang

We propose a new probabilistic characterization of the uniform distribution on the hypersphere in terms of the distribution of pairwise inner products, extending the ideas of \citep{cuesta2009projection,cuesta2007sharp} in a data-driven…

Statistics Theory · Mathematics 2026-04-14 Tiefeng Jiang , Tuan Pham

We study the problem of detecting the presence of a single unknown spike in a rectangular data matrix, in a high-dimensional regime where the spike has fixed strength and the aspect ratio of the matrix converges to a finite limit. This…

Statistics Theory · Mathematics 2018-06-18 Ahmed El Alaoui , Michael I. Jordan

We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…

Metric Geometry · Mathematics 2022-11-10 Yihan Zhang , Shashank Vatedka

We study the problem of quantization of discrete probability distributions, arising in universal coding, as well as other applications. We show, that in many situations this problem can be reduced to the covering problem for the unit…

Information Theory · Computer Science 2010-08-24 Yuriy A. Reznik

Geometric properties of $N$ random points distributed independently and uniformly on the unit sphere $\mathbb{S}^{d}\subset\mathbb{R}^{d+1}$ with respect to surface area measure are obtained and several related conjectures are posed. In…

Under general multivariate regular variation conditions, the extreme Value-at-Risk of a portfolio can be expressed as an integral of a known kernel with respect to a generally unknown spectral measure supported on the unit simplex. The…

Statistics Theory · Mathematics 2020-03-09 Robert Yuen , Stilian Stoev , Dan Cooley

We consider random instances of non-convex perceptron problems in the high-dimensional limit of a large number of examples $M$ and weights $N$, with finite load $\alpha = M/N$. We develop a formalism based on replica theory to predict the…

Disordered Systems and Neural Networks · Physics 2026-02-11 Elizaveta Demyanenko , Davide Straziota , Carlo Baldassi , Carlo Lucibello

We consider optimal stopping problems, in which a sequence of independent random variables is drawn from a known continuous density. The objective of such problems is to find a procedure which maximizes the expected reward; this is often…

Probability · Mathematics 2020-12-07 Hugh Entwistle , Christopher Lustri , Georgy Sofronov

We derive simplified sphere-packing and Gilbert--Varshamov bounds for codes in the sum-rank metric, which can be computed more efficiently than previous ones. They give rise to asymptotic bounds that cover the asymptotic setting that has…

Information Theory · Computer Science 2023-03-22 Cornelia Ott , Sven Puchinger , Martin Bossert

The spherical cap discrepancy is a widely used measure for how uniformly a sample of points on the sphere is distributed. Being hard to compute, this discrepancy measure is typically replaced by some lower or upper estimates when designing…

Combinatorics · Mathematics 2020-12-21 Holger Heitsch , René Henrion

In this paper, we consider the distribution of the supremum of non-stationary Gaussian processes, and present a new theoretical result on the asymptotic behaviour of this distribution. Unlike previously known facts in this field, our main…

Probability · Mathematics 2020-05-25 Valentin Konakov , Vladimir Panov , Vladimir Piterbarg

We study the problem of compression for the purpose of similarity identification, where similarity is measured by the mean square Euclidean distance between vectors. While the asymptotical fundamental limits of the problem - the minimal…

Information Theory · Computer Science 2014-05-13 Fabian Steiner , Steffen Dempfle , Amir Ingber , Tsachy Weissman

This note is concerned with weakly interacting stochastic particle systems with possibly singular pairwise interactions. In this setting, we observe a connection between entropic propagation of chaos and exponential concentration bounds for…

Probability · Mathematics 2024-06-06 Joe Jackson , Antonios Zitridis

We study the asymptotic distribution, as the volume parameter goes to 1, of the peak (largest part) of finite- or slowly-growing-width cylindric plane partitions weighted by their trace, seam, and volume. There are two natural asymptotic…

Probability · Mathematics 2021-12-01 Dan Betea , Alessandra Occelli

The aim of this paper is to provide several novel upper bounds on the excess risk with a primal focus on classification problems. We suggest two approaches and the obtained bounds are represented via the distribution dependent local…

Statistics Theory · Mathematics 2018-03-13 Nikita Zhivotovskiy

We consider one of the most important problems in directional statistics, namely the problem of testing the null hypothesis that the spike direction $\theta$ of a Fisher-von Mises-Langevin distribution on the $p$-dimensional unit…

Statistics Theory · Mathematics 2019-03-05 Davy Paindaveine , Thomas Verdebout
‹ Prev 1 2 3 10 Next ›