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

3468102136 · May 202619922001200920172026
48 results for concentrability coefficient

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.

New insights on offline RL with state aggregation and trajectory data.

problem Understanding sample complexity in offline policy evaluation.
method Analyzing concentrability coefficient in aggregated Markov Transition Model.
result Sample complexity depends on concentrability coefficient in aggregated model.

In the celebrated book entitled Metric Structures for Riemannian and Non-Riemannian Spaces, so-called Green Book, Gromov presented a problem regarding a metric measure space. Gromov posed the question Bound the expansion coefficient from below in terms of the observable diameter. The overall aim of the current study is…

2016-11-17abs ↗pdf ↗

Paper tackles robust offline RL for non-Markovian processes, improving efficiency and applicability.

problem Learning robust policies for non-Markovian decision processes with limited offline data.
method Proposes a novel algorithm with dataset distillation and LCB design for robust values, derived new dual forms, and introduces concentrability coefficients.
result Proves polynomial sample efficiency for finding ε-optimal robust policies.

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.

Uncertainty principles such as Heisenberg's provide limits on the time-frequency concentration of a signal, and constitute an important theoretical tool for designing and evaluating linear signal transforms. Generalizations of such principles to the graph setting can inform dictionary design for graph signals, lead to …

2016-03-10abs ↗pdf ↗

The Fokker-Planck equation with diffusion coefficient quadratic in space variable, linear drift coefficient, and nonlocal nonlinearity term is considered in the framework of a model of analysis of asset returns at financial markets. For special cases of such a Fokker-Planck equation we describe a construction of exact …

2008-04-06abs ↗pdf ↗

A concentration graph associated with a random vector is an undirected graph where each vertex corresponds to one random variable in the vector. The absence of an edge between any pair of vertices (or variables) is equivalent to full conditional independence between these two variables given all the other variables. In…

2007-05-11abs ↗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.

This paper proposes a new methodology to compute Value at Risk (VaR) for quantifying losses in credit portfolios. We approximate the cumulative distribution of the loss function by a finite combination of Haar wavelets basis functions and calculate the coefficients of the approximation by inverting its Laplace transfor…

2009-04-29abs ↗pdf ↗

Paper tackles offline CMDP problems with near-optimal algorithm and sample complexity bound.

problem Offline CMDP problems with only offline data available.
method DPDL algorithm using single-policy concentrability coefficient CC^* and deviation control mechanism.
result DPDL algorithm matches sample complexity lower bound with ildeO((1γ)1) ilde{\mathcal{O}}((1-γ)^{-1}) factor.

Recently the interest of researchers has shifted from the analysis of synchronous relationships of financial instruments to the analysis of more meaningful asynchronous relationships. Both of those analyses are concentrated only on Pearson's correlation coefficient and thus intraday lead-lag relationships associated wi…

2014-02-16abs ↗pdf ↗

SCOPE estimator improves covariance and precision matrix estimation.

problem Estimating covariance and precision matrices accurately.
method Distributionally robust optimization with convex spectral divergence.
result SCOPE estimator reduces spectral bias and improves condition number.

Unified hybrid RL algorithm improves online RL performance with offline data.

problem Improving reinforcement learning performance with limited online data.
method A unified hybrid RL algorithm combining offline and online data.
result Unified algorithm achieves state-of-the-art results in sub-optimality gap and online learning regret.

X in R^D has mean zero and finite second moments. We show that there is a precise sense in which almost all linear projections of X into R^d (for d < D) look like a scale-mixture of spherical Gaussians -- specifically, a mixture of distributions N(0, sigma^2 I_d) where the weight of the particular sigma component is P …

2012-06-27abs ↗pdf ↗

Proposes HDBEN for heteroscedastic regression with improved sparsity and variance modeling.

problem Violation of constant error variance in high-dimensional regression.
method HDBEN framework using hierarchical Bayesian priors with 1\ell_1 and 2\ell_2 penalties.
result Achieves posterior concentration, variable selection consistency, and asymptotic normality.

We consider linear models where dd potential causes X1,...,XdX_1,...,X_d are correlated with one target quantity YY and propose a method to infer whether the association is causal or whether it is an artifact caused by overfitting or hidden common causes. We employ the idea that in the former case the vector of regression c…

2018-03-02abs ↗pdf ↗

Paper develops sparse learning for heavy-tailed time series with locally stationary dynamics.

problem Sparse learning for high-dimensional heavy-tailed locally stationary time series.
method Additive modeling with kernel smoothing, sparsity-inducing penalized estimation.
result Prediction-error bounds and convergence rates for different sparsity structures.

Study on hemisphere threshold for Escobar functional on Riemannian manifolds, revealing mass and boundary invariant behaviors.

problem Analyzing the hemisphere threshold for the Escobar functional on compact Riemannian manifolds.
method Near-threshold landscape organization by boundary invariants, exact evaluation of weighted profile moments, Lyapunov-Schmidt correction, and blow-up analysis.
result At threshold, blow-ups concentrate at umbilic points with vanishing mass and gradient, leading to compactness and hemispherical rigidity.

We consider strictly stationary heavy tailed time series whose finite-dimensional exponent measures are concentrated on axes, and hence their extremal properties cannot be tackled using classical multivariate regular variation that is suitable for time series with extremal dependence. We recover relevant information ab…

2013-07-05abs ↗pdf ↗

This paper analyzes SHAP values using Fourier expansions for model interpretability.

problem Understanding and interpreting SHAP values in complex models.
method Developed a spectral framework using Fourier expansions for SHAP values in various model regimes.
result SHAP values are Lipschitz continuous in the deterministic regime and converge to Gaussian process values in the probabilistic regime.

This note examines financial distributions to competing teams at the end of the most famous multiple stage professional (male) bicyclist race, TOUR DE FRANCE. A rank-size law (RSL) is calculated for the team financial gains. The RSL is found to be hyperbolic with a surprisingly simple decay exponent (about equal to -1)…

2019-10-24abs ↗pdf ↗

Automatically differentiable estimation for BLP model reduces bias in demand estimation.

problem Estimating the BLP model with reduced bias and improved performance.
method Phrasing BLP as an automatically differentiable moment function, using CUE for estimation, and incorporating MCMC credible intervals.
result CUE estimation shows lower bias but higher MAE compared to 2S-GMM, with MCMC providing closest empirical coverage.

This study assesses the reproducibility of 1H-MRS scans across different vendors and sessions.

problem Lack of harmonization in magnetic resonance spectroscopy protocols among vendors.
method Analysis of CV and ICC for within- and between-sessions, and correlation coefficients for across machines.
result Metabolite concentrations are highly reproducible across different vendors and sessions.

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.

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 ↗