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

58116174232 · May 202619922001200920172026
48 results for Local valleys

Despite the non-convex nature of their loss functions, deep neural networks are known to generalize well when optimized with stochastic gradient descent (SGD). Recent work conjectures that SGD with proper configuration is able to find wide and flat local minima, which have been proposed to be associated with good gener…

2019-02-02abs ↗pdf ↗

This paper shows that every sublevel set of the loss function of a class of deep over-parameterized neural nets with piecewise linear activation functions is connected and unbounded. This implies that the loss has no bad local valleys and all of its global minima are connected within a unique and potentially very large…

2019-01-22abs ↗pdf ↗

LoRA-Curve connects independent LoRA optima through continuous low-loss valleys, improving Bayesian model averaging.

problem Challenges in estimating epistemic uncertainty in LoRA-based Bayesian inference.
method Introduces LoRA-Curve, a segmented Bézier curve parameterization in the LoRA space, with free and anchored configurations.
result Empirically shows that connecting independent LoRA optima through continuous low-loss valleys improves mutual information of the predictive distribution.

Looped transformers outperform standard transformers in complex reasoning tasks due to a specific loss landscape geometry.

problem Understanding why looped transformers outperform standard transformers in complex reasoning tasks.
method Explained through loss landscape geometry, distinguishing between U-shaped and V-shaped valleys, and proposing SHIFT training strategy.
result Looped transformers' recursive architecture induces a River-V-Valley landscape, leading to better loss convergence and complex pattern learning.

This paper proposes a new optimization algorithm called Entropy-SGD for training deep neural networks that is motivated by the local geometry of the energy landscape. Local extrema with low generalization error have a large proportion of almost-zero eigenvalues in the Hessian with very few positive or negative eigenval…

2016-11-06abs ↗pdf ↗

We present novel empirical observations regarding how stochastic gradient descent (SGD) navigates the loss landscape of over-parametrized deep neural networks (DNNs). These observations expose the qualitatively different roles of learning rate and batch-size in DNN optimization and generalization. Specifically we study…

2018-02-24abs ↗pdf ↗

Neural networks provide a rich class of high-dimensional, non-convex optimization problems. Despite their non-convexity, gradient-descent methods often successfully optimize these models. This has motivated a recent spur in research attempting to characterize properties of their loss surface that may explain such succe…

2018-02-18abs ↗pdf ↗

This paper explores loss landscapes of sparse neural networks, finding unique characteristics compared to dense networks.

problem Understanding the loss landscape of sparse neural networks, especially one-hidden-layer networks.
method Analyzes sparse networks with dense and sparse final layers, focusing on linear and non-linear models.
result Sparse networks can have no spurious valleys under certain conditions, but spurious valleys and minima can exist for wide sparse networks.

Quantization-aware training can recover accuracy lost by post-training quantization.

problem Post-training quantization (PTQ) can fail sharply at aggressive bitwidths.
method A unified geometric framework that explains PTQ failure and QAT recovery.
result QAT has a useful bias that steers iterates back into the basin.

Piecewise linear activations create many spurious local minima in neural networks.

problem Understanding the loss surface of neural networks with piecewise linear activations.
method Proved the existence of infinite spurious local minima and partitioned the loss surface into smooth cells.
result Piecewise linear activations create many spurious local minima that are invariant under a continuous path.

Adaptor 'E' extends gradient-based optimizers to explore loss landscapes, improving generalization.

problem Finding lower and better-generalizing minima in deep learning.
method Proposes an adaptor 'E' to extend gradient-based optimizers, encouraging exploration along landscape valleys.
result Adapted optimizers increase test accuracy by an average of 2.5% in large-batch training tasks.

A new pruning method reduces neural network computation without retraining.

problem Efficiently reduce neural network computation while maintaining accuracy.
method Structured directional pruning via perturbation orthogonal projection.
result Achieves state-of-the-art pruned accuracy without retraining.

A new Kolmogorov-Arnold network improves function approximation and optimization.

problem Approximating potentially irregular functions in high dimensions.
method Proposes a new Kolmogorov-Arnold network (KAN) and provides error bounds and universal approximation theorems.
result Outperforms multilayer perceptrons in accuracy and convergence speed for irregular functions.

D-Wave quantum annealing fails to improve sampling quality from RBMs compared to Gibbs sampling.

problem Improving sampling quality from RBMs using D-Wave quantum annealing.
method Comparison of D-Wave quantum annealing and Gibbs sampling for RBM sampling.
result D-Wave sampling does not significantly improve the number of local valleys compared to Gibbs sampling.

Proposes a method to partition univariate data into unimodal subsets.

problem Partitioning univariate multimodal data into unimodal subsets.
method Recursive splitting around valley points of the data density using properties of critical points on the convex hull of the ecdf plot.
result Obtains a hierarchical statistical model of the initial dataset as a mixture of UMMs.

