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.

169,181 papers · 148 categories

Trend · papers per month

2.4%4.8%7.1%9.5% · May 199719922001200920182026
48 results for slow decay

The study examines 3-manifolds with slow scalar curvature decay and finds Whitehead manifold properties.

problem Investigating open simply-connected 3-manifolds with slow decay of positive scalar curvature.
method Analyzing topological properties and using Whitehead manifold results.
result Open simply-connected 3-manifolds with the specified properties are homeomorphic to S2imesR\mathbb{S}^{2} imes \mathbb{R}.

Weight decay stabilizes training dynamics by slowing progressive sharpening.

problem Understanding how weight decay affects training stability in deep learning models.
method Analyzing weight decay effects at the Edge of Stability, developing a mathematical framework.
result Weight decay dampens oscillations and stabilizes sharpness in CNNs, causing a phase transition in MLPs.

Study shows slow decay of impact in equity markets after metaorders.

problem Understanding the decay of impact in equity markets after metaorders.
method Empirical study using a large dataset of metaorders executed by institutional investors.
result Impact decay follows a power-law function at short time scales and converges to a non-zero asymptotic value at long time scales.

We study asymptotic behavior of positive smooth solutions of the conformal scalar curvature equation in Rn{\bf R}^n. We consider the case when the scalar curvature of the conformal metric is bounded between two positive numbers outside a compact set. It is shown that the solution has slow decay if the radial change is …

1999-03-21abs ↗pdf ↗

A self-organized model with social percolation process is proposed to describe the propagations of information for different trading ways across a social system and the automatic formation of various groups within market traders. Based on the market structure of this model, some stylized observations of real market can…

2000-04-18abs ↗pdf ↗

SignSGD outperforms SGD in linear regression with optimal scaling laws under PLRF model.

problem Improving linear regression performance with signSGD under power-law random features.
method Analysis of signSGD risk under PLRF model, comparison with SGD, identification of unique effects.
result SignSGD can have a steeper compute-optimal slope than SGD in noisy regimes, especially with WSD schedule.

We construct unbounded positive C2C^2-solutions of the equation Δu+Ku(n+2)/(n2)=0Δu + K u^{(n + 2)/(n - 2)} = 0 in Rn{\R}^n (equipped with Euclidean metric gog_o) such that KK is bounded between two positive numbers in Rn{\R}^n, the conformal metric g=u4/(n2)gog = u^{4/(n - 2)} g_o is complete, and the volume growth of gg can be arbitrarily…

2000-02-01abs ↗pdf ↗

Using a proprietary dataset of meta-orders and prediction signals, and assuming a quasi-linear impact model, we deconvolve market impact from past correlated trades and a predictable return component to elicit the temporal dependence of the market impact of a single daily meta-order, over a ten day horizon in various e…

2014-07-12abs ↗pdf ↗

We consider the action of a pseudo-Anosov mapping class on PML(S)\mathcal{PML}(S). This action has north-south dynamics and so, under iteration, laminations converge exponentially to the stable lamination. We study the rate of this convergence and give examples of families of pseudo-Anosov mapping classes where the rate go…

2015-12-02abs ↗pdf ↗

The study uses the Merton model to estimate PD and finds a phase transition affecting convergence speed.

problem Estimating the probability of default (PD) using limited historical data.
method Adopted the Merton model and analyzed phase transitions in default correlation.
result PD estimation converges slowly when temporal correlation decays by power law less than one.

Optimizes convex functions in finite vs infinite dimensions, revealing slow convergence rates.

problem Analyzing gradient flows in finite and infinite-dimensional Hilbert spaces.
method Proves convergence rates and optimality conditions for gradient flows and related methods.
result Gradient flow convergence rates in finite dimensions are slower than in infinite dimensions, with optimal rates achievable in Hilbert spaces.

Stock markets can be characterized by fat tails in the volatility distribution, clustering of volatilities and slow decay of their time correlations. For an explanation models with several mechanisms and consequently many parameters as the Lux-Marchesi model have been used. We show that a simple herding model with only…

2002-07-11abs ↗pdf ↗

In this article we study the dependence degree of the traded volume of the Dow Jones 30 constituent equities by using a nonextensive generalised form of the Kullback-Leibler information measure. Our results show a slow decay of the dependence degree as a function of the lag. This feature is compatible with the existenc…

2005-10-12abs ↗pdf ↗

We propose a simple stochastic volatility model which is analytically tractable, very easy to simulate and which captures some relevant stylized facts of financial assets, including scaling properties. In particular, the model displays a crossover in the log-return distribution from power-law tails (small time) to a Ga…

2010-06-01abs ↗pdf ↗

The L1 loss landscape of neural nets near local minima behaves differently, revealing exponential decay and increased vertex density.

problem Understanding the L1 loss landscape of neural nets near local minima.
method Iterative minimization of the loss function on adjacent vertices of the Deep ReLU Simplex algorithm.
result Exponential decay of loss levels and increased vertex density around local minima.

Study of waves on Reissner-Nordström-AdS black holes, proving uniform boundedness and continuity.

problem Analyzing waves on black holes in AdS spacetimes, focusing on uniform boundedness and continuity.
method Initial data on a spacelike hypersurface, Dirichlet boundary conditions at infinity, proving uniform boundedness and continuity.
result Uniform boundedness and continuity of waves at the Cauchy horizon on Reissner-Nordström-AdS black holes.

In this paper, we use a database of around 400,000 metaorders issued by investors and electronically traded on European markets in 2010 in order to study market impact at different scales. At the intraday scale we confirm a square root temporary impact in the daily participation, and we shed light on a duration factor …

2014-11-30abs ↗pdf ↗

