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

Trend · papers per month

4589134178 · May 202619922001200920182026
48 results for exponentially decaying thresholding

A new method for estimating sparse inverse covariance matrices.

problem Recovering the connectivity and non-connectivity graph of covariates.
method Adaptive thresholding in a transformed domain of the inverse covariance matrix.
result The proposed method outperforms state-of-the-art methods in accuracy.

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.

A random walk wnw_n on a separable, geodesic hyperbolic metric space XX converges to the boundary X\partial X with probability one when the step distribution supports two independent loxodromics. In particular, the random walk makes positive linear progress. Progress is known to be linear with exponential decay when …

2017-10-14abs ↗pdf ↗

Paper shows existence of vortex solutions with specific decay properties.

problem Existence of solutions to Seiberg-Witten equations with specific decay properties.
method Dimensional reduction of Seiberg-Witten equations on the plane.
result Contains both exponentially decayed and polynomial growth solutions.

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.

We show that the probability that a finitely supported random walk on a non-elementary subgroup of the the mapping class group gives a non-pseudo-Anosov element decays exponentially in the length of the random walk. More generally, we show that if R is a set of mapping class group elements with an upper bound on their …

2011-04-29abs ↗pdf ↗

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.

AdamNX improves Adam's stability by adjusting its learning rate.

problem Adam's tendency to converge to non-flat minima in large-scale models.
method Proposes a novel exponential decay mechanism for Adam's second-order moment estimate.
result AdamNX outperforms Adam and its variants in stability and performance.

Unified framework for analyzing gradient flows of measures with exponential decay of entropy.

problem Analyzing exponential decay of entropy functionals in gradient flows of measures.
method Characterization of global exponential decay behaviors using Hellinger-Kantorovich geometry, shape-mass decomposition, and Polyak-Łojasiewicz-type inequalities.
result Unified theoretical framework for gradient flows with complete analysis of exponential decay behaviors.

The paper examines the optimality of kernel methods in high-dimensional clustering.

problem Understanding the optimality of kernel methods in high-dimensional data clustering.
method High-dimensional Gaussian clustering, exponential kernel function, kernel k-means, semi-definite relaxation.
result The exponential kernel function optimally recovers clusters in high-dimensional data, matching information-theoretic limits up to a factor of √2.

New exponential decay estimate for Hermitian Yang-Mills metrics near branch points.

problem Understanding the behavior of Hermitian Yang-Mills metrics near branch points.
method Local radial solutions, global gluing construction, exponential estimate near branch points.
result Exponential decay estimate for local radial solutions near branch points.

We consider Hitchin's hyperkähler metric gL2g_{L^2} on the SU(n)SU(n)-Hitchin moduli space moduli space over a compact Riemann surface. We prove that the difference between the metric gL2g_{L^2} and a simpler "semiflat" hyperkähler metric gsfg_{\mathrm{sf}} is exponentially-decaying along generic rays in the Hitchin moduli s…

2018-10-03abs ↗pdf ↗

Approximations to utility indifference prices are provided for a contingent claim in the large position size limit. Results are valid for general utility functions on the real line and semi-martingale models. It is shown that as the position size approaches infinity, the utility function's decay rate for large negative…

2012-02-17abs ↗pdf ↗

Study on U-statistics with heavy-tailed samples, providing tail bounds and LDP.

problem Deviation of U-statistics with heavy-tailed samples.
method Exponential tail bounds and Large Deviation Principle (LDP) for U-statistics.
result Obtained an exponential upper bound for U-statistics tail decay, showing two regions of decay.

Global stability proved for Navier-Stokes equations on hyperbolic space.

problem Stability of the Navier-Stokes equations on hyperbolic space.
method Proved global stability with exponential decay rate for small initial data.
result Exponential decay rate of $μλ_\Def^{(3)}$ for Navier-Stokes equations on hyperbolic space.

New research shows fixed-budget best-arm identification cannot match static oracle performance.

problem Fixed-budget best-arm identification's performance limitations.
method Analysis of various adaptive and static algorithms for best-arm identification.
result For any algorithm, there exists at least one instance where the error decay rate is at most \((1 + \frac{\log(K)}{8})^{-1}\) times that of the static oracle.

The paper studies Teichmüller TQFT for hyperbolic knots, proving exponential decay of partition functions.

