Research map / Optimization / Optimizers
Information-constrained optimization: can adaptive processing of gradients help?
Jayadev Acharya, Clement Louis Canonne, Prathamesh Mayekar, Himanshu Tyagi
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Private Adaptive Gradient Methods for Convex Optimization (ICML 2021 · similarity 0.89)
- Adaptive Gradient Methods for Constrained Convex Optimization and Variational Inequalities (AAAI 2021 · similarity 0.88)
- A Study of First-Order Methods with a Deterministic Relative-Error Gradient Oracle (ICML 2024 · similarity 0.87)
- Private (Stochastic) Non-Convex Optimization Revisited: Second-Order Stationary Points and Excess Risks (NeurIPS 2023 · similarity 0.87)
- Information Complexity of Stochastic Convex Optimization: Applications to Generalization, Memorization, and Tracing (ICML 2024 · similarity 0.86)
- A Universal Transfer Theorem for Convex Optimization Algorithms Using Inexact First-order Oracles (ICML 2024 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
