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,742 papers · 148 categories

Trend · papers per month

61122182243 · Jun 202019922001200920172026
48 results for GOE statistics

Study shows energy levels on hyperbolic surfaces follow GOE fluctuations.

problem Understanding energy level fluctuations on hyperbolic surfaces.
method Analysis of Laplace eigenvalues on hyperbolic surfaces, using GOE random matrix theory.
result Energy variance on typical hyperbolic surfaces closely matches GOE fluctuations.

Study smooth linear statistics on random covers of hyperbolic surfaces, showing central limit and variance results.

problem Analyzing fluctuations and energy variance of random covers of compact hyperbolic surfaces.
method Examining fluctuations in a small energy window around a fixed energy level, considering the variance of a typical surface, using a double limit where nn and LL go to infinity.
result Distribution of fluctuations tends to a Gaussian with variance of GOE/GUE, and energy variance of a typical random nn-cover is that of GOE/GUE.

This is a sequel to the paper [Cas]. Here, we extend the methods of Farb-Wolfson using the theory of FI_G-modules to obtain stability of equivariant Galois representations of the etale cohomology of orbit configuration spaces. We establish subexponential bounds on the growth of unstable cohomology, and then use the Gro…

2017-03-21abs ↗pdf ↗

Inverse statistics in economics is considered. We argue that the natural candidate for such statistics is the investment horizons distribution. This distribution of waiting times needed to achieve a predefined level of return is obtained from (often detrended) historic asset prices. Such a distribution typically goes t…

2002-11-02abs ↗pdf ↗

The paper shows Gaussian fluctuations in eigenvalue statistics of random hyperbolic surfaces.

problem Understanding fluctuations in Laplace eigenvalues of random hyperbolic surfaces.
method Analyzing fluctuations of linear statistics of Laplace eigenvalues over moduli space of surfaces of large genus.
result The distribution of linear statistics tends to a Gaussian as the genus of surfaces increases.

Persistence diagrams from random matrices follow RMT universality, offering a new spectral diagnostic.

problem Understanding spectral properties of random matrices using topological data analysis.
method Applying Morse theory to persistence diagrams of quadratic forms restricted to unit spheres.
result Persistence entropy outperforms traditional level spacing ratios in discriminating random matrix ensembles.

High-dimensional SGD limits show surprising dynamics and phase transitions.

problem Understanding SGD in high dimensions and its scaling limits.
method Proving limit theorems for SGD trajectories in high dimensions, choosing summary statistics, initialization, and step-size.
result Critical scaling regime for step-size, new correction term, and complex diffusive limits.

Polyak step size GD reaches final radius of convergence after log iterations.

problem Statistical and computational complexities of Polyak step size GD.
method Generalized smoothness and Lojasiewicz conditions, stability of gradients.
result Polyak step size GD reaches final statistical radius of convergence after logarithmic number of iterations.

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.

A new method of moments estimator goes beyond data reweighting.

problem Estimation of moment restrictions and conditional moment restrictions.
method Kernel Method of Moments (KMM) based on maximum mean discrepancy.
result KMM achieves competitive performance on conditional moment restriction tasks.

The paper improves ALO for 1\ell_1-regularized models.

problem Estimating out-of-sample error for 1\ell_1-regularized models.
method Developed a novel theory for 1\ell_1-regularized problems, bounding ALO error.
result For 1\ell_1-regularized problems, ALO error goes to zero as p goes to infinity.

The inverse statistics is the distribution of waiting times needed to achieve a predefined level of return obtained from (detrended) historic asset prices \cite{optihori,gainloss}. Such a distribution typically goes through a maximum at a time coined the {\em optimal investment horizon}, τρτ^*_ρ, which defines the most…

2006-01-02abs ↗pdf ↗

Loose bounds found for least-norm interpolant in over-parameterized settings.

problem Failures of model-dependent generalization bounds for least-norm interpolation.
method Analysis of generalization performance of least-norm linear regressor in over-parameterized regime.
result Generalization bounds for least-norm interpolant can be very loose, even when true excess risk goes to zero.

In this paper, we present a multi-period trading model in the style of Kyle (1985)'s inside trading model, by assuming that there are at least two insiders in the market with long-lived private information, under the requirement that each insider publicly discloses his stock trades after the fact. Based on this model, …

2011-03-04abs ↗pdf ↗

The Mallows model, introduced in the seminal paper of Mallows 1957, is one of the most fundamental ranking distribution over the symmetric group SmS_m. To analyze more complex ranking data, several studies considered the Generalized Mallows model defined by Fligner and Verducci 1986. Despite the significant research in…

2019-06-03abs ↗pdf ↗

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.

In recent publications, the authors have considered inverse statistics of the Dow Jones Industrial Averaged (DJIA) [1-3]. Specifically, we argued that the natural candidate for such statistics is the investment horizons distribution. This is the distribution of waiting times needed to achieve a predefined level of retu…

2005-11-10abs ↗pdf ↗

We show that, given an immortal solution to the Ricci flow on a closed manifold with uniformly bounded curvature and diameter, the Ricci tensor goes to zero as t goes to infinity. We also show that if there exists an immortal solution on a closed 3-dimensional manifold such that the product of the square of the diamete…

2012-04-30abs ↗pdf ↗

