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

Trend · papers per month

295887116 · May 202619922001200920172026
48 results for decay thresholds

New method trains neural networks with threshold activation functions efficiently.

problem Training neural networks with threshold activation functions is challenging due to zero gradients.
method We study weight decay regularized training problems of deep neural networks with threshold activations, showing they can be formulated as convex optimization problems.
result Regularized deep threshold network training problems can be formulated as standard convex optimization problems, paralleling the LASSO method.

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.

SAD-DPSGD improves model performance on imbalanced medical datasets like HAM10000.

problem Data leakage and imbalanced distribution in medical image classification datasets.
method SAD-DPSGD uses a linear decaying mechanism for noise and clipping thresholds to enhance performance.
result SAD-DPSGD outperforms Auto-DPSGD on HAM10000, improving accuracy by 2.15%.

Simplicial persistence measures financial market dynamics, revealing long-term structure evolution.

problem Understanding the long-term structure evolution of financial markets.
method Simplicial persistence, null models, TMFG filtering, thresholding, generative process analysis.
result More liquid markets exhibit slower persistence decay, suggesting higher fragility to systemic shocks.

Study on critical faces convergence in a Poisson point process.

problem Convergence of point processes associated with critical faces in a Čech filtration.
method Established convergence in M0\mathcal M_0-topology for critical faces above vanishing threshold.
result Obtained limit theorems for positive and negative critical faces.

A class of heterogeneous agent models is investigated where investors switch trading position whenever their motivation to do so exceeds some critical threshold. These motivations can be psychological in nature or reflect behaviour suggested by the efficient market hypothesis (EMH). By introducing different propensitie…

2006-07-31abs ↗pdf ↗

This paper describes the black hole threshold in a moduli space of spherically symmetric spacetimes.

problem Understanding the black hole threshold in a moduli space of spherically symmetric spacetimes.
method Complete description and analysis of the black hole threshold in the moduli space M\mathfrak M.
result The black hole threshold is the extremal leaf of a C1C^1 foliation of the moduli space, separating black hole solutions from non-collapsing solutions.

Study reveals phase transition in neural networks near interpolation.

problem Understanding generalization and learning transitions in neural networks.
method Effective theory for approximating Bayes-optimal generalisation error.
result Unveils a discontinuous phase transition between universal and specialisation phases.

In this paper, we describe a newly discovered statistical property of time series data for daily price changes. We conducted quantitative investigation of the {\it calm-time intervals} of price changes for 800 companies listed in the Tokyo Stock Exchange, and for the Nikkei 225 index over a 27-year period from January …

2003-12-21abs ↗pdf ↗

AI-driven investment strategies self-defeat at scale due to signal crowding and erosion.

problem Excess returns from AI-driven investment strategies diminish at scale due to signal crowding and erosion.
method Theoretical model and empirical validation using SEC Form 13F filings and hedge fund return dynamics.
result The alpha half-life of signals decreases significantly with AI adoption, leading to diminishing returns.

WBCP improves conformal prediction for distribution shifts using weighted Dirichlet posteriors.

problem Handling distribution shifts in conformal prediction.
method Generalizes Bayesian Quadrature Conformal Prediction (BQ-CP) to arbitrary importance-weighted settings.
result WBCP maintains coverage guarantees while providing richer uncertainty information.

Hybrid regularization avoids double descent in random feature models.

problem Avoiding the double descent phenomenon in random feature models.
method Combines early stopping and weight decay, using GCV for hyperparameter selection.
result Hybrid method successfully avoids double descent and achieves comparable generalization.

New method proves non-contrastive self-supervised learning learns useful features.

problem Understanding how non-contrastive self-supervised learning (NS-SL) learns useful features.
method Proved in a linear network, NS-SL learns a desirable projection matrix and reduces sample complexity. Suggested weight decay acts as an implicit threshold.
result DirectCopy, a simpler and more efficient algorithm, outperforms DirectPred on various datasets.

Decision trees and shallow neural networks have different geometric complexities, impacting their interpretability and accuracy.

problem The geometric simplicity of decision boundaries in decision trees conflicts with the approximation capabilities of shallow neural networks.
method Analysis of the Radon total variation (RTV) seminorm to compare geometric complexity of decision regions and neural network approximations.
result Smooth barrier scores can approximate decision regions with finite RTV, but their performance depends on the tube-mass condition near the decision boundary.

Continuous phase transitions identified in Doi-Onsager, noisy transformer, and Hegselmann-Krause models.

