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

Trend · papers per month

4108201,2291,639 · Jun 202019922001200920172026
48 results for moderate learning rate

Stochastic Gradient Descent shows directional bias with moderate learning rates, impacting optimization outcomes.

problem Understanding the bias of SGD with moderate learning rates in practical scenarios.
method Analyzing SGD and GD on an overparameterized linear regression problem.
result SGD converges along large eigenvalue directions, GD along small ones, affecting early stopping outcomes.

We provide a unifying treatment of pathwise moderate deviations for models commonly used in financial applications, and for related integrated functionals. Suitable scaling allows us to transfer these results into small-time, large-time and tail asymptotics for diffusions, as well as for option prices and realised vari…

2018-03-12abs ↗pdf ↗

New lower bounds show challenges in clustering in moderate dimensions.

problem Clustering points from mixtures of isotropic Gaussians in moderate dimensions.
method Established low-degree polynomial lower bounds and developed a novel non-spectral algorithm.
result New lower bounds reveal a 'non-parametric rate' in moderate dimensions.

Proposes a method for interpreting time-varying causal effect moderation in high-dimensional data.

problem Interpreting causal effect moderation in high-dimensional data with interpretability and avoiding false positives.
method Two-step method: 1) Selects a smaller model for linear causal effect moderation using Gaussian randomization, 2) Conditions on selection to construct a pivot for uniformly asymptotic semi-parametric inference.
result Consistently achieves valid coverage rates and shorter, bounded intervals in time-varying causal effect moderation.

SGD with large learning rates can achieve better test accuracy than expected.

problem SGD with large learning rates often outperforms expected convergence bounds.
method Proved that SGD with small learning rates stays close to gradient flow path on modified loss.
result Explicitly adding an implicit regularizer to the loss improves test accuracy.

New method interprets deep learning for causal effects, separating prognostic and moderating covariates.

problem Estimating individual causal/treatment effects under confounders.
method Deep counterfactual learning architecture for estimating CATE with interpretable score functions.
result Demonstrated improved interpretability and quantification of uncertainty in CATE estimation.

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.

Bayesian neural networks explore rare fluctuations for better feature learning.

problem Understanding rare but dominant fluctuations in Bayesian neural networks.
method Large-deviation theory and joint optimization over predictors and internal kernels.
result Posterior rate function optimization reveals data-dependent kernel selection.

The study shows interest rates impact investment and funding negatively but positively on dividend decisions.

problem The effect of interest rates on financial decisions like investment, funding, and dividend.
method Correlation coefficient analysis and descriptive methods.
result Interest rates have a negatively insignificant effect on investment and funding decisions, but positively moderate effect on dividend decisions.

Study describes frequencies of geodesics on hyperbolic surfaces as genus grows.

problem Large genus asymptotic behaviors of geodesic frequencies on hyperbolic surfaces.
method Proof of conjecture involving separating and nonseparating geodesics.
result Explicit function $f( rac{n}{g})$ for frequency ratio given.

For spherically symmetric distributions, efficient quantisation can be achieved with moderate sample sizes.

problem Optimal quantisation in high dimensions requires large sample sizes, making it impractical.
method Uniformly distributed random quantisers on a sphere of suitable radius achieve exceptional performance.
result For moderate sample sizes, quantisation error can be efficiently computed and approximated.

We describe a post hoc test for the Sharpe ratio, analogous to Tukey's test for pairwise equality of means. The test can be applied after rejection of the hypothesis that all population Signal-Noise ratios are equal. The test is applicable under a simple correlation structure among asset returns. Simulations indicate t…

2019-11-11abs ↗pdf ↗

Paper optimizes change-point detection using learned distributions from training sequences.

problem Optimal change-point detection with unknown pre- and post-change distributions.
method Designs a change-point estimator using training sequences and test sequences.
result Optimal confidence width characterized as a function of undetected error.

Importance sampling has become an important tool for the computation of tail-based risk measures. Since such quantities are often determined mainly by rare events standard Monte Carlo can be inefficient and importance sampling provides a way to speed up computations. This paper considers moderate deviations for the wei…

2013-06-27abs ↗pdf ↗

Cascade classifiers are widely used in real-time object detection. Different from conventional classifiers that are designed for a low overall classification error rate, a classifier in each node of the cascade is required to achieve an extremely high detection rate and moderate false positive rate. Although there are …

