Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

275380106 · May 202619922001200920172026
48 results for log-Sobolev constant

Sharp log-Sobolev inequalities proved for CD(0,N){\sf CD}(0,N) spaces.

problem Proving log-Sobolev inequalities in noncompact metric measure spaces.
method Sharp isoperimetric inequality, symmetrisation, scaling argument, Hamilton-Jacobi inequality, Sobolev regularity.
result Sharp log-Sobolev inequalities established in CD(0,N){\sf CD}(0,N) spaces.

Let PtP_t be the diffusion semigroup generated by L:=Δ+VL:=Δ+\nabla V on a complete connected Riemannian manifold with Ric(σ2ρo2+c)\operatorname {Ric}\ge-(σ^2ρ_o^2+c) for some constants σ,c>0σ, c>0 and ρoρ_o the Riemannian distance to a fixed point. It is shown that PtP_t is hypercontractive, or the log-Sobolev inequality holds for the…

2007-12-19abs ↗pdf ↗

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.

Log-Sobolev inequality proven for submanifolds in specific types of manifolds.

problem Proving Log-Sobolev inequality for submanifolds in asymptotic non-negative intermediate Ricci curvature manifolds.
method Extending previous results, proving inequality for submanifolds in specific types of manifolds.
result Sharp Log-Sobolev inequality proven for submanifolds in complete non-compact Riemannian manifolds with asymptotic non-negative intermediate Ricci curvature and Euclidean volume growth.

Sharp bounds on uniform generalization errors in binary linear classification.

problem Understanding the uniform generalization errors in binary linear classification.
method Isoperimetric arguments, Poincaré and log-Sobolev inequalities for joint distributions.
result Sharp concentration bounds on uniform generalization errors, almost sure convergence in broad settings.

Sharp Lipschitz bounds for flow-matching and diffusion models with optimal sampling rates.

problem Establishing optimal Lipschitz regularity for flow-matching and diffusion models.
method Sharp Lipschitz regularity theory for flow-matching vector fields and diffusion-model scores.
result Achieves optimal sampling rate of d/N\sqrt{d}/N for Euler-type samplers in dimension dd.

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.

Improved sampling from non-log-concave distributions with polynomial query complexity.

problem Sampling from distributions with non-log-concave densities efficiently.
method Combining Ornstein-Uhlenbeck process assumptions and polynomial moment conditions.
result Polynomial query complexity improvement over previous methods.

Polynomial convergence proved for SGM, improving over previous methods.

problem Learning probability distributions from data and generating samples efficiently.
method Proved polynomial convergence for SGM using accurate score estimates.
result First polynomial convergence guarantees for SGM, independent of dimensionality.

Study establishes Pólya-Szegő inequalities on submanifolds with small total mean curvature.

problem Analyzing Sobolev functions on submanifolds with curvature constraints.
method Developed Pólya-Szegő-type inequalities and derived corollaries.
result Proved sharp pp-Log-Sobolev inequality for minimal submanifolds.

New deficit functions link elliptic and parabolic inequalities, proving log Sobolev.

problem Proving log Sobolev inequality using deficit functions.
method Introducing two deficit functions, one elliptic and one parabolic, and showing their pointwise convergence and equations.
result Elliptic deficit converges to parabolic deficit, leading to an elliptic proof of log Sobolev inequality.

In this paper, we study the gradient estimate for positive solutions to the following nonlinear heat equation problem utΔu=aulogu+Vu,  u>0 u_t-Δu=au\log u+Vu, \ \ u>0 on the compact Riemannian manifold (M,g)(M,g) of dimension nn and with non-negative Ricci curvature. Here a0a\leq 0 is a constant, VV is a smooth function on MM with $-…

2010-09-03abs ↗pdf ↗

Study non-negative curvature Markov chains, proving entropy contraction.

problem Prove entropy contraction for Markov chains with non-negative curvature.
method Prove 1-step contraction in Wasserstein distance implies 1-step contraction in relative entropy.
result Prove MLSI with constant equal to minimal rate increment for mean-field zero-range process.

The paper derives inequalities and formulas for generalized Ricci flow.

problem Understanding and characterizing generalized Ricci flow.
method Using Bochner formula and adapted Malliavin gradient, the paper derives inequalities and characterizes generalized Ricci flow.
result Characterizations of generalized Ricci flow via inequalities for the associated Malliavin gradient.

Log Sobolev and Michael Simon inequalities for tensor fields on curved manifolds.

