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

5.9%11.7%17.6%23.4% · Jun 202519922001200920172026
48 results for finite-size effects

Study reveals finite-size effects and sensitivity to random numbers in Levy-Levy-Solomon model.

problem Finite-size effects and sensitivity to random numbers in Levy-Levy-Solomon model.
method Simulations and analysis of Levy-Levy-Solomon model with different random number generators and stopping criteria.
result Low-quality pseudo random number generators significantly impact simulation results.

We consider the roughness properties of NYSE (New York Stock Exchange) stock-price fluctuations. The statistical properties of the data are relatively homogeneous within the same day but the large jumps between different days prevent the extension of the analysis to large times. This leads to intrinsic finite size effe…

2006-02-08abs ↗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.

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.

We introduce a probabilistic framework that represents stylized banking networks with the aim of predicting the size of contagion events. Most previous work on random financial networks assumes independent connections between banks, whereas our framework explicitly allows for (dis)assortative edge probabilities (e.g., …

2016-10-13abs ↗pdf ↗

A bridge between continuous signals and discrete Ising spins for associative memory.

problem Associative memory in continuous-signal-driven Ising spin systems.
method Multilayer Ising framework with PCA whitening and SimHash projection, coupled to pseudo-inverse memory couplings.
result Finite-size scaling of operational storage capacity with αc(N)=αc()cN1/2α_c(N)=α_c(\infty)-c\,N^{-1/2}, approaching αc()0.50α_c(\infty)\approx 0.50.

Study of 3d-3d correspondence involving qq-Weyl algebra and 3d-index.

problem Understanding the action of a qq-Weyl algebra on the 3d-index of knots.
method Investigation of the qq-Weyl algebra's module action on the 3d-index, conjecturing structural properties.
result Bilinear factorization, pair of linear qq-difference equations, and rational function matrix for the 3d-index determination.

A probabilistic framework is introduced that represents stylized banking networks and aims to predict the size of contagion events. In contrast to previous work on random financial networks, which assumes independent connections between banks, the possibility of disassortative edge probabilities (an above average tende…

2011-10-19abs ↗pdf ↗

We analyse time series of CDS spreads for a set of major US and European institutions on a pe- riod overlapping the recent financial crisis. We extend the existing methodology of ε-drawdowns to the one of joint ε-drawups, in order to estimate the conditional probabilities of abrupt co-movements among spreads. We correc…

2012-05-04abs ↗pdf ↗

We address the question of market efficiency using the Minority Game (MG) model. First we show that removing unrealistic features of the MG leads to models which reproduce a scaling behavior close to what is observed in real markets. In particular we find that i) fat tails and clustered volatility arise at the phase tr…

2000-11-02abs ↗pdf ↗

We prove (without using Federer's structure theorem) that a finite-mass flat chain over any coefficient group is rectifiable if and only if almost all of its 0-dimensional slices are rectifiable. This implies that every flat chain of finite mass and finite size is rectifiable. It also leads to a simple necessary and su…

1999-07-01abs ↗pdf ↗

Unified thermodynamic approach to Transformer attention dynamics.

problem Understanding the statistical mechanics of Transformer attention.
method Constructing a Lagrangian on the information manifold to analyze attention dynamics.
result Establishes a formal correspondence between scaled dot-product attention and canonical ensemble statistics.

Estimates KRR risk from training data for various kernels and hyperparameters.

problem Predicting the generalization error of Kernel Ridge Regression.
method Introduces SCT and KARE to approximate KRR risk from training data.
result KARE provides an excellent approximation of KRR risk and helps select good kernels.

The study reveals a transition in neural network performance from infinite-width to variance-limited behavior as dataset size increases.

problem Understanding the transition from infinite-width to variance-limited behavior in neural networks.
method Empirical study of the transition from infinite-width to variance-limited behavior as a function of sample size and network width.
result The critical sample size \( P^* \) is approximately \( \sqrt{N} \) for polynomial regression with ReLU networks.

Learning three data points can generate all types of periodic orbits in a neural network.

problem Can learning three data points generate all types of periodic orbits in a neural network?
method Investigated a continuous one-dimensional map with period three in a random neural network in its thermodynamic limit.
result Almost all learned periods are unstable, and each network has its own characteristic attractors.

Topic models have achieved significant successes in analyzing large-scale text corpus. In practical applications, we are always confronted with the challenge of model selection, i.e., how to appropriately set the number of topics. Following recent advances in topic model inference via tensor decomposition, we make a fi…

2014-10-23abs ↗pdf ↗

We introduce uniform K-stability and its relationship with the coercivity property of the K-energy functional, for general polarized manifolds. Since the automorphism groups are not necessarily finite, size of the norm measuring uniformity should be reduced with respect to the group action. About this point we explain …

2016-10-25abs ↗pdf ↗

We study the cause of large fluctuations in prices in the London Stock Exchange. This is done at the microscopic level of individual events, where an event is the placement or cancellation of an order to buy or sell. We show that price fluctuations caused by individual market orders are essentially independent of the v…

2003-12-30abs ↗pdf ↗

Statistical neurodynamics studies macroscopic behaviors of randomly connected neural networks. We consider a deep layered feedforward network where input signals are processed layer by layer. The manifold of input signals is embedded in a higher dimensional manifold of the next layer as a curved submanifold, provided t…

2018-08-22abs ↗pdf ↗

We propose a general framework for solving statistical mechanics of systems with finite size. The approach extends the celebrated variational mean-field approaches using autoregressive neural networks, which support direct sampling and exact calculation of normalized probability of configurations. It computes variation…

2018-09-27abs ↗pdf ↗

Study provides selective inference method for latent block models.

problem Challenges in constructing a test on a block structure selected by clustering algorithms.
method Developed a selective inference method for latent block models using squared residue minimization and simulated annealing.
result Proposed tests effectively handle selective bias in block structures compared to naive tests.

New method uses quantum annealing and VAN for better statistical mechanics calculations.

problem Difficulty in computing partition function in statistical mechanics.
method Combines quantum annealing samples with variational autoregressive networks.
result Enhanced accuracy in finite-size Sherrington-Kirkpatrick model.

Study on function sensitivity in random DNNs using large deviation theory.

problem Understanding function sensitivity in finite-size deep neural networks.
method Large deviation theory and path integral analysis applied to random DNNs with ReLU and sign activations.
result Random DNNs with ReLU activations are more robust to parameter perturbations.

There has been a recent surge of interest in modeling neural networks (NNs) as Gaussian processes. In the limit of a NN of infinite width the NN becomes equivalent to a Gaussian process. Here we demonstrate that for an ensemble of large, finite, fully connected networks with a single hidden layer the distribution of ou…

2019-08-27abs ↗pdf ↗

Random matrix theory explains transient signal detectability in early-stopped gradient flow.

problem Transient signal detectability in early-stopped gradient flow.
method Random matrix theory applied to gradient flow in a linear teacher-student setting.
result Transient Baik-Ben Arous-Péché (BBP) transition in learning dynamics due to anisotropy and noise.

Imitative and contrarian behaviors are the two typical opposite attitudes of investors in stock markets. We introduce a simple model to investigate their interplay in a stock market where agents can take only two states, bullish or bearish. Each bullish (bearish) agent polls m "friends'' and changes her opinion to bear…

2001-09-21abs ↗pdf ↗

Theory proposes neural networks can be initialized for optimal information transmission.

problem Optimizing neural networks for optimal information transmission and representation.
method Developed a corrected mean-field framework to study neural networks as information channels, proving mutual information maximization at dynamic isometry.
result Mutual information maximization is realized between inputs and propagated signals when neural networks are initialized at dynamic isometry.

New method reduces over-parametrization in neural networks, ensuring sparsity and finite network size.

problem Over-parametrization leads to too many active neurons in neural networks, especially with large data.
method Investigates a nonconvex regularization method for shallow ReLU networks.
result Locally optimal networks are finite even with infinite data, maintaining approximation guarantees and network size bounds.

Optimizes sample reweighting to match laws under covariate shift using Wasserstein distance.

problem Matching laws of samples with different distributions under covariate shift.
method Minimizes Wasserstein distance between empirical measures of samples using Nearest Neighbors weights.
result Consistent reweighting leads to asymptotic convergence of empirical measures.

ResNets and DenseNets converge to NTK with depth and width, offering advantages for kernel regression.

problem Understanding convergence of ResNets and DenseNets to Neural Tangent Kernel (NTK).
method Analysis of finite width and depth corrections for NTK of ResNets and DenseNets.
result ResNets and DenseNets can converge to NTK with depth and width, unlike vanilla networks.

In this work we study the quantitative relation between the recursive teaching dimension (RTD) and the VC dimension (VCD) of concept classes of finite sizes. The RTD of a concept class C{0,1}n\mathcal C \subseteq \{0, 1\}^n, introduced by Zilles et al. (2011), is a combinatorial complexity measure characterized by the worst…

2017-02-18abs ↗pdf ↗

We study high-dimensional Gaussian mixture classification using statistical physics methods.

problem Classifying high-dimensional Gaussian mixture with general covariance matrices.
method Replica method from statistical physics for asymptotic analysis of convex classifiers.
result Construction and validation of a de-biased estimator for variable selection.

There has been a lot of recent interest in trying to characterize the error surface of deep models. This stems from a long standing question. Given that deep networks are highly nonlinear systems optimized by local gradient methods, why do they not seem to be affected by bad local minima? It is widely believed that tra…

2016-11-19abs ↗pdf ↗