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

85171256341 · Jun 202019922001200920172026
48 results for universal scaling

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 ↗

Deep neural networks near edge of chaos show universal scaling laws.

problem Understanding the behavior of deep neural networks near critical points.
method Analogy to absorbing phase transitions in statistical mechanics, deterministic propagation dynamics, mean-field and directed percolation universality classes.
result Deep neural networks exhibit universal scaling laws near the edge of chaos.

Study reveals a universal formula for knotting in random equilateral polygons.

problem Probability of knotting in equilateral random polygons.
method Extensive Monte Carlo simulations with improved algorithms and knot invariants.
result A universal scaling formula for knotting probability with number of edges, involving exponential and power law factors.

Field theory explains optimal scaling in ResNets for signal propagation.

problem Understanding optimal scaling parameter for ResNet performance.
method Finite-size field theory for ResNets to study signal propagation and scaling.
result Analytical expressions for optimal scaling parameter, independent of other hyperparameters.

In the framework of Lorentzian warped products, we study the Friedmann-Robertson-Walker cosmological model to investigate non-smooth curvatures associated with multiple discontinuities involved in the evolution of the universe. In particular we analyze non-smooth features of the spatially flat Friedmann-Robertson-Walke…

2003-08-16abs ↗pdf ↗

Dropout schedules can be optimized to significantly reduce model test loss.

problem Improving model performance in neural networks.
method Developed a mean-field theory of dropout at the edge of chaos, proposing front-loaded dropout schedules.
result Front-loaded dropout schedules reduce test loss by 18-35% over constant dropout.

A grand challenge of the 21st century cosmology is to accurately estimate the cosmological parameters of our Universe. A major approach to estimating the cosmological parameters is to use the large-scale matter distribution of the Universe. Galaxy surveys provide the means to map out cosmic large-scale structure in thr…

2017-11-06abs ↗pdf ↗

We uncover scaling laws and statistical structure in complex datasets.

problem Understanding universal traits in complex datasets.
method Analogizing data to physical systems, using statistical physics and RMT.
result Real-world datasets and Gaussian data with long-range correlations share the same RMT universality class.

In this paper we explore coarse properties of cusp-decomposable manifolds first defined by Nguyên Phan. We describe the large scale geometry of the universal cover of a cusp-decomposable manifold and of quasi-isometries between two such universal covers. This description will provide us the tools to prove quasi-isometr…

2017-04-21abs ↗pdf ↗

This study reveals statistical patterns in ERC20 token transactions on Ethereum blockchain.

problem Understanding transactional dynamics in decentralized systems.
method Examined over 44 million ERC20 token transfers, categorized by address type (EOA or SC), and analyzed using scaling laws.
result EOA-driven transactions exhibit consistent statistical behavior, while SC-driven activity displays sublinear scaling and bursty activity.

The paper explores simple and relatively simple transformation groups and their universal coverings.

problem Understanding the structure of universal coverings of transformation groups.
method Study of relatively simple groups and generalization of Tsuboi's metric space.
result Tsuboi's metric space of Ham~(M,ω)\widetilde{\mathrm{Ham}}(M, ω) is not quasi-isometric to the half line.

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.

Study on scalar curvature bounds and manifold topological complexity.

problem Understanding the topological complexity of manifolds with scalar curvature constraints.
method Introduced a small scale index theorem to establish bounds for Gromov's simplicial norm.
result Upper bound for Gromov's simplicial norm established in terms of scalar curvature, volume, and injectivity radius.

Transfer learning improves chaotic dynamics predictions with less data.

problem Efficiently predicting chaotic dynamics with limited data.
method Transfer learning for nonlinear dynamics, optimizing transfer rate and leveraging small-scale turbulence universality.
result Significantly more accurate inference of chaotic dynamics achieved.

Study free energy in spherical spin glasses, proving universality dichotomy.

problem Analyzing free energy in spherical spin glass models with different tail exponents.
method Introduced a tail-adapted normalization and used universality dichotomy.
result Sharp universality dichotomy for free energy across different tail exponents.

The paper shows instability in Minkowski spacetime for a quantum system.

problem Linear instability of the semiclassical Einstein-Klein-Gordon system in Minkowski spacetime.
method Formulated a forcing problem for metric and state perturbations, used tensor decomposition and quantum Møller operator.
result Metric perturbations grow exponentially, bounded by a universal scale H, indicating quantum backreaction.

