Constructs isoperimetric regions from separating hypersurfaces.
problem Finding isoperimetric regions in closed manifolds.
method Constructs isoperimetric regions from separating hypersurfaces.
result Yields isoperimetric boundaries with diverse topological types and singular sets.
MALA mixes efficiently under smoothness and isoperimetry assumptions.
problem Sampling from target densities efficiently.
method Metropolis-Adjusted Langevin algorithm (MALA) with smoothness and isoperimetry assumptions.
result MALA mixes in $O\left(\frac{(LΥ)^{\frac12}}{ψ_μ^2} \log\left(\frac{1}ε
ight)
ight)$ iterations.
Sharp Gaussian isoperimetry proven along Ricci flow.
problem Proving sharp Gaussian isoperimetric inequality for Ricci flow.
method Using monotonicity formula to prove inequality.
result Exact Gaussian enlargement theorem and concentration estimates.
Paper proves flat 3-manifolds with positive mass have unique isoperimetric surfaces.
problem Finding unique isoperimetric surfaces in flat 3-manifolds.
method Used 'fill-in' argument and sharp isoperimetric inequality.
result Each leaf of the canonical foliation is the unique isoperimetric surface.
Efficiently samples arbitrary compact bodies with polynomial complexity.
problem Uniform sampling from arbitrary compact bodies efficiently.
method Warm start algorithm under isoperimetry and volume growth condition.
result Substantial generalization of known results for convex and star-shaped bodies.
Efficient algorithm for sampling from arbitrary compact bodies.
problem Sampling from arbitrary compact bodies efficiently.
method Warm start algorithm with polynomial complexity.
result Substantial generalization of known results for convex and star-shaped bodies.
The study examines stability and isoperimetry of CMC spheres in hyperbolic and spherical manifolds.
problem Stability and isoperimetry of constant mean curvature spheres in hyperbolic and spherical manifolds.
method Analyzes rotational CMC spheres in HnimesR and SnimesR, proving stability and instability properties. result Rotational CMC spheres in HnimesR are always stable, while those in SnimesR with large mean curvature are stable and those with small mean curvature are unstable. We study the Proximal Langevin Algorithm (PLA) for sampling from a probability distribution ν=e−f on Rn under isoperimetry. We prove a convergence guarantee for PLA in Kullback-Leibler (KL) divergence when ν satisfies log-Sobolev inequality (LSI) and f has bounded second and third derivatives. Thi…
We study the Unadjusted Langevin Algorithm (ULA) for sampling from a probability distribution ν=e−f on Rn. We prove a convergence guarantee in Kullback-Leibler (KL) divergence assuming ν satisfies a log-Sobolev inequality and the Hessian of f is bounded. Notably, we do not assume convexity or boun…
New law explains why deep learning models often have more parameters than needed.
problem Why deep learning models often have more parameters than classical theory suggests.
method Proved a universal law of robustness for smooth interpolation.
result Smooth interpolation requires d times more parameters than mere interpolation.
The paper explores sharp isoperimetric properties on non-compact spaces with Ricci bounds.
problem Sharp isoperimetric properties on non-compact spaces with Ricci bounds.
method Sharp isoperimetric comparison theorems and asymptotic isoperimetric properties.
result Almost regularity theorems and enhanced functional inequalities.
In this paper, we study the asymptotic behavior of the volume of spheres in metric measure spaces. We first introduce a general setting adapted to the study of asymptotic isoperimetry in a general class of metric measure spaces. We then introduce a notion of "being asymptotically isoperimetric" for a family of finite a…
Study finds multiple solutions for Van der Waals-Cahn-Hilliard equation on manifolds.
problem Finding multiple solutions for a specific equation on manifolds.
method Combines Lusternik-Schnirelman and Morse theory with a photography method.
result Establishes multiplicity of solutions using topological invariants.
Graphs with non-negative Ollivier-Ricci curvature cannot be expanders.
problem Understanding the relationship between graph curvature and expansion properties.
method Proving an inequality linking isoperimetric profiles to total variation decay of random walks.
result Graphs with non-negative Ollivier-Ricci curvature cannot be expanders.
We prove an optimal reverse Poincaré inequality for the heat semigroup generated by the sub-Laplacian on a Carnot group of any step. As an application we give new proofs of the isoperimetric inequality and of the boundedness of the Riesz transform in Carnot groups.
Let (M,g) be an asymptotically flat Riemannian 3-manifold with non-negative scalar curvature and positive mass. We show that each leaf of the canonical foliation through stable constant mean curvature surfaces of the end of (M,g) is uniquely isoperimetric for the volume it encloses.
The study proves inequalities and curvature properties for Markov chains.
problem Isoperimetric and concentration inequalities for Markov chains.
method Laplacian separation principle for eikonal equation; modified log-Sobolev constant; Ollivier curvature.
result Affirmative answers to open questions and new inequalities.
This note is concerned with some essential properties (optimal isoperimetry, first variation, and monotonicity formula) of the so-called [0,1)∋γ-torsional rigidity Tγ,g on a complete Riemannian two-manifold (M2,g). Even in the special case of R2, major results …
The paper explores robust classifiers for imbalanced Gaussian data.
problem Adversarial robustness in machine learning with imbalanced data.
method Developed exact and approximate Bayes-optimal robust classifiers for Gaussian classification problems.
result Revealed fundamental tradeoffs between standard and robust accuracy.
Proves existence of proper solutions for inverse mean curvature flow.
problem Existence of proper solutions for inverse mean curvature flow.
method Proves existence theorem assuming non-degeneracy conditions on isoperimetric profile.
result No curvature assumption in existence theorem.
Proves a new law of robustness for interpolating arbitrary data distributions.
problem Understanding robust interpolation for arbitrary data distributions.
method Proves a Lipschitzness lower bound for robust interpolation.
result Demonstrates a two-fold law of robustness for interpolating functions.
The paper provides precise estimates for isoperimetric inequalities on weighted manifolds.
problem Quantitative isoperimetric inequalities on weighted Riemannian manifolds.
method Analyzes L1, Lp, and W2 estimates for the push-forward of measures. result Close approximation of the guiding function's push-forward to Gaussian measure.
We classify the volume preserving stable hypersurfaces in the real projective space RPn. As a consequence, the solutions of the isoperimetric problem are tubular neighborhoods of projective subspaces RPk⊂RPn (starting with points). This confirms a conjecture of Burago and Zalgal…
HMC with leapfrog integrator mixes faster than MALA under certain smoothness conditions.
problem Analyzing the mixing time of HMC and MALA for sampling from smooth distributions.
method Bounding gradient complexity and leveraging invariance of joint distribution.
result Metropolized HMC with more leapfrog steps outperforms MALA in total variation distance.
Paper proves mass theorems for nonnegative scalar curvature metrics.
problem Proving mass theorems for metrics with nonnegative scalar curvature.
method New local inverse mean curvature flow with quantitative stability.
result Existence of isoperimetric sets in low regularity metrics.
Sharp inequalities and symmetries on Riemannian surfaces quantified.
problem Understanding symmetries and asymmetries in Riemannian surfaces.
method Introducing scattering energy to measure asymmetry and proving isoperimetric inequalities.
result Sharp quantitative isoperimetric inequalities and domains with vanishing scattering energy characterized.
On a Riemannian manifold with a positive lower bound on the Ricci tensor, the distance of isoperimetric sets from geodesic balls is quantitatively controlled in terms of the gap between the isoperimetric profile of the manifold and that of a round sphere of suitable radius. The deficit between the diameters of the mani…
We study the topology of (properly) immersed complete minimal surfaces P2 in Hyperbolic and Euclidean spaces which have finite total extrinsic curvature, using some isoperimetric inequalities satisfied by the extrinsic balls in these surfaces, (see \cite{Pa}). We present an alternative and partially unified proof of…
This paper presents connections between Gromov's work on isoperimetry of waists and Milman's work on the M-ellipsoid of a convex body. It is proven that any convex body K⊆Rn has a linear image K~⊆Rn of volume one satisfying the following waist inequality: Any continu…
New algorithm samples superlinearly growing log-gradient distributions.
problem Sampling from distributions with superlinearly growing log-gradient.
method Proposes a novel taming Langevin-based scheme called sTULA.
result Derives non-asymptotic convergence bounds in KL, TV, and W2 distances.
We establish a quantitative isoperimetric inequality for weighted Riemannian manifolds with Ric∞≥1. Precisely, we give an upper bound of the volume of the symmetric difference between a Borel set and a sub-level (or super-level) set of the associated guiding function (arising from the needle deco…
In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions, one can restrict to simplicial spheres of particular shapes, called "round" and "u…
The study characterizes convex bodies with equal isoperimetric profiles to half-spaces and estimates their volume behavior.
problem Characterizing convex bodies with equal isoperimetric profiles to half-spaces.
method Using a new concept of asymptotic dimension, the study characterizes convex bodies and estimates their volume behavior.
result For large volumes, the isoperimetric profile of convex bodies is asymptotic to that of RN. Parallel sampling for smooth distributions with fast convergence.
problem Efficiently sampling from distributions with smooth densities.
method Parallelization of Langevin algorithms under log-Sobolev inequalities.
result Samples close to target distribution with low KL divergence or TV distance.
Overview of recent results on isoperimetric inequalities on manifolds with Ricci lower bounds.
problem Isoperimetric problem on manifolds with Ricci lower bounds.
method Modern tools and ideas from nonsmooth geometry.
result Sharp second order differential inequalities for isoperimetric profile.
New sampling method on Lie groups converges quickly.
problem Sampling on non-Euclidean Lie groups.
method Kinetic Langevin dynamics with noise added.
result Exponential convergence rate proved under W2 distance. LaPSRL achieves optimal regret for isoperimetric RL distributions.
problem Designing RL algorithms with sublinear regret for non-log-concave distributions.
method Posterior Sampling (PSRL) and Langevin sampling (LaPSRL) for isoperimetric distributions.
result LaPSRL achieves order-optimal regret and subquadratic complexity.
The study proves inequalities on curved spaces without global curvature bounds.
problem Proving inequalities on manifolds with non-negative curvature outside compact sets.
method ABP method localized to regions of non-negative curvature, spectral properties of manifolds.
result Validated isoperimetric and Michael-Simon inequalities on manifolds with asymptotically non-negative curvature.
We consider Lagrangian coherent structures (LCSs) as the boundaries of material subsets whose advective evolution is metastable under weak diffusion. For their detection, we first transform the Eulerian advection-diffusion equation to Lagrangian coordinates, in which it takes the form of a time-dependent diffusion or h…
Sharp spectral theorems and isoperimetric inequalities for manifolds with nonnegative Ricci curvature.
problem Understanding the geometry and topology of manifolds with nonnegative Ricci curvature.
method New spectral inequalities and isoperimetric problems involving unequal weights and warped bubbles.
result Sharp spectral and isoperimetric bounds for manifolds with nonnegative Ricci curvature.
Study mass and center of mass in flat 3-manifolds, proving existence of foliations.
problem Interplay between mass, center of mass, and isoperimetric quotients in asymptotically flat 3-manifolds.
method Adapted implicit function method and foliation techniques.
result Existence of foliations satisfying curvature conditions and unique relative isoperimetric surfaces.
New algorithm speeds up HMC by generating a warm start in O(d^1/4) iterations.
problem Unclear how many iterations of HMC are needed for high-dimensional sampling.
method Developed a non-Metropolized HMC that generates a warm start in O(d^1/4) iterations, followed by Metropolized HMC.
result Final complexity of O(d^1/4) is the fastest algorithm for high-accuracy sampling under strong log-concavity assumptions.
The Langevin Algorithm's stationary distribution is shown to be sub-exponential or sub-Gaussian under certain conditions.
problem Understanding the properties of the Langevin Algorithm's stationary distribution.
method Analysis using a rotation-invariant moment generating function (Bessel function) to study the stationary dynamics of the Langevin Algorithm.
result Concentration results for the Langevin Algorithm's stationary distribution πη are established, showing it is sub-exponential or sub-Gaussian under convex or strongly convex potential conditions. New method improves sampling from logconcave distributions truncated on polytopes.
problem Sampling from logconcave distributions with polytope constraints.
method Regularized Dikin walks, using Lewis weights.
result Improved mixing time guarantees for various distributions and polytopes.
Score matching efficiency tied to distribution isoperimetric properties.
problem Understanding when score matching is as efficient as maximum likelihood.
method Connecting score matching efficiency to isoperimetric constants of distributions.
result Score matching is statistically efficient when the distribution has a small isoperimetric constant.
A new algorithm reduces sampling complexity for general distributions.
problem Sampling from complex target distributions efficiently.
method Recursive score estimation method for diffusion-based Monte Carlo.
result Gradient complexity improved from exponential to quasi-polynomial.