English
Related papers

Related papers: On the reconstruction of convex sets from random n…

200 papers

This paper considers the reconstruction problem in Acousto-Electrical Tomography, i.e., the problem of estimating a spatially varying conductivity in a bounded domain from measurements of the internal power densities resulting from…

Numerical Analysis · Mathematics 2020-01-13 Simon Hubmer , Kim Knudsen , Changyou Li , Ekaterina Sherina

We establish risk bounds for Regularized Empirical Risk Minimizers (RERM) when the loss is Lipschitz and convex and the regularization function is a norm. In a first part, we obtain these results in the i.i.d. setup under subgaussian…

Statistics Theory · Mathematics 2021-01-07 Geoffrey Chinot , Guillaume Lecué , Matthieu Lerasle

We investigate the problem of reconstructing n-by-n structured matrix signal X via convex programming, where each column xj is a vector of s-sparsity and all columns have the same l1-norm. The regularizer in use is matrix norm…

Statistics Theory · Mathematics 2019-12-03 Yuan Tian

We address the problem of one dimensional segment detection and estimation, in a regression setup. At each point of a fixed or random design, one observes whether that point belongs to the unknown segment or not, up to some additional…

Statistics Theory · Mathematics 2014-04-25 Victor-Emmanuel Brunel

Let K be a convex body in $R^d$. A random polytope is the convex hull $[x_1,...,x_n]$ of finitely many points chosen at random in K. $\Bbb E(K,n)$ is the expectation of the volume of a random polytope of n randomly chosen points. I.…

Metric Geometry · Mathematics 2016-09-06 Carsten Schütt

The random polytope $K_n$, defined as the convex hull of $n$ points chosen uniformly at random on the boundary of a smooth convex body, is considered. Proofs for lower and upper variance bounds, strong laws of large numbers and central…

Probability · Mathematics 2017-06-12 Nicola Turchi , Florian Wespi

We introduce and study deformation $T_{{\bf b},\phi}$ of Minkowski norms in $\mathbb{R}^n$, determined by a set ${\bf b}=(\beta_1,\ldots,\beta_p)$ of linearly independent 1-forms and a smooth positive function $\phi$ of $p$ variables. In…

Differential Geometry · Mathematics 2020-11-05 Vladimir Rovenski , Pawel Walczak

We study the problem of recovering an unknown compactly-supported multivariate function from samples of its Fourier transform that are acquired nonuniformly, i.e. not necessarily on a uniform Cartesian grid. Reconstruction problems of this…

Numerical Analysis · Mathematics 2022-05-04 Ben Adcock , Milana Gataric , José Luis Romero

The Betke-Henk-Wills conjecture provides an upper bound for the lattice point enumerator $G(K, \Lambda)$ of a convex body in terms of its successive minima. While the conjecture is established for orthogonal parallelotopes, its validity for…

Metric Geometry · Mathematics 2026-03-06 Chao Wang

In this note we study the maximal perimeter of a convex set in $\mathbb{R}^n$ with respect to various classes of measures. Firstly, we show that for a probability measure $\mu$ on $ \mathbb{R}^n$, satisfying very mild assumptions, there…

Metric Geometry · Mathematics 2019-05-01 Galyna V. Livshyts

Given an affine variety X and a finite dimensional vector space of regular functions L on X, we associate a convex body to (X, L) such that its volume is responsible for the number of solutions of a generic system of functions from L. This…

Algebraic Geometry · Mathematics 2008-04-28 Kiumars Kaveh , Askold G. Khovanskii

We study the inverse source problem for a class of viscoelastic systems from a single boundary measurement in a general spatial dimension. We give specific reconstruction formula and stability estimate for the source in terms of the…

Analysis of PDEs · Mathematics 2020-04-24 Walton Green , Shitao Liu

We discuss isoperimetric inequalities for convex sets. These include the classical isoperimetric inequality and that of Brunn-Minkowski, Blaschke-Santalo, Busemann-Petty and their various extensions. We show that many such inequalities…

Metric Geometry · Mathematics 2016-07-05 Grigoris Paouris , Peter Pivovarov

Polyhedral-type approximations of convex-like domains in $\mathbb{C}^d$ have been considered recently by the second author. In particular, the decay rate of the error in optimal volume approximation as a function of the number of facets has…

Probability · Mathematics 2022-03-24 Siva Athreya , Purvi Gupta , D. Yogeshwaran

The Brunn-Minkowski theory in convex geometry concerns, among other things, the volumes, mixed volumes, and surface area measures of convex bodies. We study generalizations of these concepts to Borel measures with density in…

Metric Geometry · Mathematics 2024-03-13 Matthieu Fradelizi , Dylan Langharst , Mokshay Madiman , Artem Zvavitch

We study the inverse problem of determining a Signorini obstacle from boundary measurements for the isotropic elasticity system. We prove that the obstacle can be uniquely determined by a single measurement of displacement and normal stress…

Analysis of PDEs · Mathematics 2025-03-26 Maarten V. de Hoop , Matti Lassas , Jinpeng Lu , Lauri Oksanen , Ziyao Zhao

We examine how the measure and the number of vertices of the convex hull of a random sample of $n$ points from an arbitrary probability measure in $\mathbf{R}^d$ relates to the wet part of that measure. This extends classical results for…

Probability · Mathematics 2020-10-13 Imre Bárány , Matthieu Fradelizi , Xavier Goaoc , Alfredo Hubard , Günter Rote

This paper revisits a fundamental problem in statistical inference from a non-asymptotic theoretical viewpoint $\unicode{x2013}$ the construction of confidence sets. We establish a finite-sample bound for the estimator, characterizing its…

Statistics Theory · Mathematics 2023-01-03 Lang Liu , Zaid Harchaoui

This paper presents bounds for the best approximation, with respect to the Hausdorff metric, of a convex body $K$ by a circumscribed polytope $P$ with a given number of facets. These bounds are of particular interest if $K$ is elongated. To…

Metric Geometry · Mathematics 2016-12-15 Gilles Bonnet

How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a notion of dispersion and connect it to asymptotic convex…

Computational Complexity · Computer Science 2008-06-17 Luis Rademacher , Santosh Vempala