Algorithm tackles large-scale portfolio optimization with higher moments, improving computational efficiency.

problem Optimizing portfolios with higher moments (variance, skewness, kurtosis) for large asset universes is computationally infeasible.
method Developed a structure-exploiting algorithm based on Yau's affine-normal descent, working directly with return matrix.
result Algorithm avoids explicit higher-order tensors and exploits quartic structure for efficient computation.

Develops hierarchical reinforcement learning value function approximators.

problem Estimating long-term returns in reinforcement learning with multiple goals.
method Introduces hierarchical universal value function approximators (H-UVFAs) using the options framework.
result Demonstrates generalization and improved performance of H-UVFAs over UVFAs.

ELF simplifies normalizing flows, making them more efficient and universal.

problem Computational inefficiency of normalizing flows.
method ELF introduces a simple, one-layer network with closed-form Lipschitz constants, combining the ease of residual flows with the performance of autoregressive flows.
result ELF is a provably universal density approximator, more efficient computationally and parameter-wise.

For each nn, we construct a separable metric space Un\mathbb{U}_n that is universal in the coarse category of separable metric spaces with asymptotic dimension (asdim\mathop{asdim}) at most nn and universal in the uniform category of separable metric spaces with uniform dimension (udim\mathop{udim}) at most nn. Thus, $\m…

2017-08-11abs ↗pdf ↗

New findings show neural network training loss follows a power law over time.

problem Understanding the optimization process of neural networks during training.
method Spectral analysis of the integral operator representing the linearized evolution of a large network.
result The loss function in neural network training follows a power law behavior, L(t)tξL(t) \sim t^{-ξ}, with exponent ξξ determined by network parameters and data characteristics.

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 ↗

A neural network model predicts the critical point of the Ising phase transition.

problem Predicting the critical point of the Ising phase transition using supervised learning.
method Proposed a minimal one-free-parameter neural network model to describe the supervised learning problem for the Ising model.
result Just one free parameter is enough to describe the universal finite-size-scaling function in the network output.

The scaling properties of the time series of asset prices and trading volumes of stock markets are analysed. It is shown that similarly to the asset prices, the trading volume data obey multi-scaling length-distribution of low-variability periods. In the case of asset prices, such scaling behaviour can be used for risk…

2005-01-13abs ↗pdf ↗

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 ↗

The growth of business firms is an example of a system of complex interacting units that resembles complex interacting systems in nature such as earthquakes. Remarkably, work in econophysics has provided evidence that the statistical properties of the growth of business firms follow the same sorts of power laws that ch…

2017-12-06abs ↗pdf ↗

Researchers use quantum chaos and RMT to analyze turbulence, revealing unique scaling laws.

problem Understanding the statistical structure and scaling laws of turbulence.
method Applied tools from quantum chaos and Random Matrix Theory to analyze turbulence datasets.
result Turbulence Gram matrices exhibit power-law scalings distinct from classical chaos and random data.

Generalized algorithm for translation and scale-invariant prediction.

problem Sequential prediction with expert advice, focusing on translation and scale invariance.
method Designing a generalized online algorithm using the universal prediction perspective to compete against a generic class of expert selection strategies.
result No preliminary knowledge of loss sequences is required; performance bounds are stable under arbitrary scalings and translations.

We analyze the sequence of time intervals between consecutive stock trades of thirty companies representing eight sectors of the U. S. economy over a period of four years. For all companies we find that: (i) the probability density function of intertrade times may be fit by a Weibull distribution; (ii) when appropriate…

2004-03-27abs ↗pdf ↗

Unified framework for comparing classification metrics across different imbalance rates.

problem Differences in scale and sensitivity to class imbalance rates in classification metrics.
method Introduces outperformance standardization (OPS) function to map metrics to a common scale.
result Unified o-value metric provides clear comparison across different imbalance rates.

In the study manifolds of Ricci curvature bounded below, a stumbling obstruction is the lack of links between large-scale geometry and small-scale geometry at a fixed reference point. There have been few links (volume, dimension) when the unit ball at the point is not collapsed, that is, vol(B1(p))v>0\mathrm{vol}(B_1(p))\ge v>0. …

2018-08-07abs ↗pdf ↗

LIM enhances investment performance and efficiency at scale.

problem Diminishing returns and rising labor/time costs in traditional quantitative investment research.
method End-to-end learning and universal modeling to create a global patterns foundation model.
result Optimized performance for specific tasks through transfer learning of global patterns.

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.