Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Blanchard, Moise
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Computational Complexity Data Structures and Algorithms Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2404.06720