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

8.3%16.7%25.0%33.3% · Jul 199219922001200920172026
48 results for order statistics

This paper strengthens the central limit theorem for order statistics using relative entropy.

problem Establishing a stronger mode of convergence for central limit behavior of order statistics.
method Using relative entropy to ensure a stronger mode of convergence for central limit behavior of order statistics.
result An order O(1/n)O(1/\sqrt{n}) rate of convergence is established under mild conditions.

This paper simplifies computing higher-order UU-statistics efficiently.

problem The inefficiency of computing higher-order UU-statistics in practice.
method Decomposition, connection to Einstein summation, and treewidth-based complexity estimate.
result A new, more efficient algorithm to compute UU-statistics.

The paper provides bounds for high-dimensional U-statistics with novel order-explicit inequalities.

problem Bounding the deviation of high-dimensional U-statistics from their Hájek projections.
method Develops novel order-explicit moment inequalities for higher-order Hoeffding components.
result The maximum deviation of a high-dimensional U-statistic from its Hájek projection is of order Op(φbn1log2(dn))O_p(φb n^{-1}\log^2(dn)).

Model uses statistical physics principles to predict financial market volatility and returns.

problem Predicting price volatility and expected returns in financial markets.
method Inspired by statistical physics, the study introduces a physical model using Level 3 order book data to measure kinetic energy and momentum.
result The model outperforms traditional and machine learning approaches in forecasting volatility and expected returns.

New estimator stabilizes higher-order influence functions for stable statistical inference.

problem Numerical instability in estimating inverse population Gram matrix.
method Proposes a new stabilized higher-order estimator without sample splitting.
result Stabilized estimator exhibits more stable performance and similar statistical guarantees.

Paper proposes efficient methods for high-order clustering in tensor block models.

problem High-order clustering of multiway datasets in neuroimaging, genomics, etc.
method Tensor block model and computationally efficient algorithms (HLloyd, HSC)
result Achieves high-order exact clustering with statistical optimality and computational efficiency.

While records and order statistics of independent and identically distributed (i.i.d.) random variables X_1, ..., X_N are fully understood, much less is known for strongly correlated random variables, which is often the situation encountered in statistical physics. Recently, it was shown, in a series of works, that one…

2013-05-03abs ↗pdf ↗

New quantum states capture more information, enabling advanced processing tasks.

problem Quantum information processing challenges with limited statistical information.
method Introducing Random-Coefficient Pure States (RCPS) and exploiting their higher-order statistics.
result RCPS provide richer information than density operators, enabling new quantum tasks.

The paper studies quantile contributions and their relationship with order statistics in heavy-tailed distributions.

problem Challenges of classical statistical models in heavy-tailed distributions.
method Theoretical study of quantile contribution statistic and its relationship with order statistics. Derivation of closed-form expression for joint CDF of order statistics and quantile contributions.
result Established asymptotic normality of quantile contributions and characterized their limiting distribution.

Improved computational complexity in statistical models using second-order information.

problem Polynomial convergence of gradient descent in singular statistical models.
method Normalized Gradient Descent (NormGD) algorithm with second-order information.
result NormGD reaches final statistical radius in logarithmic iterations of nn.

New estimator stabilizes higher-order influence functions for bilinear forms.

problem Stability issues in estimating bilinear forms using higher-order influence functions.
method Proposes a new stabilized higher-order estimator for a class of bilinear forms without sample splitting.
result New estimator exhibits more stable finite-sample performance compared to the empirical higher-order estimator.

We develop a new statistical test for comparing variables with varying scales.

problem Comparing variables with different scales in multidimensional spaces.
method Order based on expectations of random variables, generalized stochastic dominance (GSD) order, regularized statistical test, linear optimization, imprecise probability models.
result Validated through multidimensional data from various fields.

Statistical shape models enhance machine learning algorithms providing prior information about deformation. A Point Distribution Model (PDM) is a popular landmark-based statistical shape model for segmentation. It requires choosing a model order, which determines how much of the variation seen in the training data is a…

2018-08-01abs ↗pdf ↗

Diffusion models learn simple statistics before complex ones, revealing a sample complexity exponent.

problem Understanding the learning dynamics of diffusion models.
method Empirical observations and theoretical analysis of diffusion models and denoisers.
result Diffusion models learn simple statistics (pair-wise correlations) at linear sample complexity, while higher-order statistics (e.g., fourth cumulant) require cubic sample complexity.

Study improves BN TTA under distribution shift using higher-order asymptotics.

problem Improving BN TTA for changing data distributions.
method Integrates Edgeworth expansion and saddlepoint approximation with one-step M-estimation.
result Derives optimal weighting parameter for minimized mean-squared error.

Finding statistically significant high-order interaction features in predictive modeling is important but challenging task. The difficulty lies in the fact that, for a recent applications with high-dimensional covariates, the number of possible high-order interaction features would be extremely large. Identifying stati…

