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.

169,181 papers · 148 categories

Trend · papers per month

4693139185 · May 202619922001200920182026
48 results for variance Brascamp-Lieb inequality

The paper discusses rigidity results for inequalities on weighted Riemannian manifolds.

problem Rigidity of inequalities on weighted Riemannian manifolds.
method Theorems of rigidity on curvature and measure for the Borell-Brascamp-Lieb inequality, generalizing a theorem by Balogh and Kristály.
result A generalization of the curvature rigidity theorem to the weighted setting.

This work improves information concentration for exp-concave distributions, making it dimension-independent.

problem Challenges in information concentration for log-concave distributions with dimension dependence.
method Proves exp-concavity leads to dimension-independent information concentration using a novel variance Brascamp-Lieb inequality.
result Information concentration depends only on the exp-concavity parameter, not the dimension.

In this article, a proof of the interpolation inequality along geodesics in pp-Wasserstein spaces is given. This interpolation inequality was the main ingredient to prove the Borel-Brascamp-Lieb inequality for general Riemannian and Finsler manifolds and led Lott-Villani and Sturm to define an abstract Ricci curvature…

2013-11-21abs ↗pdf ↗

Standard bubbles and partitions are stable in various model spaces.

problem Stability of standard bubbles and partitions in different model spaces.
method New conjugated Brascamp-Lieb inequality and conformally flattening boundary potential.
result Stability of standard bubbles and partitions in Rn\mathbb{R}^n, Sn\mathbb{S}^n, and Hn\mathbb{H}^n.

We prove that ideal sub-Riemannian manifolds (i.e., admitting no non-trivial abnormal minimizers) support interpolation inequalities for optimal transport. A key role is played by sub-Riemannian Jacobi fields and distortion coefficients, whose properties are remarkably different with respect to the Riemannian case. As …

2017-05-15abs ↗pdf ↗

New algorithms reduce variance in solving complex mathematical problems.

problem Solving convex-concave saddle point problems, variational inequalities, and inclusions.
method Stochastic variance reduction for extragradient, forward-backward-forward, and forward-reflected-backward methods.
result All proposed methods converge with complexities matching or improving deterministic counterparts.

The paper provides concentration inequalities for Markov chain variance estimators.

problem Estimating the variance of Markov chains with concentration properties.
method Martingale decomposition method for uniformly geometrically ergodic Markov chains.
result Explicit control of the p-th moment of the OBM estimator difference and dependence on p and mixing time.

The paper proposes a conjecture for a symmetric version of Ehrhard's inequality.

problem Formulating a conjecture for the optimal Ehrhard-type inequality for convex symmetric sets.
method Formulating a conjecture and explaining its optimality in terms of Gaussian concavity power.
result Proving certain inequalities for symmetric convex sets, with round k-cylinders as the only equality cases.

New algorithms solve stochastic variational inequalities without bounded variance assumption.

problem Solving stochastic variational inequalities without bounded variance assumption.
method Developed algorithms for two classes of problems: monotone and structured nonmonotone VIs.
result Oracle complexity of O(ε^-4) for solving VIs with unbounded domains and possibly unbounded variance.

Empirical Bayes method improves Gaussian sequence model inference.

problem Estimating parameters in correlated Gaussian sequence models.
method Maximum Composite Marginal Likelihood (CML) estimator, leveraging geometric Brascamp-Lieb inequality.
result CML estimator converges at rate \( n_*^{-1/2} \) in weighted Hellinger distance.

The paper extends confidence sequences for infinite variance data.

problem Addressing confidence sequences for distributions with infinite variance.
method Establishing lower bounds and deriving tight confidence sequences for relaxed bounded pthp^{th}-moment distributions.
result Derived confidence sequences are tighter than those using Dubins-Savage inequality.

We analyze the probabilistic variance of a solution of Liouville's equation for curvature, given suitable bounds on the Gaussian curvature. The related systolic geometry was recently studied by Horowitz, Katz, and Katz, where we obtained a strengthening of Loewner's torus inequality containing a "defect term", similar …

2011-05-03abs ↗pdf ↗

The paper generalizes Bayesian Cramér-Rao inequality using information geometry of relative α-entropy.

problem Establishing a lower bound for the variance of an unbiased estimator for the α-escort distribution.
method Proposes a general Riemannian metric based on relative α-entropy to derive a generalized Bayesian Cramér-Rao inequality.
result Establishes a lower bound for the variance of an unbiased estimator for the α-escort distribution.

Introduces MWLD to measure loss inequality across groups.

problem Machine learning's focus on average loss can lead to large group loss discrepancies.
method Defines MWLD, relates it to fairness and robustness, and provides estimation methods.
result MWLD can be estimated efficiently under certain weighting functions and reduces loss variance without significant accuracy loss.

Generalization in nonlinear least squares can be studied via algorithmic stability and effective dimension.

problem Generalization in nonlinear least squares models
method Deriving error bounds for local minimizers using algorithmic stability and effective dimension
result Bounds depend on learned geometry rather than parameter count

We show that Bonnesen's isoperimetic defect has a systolic analog for Loewner's torus inequality. The isosystolic defect is expressed in terms of the probabilistic variance of the conformal factor of the metric g with respect to the flat metric of unit area in the conformal class of g.

