This paper presents a stochastic behavior analysis of a kernel-based stochastic restricted-gradient descent method. The restricted gradient gives a steepest ascent direction within the so-called dictionary subspace. The analysis provides the transient and steady state performance in the mean squared error criterion. It…
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
48 results for “Stochastic analysis”
Asymptotic and Finite Sample Analysis of Nonexpansive Stochastic Approximations with Markovian Noisecs.LG
This work analyzes nonexpansive stochastic approximations with Markovian noise, proving convergence in reinforcement learning.
problem Applying stochastic approximation to reinforcement learning settings with nonexpansive operators.
method Investigates nonexpansive stochastic approximations with Markovian noise, providing asymptotic and finite sample analysis.
result First-time proof of convergence for classical tabular average reward temporal difference learning.
Backward stochastic difference equations on lattices with application to market equilibrium analysismath.PR
Study BSΔE on lattices for asset price analysis.
problem Optimal investment and market equilibrium analysis in asset price models.
method Backward stochastic difference equations on lattices.
result Applications to optimal investment and market equilibrium analysis.
AL-SPCE improves reliability analysis for complex systems with active learning and SPCE.
problem Efficiently analyzing reliability of complex, computationally expensive models with intrinsic randomness.
method Active learning framework using stochastic polynomial chaos expansions (SPCE) to reduce computational burden.
result AL-SPCE maintains high accuracy in reliability estimates while significantly improving efficiency.
DeepONet accelerates reliability analysis of stochastic nonlinear systems.
problem Time-dependent reliability analysis of systems with stochastic forcing.
method DeepONet, a novel operator network, learns function-to-function mappings.
result DeepONet efficiently and accurately predicts system responses.
Algorithm improves online canonical correlation analysis.
problem Online canonical correlation analysis.
method Stochastic Scaled-Gradient Descent (SSGD) for minimizing expectation over Riemannian manifolds.
result Achieved optimal one-time-scale algorithm with explicit rate of local asymptotic convergence.
Stochastic momentum methods have been widely adopted in training deep neural networks. However, their theoretical analysis of convergence of the training objective and the generalization error for prediction is still under-explored. This paper aims to bridge the gap between practice and theory by analyzing the stochast…
Unified Convergence Analysis of Stochastic Momentum Methods for Convex and Non-convex Optimizationmath.OC
Recently, {\it stochastic momentum} methods have been widely adopted in training deep neural networks. However, their convergence analysis is still underexplored at the moment, in particular for non-convex optimization. This paper fills the gap between practice and theory by developing a basic convergence analysis of t…
Portfolio Analysis Based on Markowitz Stochastic Dominance Criteria: A Behavioral Perspectiveq-fin.PM
The paper analyzes how behavioral investors make portfolio decisions using Markowitz Stochastic Dominance criteria.
problem Understanding how behavioral investors make portfolio decisions.
method Developed stochastic optimization problems and MILP models to capture subjective decision weights and probability weighting functions.
result The developed models can be used to formulate computationally tractable portfolio analysis problems.
This paper tackles reliability analysis for stochastic systems using surrogate models.
problem Traditional reliability analysis relies on deterministic models, which are not suitable for stochastic systems with non-repeatable outcomes.
method The paper introduces reliability analysis for stochastic models by using generalized lambda models and stochastic polynomial chaos expansions as surrogate models to lower computational cost.
result The surrogate models enable efficient uncertainty quantification at a lower cost than traditional Monte Carlo simulation.
Although stochastic approximation learning methods have been widely used in the machine learning literature for over 50 years, formal theoretical analyses of specific machine learning algorithms are less common because stochastic approximation theorems typically possess assumptions which are difficult to communicate an…
New analysis shows GMD can converge linearly under PL-like conditions.
problem Establishing linear convergence for generalized mirror descent.
method PL-based analysis for time-dependent mirrors, Taylor-series approach for stochastic GMD.
result Linear convergence of stochastic GMD under PL-like conditions.
The paper analyzes the variance of different shuffling methods in stochastic gradient descent.
problem Understanding the variance of different shuffling methods in stochastic gradient descent.
method Power spectral density analysis to study the noise sequences of stochastic gradients.
result The stationary variances of iterates decrease in the order of SGD, SGD-RR, and SGD-SO.
Stochastic gradient methods converge for training wide PINNs.
problem Convergence of stochastic gradient descent in training over-parameterized PINNs.
method Established linear convergence of stochastic gradient descent/flow in training over-parameterized two-layer PINNs.
result Linear convergence with high probability for general activation functions.
MAntRA combines machine learning and Bayesian methods for time-dependent reliability analysis of unknown systems.
problem Time-dependent reliability analysis of systems with unknown governing physics.
method Combines machine learning, Bayesian statistics, and stochastic integration to discover and analyze SDEs from data.
result Demonstrates the effectiveness of MAntRA on three numerical examples, indicating its potential for in-situ and heritage structure analysis.
Solves wealth maximization problem using variational analysis.
problem Maximizing expected utility of terminal wealth.
method Variational analysis, forward-backward stochastic differential equation (FBSDE).
result Characterization and solutions for various utility functions.
This paper analyzes Stochastic Depth regularization in ResNets.
problem Improving generalization in ResNets through regularization.
method Hybrid analysis combining perturbation and signal propagation.
result Principled guidelines for choosing survival rates in SD.
We propose novel first-order stochastic approximation algorithms for canonical correlation analysis (CCA). Algorithms presented are instances of inexact matrix stochastic gradient (MSG) and inexact matrix exponentiated gradient (MEG), and achieve -suboptimality in the population objective in $\operatorname{poly}(\fr…
Stochastic Gradient Descent (SGD) has become popular for solving large scale supervised machine learning optimization problems such as SVM, due to their strong theoretical guarantees. While the closely related Dual Coordinate Ascent (DCA) method has been implemented in various software packages, it has so far lacked go…
Optimal algorithms for Riemannian optimization with reduced complexity.
problem Stochastic optimization on Riemannian manifolds with limited data.
method Zeroth-order Riemannian Averaging Stochastic Approximation algorithms using Riemannian moving-average estimators and novel geometric conditions.
result Achieves optimal sample complexities for generating approximate first-order stationary solutions.
Theoretical Connection between Locally Linear Embedding, Factor Analysis, and Probabilistic PCAstat.ML
This work connects LLE, factor analysis, and probabilistic PCA through a stochastic perspective.
problem Exploring the theoretical connection between LLE, factor analysis, and probabilistic PCA.
method Solving the stochastic linear reconstruction of LLE using expectation maximization.
result LLE, factor analysis, and probabilistic PCA are shown to be connected through a stochastic perspective.
Paper analyzes online tensorial ICA convergence with stochastic approximation.
problem Online tensorial ICA convergence analysis.
method Stochastic approximation for nonconvex optimization.
result Sharp finite-sample error bound of .
Quantum Encoding and Analysis on Continuous Time Stochastic Process with Financial Applicationsquant-ph
Quantum computing speeds up analysis of financial stochastic processes.
problem Challenging simulation and analysis of continuous time stochastic processes.
method Established a quantum framework for efficient state preparation and information extraction.
result Extraction of path-dependent and history-sensitive information from stochastic processes efficiently.
This paper analyzes adaptive gradient algorithms for better performance in ill-conditioned problems.
problem Poor performance of standard stochastic gradient algorithms in ill-conditioned problems.
method Non-asymptotic analysis of adaptive gradient algorithms (Adagrad and Stochastic Newton) for strongly convex objectives.
result Theoretical analysis and adaptation to practical applications like linear regression and regularized GLM.
Paper analyzes SGHMC for non-convex optimization with discontinuous gradients.
problem Training neural networks with ReLU activation.
method Non-asymptotic convergence analysis of SGHMC with discontinuous gradients.
result Explicit upper bounds for expected excess risk in non-convex optimization.
New analysis of stochastic approximation with non-expansive mappings.
problem Finite-time analysis of two-time-scale stochastic approximation with non-expansive mappings.
method Studied two-time-scale stochastic approximation algorithms with non-expansive mappings and projection steps.
result Last-iterate mean square residual error decays at a rate .
Principal component analysis (PCA) has been a prominent tool for high-dimensional data analysis. Online algorithms that estimate the principal component by processing streaming data are of tremendous practical and theoretical interests. Despite its rich applications, theoretical convergence analysis remains largely ope…
Study on policy gradient for stochastic bandits using diffusion approximation.
problem Improving policy gradient methods for stochastic bandits with optimal regret bounds.
method Continuous-time diffusion approximation of policy gradient with learning rate analysis.
result Proved optimal regret bound of for .
Unified SGD method improves convergence for nested optimization problems.
problem Stochastic nested optimization problems.
method ALTERNATE dESCEN (ALSET) method leveraging hidden smoothness.
result Requires samples to achieve an -stationary point.
This work analyzes discrete diffusion models using stochastic integrals, providing error bounds and insights.
problem Error analysis for discrete diffusion models remains less understood.
method Proposes a comprehensive framework based on Lévy-type stochastic integrals.
result Obtains the first error bound for the -leaping scheme in KL divergence.
Develops robust methods for infinite-dimensional stochastic processes.
problem Measuring covariations in stochastic evolution equations in infinite dimensions.
method Asymptotic theory for jump robust measurement of covariations.
result Identifies scaling limits for realized covariations.
Improved privacy analysis for stochastic gradient descent.
problem Analyzing privacy leakage in noisy stochastic gradient descent.
method Modeling Rényi divergence dynamics with Langevin diffusions, proving exponential privacy loss convergence for smooth and strongly convex objectives.
result Privacy loss converges exponentially fast for smooth and strongly convex objectives under constant step size.
Single-timescale analysis improves convergence in multi-sequence stochastic approximation.
problem Finite-time convergence of nonlinear stochastic approximation with multiple coupled sequences.
method Smoothness property of fixed points and analysis of fine-grained single-timescale SA.
result Improved iteration complexity for achieving ε-accuracy in multi-sequence single-timescale SA.
Explains gradient descent methods and their convergence, focusing on simple analysis.
problem Understanding and analyzing gradient descent methods and their variants.
method Elementary mathematical analysis focusing on structures and assumptions of objective functions.
result Unified convergence analysis of various gradient descent methods and variants.
Economies and societal structures in general are complex stochastic systems which may not lend themselves well to algebraic analysis. An addition of subjective value criteria to the mechanics of interacting agents will further complicate analysis. The purpose of this short study is to demonstrate capabilities of agent-…
Unified analysis of stochastic iterative algorithms using Lyapunov functions.
problem Analyzing convergence of stochastic iterative algorithms for fixed-point equations.
method Lyapunov-based techniques for finite-time analysis of stochastic approximation algorithms.
result Unified mean-square convergence guarantees for various algorithms.
We introduce a stochastic model for noisy vector fields on manifolds.
problem Noisy vector fields violate the assumption of parallel transport in stochastic analysis.
method We define a stochastic Lie bracket that induces torsion and analyze its consequences.
result The stochastic Lie bracket induces torsion in expectation.
We develop a simple routine unifying the analysis of several important recently-developed stochastic optimization methods including SAGA, Finito, and stochastic dual coordinate ascent (SDCA). First, we show an intrinsic connection between stochastic optimization methods and dynamic jump systems, and propose a general j…
This study analyzes satellite communication latency using a stochastic geometry model.
problem Latency analysis of LEO satellite relay communication systems.
method Stochastic geometry framework with spherical BPP models, suboptimal satellite relay selection strategy.
result Derives distance distributions and analytical expressions for transmission delays.
These notes were originally written for the Stochastic Analysis Seminar in the Department of Operations Research and Financial Engineering at Princeton University, in February of 2011. The seminar was attended and supported by members of the Research Training Group, with the author being partially supported by NSF gran…
Derives effective continuous dynamics for adaptive SGD methods.
problem Analyzing noise in adaptive SGD methods.
method Stochastic modified equations framework and Malladi's scaling rules.
result Sampling-induced noise in SGD limits to independent Brownian motions.
Paper introduces stochastic HJB on Jacobi structures.
problem Stochastic analysis on Jacobi manifolds.
method Global stochastic analysis techniques, extending Bismut and Lázaro-Camí work.
result Proposes a stochastic HJB framework.
Improved convergence for non-log-concave sampling.
problem Sampling from non-log-concave distributions.
method Novel conductance analysis of SGLD with auxiliary Markov Chain.
result SGLD achieves ε-sampling error with fewer evaluations.
Unified analysis of stochastic gradient methods for convex and smooth optimization.
problem Minimizing composite convex and smooth functions.
method Unified convergence analysis of various stochastic gradient methods.
result Unified convergence rates for a variety of methods including proximal SGD, variance reduced methods, quantization, and coordinate descent.
Stochastic gradient Langevin dynamics (SGLD) is a fundamental algorithm in stochastic optimization. Recent work by Zhang et al. [2017] presents an analysis for the hitting time of SGLD for the first and second order stationary points. The proof in Zhang et al. [2017] is a two-stage procedure through bounding the Cheege…
Paper analyzes Scaffold algorithm for federated learning, proving linear speed-up with stochastic gradients.
problem Understanding the impact of stochastic gradients on the Scaffold algorithm's performance.
method Proved linear speed-up in the number of clients using a Markov chain analysis of global parameters and control variates.
result Scaffold achieves linear speed-up in the number of clients up to higher-order terms in the step size, but retains a higher-order bias.
Unified analysis of stochastic ADMM variants via SME.
problem Analyzing and optimizing stochastic ADMM variants for machine learning.
method Unified mathematical framework of SME for continuous-time analysis.
result Dynamics of stochastic ADMM approximated by SDEs with small noise.
Stochastic Partial Differential Equations on Evolving Surfaces and Evolving Riemannian Manifoldsmath.AP
We formulate stochastic partial differential equations on Riemannian manifolds, moving surfaces, general evolving Riemannian manifolds (with appropriate assumptions) and Riemannian manifolds with random metrics, in the variational setting of the analysis to stochastic partial differential equations. Considering mainly …