2015-06-26abs ↗pdf ↗

Paper explores limits of high-order clustering with planted structures.

problem Statistical and computational limits of high-order clustering with planted structures.
method Developed methods for detection and recovery of clusters, identified signal-to-noise ratio boundaries.
result Sharp boundaries of signal-to-noise ratio for statistical and computational feasibility.

Neural networks can learn from higher-order cumulants efficiently, requiring quadratic samples.

problem Learning from higher-order cumulants in high-dimensional data.
method Spiked cumulant model, polynomial time algorithms, neural networks, random features.
result Neural networks require quadratic samples to learn from higher-order cumulants efficiently, while random features require more samples.

New method finds significant high-order interactions efficiently.

problem Finding statistically significant high-order interactions in high-dimensional data.
method Extends selective inference to high-order interaction models with pruning strategy.
result Demonstrated efficient and powerful method for high-order interactions.

The paper reviews recent statistical methods for financial markets, focusing on jumps, volatility, and microstructure noise.

problem Analyzing financial market data with statistical models.
method Review and development of statistical methods for financial markets, including jump tests, rough volatility, and microstructure noise.
result Established a minimax lower bound for volatility recovery and proposed new statistical methods for financial market analysis.

Improved estimation of higher order integrals using shrinkage techniques.

problem Estimating higher order Bochner integrals in non-parametric settings.
method Shrinkage of U-statistic towards a target element, considering kernel degeneracy.
result Consistent shrinkage estimators with fast rates of convergence, even for non-degenerate kernels.

New method for zeroth-order stochastic gradient algorithms provides confidence intervals.

problem Lack of inferential capabilities for zeroth-order stochastic gradient algorithms.
method Established central limit theorem and provided online estimators for asymptotic covariance matrix.
result Asymptotically valid confidence sets for parameter estimation and prediction.

We propose a model for price formation in financial markets based on clearing of a standard call auction with random orders, and verify its validity for prediction of the daily closing price distribution statistically. The model considers random buy and sell orders, placed following demand- and supply-side valuation di…

2019-04-16abs ↗pdf ↗

We present an extension of the Kolmogorov-Smirnov (KS) two-sample test, which can be more sensitive to differences in the tails. Our test statistic is an integral probability metric (IPM) defined over a higher-order total variation ball, recovering the original KS test as its simplest case. We give an exact representer…

2019-03-24abs ↗pdf ↗

Study quantifies how LLMs capture higher-order statistical structure using cumulant expansion.

problem Understanding how LLMs internalize statistical structure during next-token prediction.
method Cumulant-expansion framework treating softmax entropy as perturbation around center distribution.
result Cumulants reveal distinct signatures for mathematical vs. general text prompts, quantifying feature-learning dynamics.

A new model predicts race places using changeover-times and log-normal distributions.

problem Predicting race places in orienteering races.
method Fenton-Wilkinson Order Statistics model based on log-normal leg-times and changeover-times.
result The model accurately predicts race places with smaller root-mean-square-errors.

Improved simulation of phase transitions using hierarchical autoregressive networks.

problem Simulating phase transitions in complex systems.
method Hierarchical Autoregressive Neural (HAN) network sampling algorithm.
result Significant improvement in statistical uncertainty compared to the Wolff cluster algorithm.

New method uses statistical physics to detect financial market manipulation.

problem Detecting financial market manipulation activities like spoofing and layering.
method Modeling order book dynamics as particle motion and using momentum measure.
result Method outperforms conventional Z-score-based anomaly detection.

New inequalities help optimize first-order algorithms for statistical risk analysis.

problem Optimizing first-order iterative algorithms for statistical risk analysis.
method Introducing basic inequalities that connect implicit and explicit regularization.
result The basic inequalities translate the number of iterations into an effective regularization coefficient.

We develop a theory of higher-order feature attribution for complex models.

problem Interpreting feature contributions in models with interactions is challenging.
method We extend Integrated Gradients (IG) to higher-order feature attributions.
result We establish natural connections to statistics and topological signal processing.

Flexible approach for normal approximations in geometric and topological statistics.

problem Normal approximation for complex statistics not expressible as sums of score functions.
method Flexible add-one cost operator combined with strong stabilization theory.
result Established normal approximation results for geometric and topological statistics.

This article develops a statistical test for the null hypothesis of strict stationarity of a discrete time stochastic process in the frequency domain. When the null hypothesis is true, the second order cumulant spectrum is zero at all the discrete Fourier frequency pairs in the principal domain. The test uses a window …

2018-01-20abs ↗pdf ↗

LOB-Bench benchmarks generative AI for financial data, outperforming traditional models.

problem Lack of consensus on evaluating generative AI models for financial data.
method Python-based benchmark with LOB statistics and market impact metrics.
result Generative autoregressive models outperform traditional models in LOB data.