Oliver Hinder

14 papers · 2017–2026 · 4 venues · across top CS/AI venues

Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.

Achievements

Jump to papers ↓

+5 more ↓

🌍 Conference Polyglot · Bronze 🏃 Academic Marathon · Sprint 🗺️ Taxonomy Completionist (18) 🌉 Interdisciplinary Bridge · Bronze 🏆 Keyword Champion (4)

🔬 Deep Specialist (10) 🧬 Topic Evolution 🗃️ Keyword Collector (71) 🔥 Unstoppable · Bronze 💎 Century Club · Bronze

Venues

COLT (6) NeurIPS (5) ICML (2) JMLR (1)

Top co-authors

Yair Carmon (7) Itai Kreisler (2) Maor Ivgi (2) John C. Duchi (2) Aaron Sidford (2) Rudy R Bunel (1) Nimit Sohoni (1) Srinadh Bhojanapalli (1) Haihao Lu (1) Mateo Diaz (1)

Research topics

Mathematics & Optimization (12) Optimization (12) Machine Learning (11) Optimization & Theory · Machine Learning (11) Deep Learning (3) Optimization & Theory · Deep Learning (3) Mathematics (1)

Keywords

stochastic convex optimization (6) convex optimization (4) parameter-free optimization (4) non-convex optimization (3) adaptive optimization (2) stochastic gradient descent (2) high probability guarantee (2) stationary point (2) regret bound (2) gradient descent (2) first-order method (2) matrix completion (1) sample complexity (1) parameter-free algorithm (1) positive semidefinite matrix (1) positive semidefinite matrices (1) accelerated optimization (1) model selection (1) cutting plane method (1) linear programming (1)

Papers

Clipping the Price of Adaptivity at the Tail COLT 2026 The Sample Complexity of Parameter-Free Stochastic Convex Optimization JMLR 2026 Accelerated Parameter-Free Stochastic Optimization COLT 2024 The Price of Adaptivity in Stochastic Convex Optimization COLT 2024 Datasets and Benchmarks for Nanophotonic Structure and Parametric Design Simulations NeurIPS 2023 DoG is SGD’s Best Friend: A Parameter-Free Dynamic Step Size Schedule ICML 2023 A consistently adaptive trust-region method NeurIPS 2022 Making SGD Parameter-Free COLT 2022 Practical Large-Scale Linear Programming using Primal-Dual Hybrid Gradient NeurIPS 2021 An efficient nonconvex reformulation of stagewise convex optimization problems NeurIPS 2020 Conic Descent and its Application to Memory-efficient Optimization over Positive Semidefinite Matrices NeurIPS 2020 Near-Optimal Methods for Minimizing Star-Convex Functions and Beyond COLT 2020 Cutting plane methods can be extended into nonconvex optimization COLT 2018 “Convex Until Proven Guilty”: Dimension-Free Acceleration of Gradient Descent on Non-Convex Functions ICML 2017