The Impact of Noise on Evaluation Complexity: The Deterministic Trust-Region Case
Not on the map. Why?
Abstract (arXiv)
Intrinsic noise in objective function and derivatives evaluations may cause premature termination of optimization algorithms. Evaluation complexity bounds taking this situation into account are presented in the framework of a deterministic trust-region method. The results show that the presence of intrinsic noise may dominate these bounds, in contrast with what is known for methods in which the inexactness in function and derivatives' evaluations is fully controllable. Moreover, the new analysis provides estimates of the optimality level achievable, should noise cause early termination. It finally sheds some light on the impact of inexact computer arithmetic on evaluation complexity.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 6 Apr 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 1; 2026: 1.
4 papers.
- 2025Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimizationcited by 3
- 2023Stochastic Ratios Tracking Algorithm for Large Scale Machine Learning Problemscited by 1
- 2024A Trust-Region Algorithm for Noisy Equality Constrained Optimizationcited by 1
- 2026Layer-Parallel Training for Transformerscited by 1
- 2026Layer-Parallel Training for Transformers13 Jan 2026
- 2025Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimization15 Jul 2025
- 2024A Trust-Region Algorithm for Noisy Equality Constrained Optimization4 Nov 2024
- 2023Stochastic Ratios Tracking Algorithm for Large Scale Machine Learning Problems17 May 2023