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

2575147701,027 · Jun 202019922001200920172026
48 results for generalized concentrability

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 on volume of tubes and concentration in Riemannian geometry.

problem Understanding concentration loci in Riemannian manifolds and their relation to tube volumes.
method Provided a general formula for tube volumes, specialized to totally geodesic submanifolds, and investigated concentration loci.
result Explicitly proved concentration for codimension one cases and explored characterizations in Wasserstein and Box distances.

The paper extends Hoeffding's inequality for Markov chains using a generalized concentrability condition.

problem Applying Hoeffding's inequality to non-ergodic Markov chains.
method Integrates generalized concentrability condition via IPM to extend traditional hypotheses.
result Demonstrates utility in machine learning applications such as empirical risk minimization and bandits.

A limit point p of a discrete group of Mobius transformations acting on S^n is called a concentration point if for any sufficiently small connected open neighborhood U of p, the set of translates of U contains a local basis for the topology of S^n at p. For the case of Fuchsian groups (n = 1), every concentration point…

1998-06-23abs ↗pdf ↗

New concentration inequalities for tensors with heavy-tailed coefficients.

problem Developing bounds for Euclidean functions of tensors with sub-Weibull distributions.
method Extending concentration inequalities to sub-Weibull random tensors, using new inequalities for heavy-tailed random variables and martingale analysis.
result Established a phase transition between sub-gaussian and heavy-tailed regimes for Euclidean functions of tensors.

Sharp concentration results for sums of heavy-tailed random variables.

problem Analyzing sums of independent heavy-tailed random variables.
method Using concentration inequalities and large deviation principles for distributions satisfying specific tail bounds.
result Sharp concentration inequalities and large deviation results for sums of heavy-tailed random variables.

The paper generalizes product inequalities for random vectors and their applications.

problem Understanding concentration of measure for products of random vectors.
method Develops expressions for the concentration of functionals of random vectors based on product norms.
result Provides generalized Hanson-Wright inequalities and applications to random matrices.

The paper establishes concentration bounds for embeddings of generative models.

problem Analyzing statistical properties of generative models.
method High probability concentration bounds on sample vector embeddings using Data Kernel Perspective Space.
result Determines the number of samples needed for accurate approximation of generative model embeddings.

This work achieves exponential concentration in heavy-tailed data over CAT(κ) spaces using the Fréchet median.

problem Achieving robust estimation in heavy-tailed data distributions.
method Developing a concentration bound for the Fréchet median in CAT(κ) spaces.
result Exponential concentration of the Fréchet median in CAT(κ) spaces over heavy-tailed data.

The paper offers a framework to analyze machine learning problems using concentration of measure.

problem Analyzing machine learning algorithms defined by implicit equations.
method Develops a concentration of measure framework to solve convex problems and implicit formulations.
result Provides precise estimations for the first moments of the solution, describing the behavior and performance of machine learning classifiers.

We consider a priori generalization bounds developed in terms of cross-validation estimates and the stability of learners. In particular, we first derive an exponential Efron-Stein type tail inequality for the concentration of a general function of n independent random variables. Next, under some reasonable notion of s…

2017-06-19abs ↗pdf ↗

Paper establishes convergence rates and concentration bounds for stochastic approximation and reinforcement learning with Markovian noise.

problem Analyzing convergence rates and concentration bounds for stochastic approximation and reinforcement learning with Markovian noise.
method Novel discretization of the mean ODE of stochastic approximation algorithms using intervals with diminishing length.
result First almost sure convergence rate and maximal concentration bound with exponential tails for contractive stochastic approximation algorithms with Markovian noise.

Paper addresses concentration of distances for fractional quasi p-norms, identifying conditions for concentration and anti-concentration.

problem Understanding concentration of distances for fractional quasi p-norms in high dimensions.
method Analyzes conditions for concentration and anti-concentration of distances for fractional quasi p-norms.
result Identifies conditions for concentration and anti-concentration of fractional quasi p-norms, ruling out some approaches and specifying conditions for control.

Study Finsler metric measure manifolds' concentration properties.

problem Understanding concentration properties in Finsler metric measure manifolds.
method Established relationships with observable diameter, isoperimetric inequalities, and first eigenvalue.
result Derived a Cheng type upper bound estimate for the first closed eigenvalue.