problem Analyzing Teichmüller TQFT for hyperbolic knots with generalized FAMED triangulations.
method Introducing generalized FAMED property, proving exponential decay of partition functions in semi-classical limit.
result Partition functions decay exponentially with the volume of knot complements, and the 1-loop invariant emerges.

We compare systematically several classes of stochastic volatility models of stock market fluctuations. We show that the long-time return distribution is either Gaussian or develops a power-law tail, while the short-time return distribution has generically a stretched-exponential form, but can assume also an algebraic …

2010-09-14abs ↗pdf ↗

New bounds for KRR condition number reveal overfitting phenomena.

problem Characterizing overfitting in KRR with varying kernel spectral decay.
method Derived new bounds for kernel matrices, enhanced test error bounds, and identified feature independence role.
result Identified tempered and catastrophic overfitting phenomena.

We found that factors decay over time, with momentum fitting best.

problem Understanding how factors decay over time and their impact on performance.
method Derived a hyperbolic decay model for factors, tested against linear and exponential alternatives.
result Momentum exhibits hyperbolic decay, outperforming linear and exponential models.

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%.

The study analyzes when Bayesian averaging over decision trees is reliable.

problem When do Bayesian model averaging weights over decision trees provide reliable information?
method Closed-form solution for Bayesian decision trees with Catalan-exponential priors.
result Established a complete non-asymptotic theory of rational commitment thresholds.

We study the geodesic X-ray transform on Cartan-Hadamard manifolds, and prove solenoidal injectivity of this transform acting on functions and tensor fields of any order. The functions are assumed to be exponentially decaying if the sectional curvature is bounded, and polynomially decaying if the sectional curvature de…

2017-05-29abs ↗pdf ↗

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.

Sharp large deviations and Gibbs conditioning for portfolio credit risk models.

problem Analyzing the risk of default in financial portfolios with dependent factors.
method Sharp large deviation estimates and conditional Bahadur-Rao estimates for threshold models with diverging latent factors.
result Conditioned on a large exceedance event, default indicators become asymptotically i.i.d., and loss-given-default is exponentially tilted.

Study on biharmonic heat equation on manifolds with curvature constraints.

problem Analyzing entire solutions of biharmonic heat equation on manifolds.
method Exponential decay estimates for biharmonic heat kernel under Ricci curvature and noncollapsing conditions. Proving uniqueness criteria for Cauchy problem.
result Conservation law for biharmonic heat kernel and uniform L-infinity estimate for entire solutions.

We improve deep threshold networks' memorization capacity exponentially.

problem Memorizing datasets with randomized labels using deep neural networks.
method Using Gaussian random weights in the first layer and binary or integer weights in subsequent layers, we prove a new dependence on minimum distance.
result We show that O~(1δ+n)\widetilde{\mathcal{O}}(\frac{1}{\delta} + \sqrt{n}) neurons and O~(dδ+n)\widetilde{\mathcal{O}}(\frac{d}{\delta} + n) weights are sufficient.

Analyzes dynamics of quantum neural networks, predicting exponential decay of training error.

problem Understanding convergence rate of quantum neural networks training.
method Analytic theory for gradient descent dynamics of wide quantum neural networks.
result Simple analytic formula predicts exponential decay of training error.

We consider a random walk on the mapping class group of a surface of finite type. We assume that the random walk is determined by a probability measure whose support is finite and generates a non-elementary subgroup HH. We further assume that HH is not consisting only of lifts with respect to any one covering. Then w…

2014-08-02abs ↗pdf ↗

VISTA learns causal structures by integrating local subgraphs, improving accuracy and efficiency.

problem Efficiently learning causal structures from high-dimensional observational data.
method VISTA decomposes the global causal structure learning problem into local subgraphs based on Markov Blankets, integrating them via a weighted voting mechanism.
result VISTA achieves notable improvements in accuracy and efficiency over existing methods.

The paper establishes a nearly-sharp statistical threshold for efficient learning in Latent MDPs with separated components.

problem Learning Latent Markov Decision Processes (LMDPs) with separated components.
method The paper considers various notions of separation and establishes a nearly-sharp statistical threshold for efficient learning. It also presents a quasi-polynomial algorithm with time complexity scaling in terms of the statistical threshold under a weaker assumption of separability under the optimal policy, and a near-matching time complexity lower bound under the exponential time hypothesis.
result Establishes a nearly-sharp statistical threshold for efficient learning in Latent MDPs with separated components.

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.

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.