Asymptotic regularity of a generalised stochastic Halpern scheme with applications
We provide abstract, general and highly uniform rates of asymptotic regularity for a generalized stochastic Halpern-style iteration, which incorporates a second mapping in the style of a Krasnoselskii-Mann iteration. This iteration is general in two ways: First, it incorporates stochasticity in a completely abstract way rather than fixing a sampling method; secondly, it includes as special cases stochastic versions of various schemes from the optimization literature, including Halpern's iteration as well as a Krasnoselskii-Mann iteration with Tikhonov regularization terms in the sense of Bo\c{t}, Csetnek and Meier. For these particular cases, we in particular obtain linear rates of asymptotic regularity, matching (or improving) the currently best known rates for these iterations in stochastic optimization, and quadratic rates of asymptotic regularity are obtained in the context of inner product spaces for the general iteration. We utilize these rates to give bounds on the oracle complexity of such iterations under suitable variance assumptions and batching strategies, again presented in an abstract style. Finally, we sketch how the schemes presented here can be instantiated in the context of reinforcement learning to yield novel methods for Q-learning.
Code (0)
등록된 구현이 없습니다.
Tasks
Q-LearningStochastic OptimizationSimilar Papers 제목 키워드 기반
Stochastic Halpern Iteration with Variance Reduction for Stochastic Monotone Inclusions
We study stochastic monotone inclusion problems, which widely appear in machine learning applications, including robust regression and adversarial learning. We propose novel variants of stochastic Halpern iteration with …
New nonasymptotic convergence rates of stochastic proximal pointalgorithm for convex optimization problems
Large sectors of the recent optimization literature focused in the last decade on the development of optimal stochastic first order schemes for constrained convex models under progressively relaxed assumptions. Stochasti…
Stochastic OptimizationPrecise asymptotics: robust stochastic volatility models
We present a new methodology to analyze large classes of (classical and rough) stochastic volatility models, with special regard to short-time and small noise formulae for option prices. Our main tool is the theory of re…
An Inexact Halpern Iteration with Application to Distributionally Robust Optimization
The Halpern iteration for solving monotone inclusion problems has gained increasing interests in recent years due to its simple form and appealing convergence properties. In this paper, we investigate the inexact variant…
Optimal hedging under fast-varying stochastic volatility
In a market with a rough or Markovian mean-reverting stochastic volatility there is no perfect hedge. Here it is shown how various delta-type hedging strategies perform and can be evaluated in such markets in the case of…