2008-03-05abs ↗pdf ↗

Simplified analysis of diffusion models using discrete random variables.

problem Theoretical analysis of diffusion models is complex and requires rigorous proofs.
method Simplified framework for analyzing Euler--Maruyama discretization of VP-SDEs using Grönwall's inequality.
result Standard Gaussian noise can be replaced by discrete random variables without sacrificing convergence guarantee.

The paper analyzes sparse high-dimensional linear regression with random design and unknown error variance, providing adaptiveness and concentration rates.

problem Sparse high-dimensional linear regression with random design and unknown error variance.
method Analysis of posterior concentration rates, employing techniques to address model misspecification.
result Adaptiveness and concentration rates of the posterior for sparse high-dimensional linear regression.

Sharp concentration inequalities for sub-Orlicz random variables with phase transition at α=2.

problem Developing concentration inequalities for sub-Orlicz random variables with phase transition.
method New theoretical analysis framework involving variance and min/max functions of Orlicz tails.
result Sharp concentration inequalities with phase transition at α=2 for sub-Orlicz random variables.

We obtain a sharp lower bound on the isoperimetric deficit of a general polygon in terms of the variance of its side lengths, the variance of its radii, and its deviation from being convex. Our technique involves a functional minimization problem on a suitably constructed compact manifold and is based on the spectral t…

2014-02-18abs ↗pdf ↗

Paper defines Fisher co-metric on cotangent bundle and clarifies its relation to variance.

problem Defines Fisher co-metric on cotangent bundle and clarifies its relation to variance.
method Defines Fisher co-metric directly from Fisher metric without going through tangent bundle, using a natural correspondence between cotangent vectors and random variables.
result Clarifies the relation between Fisher co-metric and variance/covariance, trivializing the Cramér-Rao inequality.

Paper improves convergence rate of Langevin Dynamics algorithms.

problem Sampling problems and non-convex optimization in machine learning.
method Stochastic Variance Reduced Gradient Langevin Dynamics and Stochastic Recursive Gradient Langevin Dynamics with improved convergence rates.
result Proves convergence to objective distribution under weaker conditions.

New concentration inequality for U-statistics of Markov chains.

problem Proving a concentration inequality for U-statistics of order two in uniformly ergodic Markov chains.
method Inductive analysis using martingale techniques, uniform ergodicity, Nummelin splitting, and Bernstein's inequality.
result Recovery of convergence rate for U-statistics of independent random variables and canonical kernels, with improved results for dependent kernels.

New algorithm reduces regret for linear bandits with unknown noise variance.

problem Finding optimal actions in linear bandits with varying noise variance.
method Adaptive algorithm with Freedman-type concentration inequality and multi-layer structure.
result Achieves ildeO(dk=1Kσk2+d) ilde{O}(d \sqrt{\sum_{k = 1}^K σ_k^2} + d) regret for linear bandits.

Adaptive kernel regression with streaming data and unknown variance.

problem Tackling adaptive regularization in streaming kernel regression with unknown noise variance.
method Generalized finite-dimensional linear regression to kernel setup, using self-normalized inequalities for variance estimation and adaptive regularization.
result Valid uniform bounds on mean function value at all points and time steps, leading to improved kernel bandit procedures.

We give improved constants for data dependent and variance sensitive confidence bounds, called empirical Bernstein bounds, and extend these inequalities to hold uniformly over classes of functionswhose growth function is polynomial in the sample size n. The bounds lead us to consider sample variance penalization, a nov…

2009-07-21abs ↗pdf ↗

Integrates prediction models into portfolio optimization for better asset allocation.

problem Traditional portfolio optimization ignores prediction models, leading to suboptimal decisions.
method Developed a framework that combines regression prediction with mean-variance optimization, providing analytical solutions and neural-network-based optimization for inequality constraints.
result Demonstrated through simulations that integrating prediction models improves portfolio performance.

A new matrix concentration inequality for random products of matrices.

problem Understanding the behavior of random matrix products under bounded independent positive semidefinite matrices.
method Developed a non-asymptotic concentration inequality for the product of matrices.
result The inequality provides a bound on the deviation of the matrix product from its expected value.

Proposes counterfactual explainability for causal attribution, extending variance analysis methods.

problem Lack of mechanistic understanding in existing tools for explaining complex models.
method Extends global sensitivity analysis methods to causal explanations using directed acyclic graphs.
result Developed methods to estimate counterfactual explainability and applied to income inequality analysis.

We give tight concentration bounds for mixtures of martingales that are simultaneously uniform over (a) mixture distributions, in a PAC-Bayes sense; and (b) all finite times. These bounds are proved in terms of the martingale variance, extending classical Bernstein inequalities, and sharpening and simplifying prior wor…

2015-06-22abs ↗pdf ↗

Unified framework for variance reduction to solve monotone operator problems.

problem Large-scale monotone inclusion problems with finite sum structure.
method Developed a general framework for variance-reduced forward-backward splitting algorithms.
result Linear convergence rate under mild assumptions, with Catalyst acceleration and asynchronous implementation.