problem Phase transitions in multimodal models and their properties.
method Sharp coercivity estimate and constrained Lebedev--Milin inequality.
result Continuous phase transitions at critical coupling strengths for Doi-Onsager, noisy transformer, and Hegselmann-Krause models.

We study approximations of the partition function of dense graphical models. Partition functions of graphical models play a fundamental role is statistical physics, in statistics and in machine learning. Two of the main methods for approximating the partition function are Markov Chain Monte Carlo and Variational Method…

2017-11-05abs ↗pdf ↗

Look-Ahead-Bench evaluates financial LLMs for lookahead bias, revealing significant differences in model performance.

problem Measuring and mitigating lookahead bias in financial LLMs.
method Standardized benchmark evaluating model behavior in practical financial scenarios, analyzing performance decay across market regimes.
result Standard LLMs exhibit significant lookahead bias, while Pitinf models show improved generalization and reasoning abilities.

Deep networks generalize well even when they fit training data perfectly, thanks to overparametrization.

problem Understanding generalization in overparametrized deep networks.
method Random features regression, asymptotic analysis, ensemble averaging.
result Bias remains constant beyond the interpolation threshold, while variance components decay with overparametrization.

The paper models market dynamics using a limit order book system to explain slippage and inefficiency.

problem Inefficiency in matching markets due to structural liquidity constraints and slippage.
method Introduces a market microstructure framework with a latent preference state matrix and a dynamic discrete choice execution model.
result Persistent slippage and regional invariance of preference orderings are explained by liquidity thresholds.

A hierarchical model shows how scaling laws emerge from sequential feature recovery.

problem Emergence of scaling laws from feature learning in multi-layer networks.
method Layer-wise spectral algorithm adapted to compositional structure, sequential feature detection.
result Sequential detection of latent features, leading to explicit power-law decay of prediction error.

In this paper we investigate the computational complexity of learning the graph structure underlying a discrete undirected graphical model from i.i.d. samples. We first observe that the notoriously difficult problem of learning parities with noise can be captured as a special case of learning graphical models. This lea…

2014-12-03abs ↗pdf ↗

Unique solutions found for wave-like decaying null infinity equations.

problem Wave-like decaying null infinity equations with spherically symmetric Einstein-scalar-field.
method Local and global unique solutions for small initial data.
result Sharp decaying condition for unique solutions.

The paper examines how heavy-tailed risks behave under Gaussian copula models.

problem Understanding tail risk probabilities with heavy-tailed marginal risks and Gaussian dependence.
method Modeling heavy-tailed risks using regular variation and analyzing tail probabilities under Gaussian copula.
result The rate of decay of tail set probabilities varies with the type of tail sets and Gaussian correlation matrix.

We study quantitatively the level of false multifractal signal one may encounter while analyzing multifractal phenomena in time series within multifractal detrended fluctuation analysis (MF-DFA). The investigated effect appears as a result of finite length of used data series and is additionally amplified by the long-t…

2013-07-08abs ↗pdf ↗

New method identifies network structure without regularization for sparse teacher couplings.

problem Identifying network structure in inverse Ising problems with model mismatch.
method Ridge linear regression with two-stage estimator.
result Perfect identification of network structure possible without regularization for sparse teacher couplings.

Study on scalar curvature decay on non-compact manifolds linked at infinity.

problem Understanding scalar curvature decay on non-compact manifolds with topological linking at infinity.
method Analyzing polynomial decay, developing obstruction theory, using μμ--bubble exhaustions, and index theory.
result Topological linking at infinity forces polynomial decay of scalar curvature on manifolds of weakly bounded geometry.

Study on massless Vlasov equation on Reissner-Nordström spacetimes, showing decay rates and non-decay phenomena.

problem Analyzing decay and non-decay rates of solutions to the massless Vlasov equation on Reissner-Nordström spacetimes.
method Quantitative analysis of geodesic flow and comparison to wave equation instability results.
result Exponential decay rates in subextremal cases and polynomial rates in extremal cases, with non-decay of transversal derivatives in extremal cases.

The study shows that the visible range from a point on harmonic manifolds follows an exponential distribution.

problem Understanding the visible range from a point on harmonic manifolds.
method Analyzing Poisson Boolean models on harmonic manifolds, focusing on the geometric mechanism of tube volumes around geodesic segments.
result The visible range from a point on harmonic manifolds follows an exponential distribution.