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

83166248331 · May 202619922001200920172026
48 results for small-σ regime

SRRM improves recursive transport surrogates in the small-discrepancy regime.

problem Insufficient understanding of recursive partitioning methods' statistical behavior and resolution in the small-discrepancy regime.
method Introduced Selective Recursive Rank Matching (SRRM) to improve the resolution of Recursive Rank Matching (RRM).
result SRRM yields a higher-fidelity practical surrogate for the Wasserstein distance at moderate additional computational cost.

New dynamics for SGD in small learning rate regime.

problem Improving stochastic gradient descent in small learning rate regime.
method Introducing stochastic modified flows and distribution dependent stochastic modified flows.
result Captures fluctuating dynamics of SGD in small learning rate - infinite width scaling regime.

A new approach is presented to describe the change in the statistics of the log return distribution of financial data as a function of the timescale. To this purpose a measure is introduced, which quantifies the distance of a considered distribution to a reference distribution. The existence of a small timescale regime…

2005-09-30abs ↗pdf ↗

New examples of deformed Hermitian-Yang-Mills connections found.

problem Constructing deformed Hermitian-Yang-Mills connections on manifolds.
method Constructed first higher rank, irreducible deformed Hermitian-Yang-Mills connections in both small and large radius regimes.
result Existence of solutions with any possible angle and ruling out some stability conditions.

Sharp stability of Alexandrov's theorem for C1C^1 domains in the small-excess regime

problem Stability of Alexandrov's theorem for C1C^1 domains in the small-excess regime
method Combines a BVBV version of Fuglede's spectral-gap argument, a star-shaped rearrangement for sets of finite perimeter, quantitative estimates for the part of the boundary contained in the tentacles, and a polyhedral approximation argument for the non-graphical region
result Sharp stability estimate in a genuinely non-parametric regime

New method detects and clusters market regimes in multidimensional data.

problem Detecting and clustering market regimes in complex data structures.
method Non-parametric online market regime detection and clustering using path-wise two-sample tests and maximum mean discrepancy.
result Successfully detected and clustered market regimes in various data structures.

Local minimizers are convex and close to Wulff shapes.

problem Finding local minimizers in anisotropic isoperimetric problems.
method Showed local minimizers are geodesically convex and small smooth perturbations of tangent Wulff shapes.
result Local minimizers are quantitatively close to Wulff shapes.

Study identifies change points in piecewise constant reward functions with fixed exploration budget.

problem Locating abrupt changes in piecewise constant reward functions under bandit feedback.
method Fixed exploration budget, piecewise constant bandit problem, lower bounds, near optimal algorithms.
result Established lower bounds and near matching upper bounds for both small and large budgets.

Study best arm identification with contextual info, achieving optimal misidentification probability.

problem Identify the best treatment arm with minimal misidentification probability in a small gap scenario.
method Developed RS-AIPW strategy that matches lower bound of misidentification probability in the small-gap regime.
result RS-AIPW strategy is asymptotically optimal for best arm identification.

The intraday pattern, long memory, and multifractal nature of the intertrade durations, which are defined as the waiting times between two consecutive transactions, are investigated based upon the limit order book data and order flows of 23 liquid Chinese stocks listed on the Shenzhen Stock Exchange in 2003. An inverse…

2008-06-15abs ↗pdf ↗

Paper analyzes Gibbs and Langevin Monte Carlo for interpolation regime, showing generalization from low errors.

problem Analyzing Gibbs and Langevin Monte Carlo in overparameterized interpolation regime.
method Data-dependent bounds and stability under approximation with Langevin Monte Carlo.
result Generalization is signaled by small training errors in noisy regime, with bounds stable under approximation.

Theoretical analysis explains why models generalize after overfitting in modular addition.

problem Understanding why models generalize after overfitting in modular addition.
method Theoretical analysis and gradient descent behavior of two-layer quadratic networks and Transformers.
result Two-layer quadratic networks and simple Transformers generalize well after initially overfitting, indicating grokking.

Study small perturbations on low energy Laplace eigenfunctions.

problem Understanding small changes in low energy Laplace eigenfunctions.
method Investigates nodal geometry and topology, focusing on low frequency regimes and small perturbations.
result Highlight interesting aspects of spectral theory and nodal phenomena tied to ground state/low energy eigenfunctions.

We find the wealth distribution for an economic agent in the financial market, in analogy with standard derivation of generaliz Boltzman (Tsallis) factor in statistical mechanics. In this respect, Tsallis entropic index separates two different regimes, the large and small size market. The Pareto like wealth distributio…

2004-04-28abs ↗pdf ↗

A model of open economics composed of producers and speculators is investigated by numerical simulations. The capital flows from the environment to the producers and from them to the speculators. The price fluctuations are suppressed by the speculators. When the aggressivity of the speculators grows, there is a transit…

1999-06-16abs ↗pdf ↗

Study finds multiple solutions for Gross-Pitaevskii equations on curved spaces.

problem Finding multiple solutions for Gross-Pitaevskii equations on Riemannian manifolds.
method Critical point theory and Γ-convergence for Ginzburg-Landau functionals, plus new isoperimetric results.
result Lower bounds on the multiplicity of solutions in terms of the topology of the velocity set.

Analyzes Willmore flow for graphs with boundary data, proving existence and convergence.

problem Willmore flow of graphs with boundary conditions over bounded domains.
method Developed low-regularity theory, reformulated graphical equation, used time-weighted parabolic Hölder spaces.
result Proved short-time and global existence for initial data in C1+α(Ω)C^{1+α}(\overlineΩ) and Lipschitz, with exponential convergence.

