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,695 papers · 148 categories

Trend · papers per month

23466891 · Jun 202019922001200920172026
48 results for Modified Log-Sobolev Inequality

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.

The paper derives Harnack inequalities for evolving Riemannian manifolds without dimensionality restrictions.

problem Deriving Harnack inequalities for geometric flows with evolving metrics.
method Probabilistic representation of conjugate semigroups and supercontractivity.
result Established dimension-free Harnack inequalities for geometric flows.

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 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.

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.

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.

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 ↗

Unified analysis of MPLE for Ising models with bounded operator norm or infinity norm.

problem Estimating Ising models in Total Variation distance with limited samples.
method Maximum Pseudo-Likelihood Estimator (MPLE) for two general classes of Ising models.
result Unified framework for polynomial-time estimation in TV distance for two general classes of Ising models.

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.

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.

New sampling and identity-testing methods for mixtures of distributions that don't satisfy approximate tensorization of entropy.

problem Sampling and identity-testing for mixtures of distributions that don't satisfy approximate tensorization of entropy.
method Fast mixing of Glauber dynamics and efficient identity-testers in the coordinate-conditional sampling access model.
result Efficient identity-testers for mixtures of ATE distributions in the coordinate-conditional sampling access model.

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.

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 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.

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.

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 ↗

Improved Langevin algorithms with prior diffusion achieve dimension-independent convergence for non-log-concave distributions.

problem Understanding the dimension dependency of computational complexity in high-dimensional sampling.
method Investigation of prior diffusion technique for log-Sobolev inequality target distributions.
result Modified Langevin algorithm achieves dimension-independent KL divergence convergence.

New sampling algorithms for complex distributions without log-concavity.

problem Efficient sampling from complex, high-dimensional distributions.
method Randomized splitting Langevin Monte Carlo (RSLMC) algorithm.
result Uniform-in-time error bounds for RSLMC and RLMC algorithms.

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.

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.

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.

Proposes a new generalization bound for Bayesian deep nets without strict assumptions.

problem Lack of generalization bounds for Bayesian deep nets without strict assumptions.
method Exploits contractivity of Log-Sobolev inequalities to add a loss-gradient norm term to the generalization bound.
result Introduces a new generalization bound for Bayesian deep nets that avoids strict assumptions.

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.

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.

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.

We define a Hamilton-Jacobi semigroup acting on continuous functions on a compact length space. Following a strategy of Bobkov, Gentil and Ledoux, we use some basic properties of the semigroup to study geometric inequalities related to concentration of measure. Our main results are that (1) a Talagrand inequality on a …

2006-12-19abs ↗pdf ↗

Improved sampling from mean-field stationary distributions.

problem Sampling from the stationary distribution of mean-field SDEs.
method Decoupling the problem into two aspects: approximation of mean-field SDE and sampling from finite-particle distribution.
result Improved guarantees in various settings, including optimizing neural networks.

The Riemannian Langevin Algorithm samples from manifolds efficiently.

problem Sampling from distributions on manifolds with log-Sobolev inequality.
method Riemannian Langevin Algorithm, log-Sobolev inequality, self-concordance extension, stochastic smoothness bounding.
result The Riemannian Langevin Algorithm converges rapidly to the target density.