WSD schedule improves model training efficiency by adapting learning rates dynamically.

problem Fixed compute budgets limit training efficiency of language models.
method Introduces a WSD schedule that uses a constant learning rate followed by a rapid decay phase.
result WSD schedule generates a non-traditional loss curve with stable and decay phases.

HyPV-LEAD detects cryptocurrency anomalies proactively, improving financial security.

problem Cryptocurrency anomalies like mixing, fraud, and pump-and-dump operations are hard to detect due to class imbalance and temporal volatility.
method HyPV-LEAD integrates lead time into anomaly detection through window-horizon modeling, Peak-Valley sampling, and hyperbolic embedding.
result HyPV-LEAD achieves a PR-AUC of 0.9624 on Bitcoin transaction data, significantly outperforming state-of-the-art methods.

Unbalanced data arises in many learning tasks such as clustering of multi-class data, hierarchical divisive clustering and semisupervised learning. Graph-based approaches are popular tools for these problems. Graph construction is an important aspect of graph-based learning. We show that graph-based algorithms can fail…

2011-12-11abs ↗pdf ↗

A new AI optimization method uses energy-conserving dynamics inspired by Born-Infeld theory.

problem Optimization challenges in non-convex loss functions and machine learning tasks.
method Discretization of Born-Infeld dynamics for energy-conserving Hamiltonian optimization.
result The method avoids high local minima and outperforms traditional methods in shallow valleys.

Designs chiral photonic structures using machine learning for efficient optical properties.

problem Optimizing chiral photonic nanostructures for light-matter interactions.
method Evolutionary algorithm and neural network approach for rapid optimization.
result Frequency-dependent modification in reflected light's degree of circular polarization.

Tilting loss functions improves machine learning performance.

problem Improving machine learning models, especially in under- and over-parameterized networks.
method Using evolving loss functions that emphasize different classes cyclically.
result Dynamical loss functions lead to better generalization and stability in training.

Stablecoin liquidity was affected by the SVB collapse, with USDC's transparency leading to market reactions.

problem Impact of stablecoin transparency on liquidity during market turmoil.
method Adapted MCI measure to Uniswap, Difference-in-Differences analysis on MCI and TVL, measured liquidity concentration.
result USDC's transparency led to swift market reactions, while USDT's opacity provided a safety net.

This paper presents an algorithm for a complete and efficient calibration of the Heston stochastic volatility model. We express the calibration as a nonlinear least squares problem. We exploit a suitable representation of the Heston characteristic function and modify it to avoid discontinuities caused by branch switchi…

2015-11-27abs ↗pdf ↗

This research explains why SGD generalizes better than ADAM in deep learning.

problem Understanding the generalization gap between SGD and ADAM in deep learning.
method Analyzing local convergence behaviors through Levy-driven stochastic differential equations (SDEs).
result SGD is more locally unstable and better escapes from sharp minima to flatter ones, leading to better generalization.

Model shows how banks' hidden-to-maturity accounting can mask run risk and lead to financial instability.

problem Run risk and hidden-to-maturity accounting in banking systems.
method Balance sheet model and optimization problem to assess run risk and resilience.
result Held-to-maturity accounting can mask revaluation losses and increase run risk.

Study the landscape of Lipschitz functions between manifolds using persistent homology.

problem Understanding the structure of homotopy paths between maps with high Lipschitz constants.
method Using persistent homology to analyze the landscape of Lipschitz functions between manifolds.
result First results on the persistence of higher-dimensional cycles in function spaces.

Model shows how capital accumulation can lead to poverty traps and well-being states.

problem Capital accumulation and its effects on poverty and well-being.
method Stochastic Solow growth model with sigmoidal saving fraction and bimodal steady state distribution.
result Existence of poverty trap with fluctuation-driven transitions between poverty and well-being states.

Proves existence of a single-valued minimal hypersurface in compact manifolds.

problem Existence of multiplicity-1 minimal hypersurfaces in compact Riemannian manifolds.
method Modified minmax construction with Allen-Cahn approximation and valley point optimization.
result Existence of a smooth, closed minimal hypersurface with multiplicity 1 in bumpy metrics.

Paper proves existence of anisotropic dynamical horizons in gravitational collapse.

problem Existence of apparent horizons in gravitational collapse.
method Scale-critical hyperbolic method and non-perturbative elliptic techniques.
result Smooth and spacelike apparent horizons emerge from general initial data in gravitational collapse.

Combining insights from machine learning and quantum Monte Carlo, the stochastic reconfiguration method with neural network Ansatz states is a promising new direction for high-precision ground state estimation of quantum many-body problems. Even though this method works well in practice, little is known about the learn…

2019-10-24abs ↗pdf ↗