Related papers: Reducing Isotropy and Volume to KLS: Faster Roundi…

We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our…

Let $ K $ be a convex body in $ \mathbb{R}^n $. We denote the volume of $ K $ by $ \vert K\vert $, and the polar body of its difference body $ K - K $ by $ (K - K)^{\circ} $. We provide a new proof of the well-known estimate \[ |K||(K -…

We compute the volumes of convex bodies that are given by inequalities of concave polynomials. These volumes are found to arbitrary precision thanks to the representation of periods by linear differential equations. Our approach rests on…

We study the two-dimensional geometric knapsack problem for convex polygons. Given a set of weighted convex polygons and a square knapsack, the goal is to select the most profitable subset of the given polygons that fits non-overlappingly…

In the course of classifying generic sparse polynomial systems which are solvable in radicals, Esterov recently showed that the volume of the Minkowski sum $P_1+\dots+P_d$ of $d$-dimensional lattice polytopes is bounded from above by a…

This paper develops a unified framework for estimating the volume of a set in $\mathbb{R}^d$ based on observations of points uniformly distributed over the set. The framework applies to all classes of sets satisfying one simple axiom: a…

We present an alternative approach to some results of Koldobsky on measures of sections of symmetric convex bodies, which allows us to extend them to the not necessarily symmetric setting. We prove that if $K$ is a convex body in ${\mathbb…

Let $x_1,\ldots ,x_N$ be independent random points distributed according to an isotropic log-concave measure $\mu $ on ${\mathbb R}^n$, and consider the random polytope $$K_N:={\rm conv}\{ \pm x_1,\ldots ,\pm x_N\}.$$ We provide sharp…

We give efficient algorithms for volume sampling, i.e., for picking $k$-subsets of the rows of any given matrix with probabilities proportional to the squared volumes of the simplices defined by them and the origin (or the squared volumes…

There are already quite a few tools for solving the Satisfiability Modulo Theories (SMT) problems. In this paper, we present \texttt{VolCE}, a tool for counting the solutions of SMT constraints, or in other words, for computing the volume…

Given a separation oracle for a convex set $K \subset \mathbb{R}^n$ that is contained in a box of radius $R$, the goal is to either compute a point in $K$ or prove that $K$ does not contain a ball of radius $\epsilon$. We propose a new…

Short and transparent proofs of central limit theorems for intrinsic volumes of random polytopes in smooth convex bodies are presented. They combine different tools such as estimates for floating bodies with Stein's method from probability…

Constrained non-convex optimization is fundamentally challenging, as global solutions are generally intractable and constraint qualifications may not hold. However, in many applications, including safe policy optimization in control and…

This paper studies finite-sample set-membership identification for discrete-time bilinear systems under bounded symmetric log-concave disturbances. Compared with existing finite-sample results for linear systems and related analyses under…

A polyhedral approximation of a convex body can be calculated by solving approximately an associated multiobjective convex program (MOCP). An MOCP can be solved approximately by Benson type algorithms, which compute outer and inner…

Recently, motivated by the rapid increase of the data size in various applications, Monemizadeh [APPROX'23] and Driemel, Monemizadeh, Oh, Staals, and Woodruff [SoCG'25] studied geometric problems in the setting where the only access to the…

In this paper, we obtain a number of new simple pseudo-polynomial time algorithms on the well-known knapsack problem, focusing on the running time dependency on the number of items $n$, the maximum item weight $w_\mathrm{max}$, and the…

Let $K \subset {\mathbb R}^2$ be an $o$-symmetric convex body, and $K^*$ its polar body. Then we have $|K|\cdot |K^*| \ge 8$, with equality if and only if $K$ is a parallelogram. ($| \cdot |$ denotes volume). If $K \subset {\mathbb R}^2$ is…

We present a quantum interior-point method (IPM) for second-order cone programming (SOCP) that runs in time $\widetilde{O} \left( n\sqrt{r} \frac{\zeta \kappa}{\delta^2} \log \left(1/\epsilon\right) \right)$ where $r$ is the rank and $n$…

The classical Dvoretzky--Rogers lemma provides a deterministic algorithm by which, from any set of isotropic vectors in Euclidean $d$-space, one can select a subset of $d$ vectors whose determinant is not too small. Subsequently,…