English
Related papers

Related papers: Reverse Euclidean and Gaussian isoperimetric inequ…

200 papers

We investigate the intersections of balls of radius $r$, called $r$-ball bodies, in Euclidean $d$-space. An $r$-lense (resp., $r$-spindle) is the intersection of two balls of radius $r$ (resp., balls of radius $r$ containing a given pair of…

Metric Geometry · Mathematics 2021-09-28 Károly Bezdek

We analyze the connection between minimizers with good generalizing properties and high local entropy regions of a threshold-linear classifier in Gaussian mixtures with the mean squared error loss function. We show that there exist…

Machine Learning · Computer Science 2021-02-03 Carlo Baldassi , Enrico M. Malatesta , Matteo Negri , Riccardo Zecchina

Under study is the new class of geometrical extremal problems in which it is required to achieve the best result in the presence of conflicting goals; e.g., given the surface area of a convex body $\mathfrak x$, we try to maximize the…

Metric Geometry · Mathematics 2009-02-09 S. S. Kutateladze

We establish higher-order nonasymptotic expansions for a difference between probability distributions of sums of i.i.d. random vectors in a Euclidean space. The derived bounds are uniform over two classes of sets: the set of all Euclidean…

Statistics Theory · Mathematics 2022-11-30 Mayya Zhilova

The isodiametric inequality states that the Euclidean ball maximizes the volume among all convex bodies of a given diameter. We are motivated by a conjecture of Makai Jr.~on the reverse question: Every convex body has a linear image whose…

Metric Geometry · Mathematics 2020-04-29 Bernardo González Merino , Matthias Schymura

The Kullback-Leibler divergence or relative entropy is an information-theoretic measure between statistical models that play an important role in measuring a distance between random variables. In the study of complex systems, random fields…

Information Theory · Computer Science 2022-03-25 Alexandre L. M. Levada

Geodesic metric spaces support a variety of averaging constructions for given finite sets. Computing such averages has generated extensive interest in diverse disciplines. Here we consider the inverse problem of recognizing computationally…

Optimization and Control · Mathematics 2024-06-07 Ariel Goodwin , Adrian S. Lewis , Genaro Lopez-Acedo , Adriana Nicolae

The discrete isoperimetric inequality in Euclidean geometry states that among all $n$-gons having a fixed perimeter $p$, the one with the largest area is the regular $n$-gon. The statement is true in spherical geometry and hyperbolic…

Geometric Topology · Mathematics 2024-10-31 Bidyut Sanki , Arya Vadnere

We study the problem of estimating the parameters of a Gaussian distribution when samples are only shown if they fall in some (unknown) subset $S \subseteq \R^d$. This core problem in truncated statistics has long history going back to…

Statistics Theory · Mathematics 2019-08-06 Vasilis Kontonis , Christos Tzamos , Manolis Zampetakis

We consider the question of Gaussian mean testing, a fundamental task in high-dimensional distribution testing and signal processing, subject to adversarial corruptions of the samples. We focus on the relative power of different…

Data Structures and Algorithms · Computer Science 2023-07-21 Clément L. Canonne , Samuel B. Hopkins , Jerry Li , Allen Liu , Shyam Narayanan

In this paper, the isoperimetric problem in Randers planes, $(\mathbb{R}^2,F=\alpha +\beta)$, which are slight deformation of the Euclidean plane $(\mathbb{R}^2,\alpha)$ by suitable one forms $\beta$, have been studied. We prove that the…

Differential Geometry · Mathematics 2022-04-05 Arti Sahu , Ranadip Gangopadhyay , Hemangi Madhusudan Shah , Bankteshwar Tiwari

Embedding complex objects as vectors in low dimensional spaces is a longstanding problem in machine learning. We propose in this work an extension of that approach, which consists in embedding objects as elliptical probability…

Machine Learning · Statistics 2019-02-19 Boris Muzellec , Marco Cuturi

In both real and complex cases, we establish the connection of the problem about $2$-dimensional linear subspaces the most deviating from the coordinate ones with one simply formulated optimization problem for isoperimetric polygons in…

Numerical Analysis · Mathematics 2024-08-30 Yuri Nesterenko

It is shown that $m$ disjoint sets with fixed Gaussian volumes that partition $\mathbb{R}^{n}$ with minimum Gaussian surface area must be $(m-1)$-dimensional. This follows from a second variation argument using infinitesimal translations.…

Functional Analysis · Mathematics 2021-07-13 Steven Heilman

We say that a metric graph is uniformly bounded if the degrees of all vertices are uniformly bounded and the lengths of edges are pinched between two positive constants; a metric space is approximable by a uniform graph if there is one…

Metric Geometry · Mathematics 2013-06-25 Dmitri Burago , Sergei Ivanov

Open set recognition is an emerging research area that aims to simultaneously classify samples from predefined classes and identify the rest as 'unknown'. In this process, one of the key challenges is to reduce the risk of generalizing the…

Computer Vision and Pattern Recognition · Computer Science 2020-12-14 Guangyao Chen , Limeng Qiao , Yemin Shi , Peixi Peng , Jia Li , Tiejun Huang , Shiliang Pu , Yonghong Tian

The problem of recovering the configuration of points from their partial pairwise distances, referred to as the Euclidean Distance Matrix Completion (EDMC) problem, arises in a broad range of applications, including sensor network…

Optimization and Control · Mathematics 2026-05-07 Chandler Smith , HanQin Cai , Abiy Tasissa

Let $S\subset\R^d$ be a bounded subset with positive Lebesgue measure. The Paley-Wiener space associated to $S$, $PW_S$, is defined to be the set of all square-integrable functions on $\R^d$ whose Fourier transforms vanish outside $S$. A…

Classical Analysis and ODEs · Mathematics 2010-01-25 A. Bailey , Th. Schlumprecht , N. Sivakumar

Consider a stationary Poisson process $\eta$ in the $d$-dimensional Euclidean or hyperbolic space and construct a random graph with vertex set $\eta$ as follows. First, each point $x\in\eta$ is connected by an edge to its nearest neighbour,…

Probability · Mathematics 2024-11-04 Holger Sambale , Christoph Thäle , Tara Trauthwein

A radial probability measure is a probability measure with a density (with respect to the Lebesgue measure) which depends only on the distances to the origin. Consider the Euclidean space enhanced with a radial probability measure. A…

Probability · Mathematics 2017-10-10 Yashar Memarian
‹ Prev 1 4 5 6 7 8 10 Next ›