paper-with-me

Papers

A neural network based policy iteration algorithm with global $H^2$-superlinear convergence for stochastic games on domains

2019-06-05 · Kazufumi Ito, Christoph Reisinger, Yufei Zhang

In this work, we propose a class of numerical schemes for solving semilinear Hamilton-Jacobi-Bellman-Isaacs (HJBI) boundary value problems which arise naturally from exit time problems of diffusion processes with controlled drift. We exploit policy iteration to reduce the semilinear problem into a sequence of linear Dirichlet problems, which are subsequently approximated by a multilayer feedforward neural network ansatz. We establish that the numerical solutions converge globally in the $H^2$-norm, and further demonstrate that this convergence is superlinear, by interpreting the algorithm as an inexact Newton iteration for the HJBI equation. Moreover, we construct the optimal feedback controls from the numerical value functions and deduce convergence. The numerical schemes and convergence results are then extended to HJBI boundary value problems corresponding to controlled diffusion processes with oblique boundary reflection. Numerical experiments on the stochastic Zermelo navigation problem are presented to illustrate the theoretical results and to demonstrate the effectiveness of the method.

📄 PDF Abstract BibTeX arXiv:1906.02304

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Stochastic Newton Proximal Extragradient Method

2024-06-03 · Ruichen Jiang, Michał Dereziński, Aryan Mokhtari

Stochastic second-order methods achieve fast local convergence in strongly convex optimization by using noisy Hessian estimates to precondition the gradient. However, these methods typically reach superlinear convergence…

Second-order methods

Hessian Averaging in Stochastic Newton Methods Achieves Superlinear Convergence

2022-04-20 · Sen Na, Michał Dereziński, Michael W. Mahoney

We consider minimizing a smooth and strongly convex objective function using a stochastic Newton method. At each iteration, the algorithm is given an oracle access to a stochastic estimate of the Hessian matrix. The orac…

Online Learning Guided Curvature Approximation: A Quasi-Newton Method with Global Non-Asymptotic Superlinear Convergence

2023-02-16 · Ruichen Jiang, Qiujiang Jin, Aryan Mokhtari

Quasi-Newton algorithms are among the most popular iterative methods for solving unconstrained minimization problems, largely due to their favorable superlinear convergence property. However, existing results for these a…

Exploiting Local Convergence of Quasi-Newton Methods Globally: Adaptive Sample Size Approach

2021-06-10 · NeurIPS 2021 12 · Qiujiang Jin, Aryan Mokhtari

In this paper, we study the application of quasi-Newton methods for solving empirical risk minimization (ERM) problems defined over a large dataset. Traditional deterministic and stochastic quasi-Newton methods can be ex…

Non-asymptotic Superlinear Convergence of Standard Quasi-Newton Methods

2020-03-30 · Qiujiang Jin, Aryan Mokhtari

In this paper, we study and prove the non-asymptotic superlinear convergence rate of the Broyden class of quasi-Newton algorithms which includes the Davidon--Fletcher--Powell (DFP) method and the Broyden--Fletcher--Goldf…