Related papers: Learning convex bodies is hard
A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…
We establish upper bounds for the expected excess risk of models trained by proper iterative algorithms which approximate the local minima. Unlike the results built upon the strong globally strongly convexity or global growth conditions…
We consider a generalization of the hyperplane problem to arbitrary measures in place of volume and to sections of lower dimensions. We prove this generalization for unconditional convex bodies and for duals of bodies with bounded volume…
This work is motivated by recent applications of structured dictionary learning, in particular when the dictionary is assumed to be the product of a few Householder atoms. We investigate the following two problems: 1) How do we approximate…
We prove bounds for the covering numbers of classes of convex functions and convex sets in Euclidean space. Previous results require the underlying convex functions or sets to be uniformly bounded. We relax this assumption and replace it…
Let $K$ be a convex body in $\mathbb{R}^n$ and $f : \partial K \rightarrow \mathbb{R}_+$ a continuous, strictly positive function with $\int\limits_{\partial K} f(x) d \mu_{\partial K}(x) = 1$. We give an upper bound for the approximation…
Grasping inhomogeneous objects in real-world applications remains a challenging task due to the unknown physical properties such as mass distribution and coefficient of friction. In this study, we propose a meta-learning algorithm called…
We introduce a new variant of quantitative Helly-type theorems: the minimal \emph{"homothetic distance"} of the intersection of a family of convex sets to the intersection of a subfamily of a fixed size. As an application, we establish the…
It is conjectured since long that for any convex body $P\subset \mathbb{R}^n$ there exists a point in its interior which belongs to at least $2n$ normals from different points on the boundary of $P$. The conjecture is known to be true for…
The main goal of this paper is to present a series of inequalities connecting the surface area measure of a convex body and surface area measure of its projections and sections. We present a solution of a question from S. Campi, P.…
We consider the problem of computing, given a set S of n points in the plane, which points of S are vertices of the convex hull of S. For certain variations of this problem, different proofs exist that the complexity of this problem in the…
We consider the convex hull of a finite sample of i.i.d. points uniformly distributed in a convex body in $\R^d$, $d\geq 2$. We prove an exponential deviation inequality, which leads to rate optimal upper bounds on all the moments of the…
Approximating convex bodies is a fundamental problem in geometry. Given a convex body $K$ in $\mathbb{R}^d$ for a fixed dimension $d$, the objective is to minimize the number of facets of an approximating polytope for a given Hausdorff…
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…
We study the problem of learning nonparametric distributions in a finite mixture, and establish tight bounds on the sample complexity for learning the component distributions in such models. Namely, we are given i.i.d. samples from a pdf…
Minimizing the number of probes is one of the main challenges in reconstructing geometric objects with probing devices. In this paper, we investigate the problem of using an $\omega$-wedge probing tool to determine the exact shape and…
The entropy per coordinate in a log-concave random vector of any dimension with given density at the mode is shown to have a range of just 1. Uniform distributions on convex bodies are at the lower end of this range, the distribution with…
Given a convex set $\Omega$ of $\mathbb{R}^n$, we consider the shape optimization problem of finding a convex subset $\omega\subset \Omega$, of a given measure, minimizing the $p$-distance functional $$\mathcal{J}_p(\omega) :=…
The deviation of a general convex body with twice differentiable boundary and an arbitrarily positioned polytope with a given number of vertices is studied. The paper considers the case where the deviation is measured in terms of the…
Let $\Omega\subset\mathbb{R}^{n+1}$ have minimal Gaussian surface area among all sets satisfying $\Omega=-\Omega$ with fixed Gaussian volume. Let $A=A_{x}$ be the second fundamental form of $\partial\Omega$ at $x$, i.e. $A$ is the matrix of…