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

123246368491 · Jun 202019922001200920172026
48 results for Concentration estimates

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.

Develops inequalities for high-dimensional linear processes with dependent innovations.

problem Estimating high-dimensional VAR(p) systems and HAC covariance estimation.
method Concentration inequalities for ll_\infty norm of vector linear processes with sub-Weibull, mixingale innovations.
result Obtained concentration bounds for the maximum entrywise norm of lag-hh autocovariance matrices.

Improved estimation of concentration using half-spaces for adversarial vulnerability.

problem Understanding the concentration of measure phenomenon and its impact on adversarial vulnerability.
method Extending Gaussian Isoperimetric Inequality to non-spherical Gaussian measures and arbitrary ℓ_p-norms, using half-spaces to estimate concentration.
result Proposed method finds tighter intrinsic robustness bounds, providing evidence against concentration as a cause of adversarial vulnerability.

Study robust covariance estimation in large data with concentrated vectors.

problem Estimating robust covariance in large data with concentrated vectors.
method Fixed point of a contracting function using stable semi-metric and concentration of measure.
result Existence and uniqueness of robust estimator with evaluated limiting spectral distribution.

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.

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.

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 ↗

Sample measures of top centile contributions to the total (concentration) are downward biased, unstable estimators, extremely sensitive to sample size and concave in accounting for large deviations. It makes them particularly unfit in domains with power law tails, especially for low values of the exponent. These estima…

2014-05-08abs ↗pdf ↗

Improved concentration inequalities for sub-Weibull variables enhance statistical and machine learning applications.

problem Improving concentration inequalities for sub-Weibull random variables.
method Developed new concentration inequalities for sums of independent sub-Weibull random variables, including a new sub-Weibull parameter.
result New concentration inequalities with sharper constants and a mixture of sub-Gaussian and sub-Weibull tails.

The paper analyzes risk estimation methods and derives bounds for OCE risk.

problem Estimating the Optimized Certainty Equivalent (OCE) risk from samples.
method Derives mean-squared error and concentration bounds for SAA of OCE, and analyzes an efficient stochastic approximation-based estimator.
result Finite sample bounds and mis-identification probability bounds for the efficient estimator.

The study characterizes heat flow and concentration on directed graphs with a lower Ricci curvature bound.

problem Understanding heat flow and concentration on directed graphs with a specific curvature bound.
method Characterization via gradient estimate and transportation inequality for the heat semigroup.
result Concentration of measure inequality for directed graphs with positive Ricci curvature.

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.

The paper proves concentration inequalities for diffusion processes.

problem Proving concentration inequalities for diffusion processes.
method Analysis via the Poisson equation for a broad class of subexponentially ergodic processes.
result Demonstrates power of concentration inequalities in validating conditions for Lasso estimation and sampling algorithms.

Paper shows how online betting algorithms' regret can be used to create tight confidence sequences.

problem Estimating the expectation of random variables from samples and creating time-uniform confidence sequences.
method Converts the regret guarantee of universal portfolio algorithms into time-uniform concentration inequalities and confidence sequences.
result Numerically obtained confidence sequences are never vacuous and satisfy the law of iterated logarithm.

We consider the problem of estimating a spectral risk measure (SRM) from i.i.d. samples, and propose a novel method that is based on numerical integration. We show that our SRM estimate concentrates exponentially, when the underlying distribution has bounded support. Further, we also consider the case when the underlyi…

2019-12-22abs ↗pdf ↗

We analyze a plug-in estimator for a large class of integral functionals of one or more continuous probability densities. This class includes important families of entropy, divergence, mutual information, and their conditional versions. For densities on the dd-dimensional unit cube [0,1]d[0,1]^d that lie in a ββ-Hölder s…

2016-03-28abs ↗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.

Study on network-valued processes with asynchronous updates, proving consistency in community and changepoint estimation.

problem Understanding the behavior of network-valued stochastic processes with asynchronous updates.
method Analysis of concentration properties of aggregated adjacency and Laplacian matrices for lazy network-valued stochastic processes.
result Demonstrates consistency of estimators in community and changepoint estimation problems.

New model estimates indoor radon distribution with higher spatial resolution.

problem Accurate estimation of indoor radon concentration for health assessment.
method Quantile regression forest and probabilistic Monte Carlo sampling.
result Approximate lognormal distribution of indoor radon in Germany with specific exceedance probabilities.

The problem of estimating a high-dimensional sparse vector θRn\boldsymbolθ \in \mathbb{R}^n from an observation in i.i.d. Gaussian noise is considered. The performance is measured using squared-error loss. An empirical Bayes shrinkage estimator, derived using a Bernoulli-Gaussian prior, is analyzed and compared with the…

2017-07-28abs ↗pdf ↗

Study on stock portfolio concentration among Finnish households and investors.

problem Understanding the concentration of stock portfolios owned by Finnish households and investors.
method Analysis of stock portfolios using Herfindahl-Hirschman index over 20 years.
result High portfolio concentration observed in Finnish retail investors, similar to institutional investors.

In this paper, we study non-asymptotic deviation bounds of the least squares estimator in Gaussian AR(nn) processes. By relying on martingale concentration inequalities and a tail-bound for χ2χ^2 distributed variables, we provide a concentration bound for the sample covariance matrix of the process output. With this, …

2019-12-17abs ↗pdf ↗

Proposes a method to estimate sparse Gaussian graphical models with hidden clustering structure.

problem Modeling statistical relationships between variables with sparsity and clustering.
method Two-phase algorithm using sGS-ADMM for initial point and pALM for solution.
result Demonstrates good performance and efficiency of the proposed model and algorithm on synthetic and real data.

Study on bending energy of surfaces with curvature concentration, deriving new lower bounds.

problem Analyzing the Willmore energy of surfaces with curvature concentration.
method Using isoperimetric inequalities and framed loops, derive new lower bounds for the bending energy.
result Optimal blowup rates of the Willmore energy when curvature is concentrated.

Improved privacy-preserving methods for convex optimization with heavy-tailed data.

problem Privacy-preserving optimization of convex functions with heavy-tailed data.
method Developed algorithms for private mean estimation and convex optimization under concentrated differential privacy constraints.
result Achieved improved upper bounds on excess population risk for convex and strongly convex loss functions.

The paper improves Bayesian precision matrix estimation for high-dimensional sparse data.

problem Estimating sparse precision matrices in high-dimensional settings.
method Tempered posterior with fully specified horseshoe prior.
result Concentration results and theoretical oracle inequality for posterior.

The paper develops concentration inequalities for structured random data, extending beyond independent terms.

problem Developing concentration inequalities for structured weighted sums of random data, including tensors and matrix-valued data.
method The paper develops Hoeffding and Bernstein bounds for structured weighted sums under exchangeability, extending beyond the classical framework of independent terms.
result The paper develops a sharper concentration bound for combinatorial sums of matrix arrays.

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.