Develops unbiased estimation method using underdamped Langevin dynamics.

problem Estimating expectations of non-negative Lebesgue density probability measures.
method Underdamped Langevin dynamics, time-discretized versions, doubly randomized estimation.
result Proves finite variance and expected/finite cost of the proposed estimator.

Proposes an exponentially increasing step-size for faster parameter estimation in statistical models.

problem Slow convergence of gradient descent in locally convex loss functions.
method Exponentially increasing step-size in gradient descent algorithm.
result Converges linearly to optimal solution under homogeneous assumptions.

Study shows exponential growth of Laplacian determinant on random hyperbolic surfaces.

problem Understanding the behavior of Laplacian determinants on random hyperbolic surfaces.
method Investigated various models of random hyperbolic surfaces and their Laplacian determinants as genus increases.
result For all popular models, the determinant grows exponentially with a universal exponent as the genus goes to infinity.

The parametric complexity is the key quantity in the minimum description length (MDL) approach to statistical model selection. Rissanen and others have shown that the parametric complexity of a statistical model approaches a simple function of the Fisher information volume of the model as the sample size nn goes to in…

2015-10-01abs ↗pdf ↗

We introduce and study a new family of extensions for the Borsuk-Ulam and topological Radon type theorems. The defining idea for this new family is to replace requirements of the form `a subset that is large in some sense goes to a singleton' with requirements of the milder form `a subset that is large in some sense go…

2018-12-28abs ↗pdf ↗

Stochastic gradient descent converges to universal limits in high dimensions.

problem Statistical tasks in high dimensions with specific data projections.
method Stochastic gradient descent applied to mixture distributions, proving universality of limits.
result The ODE limits are universal for mixtures of arbitrary product distributions.

Unified approach for quantum and classical learning from evaluation oracles.

problem Learning from evaluation oracles in quantum and classical settings.
method Inspired by Kearns' SQ and Valiant's weak evaluation oracle, a unified framework is established.
result Characterizes query complexity for learning linear function classes and extends learnability results for quantum circuits.

Study the limits of discrete DPPs to continuous DPPs as set size grows.

problem Characterize the behavior of discrete DPPs as they approach continuous DPPs.
method Non-asymptotic characterization of the limit in terms of weak coherency.
result Sufficient conditions for weak coherency are identified.

Paper studies MCCR models with scale parameters tending to zero, revealing optimal learning rate and comparing robustness.

problem Analyzing MCCR models with scale parameters approaching zero.
method Investigates MCCR models with scale parameters tending to zero, revealing optimal learning rate and comparing robustness.
result Optimal learning rate of MCCR models is O(n1){\mathcal{O}}(n^{-1}) in the asymptotic sense.

Let M be a closed connected manifold. Let m(M) be the Morse number of M, that is, the minimal number of critical points of a Morse function on M. Let N be a finite cover of M of degree d. M.Gromov posed the following question: what are the asymptotic properties of m(N) as d goes to infinity? In this paper we study the …

1998-10-22abs ↗pdf ↗

Study calculates eigenvalues and eigenfunctions for spherical triangles and finds fundamental gap behavior.

problem Understanding eigenvalues and gaps in spherical triangles.
method Explicit computation of Dirichlet eigenvalues and eigenfunctions for spherical lunes and triangles.
result Fundamental gap of spherical triangles increases as the angle of the lune decreases.

Inferring the correct answers to binary tasks based on multiple noisy answers in an unsupervised manner has emerged as the canonical question for micro-task crowdsourcing or more generally aggregating opinions. In graphon estimation, one is interested in estimating edge intensities or probabilities between nodes using …

2017-03-23abs ↗pdf ↗

Paper tackles small eigen-gap estimation and inference for noisy symmetric matrices.

problem Estimating eigenvectors with small eigen-gap and fine-grained statistical reasoning.
method Eigen-decomposition of asymmetric data matrix, distribution-free procedures, adaptive to heteroscedastic noise.
result Minimax optimal under Gaussian noise, confidence intervals for eigenvalues, small eigen-gap handling.

Study improves Hayashi-Yoshida estimator for high-dimensional stock covolatility.

problem Inconsistent performance of Hayashi-Yoshida estimator in high dimensions.
method Analyzed the limiting spectral distribution of the Hayashi-Yoshida estimator.
result Established the connection between the estimator's spectrum and the true covariance matrix in high dimensions.

We show that univariate and symmetric multivariate Hawkes processes are only weakly causal: the true log-likelihoods of real and reversed event time vectors are almost equal, thus parameter estimation via maximum likelihood only weakly depends on the direction of the arrow of time. In ideal (synthetic) conditions, test…

2017-09-25abs ↗pdf ↗

New method detects OOD samples using neural network trajectories.

problem Lack of comprehensive layer exploration in OOD detection.
method Functional data perspective, analyzing sample trajectories through multi-layer classifier.
result Empirically validated as effective compared to state-of-the-art methods.

New DP bootstrap method for statistical inference with improved privacy and accuracy.

problem Lack of general techniques for conducting statistical inference under differential privacy.
method DP bootstrap procedure to infer sampling distribution and construct confidence intervals.
result DP bootstrap estimates provide consistent point estimates and asymptotically valid standard CIs.