problem Establishing inequalities for tensor fields on curved manifolds.
method Applying the ABP method to symmetric tensor fields on manifolds with nonnegative sectional curvature.
result Log Sobolev and Michael Simon inequalities for tensor fields.

New framework improves EM algorithm convergence under log-Sobolev inequality.

problem Improving convergence of the EM algorithm.
method Extending gradient flow techniques to EM algorithm, using free energy representation.
result Exponential convergence of EM algorithm under log-Sobolev inequality.

In this paper, we prove the equivalent of ultracontractive bound of heat semigroup or the uniform upper bound of the heat kernel with the Nash inequality, Log-Sobolev inequalities on graphs. We also show that under the assumption of volume growth and nonnegative curvature CDE(n,0)CDE'(n,0) the Sobolev inequality, Nash inequa…

2015-02-06abs ↗pdf ↗

Proves error bounds for PGD, extending log-Sobolev and Talagrand inequalities.

problem Maximum likelihood estimation of large latent variable models.
method Extending log-Sobolev and Talagrand inequalities to models with strongly concave log-likelihoods.
result Non-asymptotic error bounds for PGD in models satisfying LSI and PŁI.

We study the Proximal Langevin Algorithm (PLA) for sampling from a probability distribution ν=efν= e^{-f} on Rn\mathbb{R}^n under isoperimetry. We prove a convergence guarantee for PLA in Kullback-Leibler (KL) divergence when νν satisfies log-Sobolev inequality (LSI) and ff has bounded second and third derivatives. Thi…

2019-11-04abs ↗pdf ↗

The study improves Poincaré and log-Sobolev inequalities on hyperbolic spaces.

problem Improving Poincaré and log-Sobolev inequalities on hyperbolic spaces.
method Establishing scale-dependent Poincaré-Hardy type identities and choosing suitable parameters, potentials, and vector fields.
result Derives new versions and substantially improves existing inequalities.

In this paper, we study the gradient estimates of Li-Yau-Hamilton type for positive solutions to both drifting heat equation and the simple nonlinear heat equation problem utΔu=aulogu,  u>0 u_t-Δu=au\log u, \ \ u>0 on the compact Riemannian manifold (M,g)(M,g) of dimension nn and with non-negative (Bakry-Emery)-Ricci curvature. Here…

2010-09-03abs ↗pdf ↗

This paper proves a Liouville type result for a specific higher-order equation on the sphere.

problem Proving that positive, smooth solutions to a particular equation on the sphere are constant under certain conditions.
method Analyzing the GJMS operator and using Liouville type results.
result Positive, smooth solutions to the equation are constant under specified conditions.

Paper proposes new Langevin samplers for sampling from log-concave distributions with superlinear gradient growth.

problem Sampling from log-concave distributions with superlinear gradient growth.
method Proposes two novel discretizations of kinetic Langevin SDEs, showing contractivity and log-Sobolev inequality.
result Establishes non-asymptotic bounds in 2-Wasserstein distance between sampled distributions and target measures.

The paper examines stability of the Sobolev inequality in metric spaces with curvature dimension conditions.

problem Investigating stability of the Sobolev inequality in metric spaces with curvature dimension conditions.
method Assuming almost the same optimal constant, the paper shows that the cumulative distribution of almost extremal functions is close to that of an Aubin-Talenti bubble on the round sphere.
result Quantitative stability with sharp exponent for the Sobolev inequality in various curvature and dimension assumptions.

Inequalities linking entropy, Fisher info, Stein discrepancy, and Wasserstein distance on Riemannian manifolds.

problem Linking entropy, Fisher info, Stein discrepancy, and Wasserstein distance on Riemannian manifolds.
method Deriving inequalities linking these measures on Riemannian manifolds.
result Strengthening and extending existing inequalities to Riemannian manifolds.

Improved sampling guarantees for underdamped Langevin Monte Carlo without restrictive assumptions.

problem Sampling from unnormalized densities with improved guarantees and acceleration.
method Novel analysis relaxing assumptions on log-Sobolev inequality and Hessian smoothness, using Rényi discretization bounds.
result First KL divergence guarantees for ULMC without Hessian smoothness under strong log-concavity.

Greedy MI maximization method outperforms existing approaches in nonlinear models.

problem Maximizing mutual information in nonlinear models with non-Gaussian noise.
method Greedy approaches based on log-Sobolev inequalities for computationally inexpensive MI lower bounds.
result Proposed method outperforms random selection and Gaussian approximations.