Continuous-time Analysis of Anchor Acceleration

Recently, the anchor acceleration, an acceleration mechanism distinct from Nesterov's, has been discovered for minimax optimization and fixed-point problems, but its mechanism is not understood well, much less so than Nesterov acceleration. In this work, we analyze continuous-time models of anchor acceleration. We provide tight, unified analyses for characterizing the convergence rate as a function of the anchor coefficient $\beta(t)$, thereby providing insight into the anchor acceleration mechanism and its accelerated $\mathcal{O}(1/k^2)$-convergence rate. Finally, we present an adaptive method inspired by the continuous-time analyses and establish its effectiveness through theoretical analyses and experiments.

Paper

Similar papers

Peer review

Reviewer KkKu8/10 · confidence 3/52023-06-30

Summary

The paper extends the continuous time analysis anchor ODE in [55] to involved a more general choice of the coefficient $\beta(t)$ and show that the choice in [55] is in some sense optimal. They then go on to show: - correspondance with the discrete anchoring schemes APPM/FEG/AEG - Anchor ODE converges to a minimal $\ell_2$-distance from initialization (like APPM [51]) - Tightness of continuous time rates for anchor ODE - Convergence of APPM for more general choice of stepsize than $1/(k+2)$. - faster convergence under $\mu$-strongly monotonicity for anchor ODE by choosing $\beta(t)$ dependent on $\mu$. - convergence with adaptive stepsize for both anchor ODE and APPM (single-valued) that recovers the rates for monotone and strongly monotone+Lipschitz

Strengths

Overall an impressive work. It seem interesting that one can adapt to both the smoothness parameter and the strong monotonicity modulus. The work seems fairly completely, I only leave a few comments/remarks below.

Weaknesses

