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

99199298397 · Jun 202019922001200920172026
48 results for Stochastic Initialization

SGD fails to converge for deep ReLU networks with limited random initializations.

problem SGD convergence in deep neural networks with limited random initializations.
method Analysis of four discretization parameters: network architecture, training data, gradient steps, and random initializations.
result SGD fails to converge for ReLU networks with depth much larger than width.

Stochastic variational inference is an established way to carry out approximate Bayesian inference for deep models. While there have been effective proposals for good initializations for loss minimization in deep learning, far less attention has been devoted to the issue of initialization of stochastic variational infe…

2018-10-18abs ↗pdf ↗

New MKABSDEs help calculate initial margins in financial contracts.

problem Calculating initial margins in financial contracts with dependencies.
method Introduced MKABSDEs, provided existence and uniqueness, applied to CVaR, used deterministic and Monte-Carlo methods for numerical approximations.
result MKABSDEs provide a new way to solve for initial margins in financial contracts.

New insights show stochastic initialization prevents token clustering in deep Transformers.

problem Understanding token dynamics in deep stochastic Transformers.
method Analysis of deep Transformers with random initialization noise, proving convergence to an interacting-particle system on the sphere.
result Initialization noise prevents token clustering, leading to antipodal formations.

Study on the smoothness of solutions to a specific type of stochastic differential equation.

problem Regularity of solutions to mean-field GG-SDEs.
method Analysis of first and second order Fréchet differentiability in the random initial condition.
result Established the Fréchet differentiability of the solution and specified the corresponding equations.

Enlargement of filtrations is a classical topic in the general theory of stochastic processes. This theory has been applied to stochastic finance in order to analyze models with insider information. In this paper we study initial enlargement in a Markov chain market model, introduced by R. Norberg. In the enlargened fi…

2011-08-12abs ↗pdf ↗

Study optimizes trading in multiple assets with cross-effects.

problem Optimizing trade execution in multiple assets with cross-impact effects.
method Formulated as a stochastic control problem, extended to progressively measurable controls, solved using linear-quadratic control theory.
result Cross-hedging effects can be optimal, e.g., trading in an asset without an initial position.

SGD transitions between maxima and minima with varying time scales.

problem Understanding SGD's behavior near critical points in noisy landscapes.
method Analyzing SGD convergence and escape dynamics in 1D landscapes with infinite- and finite-variance noise.
result SGD reliably moves to the basin's minimum unless close to a local maximum, where it can linger.

In this paper, we study the minimax optimization problem in the smooth and strongly convex-strongly concave setting when we have access to noisy estimates of gradients. In particular, we first analyze the stochastic Gradient Descent Ascent (GDA) method with constant stepsize, and show that it converges to a neighborhoo…

2020-02-13abs ↗pdf ↗

Deep neural networks achieve state-of-the-art performance for a range of classification and inference tasks. However, the use of stochastic gradient descent combined with the nonconvexity of the underlying optimization problems renders parameter learning susceptible to initialization. To address this issue, a variety o…

2020-01-28abs ↗pdf ↗

New initialization schemes preserve fractional moments of weights in deep networks, improving training and test performance.

problem Heavy-tailed distribution of stochastic gradients in DNNs during training.
method Developed initialization schemes that preserve any given fractional moment of order s < 2 over layers for various activations.
result The network output admits a heavy-tailed distribution with finite moments, improving training and test performance.

Posterior inference in directed graphical models is commonly done using a probabilistic encoder (a.k.a inference model) conditioned on the input. Often this inference model is trained jointly with the probabilistic decoder (a.k.a generator model). If probabilistic encoder encounters complexities during training (e.g. s…

2019-12-19abs ↗pdf ↗

Gradient descent training of neural networks leads to solutions close to natural cubic splines.

problem Understanding the implicit bias of gradient descent in neural networks.
method Analysis of gradient descent training for wide neural networks, focusing on the curvature penalty and initialization schemes.
result The solutions of gradient descent training are polyharmonic splines for certain initialization schemes.

Investment strategies in occupational pension plans are optimized for non-tradable income risk.

problem Optimizing investment strategies for occupational pension plans in the presence of non-tradable income risk.
method Formulated as a stochastic optimization problem, analyzed in both constant and stochastic volatility environments.
result Random contributions induce the optimal glide path structure, influenced by initial wealth, contributions, and risk aversion.

New analysis shows temperature guarantees generalization in stochastic training.

problem Analyzing the generalization gap in stochastic training algorithms.
method Analyzing Langevin dynamics with positive temperature and bounding the generalization gap.
result Bounding the generalization gap by √(βE[L(θ_0)] + log(1/δ))/√N with probability 1-δ.

Persistent neurons improve neural network optimization by leveraging previous solutions.

problem Improving neural network optimization under different initialization and data distributions.
method Persistent neurons use information from previous converged solutions to explore new landscapes and avoid local minima.
result Persistent neurons converge to more optimal solutions and improve model performance under various initializations.

New method uses SDEs for accurate non-uniformly sampled time series analysis.

problem Characterizing non-uniformly sampled time series with high accuracy.
method Stochastic Differential Equations (SDEs) for modeling, incremental estimation, and model truncation.
result Increased accuracy in characterizing non-uniformly sampled time series.

One of the difficulties of training deep neural networks is caused by improper scaling between layers. Scaling issues introduce exploding / gradient problems, and have typically been addressed by careful scale-preserving initialization. We investigate the value of preserving scale, or isometry, beyond the initial weigh…

2016-04-26abs ↗pdf ↗

New analysis improves convergence guarantees for diffusion-based samplers in Wasserstein distance.

problem Improving convergence guarantees for diffusion-based generative models.
method Simple framework to analyze discretization, initialization, and score estimation errors.
result First Wasserstein convergence bound for the Heun sampler and improved results for Euler sampler.

Optimal algorithm for high-dimensional stochastic linear bandits with sparse parameters.

problem High-dimensional stochastic linear bandits with sparse parameters.
method Three-stage arm selection algorithm using thresholded Lasso for estimation.
result Achieves exact minimax optimality in cumulative regret.

We solve a complex trade execution problem by simplifying it into a known LQ control problem.

problem Optimal trade execution with stochastic price impact and resilience.
method Extending the problem to progressively measurable processes and reducing it to a LQ stochastic control problem.
result The solution to the LQ problem traces back to the solution of the original trade execution problem.

Paper shows pre-training and transfer learning reduce sample complexity for neural networks.

problem Training high-dimensional supervised learning with limited labeled data.
method Study of single-layer neural networks via online stochastic gradient descent, considering concept shift.
result Pre-training and transfer learning reduce sample complexity by polynomial factors under general assumptions.

Stochastic gradient descent converges to universal limits in high dimensions.

problem Statistical tasks in high dimensions with specific data projections.
method Stochastic gradient descent applied to mixture distributions, proving universality of limits.
result The ODE limits are universal for mixtures of arbitrary product distributions.

We show that stochastic interpolation flow maps are Lipschitz with a sharp constant.

problem High dimensional sampling and transport problems.
method Investigating stochastic interpolation flow for generating data samples.
result Stochastic interpolation flow maps are Lipschitz with a sharp constant matching optimal transport maps.