An analysis of the stylized facts in financial time series is carried out. We find that, instead of the heavy tails in asset return distributions, the slow decay behaviour in autocorrelation functions of absolute returns is actually directly related to the degree of clustering of large fluctuations within the financial…

2010-02-01abs ↗pdf ↗

The statistical properties of the increments x(t+T) - x(t) of a financial time series depend on the time resolution T on which the increments are considered. A non-parametric approach is used to study the scale dependence of the empirical distribution of the price increments x(t+T) - x(t) of S&P Index futures, for time…

1997-05-08abs ↗pdf ↗

New theory sharpens Q-learning with LDTZ rate, proving it's best of both worlds.

problem Improving Q-learning's theoretical and practical performance.
method Developed a sharp non-asymptotic error bound and central limit theory for Q-learning with PD2Z-ν schedule.
result Q-learning with LDTZ schedule achieves rapid decay and asymptotic convergence guarantees.

For an integer n3n \ge 3 and any positive number εε we establish the existence of smooth functions K on Rn{0}R^n \setminus \{0 \} with K1ε|K - 1| \le ε, such that the equation Δu+n(n2)Kun+2n2=0Δu + n (n - 2) K u^{{n + 2}\over {n - 2}} = 0 in Rn{0}R^n \setminus \{0 \} has a smooth positive solution which blows up at the origin (i.e., u does…

2002-02-23abs ↗pdf ↗

Study shows how anisotropic data affects learning dynamics in phase retrieval.

problem Understanding learning dynamics in phase retrieval with anisotropic Gaussian inputs.
method Developed a tractable reduction to reveal a three-phase trajectory and derived scaling laws.
result Found that anisotropy leads to a three-phase trajectory: fast escape, slow convergence, and spectral-tail learning.

Spectral feature learning improves IV regression for causal effect estimation.

problem Estimating causal effects in the presence of hidden confounders.
method Two-stage least squares estimator based on spectral features.
result Performance of the method depends on strong spectral alignment and slow eigenvalue decay.

This work studies learning curves for revenue maximization algorithms.

problem Understanding the performance of revenue-maximizing algorithms as they learn from more data.
method Initiates the study of learning curves for revenue maximization, providing a near-complete characterization of their rate of decay.
result Learning curves for revenue maximization can decay arbitrarily slowly or almost exponentially fast, depending on the distribution and optimal revenue.

A phase transition affects loss landscape and generalization in neural networks.

problem Understanding the transition between under- and over-parametrization in neural networks.
method Analytical and empirical study of fully-connected networks with hinge loss.
result The generalization error shows three phases: initial decay, increase until a cusp, and slow decay.

This article derives prognostic expressions for the evolution of globally aggregated economic wealth, productivity, inflation, technological change, innovation and growth. The approach is to treat civilization as an open, non-equilibrium thermodynamic system that dissipates energy and diffuses matter in order to sustai…

2013-06-15abs ↗pdf ↗

Adafactor optimizes neural networks with less memory and similar performance.

problem Memory constraints in adaptive optimization methods.
method Adafactor uses row and column sums of moving averages to estimate per-parameter second moments, reducing memory usage.
result Adafactor achieves similar performance to Adam with minimal auxiliary storage.

We discuss the distribution of commuting distances and its relation to income. Using data from Denmark, the UK, and the US, we show that the commuting distance is (i) broadly distributed with a slow decaying tail that can be fitted by a power law with exponent γ3γ\approx 3 and (ii) an average growing slowly as a power …

2016-02-04abs ↗pdf ↗

We prove a global smooth isometric immersion for negatively curved surfaces with finite total curvature.

problem Finding a sufficient condition for a complete negatively curved surface to be isometrically embedded in R^3.
method Developed new techniques to overcome slow decay and oscillations of Gauss curvature, reformulating the Gauss-Codazzi equations as a symmetric hyperbolic system.
result Proved the global existence of a smooth solution to the Gauss-Codazzi system, achieving a global smooth isometric immersion of the surface into R^3.

SKI speeds up Toeplitz Neural Networks by avoiding explicit decay bias and using frequency response.

problem Efficiently compute and update Toeplitz matrices in neural networks.
method Sparse plus low-rank decomposition, asymmetric SKI, frequency response modeling.
result Achieved significant speedup with minimal performance loss.

The concepts of scale invariance, self-similarity and scaling have been fruitfully applied to the study of price fluctuations in financial markets. After a brief review of the properties of stable Levy distributions and their applications to market data we indicate the shortcomings of such models and describe the trunc…

1997-05-09abs ↗pdf ↗

Paper analyzes convergence of FedAvg on non-iid data and provides theoretical guarantees.

problem Analyzing convergence of Federated Averaging on non-iid data.
method Theoretical analysis of convergence rate and trade-offs between communication-efficiency and convergence rate.
result Established a convergence rate of O(1T)\mathcal{O}(\frac{1}{T}) for strongly convex and smooth problems.

Bounds on chemical reaction network relaxation rates using convex analysis.

problem Understanding relaxation dynamics in chemical reaction networks.
method Convex analysis, generalized gradient flows, singular values of stoichiometric matrix.
result Bounds on Kullback-Leibler divergence to equilibrium for CRNs.

Machine learning speeds up FLIM analysis in biomedical research.

problem Complex, slow, and computationally expensive FLIM analysis.
method Machine learning techniques for faster and smarter FLIM data extraction and interpretation.
result Higher accuracy in classifying and segmenting FLIM images compared to conventional methods.

PCA-Net combines PCA and neural networks for operator approximation, with new bounds on complexity.

problem Developing approximation theory for PCA-Net architecture.
method Combines PCA and neural networks, derives universal approximation results and lower bounds on complexity.
result PCA-Net can overcome the curse of parametric complexity for specific operators.