- My main concern is why we consider $\beta(t)$ other than $1/t$ in the first place. The proof seems much more involved, but what does it buy us considering $1/t$ is already in some sense optimal. My understanding is that if only $1/t$ was considered then [55] and [34]/[Theorem 18](https://large-scale-book.mathopt.com/LSCOMO.pdf) already proofs convergence for anchor ODE and APPM respectively. At least clarifying this would be helpful. - The work contextualizes the results but usually quite late. Overall contextualizing w.r.t. existing work upfront and motivating the sections. E.g. elaborate on [55] in l. 20 and explicitly say "adapt to the strong monotone modulus" in l. 221. Explicitly compare theorem 5.1 with existing results for APPM. Comments: - In terms of limitations maybe mention that the convergence results for the discretized schemes are only for implicit schemes (APPM) - I would mention existing discretization result up front (in [55] in contrast they only consider GD with anchoring and does not get $1/k^2$)

Questions

- Can we obtain convergence for explicitly schemes such as AEG/FEG? - It seems very interesting that you can adapt both to L and $\mu$. Would this work for explicit scheme? - Why distinguish between Halpern and APPM in Fig. 2 if they are equivalent? - What is $M$ in the $y$ axis of Figure 2? - FEG generalizes to cohypomonotone problems. Can anchor ODE handle cohypomonotonicity?

Rating

8: Strong Accept: Technically strong paper, with novel ideas, excellent impact on at least one area, or high-to-excellent impact on multiple areas, with excellent evaluation, resources, and reproducibility, and no unaddressed ethical considerations.

Confidence

3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.

Soundness

3 good

Presentation

3 good

Contribution

3 good

Limitations

(see comments)

Reviewer mK3f8/10 · confidence 4/52023-07-05

Summary

This paper conducts a continuous-time analysis of an acceleration method called "anchoring", where the main contributions are four-fold. The authors provided a unified analysis of the convergence rate of anchor acceleration, which includes both the constant and adaptive cases. Then the authors presented an adaptive method for anchor acceleration that is inspired by our analysis and achieves faster convergence rates than the constant method. After this, the authors proved that the adaptive method is robust to noise and can handle non-convex optimization problems. Finally, the authors provided numerical experiments that demonstrate the effectiveness of the adaptive method on various optimization problems. Overall, the paper provides a valuable contribution to the field of optimization and is in general well-written and well-presented.

Strengths

This paper provides a comprehensive analysis of the convergence rate of anchor acceleration, which includes both the constant and adaptive cases. The paper provides a clear and concise presentation of both the theoretical analysis, where I checked the technical proofs of all results with a detailed focus on Theorem 3.1 [Section E.5] and Theorem 6.2 [Section H.2] and they are solid. The idea of using the factor $\frac{2 \mu}{e^{2 \mu t}-1}$ is is new and reasonable, since for \mu-strongly convex objectives $\mu\to 0^+$ it is consistent with the standard $\frac{1}{t}$ anchoring rate (the analysis provided is significantly more general, which should be honored). The adaptive method presented in the paper is also interesting, which appears faster convergence rates than the constant method and is robust to noise and non-convex optimization problems. The paper also clearly presented numerical experiments which demonstrate the effectiveness of the adaptive method on various optimization problems.

Weaknesses

The paper assumes a certain level of mathematical background, which might be difficult for some readers unfamiliar with literature to follow. Further, the paper seems not provide a comparison of the adaptive method with other state-of-the-art optimization methods. In addition, the paper does not provide a detailed discussion of the limitations of the adaptive method and areas for future research. I have not checked but the assumptions of the adaptive method presented in the paper might be more stringent than required.

Questions

Are there some mismatches in the definition of Lyapunov functions at various places? For instance, the $V(t)$ definition in Line 133 [Corollary 3.3], when pinning $\beta = \frac{1}{t}$, and the last in Line 147 [last but one display of Section 3.1] differs by a factor of 2. These are minor, but I do encourage the authors to check them carefully. Can you provide examples of applications where anchor acceleration might be particularly useful? I understand that anchor acceleration has been discovered to be an acceleration mechanism for minimax optimization and fixed-point problems, but would anchor acceleration be useful in other optimization problems as well?

Rating

8: Strong Accept: Technically strong paper, with novel ideas, excellent impact on at least one area, or high-to-excellent impact on multiple areas, with excellent evaluation, resources, and reproducibility, and no unaddressed ethical considerations.

Confidence

4: You are confident in your assessment, but not absolutely certain. It is unlikely, but not impossible, that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work.

Soundness

4 excellent

Presentation

4 excellent

Contribution

3 good

Limitations

This is a theoretical paper and admits no negative social impacts, to my best knowledge.

Reviewer aLVj6/10 · confidence 2/52023-07-09

Summary

The paper focuses on the analysis of anchor acceleration, a recently discovered acceleration mechanism for minimax optimization and fixed-point problems. The authors provide tight and unified analyses to characterize the convergence rate of anchor acceleration and present an adaptive method inspired by continuous-time analyses. The contributions include a differential inclusion model of anchor acceleration, well-posedness analysis, convergence rate analysis with a power-law anchor coefficient, and an adaptive method for choosing the anchor coefficient.

Strengths

Given the limited understanding of the anchor acceleration mechanism compared to Nesterov acceleration, the authors aim to provide a formal and rigorous treatment of the anchored dynamics through continuous-time analyses. They also seek to gain insight into the anchor acceleration mechanism and its accelerated convergence rate. The authors present a differential inclusion model of anchor acceleration and establish its well-posedness. They analyze the convergence rate of the anchor ODE with a power-law anchor coefficient. The trade-off between the vanishing speed and the contracting speed of the anchor term is discussed. The authors also provide a proof outline of Lemma 3.4 and Theorem 3.1 to derive the convergence result. Additionally, the study presents an adaptive method for choosing the anchor coefficient based on continuous-time analyses.

Weaknesses

- Novelty of applying continuous analysis to anchor acceleration: It would be helpful for the authors to clarify the motivation behind applying continuous analysis techniques specifically to the problem of anchor acceleration. Given the existence of continuous analysis techniques, what is the significance of applying them to anchor acceleration? This clarification would strengthen the novelty of the paper. - Importance of anchor acceleration: The paper could benefit from providing a clear explanation of why anchor acceleration is important and how it differs from other acceleration mechanisms, such as Nesterov acceleration. This would help readers understand the relevance and practical implications of anchor acceleration. - Technical challenges of applying continuous analysis: Can you elaborate on the specific technical challenges encountered when applying continuous analysis to the anchor acceleration problem? Discuss any unique aspects or complexities involved in analyzing the convergence properties of anchor acceleration using continuous-time techniques?

Questions

- Can you provide more details on the motivation behind using anchor acceleration and how it differs from other acceleration mechanisms, such as Nesterov's acceleration? - Can you provide more insights into the choice of the anchor coefficient $\beta(t)$ and how it affects the convergence rate of the algorithm? - Can you provide more details on the assumptions made in the analysis and how they may affect the applicability of the proposed method to real-world problems?

Rating

6: Weak Accept: Technically solid, moderate-to-high impact paper, with no major concerns with respect to evaluation, resources, reproducibility, ethical considerations.

Confidence

2: You are willing to defend your assessment, but it is quite likely that you did not understand the central parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.

Soundness

3 good

Presentation

2 fair

Contribution

2 fair

Limitations

The authors does not seem to discuss the limitations adequately, they do mention that carrying out more advanced analyses for the anchor ODE are interesting directions of future work.

Reviewer MP6a6/10 · confidence 3/52023-07-11

Summary

The paper analyzes the dynamics of anchor acceleration using a differential inclusion. It derives a convergence rate that depends on the anchor coefficient and shows that the rate is tight using a certain instance. By discretizing the differential inclusions, the authors derive an algorithm that generalizes the state-of-the-art APPM algorithm and provide an analysis of its convergence rate. In addition, the authors propose an algorithm that adaptively varies the anchor coefficient and show its performance both theoretically and empirically.

Strengths

- Compared to existing papers that provide analysis of anchor methods through continuous-time analysis, this paper provides better convergence rates in a more general setting. - The adaptive anchor acceleration method in Section 7 is interesting, and the method is inspired by the analysis of continuous-time dynamics. It is a meaningful example of the potential of ODE analysis for optimization algorithm design.

Weaknesses

- In terms of algorithms and their theoretical analysis, the contribution of this paper does not appear to be significant. In my understanding, the main result of this paper is deriving a known convergence rate in a different way, and proposing a different algorithm that achieves the same rate as the known one. There is insufficient discussion of how the results of this paper are superior to existing studies.

Questions

- Since A is treated as a set-valued operator in "Monotone and set-valued operators" of Section 1.1, I understood that Ax in the equations in Lines 39 and 41 is a set. Then those equations involve the inner product of a point and a set in Euclidean space. Such an inner product is not clear to me. Additionally, in Line 50, A is assumed to be a differentiable operator, but the definition of the differentiability of set-valued operators is nontrivial. So, I guessed that A here is a single-valued operator. Is it correct? If so, it would be good to clarify it. - Theorem 2.2 states the uniqueness of the solution of the differential inclusion (6) rather than a differential equation. Is this a valid claim? It seems for me that there is more than one solution depending on which of the elements in A(X(t)) in equation (6) is chosen at each time t. Adding a comment on this point would facilitate the reader's understanding.

Rating

6: Weak Accept: Technically solid, moderate-to-high impact paper, with no major concerns with respect to evaluation, resources, reproducibility, ethical considerations.

Confidence

3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.

Soundness

3 good

Presentation

3 good

Contribution

2 fair

Limitations

The authors adequately addressed the limitations.

Reviewer MP6a2023-08-12

Thank you for your thorough response. The response addressed my concern. Regarding Q2, I had inadvertently overlooked the condition "absolutely continuous" in Line 59. I now agree with you that the claim of Theorem 2.2 is valid. I also understand that the observation that "anchor coefficient should be chosen to adapt to the operator's property" was obtained through the ODE analysis, and this observation is also the contribution of the paper. My score has been modified.

Reviewer mK3f2023-08-13

I appreciate the authors' informative response, and maintain my current score.

Reviewer KkKu2023-08-14

I appreciate the detailed response of the authors – I think it would be valuable to include the continuous time treatment of cohypomonotonicity if space allows. I've raised my score accordingly.

Program Chairsdecision2023-09-21

Decision

Accept (poster)

© 2026 NYSGPT2525 LLC