The paper studies large deviation principles for stochastic volatility models with reflection, focusing on binary barrier options and call prices.

problem Large deviation principles for stochastic volatility models with reflection.
method Sample path and small-noise large deviation principles for the log-price process.
result Asymptotic behavior of binary barrier options and call prices in the small-noise regime.

Momentum affects optimization differently at small vs large batch sizes near instability.

problem Understanding how momentum impacts optimization near the edge of stability.
method Demonstrated through batch-size dependent behavior of SGD with momentum.
result Momentum operates in two distinct regimes: amplifying stochastic fluctuations at small batch sizes and stabilizing at large batch sizes.

The study identifies conditions under which algorithmic stability explains generalization in interpolating learning systems.

problem Understanding when algorithmic stability explains generalization in interpolating learning systems.
method Modeling training as a function-space trajectory and measuring sensitivity to single-sample perturbations.
result There exist interpolating regimes with small risk where contractive sensitivity cannot hold, showing that stability is not a universal explanation.

We train a network to generate mappings between training sets and classification policies (a 'classifier generator') by conditioning on the entire training set via an attentional mechanism. The network is directly optimized for test set performance on an training set of related tasks, which is then transferred to unsee…

2018-03-30abs ↗pdf ↗

We consider call option prices in diffusion models close to expiry, in an asymptotic regime ("moderately out of the money") that interpolates between the well-studied cases of at-the-money options and out-of-the-money fixed-strike options. First and higher order small-time moderate deviation estimates of call prices an…

2016-04-05abs ↗pdf ↗

We investigate the problem of optimal dividend distribution for a company in the presence of regime shifts. We consider a company whose cumulative net revenues evolve as a Brownian motion with positive drift that is modulated by a finite state Markov chain, and model the discount rate as a deterministic function of the…

2008-12-29abs ↗pdf ↗

Large learning rates prevent memorization in denoising score matching.

problem Memorization of training data in diffusion-based generative models.
method Investigating the role of large learning rates in the small-noise regime, proving that they prevent convergence to the empirical optimal score.
result Large learning rates prevent memorization by making it impossible for the learned score to be arbitrarily close to the empirical optimal score.

ALO-CV approximates leave-one-out error in proportional regime.

problem Estimating generalization error in high-dimensional settings.
method Developed new analysis for ALO-CV, showed consistency under strong convexity.
result ALO-CV approximates leave-one-out error up to negligible error.

Generative models use kernel smoothing for conditioning on small example sets.

problem Improving generative models' performance with limited conditioning examples.
method Showed that cross-attention conditioning is equivalent to kernel smoothing, specifically a Nadaraya--Watson kernel smoother.
result The approach predicts and confirms three failure regimes for kernel-based conditioning.

New method for density estimation without approximating posterior distributions.

problem Challenges in non-smooth data distributions for Bayesian density estimation.
method Autoregressive likelihood decomposition and Gaussian process prior in a quasi-Bayesian framework.
result Achieves state-of-the-art results in small-data regimes.

Deep neural networks have had an enormous impact on image analysis. State-of-the-art training methods, based on weight decay and DropOut, result in impressive performance when a very large training set is available. However, they tend to have large problems overfitting to small data sets. Indeed, the available regulari…

2016-05-30abs ↗pdf ↗

Study shows how large neural networks avoid overfitting through decoupling of feature learning and complexity growth.

problem Understanding inductive bias and generalization in large neural networks.
method Dynamical mean field theory applied to large two-layer networks.
result Training dynamics of large networks exhibit a separation of timescales, decoupling feature learning and overfitting.

The vision for precision medicine is to use individual patient characteristics to inform a personalized treatment plan that leads to the best healthcare possible for each patient. Mobile technologies have an important role to play in this vision as they offer a means to monitor a patient's health status in real-time an…

2016-11-10abs ↗pdf ↗

The paper provides generalization bounds for metric learning using neural network embeddings.

problem Generalization guarantees for metric learning with neural network embeddings.
method Uniform generalization bounds for two regimes: sparse and bounded amplification.
result Dimension-free generalization bounds can be achieved even without sparsity in solutions.

We derive a small-time expansion for out-of-the-money call options under an exponential Levy model, using the small-time expansion for the distribution function given in Figueroa-Lopez & Houdre (2009), combined with a change of numéraire via the Esscher transform. In particular, we quantify find that the effect of a no…

2011-05-16abs ↗pdf ↗

We consider a stochastic volatility model which captures relevant stylized facts of financial series, including the multi-scaling of moments. The volatility evolves according to a generalized Ornstein-Uhlenbeck processes with super-linear mean reversion. Using large deviations techniques, we determine the asymptotic sh…

2015-01-14abs ↗pdf ↗

New learner achieves optimal agnostic error in small error regime.

problem Optimizing agnostic learning in the small error regime.
method Careful aggregations of ERM classifiers.
result Achieves error $c \cdot τ+ O \left(\sqrt{\frac{τ(d + \log(1 / δ))}{m}} + \frac{d + \log(1 / δ)}{m} ight)$, matching lower bound when τd/mτ\approx d/m.

Study compares deep feature methods for anomaly detection in limited data scenarios.

problem Handling limited data in industrial inspection applications.
method Three approaches (KNN, Mahalanobis, PaDiM) using pre-trained deep features with data augmentation.
result Data augmentation significantly improves performance in small data regimes.

In this paper we introduce Feature Gradients, a gradient-based search algorithm for feature selection. Our approach extends a recent result on the estimation of learnability in the sublinear data regime by showing that the calculation can be performed iteratively (i.e., in mini-batches) and in linear time and space wit…

2019-08-27abs ↗pdf ↗