2013-01-10abs ↗pdf ↗

The paper tackles robust policy learning from multiple data sources.

problem Learning a policy that generalizes across diverse settings from multiple heterogeneous data sources.
method Proposes a minimax regret optimization objective and a policy learning algorithm combining doubly robust offline policy evaluation and no-regret learning.
result Achieves minimal worst-case mixture regret up to a moderated vanishing rate of the total data across all sources.

We present an extended version of the recently proposed "LLOB" model for the dynamics of latent liquidity in financial markets. By allowing for finite cancellation and deposition rates within a continuous reaction-diffusion setup, we account for finite memory effects on the dynamics of the latent order book. We compute…

2017-10-10abs ↗pdf ↗

RQMC improves kernel-based learning by reducing deterministic error and offering computational advantages.

problem Improving kernel-based learning methods to reduce deterministic error and computational complexity.
method Randomized quasi-Monte Carlo (RQMC) methods applied to random feature approximations.
result RQMC methods improve deterministic approximation error bound from OP(1/M)O_P(1/\sqrt{M}) to O(1/M)O(1/M), matching QMC methods.

Computes invariants distinguishing between immersions and embeddings of doodles and blobs on surfaces.

problem Distinguishing between immersions and embeddings of doodles and blobs on surfaces.
method Regular embeddings, bordisms, and exact sequences of abelian groups.
result Exact sequence describing bordisms of immersions and embeddings of doodles on A=RimesIA = \mathbb R imes I.

Developers of text-to-speech synthesizers (TTS) often make use of human raters to assess the quality of synthesized speech. We demonstrate that we can model human raters' mean opinion scores (MOS) of synthesized speech using a deep recurrent neural network whose inputs consist solely of a raw waveform. Our best models …

2016-11-28abs ↗pdf ↗

Deep neural networks (DNNs) although achieving human-level performance in many domains, have very large model size that hinders their broader applications on edge computing devices. Extensive research work have been conducted on DNN model compression or pruning. However, most of the previous work took heuristic approac…

2018-10-17abs ↗pdf ↗

Modeling house prices in Australia reveals supply limitations as the primary driver of extreme trends.

problem Understanding the resilience of Australia's housing prices despite changes in mortgage rates.
method Developed a differential equation model and used modern extreme value techniques on real-world data.
result Without supply increases, a 11% mortgage rate hike is needed to moderate extreme housing costs.

We consider the problem of learning linear classifiers when both features and labels are binary. In addition, the features are noisy, i.e., they could be flipped with an unknown probability. In Sy-De attribute noise model, where all features could be noisy together with same probability, we show that 00-11 loss ($l_{…

2019-11-18abs ↗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 ↗

A new graph-based clustering method for moderate-dimensional data.

problem Performance degradation of existing graph-based clustering methods in high dimensions.
method Introduces UN-CCDs using NND-based MC-SRT for covering radii determination.
result UN-CCDs provide stable and competitive performance in moderate-sized datasets.

Proposes a two-stage method for testing variable interactions with FDR control.

problem Testing pairwise interactions in high-dimensional data with dependence.
method Two-stage testing procedure with FDR control using Cramér type moderate deviation technique.
result The proposed method controls FDR and has comparable or improved statistical power.

Careful tuning of the learning rate, or even schedules thereof, can be crucial to effective neural net training. There has been much recent interest in gradient-based meta-optimization, where one tunes hyperparameters, or even learns an optimizer, in order to minimize the expected loss when the training procedure is un…

2018-03-06abs ↗pdf ↗

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.

Paper generalizes VB-FTRL for online learning of quantum states with logarithmic loss.

problem Online learning of quantum states with logarithmic loss.
method Generalizes VB-FTRL algorithm for LL-OLQS with polynomial-time implementation.
result Achieves a regret rate of O(d2log(d+T))O (d^2 \log (d + T)) for LL-OLQS.

This study optimizes DRL for American option hedging with new training methods.

problem Optimizing Deep Reinforcement Learning for American Put Option Hedging
method Investigates hyperparameters, introduces new training methods, and compares with Black-Scholes method.
result Weekly-trained DRL agents outperform Black-Scholes at transaction costs of 1% and 3%