Online Non-Convex Learning: Following the Perturbed Leader is Optimal

19 March 2019

Papers citing "Online Non-Convex Learning: Following the Perturbed Leader is Optimal"

11 / 11 papers shown

Title
Investigating Large Language Models in Diagnosing Students' Cognitive Skills in Math Problem-solving Hyoungwook Jin Yoonsu Kim Dongyun Jung Seungju Kim Kiyoon Choi J. Son Juho Kim LRM 62 0 0 01 Apr 2025
Distributed Online Non-convex Optimization with Composite Regret Zhanhong Jiang Aditya Balu Xian Yeow Lee Young M. Lee C. Hegde S. Sarkar 41 4 0 21 Sep 2022
A Unifying Framework for Online Optimization with Long-Term Constraints Matteo Castiglioni A. Celli A. Marchesi Giulia Romano N. Gatti 23 34 0 15 Sep 2022
Online Low Rank Matrix Completion Prateek Jain S. Pal 42 9 0 08 Sep 2022
Optimistic No-regret Algorithms for Discrete Caching N. Mhaisen Abhishek Sinha G. Paschos Georgios Iosifidis 36 11 0 15 Aug 2022
Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods Davoud Ataee Tarzanagh Parvin Nazari Bojian Hou Li Shen Laura Balzano 49 10 0 06 Jul 2022
Building Robust Ensembles via Margin Boosting Dinghuai Zhang Hongyang R. Zhang Aaron Courville Yoshua Bengio Pradeep Ravikumar A. Suggala AAML UQCV 48 15 0 07 Jun 2022
An Online Learning Approach to Interpolation and Extrapolation in Domain Generalization Elan Rosenfeld Pradeep Ravikumar Andrej Risteski 31 34 0 25 Feb 2021
LeadCache: Regret-Optimal Caching in Networks Debjit Paria Abhishek Sinha 26 25 0 17 Sep 2020
New Oracle-Efficient Algorithms for Private Synthetic Data Release G. Vietri Grace Tian Mark Bun Thomas Steinke Zhiwei Steven Wu SyDa 88 75 0 10 Jul 2020
Follow the Perturbed Leader: Optimism and Fast Parallel Algorithms for Smooth Minimax Games A. Suggala Praneeth Netrapalli 19 15 0 13 Jun 2020