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

1122 · Dec 202519922001200920172026
20 results for non-universality

We conclude from an analysis of high resolution NYSE data that the distribution of the traded value fif_i (or volume) has a finite variance σiσ_i for the very large majority of stocks ii, and the distribution itself is non-universal across stocks. The Hurst exponent of the same time series displays a crossover from we…

2006-08-02abs ↗pdf ↗

Normalizing flows are shown to be equivalent to Bayesian networks, revealing new insights.

problem Understanding the limitations and capabilities of normalizing flows.
method Revisiting normalizing flows as probabilistic graphical models and analyzing their structure.
result Normalizing flows can be reduced to Bayesian networks, revealing new insights into their structure and capabilities.

We present a relatively detailed analysis of the persistence probability distributions in financial dynamics. Compared with the auto-correlation function, the persistence probability distributions describe dynamic correlations non-local in time. Universal and non-universal behaviors of the German DAX and Shanghai Index…

2005-11-23abs ↗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.

This paper explores the limits of deep learning in poly-time.

problem Characterizing function distributions that deep learning can or cannot learn efficiently.
method Analysis of SGD and GD-based deep learning approaches, proving universality and non-universality results.
result SGD-based deep learning is efficiently universal, while GD-based is not, especially with large batches.

We reanalyze high resolution data from the New York Stock Exchange and find a monotonic (but not power law) variation of the mean value per trade, the mean number of trades per minute and the mean trading activity with company capitalization. We show that the second moment of the traded value distribution is finite. Co…

2005-08-22abs ↗pdf ↗

We present evidence, that if a large enough set of high resolution stock market data is analyzed, certain analogies with physics -- such as scaling and universality -- fail to capture the full complexity of such data. Despite earlier expectations, the mean value per trade, the mean number of trades per minute and the m…

2005-12-21abs ↗pdf ↗

We provide an analytically treatable model that describes in a unified manner income distribution for all income categories. The approach is based on a master equation with growth and reset terms. The model assumptions on the growth and reset rates are tested on an exhaustive database with incomes on individual level s…

2019-11-06abs ↗pdf ↗

We provide a microfoundation for linear price impact models in a stationary market.

problem Deriving linear price impact models in a stationary market with asymmetric information.
method Deriving linear price impact models as the equilibrium of an agent-based system.
result The model shows compatibility with universal price diffusion at small times and non-universal mean-reversion at larger times.

The paper proposes a new method for creating interpretable models using convex optimization.

problem Creating models that are both accurate and interpretable for decision-making.
method Formulates convex learning problems that combine interpretability with accuracy, using operator theory and parametric nonlinear models.
result Shows how to create efficient surrogate models that are both accurate and interpretable.

The paper characterizes the geometry and topology of spin random fields.

problem Understanding the expected geometry and topology of spin random fields.
method Investigating the asymptotic behavior of geometric and topological functionals for spin random fields under scaling assumptions.
result Explicit results for monochromatic fields, showing non-universal asymptotic behavior and new generalized models.

EM algorithm achieves optimal sample complexity for well-separated Gaussian mixtures.

problem Estimating parameters of well-separated Gaussian mixtures.
method New EM convergence proof for well-separated Gaussian mixtures.
result EM algorithm converges with Ω(logk)Ω(\sqrt{\log k}) separation, achieving O(kd/ε2)O(kd/ε^2) samples.

There are (at least) three approaches to quantifying information. The first, algorithmic information or Kolmogorov complexity, takes events as strings and, given a universal Turing machine, quantifies the information content of a string as the length of the shortest program producing it. The second, Shannon information…

2011-10-17abs ↗pdf ↗

Gaussian equivalence fails for simple polynomial embeddings in quadratic scaling RF models.

problem Failure of Gaussian equivalence in polynomial feature embeddings under quadratic scaling.
method Introduced Conditional Gaussian Equivalent (CGE) model to capture non-Gaussian behavior.
result Correct asymptotics derived for training and test errors in CGE model.