An $O(s^r)$-Resolution ODE Framework for Discrete-Time Optimization Algorithms and Applications to the Linear Convergence of Minimax Problems

23 Jan 2020Haihao Lu

There has been a long history of using Ordinary Differential Equations (ODEs) to understand the dynamic of discrete-time algorithms (DTAs). However, there are two major difficulties to apply this approach: (i) it is unclear how to obtain a suitable ODE from a DTA, and (ii) it is unclear what is the connection between the convergence of a DTA and the convergence of its corresponding ODE... (read more)

PDF Abstract


No code implementations yet. Submit your code now


Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods used in the Paper

🤖 No Methods Found Help the community by adding them if they're not listed; e.g. Deep Residual Learning for Image Recognition uses ResNet