- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This work applies Riemannian optimization with adaptive moments to iterative learning control, where the goal is to satisfy the surface constraints by keeping the input while learning to improve the tracking error by incorporating past tracking errors. The authors propose to use an adaptive Riemannian method with momentum (Algorithm 1) applied to the input product manifold obtained from the system output being conditioned on staying on a fixed surface. Further the work established theoretical guarantees on the convergence of iterate-gradient of the proposed method (Theorem 1) and avoidance of saddle points (Theorem 2) under certain technical assumptions. Finally the authors provide experimental results in terms of simulations and a physical (real world) experiment to support their learning control method.
Critical strengths
None
Critical weaknesses
-
Main issue: The authors assume in (2.4) to have access to a ideal (product) manifold of inputs which guarantee that the outputs stay within a prescribed surface . However, the entire reason to use ILC (as opposed to feedforward control) in practice is precisely because one does not have an accurate (enough) model of the system. The authors do not account for this possibility in their theory and experiments (both simulated and physical), i.e. they try to correct a tracking error mismatch due to imperfect information, but assume perfect information (by assuming access to , its tangent spaces, etc). The simulated experiments use this ideal manifold, while the physical experiment does not show the true off-surface error.
The reviewer cannot think of a real situation where would be perfectly available, but a system model is too inaccurate to track a reference via feedforward control (solved offline) and plant inversion techniques, nor do the authors provide such an example. The physical system in this paper is not such an example, since we do not know for the real world SO101 robot and surface (as opposed to its Mujoco model). -
The core contribution of this paper is a straightforward application of existing results in Riemannian Adaptive Optimization Methods to the well-established area of iterative learning control or a slight extension of these. While an application of one domain to another can lead to fruitful synergies, it is not the case here due to first issue (1) for this paper. In particular, the adaptive algorithm that the authors use was already proposed in [1] (cited by the paper itself) and some theoretical contributions (Theorem 1) have been already established for the Euclidean case in the work [2]. E.g. in [2, Theorem 11, Theorem 9] the Euclidean version of Theorem 1 was shown under a similar assumption [2, Assumption 1] as in this work. The Theorem 1 in this work seems to be a Riemannian extension of these due to the fact that scalar factors commute with parallel transport (see formula on top of page 17). The current work does not separate the technical novelty from [1, 2] sufficiently well.
-
The reviewer fails to see how Theorem 1 and Theorem 2 are relevant for ILC. While avoidance of saddle points is important for optimization, for ILC it is crucial that the input sequence converges itself, which Theorem 1 does not establish. Therefore it is unclear in how far the current theory supports the experimental observations.
-
The experiments are not sufficiently diverse and informative: They consist entirely of a single system with the same surface constraint. While this is understandable for the physical robot (where experiments are time-consuming and costly), the authors should have provided more diverse simulated situations (e.g. different robots and surfaces) and additionally distinguish between the input manifold for the true system and the system model (see core issue (1)) for both simulation and physical experiment. Further, the physical experiment lacks the plot of the crucial off-surface error (which has to be measured somehow).
Questions for authors
Please see questions raised in "weaknesses"
Thank you for asking what R-ILC needs to know about the plant.
Eq. (2.4) asks for inputs known to keep nominal outputs on the surface. A cylindrical guide fixes the pen radius R mechanically. Its references (R,θ,z) have tangent directions (0,δθ,δz) for any angular servo delay d. The pen reaches θt−d at time t. Two drives can share the exact manifold and tangents yet need different command advances to track on time. The measured lag tells us how far to advance the next stroke. On a guided CNC axis, Wang and Hsiao [4] used motor and table measurements to learn positioning corrections.
For our arm, nominal pen kinematics and the ellipsoid define M (Appendix E.1). If the modeled patch is within δS of the workpiece and tip bias and execution noise are bounded by δF and σ, the triangle inequality bounds true tip-to-workpiece distance by δS+δF+σ for every nominally feasible sample.
Transported momentum and factorwise scaling come from [1], whose regret bounds concern geodesically convex losses. Our nonconvex trial loss couples neighboring samples (Appendix E.2). Theorem 1 extends the Euclidean stationarity and rate results in the preprint of [2] (Theorems 9 and 11) to the trial-input manifold. Commutation transports the previous scale. Lemma 7 also bounds the momentum-alignment error from the changing gradient along the update geodesic by O(ηk−1). This and the scale-change error O(1−θk) (Lemma 5) are summable after weighting by ηk.
For Theorem 2, [3] gives a Riemannian precedent for saddle avoidance. Lemma 12 absorbs the leading momentum term into an auxiliary iterate. Appendix D verifies that under Assumption 3 the noise excites the unstable subspace of the joint recursion for this iterate and the second moment.
A single limiting input requires additional structure. Lemma 3 gives d(uk+1,uk)≤Bstepηk→0. Theorem 1 drives the gradient norm to zero, so even the best feasible direction offers vanishing first-order gain in expected tracking loss. If the iterates stay in a compact set with continuous gradient and finitely many stationary inputs, these facts imply a single limit. Under its extra assumptions, Theorem 2 gives zero probability of settling at any member of a prescribed finite or countable set of strict saddles.
The recorded inputs settled as tracking improved. For the triangle, RMS change per joint and sample fell from 0.0329 rad (trials 1–2) to 0.000284 rad (9–10), while tracking RMSE fell from 20.24 to 0.106 mm. At all three starts the last input change was below 1% of the first.
We varied initialization on one SO-ARM101 and one ellipsoid. For the triangle, circle and scaled heart, final RMSE was 0.106, 0.0593 and 0.0499 mm with R-ILC versus 1.047, 0.812 and 0.754 mm with PD-ILC. Transfer to other robots or surfaces remains open. The same simulated kinematics define the manifold and evaluate the tip, so Pk<2.6×10−12 m over 30 trials measures nominal surface deviation.
On hardware the arm replayed the simulation-learned input as a fixed reference. Figure 3A shows the resulting heart. A physical off-surface plot requires 3-D tip positions registered to the workpiece throughout the stroke. Only the simulations recorded those positions.
We offset only the simulated base. From shared target IK, nine updates cut tracking RMSE Ek by about 76% at each offset. RMS shortest distance Dk to the fixed workpiece fell by 23.6–28.1%, to 0.155–0.650 mm at stroke 10.
References
[1] Bécigneul and Ganea. Riemannian Adaptive Optimization Methods. ICLR, 2019.
[2] Liang et al. Machine Learning, 2025. Published article. 2023 version.
[3] Hsieh et al. Riemannian stochastic optimization methods avoid strict saddle points. NeurIPS, 2023.
[4] Wang and Hsiao. Sensors, 2024. Feed-drive experiments, §5.