New theory for BNNs with Gaussian priors achieves optimal posterior concentration rates.

problem Lack of theoretical results for BNNs with Gaussian priors.
method New approximation theory for non-sparse DNNs with bounded parameters.
result BNNs with non-sparse general priors can achieve near-minimax optimal posterior concentration rates.

Paper develops bounds for stochastic approximation with averaging.

problem Establish high-probability bounds for averaged stochastic approximation.
method Develops a general framework for non-asymptotic concentration bounds.
result Derives sharp bounds for averaged iterates and tightens existing results.

We present a general sufficient condition for the formation of black holes due to concentration of angular momentum. This is expressed in the form of a universal inequality, relating the size and angular momentum of bodies, and is proven in the context of axisymmetric initial data sets for the Einstein equations which …

2015-03-20abs ↗pdf ↗

We survey recent results related to the concentration of eigenfunctions. We also prove some new results concerning ball-concentration, as well as showing that eigenfunctions saturating lower bounds for L1L^1-norms must also, in a measure theoretical sense, have extreme concentration near a geodesic.

2015-10-26abs ↗pdf ↗

The paper studies Dirac operators and their solutions concentrating near singular sets.

problem Understanding concentration properties of solutions to Dirac equations.
method Analyzes Dirac operators of the form Dε=D+ε1AD_\varepsilon= D+\varepsilon^{-1}\mathcal A and their solutions.
result Solutions concentrate exponentially near the locus where the rank of ker(A)\ker(\mathcal A) jumps.

Polluting fine dusts in South Korea which are mainly consisted of biomass burning and fugitive dust blown from dust belt is significant problem these days. Predicting concentrations of fine dust particles in Seoul is challenging because they are product of complicate chemical reactions among gaseous pollutants and also…

2019-01-29abs ↗pdf ↗

We improve bounds for stochastic processes, especially those with heavy tails.

problem Bounding the concentration of sub-ψψ processes with heavy tails.
method Variational approach to concentration, focusing on sub-Gaussian and other tail conditions.
result First dimension-free self-normalized empirical Bernstein inequality.

This study assesses risk concentration in MDB portfolios using Monte Carlo simulations.

problem Risk concentration in MDB portfolios of a few borrowers.
method Realistic MDB portfolio simulations and Monte Carlo analysis.
result Current risk adjustments may be overly conservative.

New approach to concentration inequalities for unbounded state space dynamical systems.

problem Concentration inequalities for unbounded state space dynamical systems.
method Functional analytic framework, transport-entropy inequality.
result Exponential concentration inequalities for sampling from stationary distribution.

The paper reviews and improves concentration inequalities for statistical inference.

problem Analyzing statistical inference in various settings with high-dimensional data.
method Review and improvement of concentration inequalities for different types of random variables and statistical measures.
result Fresh new results and improved bounds with sharper constants.

Study analyzes impact of concentrated liquidity on trading fees and provider returns.

problem Impact of concentrated liquidity on trading fees and provider returns.
method Comparison of average liquidity provider returns before and after concentrated liquidity introduction; quantification of fundamental strategies performance.
result Concentrated liquidity strategies outperform in certain trading pairs and market conditions.

In this paper, we study the Lévy-Milman concentration phenomenon of 1-Lipschitz maps into infinite dimensional metric spaces. Our main theorem asserts that the concentration to an infinite dimensional p\ell^p-ball with the q\ell^q-distance function for 1p<q+1\leq p<q\leq +\infty is equivalent to the concentration to the…

2008-08-24abs ↗pdf ↗

This work explores the characteristics of financial contagion in networks whose links distributions approaches a power law, using a model that defines banks balance sheets from information of network connectivity. By varying the parameters for the creation of the network, several interbank networks are built, in which …

2014-10-09abs ↗pdf ↗

We give concentration bounds for martingales that are uniform over finite times and extend classical Hoeffding and Bernstein inequalities. We also demonstrate our concentration bounds to be optimal with a matching anti-concentration inequality, proved using the same method. Together these constitute a finite-time versi…

2014-05-12abs ↗pdf ↗

Proves new concentration inequalities for sub-gaussian and sub-exponential variables.

problem Understanding functions of independent random variables better.
method Sub-gaussian and sub-exponential conditions, Rademacher complexities, Lipschitz function classes.
result Extension of Rademacher complexities to unbounded sub-exponential distributions.