% Key papers for Constrained and unconstrained OCO algorithms (scime atlas, https://atlas.scime.ai). Authors are not included: add them from the paper pages.

@inproceedings{icml2016_adaptive_35732,
  title = {{Adaptive Algorithms for Online Convex Optimization with Long-term Constraints}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2016},
  url = {https://proceedings.mlr.press/v48/jenatton16.html},
}

@inproceedings{neurips2018_online_57480,
  title = {{Online convex optimization for cumulative constraints}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2018},
  url = {https://nips.cc/virtual/2018/poster/11595},
}

@inproceedings{neurips2019_beyond_57950,
  title = {{Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimization}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2019},
  url = {https://nips.cc/virtual/2019/poster/14498},
}

@inproceedings{aaai2016_delay_105148,
  title = {{Delay-Tolerant Online Convex Optimization: Unified Analysis and Adaptive-Gradient Algorithms}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2016},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/10320},
}

@inproceedings{neurips2017_online_56542,
  title = {{Online Convex Optimization with Stochastic Constraints}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2017},
  url = {https://nips.cc/virtual/2017/poster/8934},
}

@inproceedings{neurips2020_online_60521,
  title = {{Online Optimization with Memory and Competitive Control}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2020},
  url = {https://nips.cc/virtual/2020/poster/17586},
}

@inproceedings{aaai2021_online_1114,
  title = {{Online Optimal Control with Affine Constraints}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2021},
  url = {https://aaai.org/papers/08527-online-optimal-control-with-affine-constraints/},
}

@inproceedings{icml2017_second_36386,
  title = {{Second-Order Kernel Online Convex Optimization with Adaptive Sketching}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2017},
  url = {https://icml.cc/virtual/2017/poster/812},
}

@inproceedings{aaai2020_efficient_102254,
  title = {{Efficient Projection-Free Online Methods with Stochastic Recursive Gradient}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2020},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/6116},
}

@inproceedings{aaai2022_safe_2689,
  title = {{Safe Online Convex Optimization with Unknown Linear Safety Constraints}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2022},
  url = {https://aaai.org/papers/06175-safe-online-convex-optimization-with-unknown-linear-safety-constraints/},
}

@inproceedings{neurips2017_online_56549,
  title = {{Online Learning with a Hint}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2017},
  url = {https://nips.cc/virtual/2017/poster/9305},
}

@inproceedings{aaai2021_projection_1203,
  title = {{Projection-free Online Learning over Strongly Convex Sets}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2021},
  url = {https://aaai.org/papers/10076-projection-free-online-learning-over-strongly-convex-sets/},
}

@inproceedings{neurips2016_online_55911,
  title = {{Online Convex Optimization with Unconstrained Domains and Losses}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2016},
  url = {https://nips.cc/virtual/2016/poster/7304},
}

@inproceedings{icml2019_matrix_37533,
  title = {{Matrix-Free Preconditioning in Online Learning}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2019},
  url = {https://icml.cc/virtual/2019/poster/3934},
}

@inproceedings{neurips2020_minimax_60324,
  title = {{Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2020},
  url = {https://nips.cc/virtual/2020/poster/18238},
}

@inproceedings{icml2021_regret_39861,
  title = {{Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraints}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2021},
  url = {https://icml.cc/virtual/2021/poster/9489},
}

@inproceedings{neurips2020_regret_60684,
  title = {{Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2020},
  url = {https://nips.cc/virtual/2020/poster/17414},
}

@inproceedings{neurips2024_optimal_72349,
  title = {{Optimal Algorithms for Online Convex Optimization with Adversarial Constraints}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2024},
  url = {https://neurips.cc/virtual/2024/poster/94999},
}

@inproceedings{aaai2023_distributed_3482,
  title = {{Distributed Projection-Free Online Learning for Smooth and Convex Losses}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2023},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/26218},
}

@inproceedings{neurips2022_online_66155,
  title = {{Online Convex Optimization with Hard Constraints: Towards the Best of Two Worlds and Beyond}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2022},
  url = {https://nips.cc/virtual/2022/poster/54814},
}

@inproceedings{aaai2024_online_6853,
  title = {{Online Submodular Maximization via Online Convex Optimization}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2024},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/29425},
}

@inproceedings{aaai2025_doubly_8803,
  title = {{Doubly-Bounded Queue for Constrained Online Learning: Keeping Pace with Dynamics of Both Loss and Constraint}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2025},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/35411},
}

@inproceedings{aaai2025_revisiting_10557,
  title = {{Revisiting Projection-Free Online Learning with Time-Varying Constraints}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2025},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/35434},
}

@inproceedings{aaai2025_safe_10661,
  title = {{Safe Online Convex Optimization with Heavy-Tailed Observation Noises}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2025},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/34357},
}

@inproceedings{icml2024_quantum_44058,
  title = {{Quantum Algorithm for Online Exp-concave Optimization}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2024},
  url = {https://icml.cc/virtual/2024/poster/34394},
}

@inproceedings{icml2024_projection_44412,
  title = {{Projection-Free Online Convex Optimization with Time-Varying Constraints}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2024},
  url = {https://icml.cc/virtual/2024/poster/34040},
}

@inproceedings{icml2025_implicit_47061,
  title = {{Implicit Riemannian Optimism with Applications to Min-Max Problems}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2025},
  url = {https://icml.cc/virtual/2025/poster/45525},
}

@inproceedings{icml2025_exploiting_47983,
  title = {{Exploiting Curvature in Online Convex Optimization with Delayed Feedback}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2025},
  url = {https://icml.cc/virtual/2025/poster/44622},
}

@inproceedings{icml2025_unconstrained_49042,
  title = {{Unconstrained Robust Online Convex Optimization}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2025},
  url = {https://icml.cc/virtual/2025/poster/43582},
}

@inproceedings{icml2026_upper_51529,
  title = {{Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2026},
  url = {https://openreview.net/forum?id=NHWsF72zPP},
}

@inproceedings{neurips2024_online_71787,
  title = {{Online Composite Optimization Between Stochastic and Adversarial Environments}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2024},
  url = {https://neurips.cc/virtual/2024/poster/95506},
}

@inproceedings{neurips2024_fast_72664,
  title = {{Fast Rates in Stochastic Online Convex Optimization by Exploiting the Curvature of Feasible Sets}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2024},
  url = {https://neurips.cc/virtual/2024/poster/94720},
}

@inproceedings{neurips2024_from_73078,
  title = {{From Linear to Linearizable Optimization: A Novel Framework with Applications to Stationary and Non-stationary DR-submodular Optimization}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2024},
  url = {https://neurips.cc/virtual/2024/poster/94350},
}

@inproceedings{neurips2024_universal_74485,
  title = {{Universal Online Convex Optimization with \$1\$ Projection per Round}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2024},
  url = {https://neurips.cc/virtual/2024/poster/93090},
}

@inproceedings{neurips2025_an_76622,
  title = {{An Ellipsoid Algorithm for Online Convex Optimization}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2025},
  url = {https://openreview.net/forum?id=LNsGnfXS2V},
}

@inproceedings{neurips2025_parameter_76670,
  title = {{Parameter-free Algorithms for the Stochastically Extended Adversarial Model}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2025},
  url = {https://openreview.net/forum?id=LuGevcG5IB},
}

@inproceedings{neurips2025_on_76912,
  title = {{On the necessity of adaptive regularisation: Optimal anytime online learning on \$boldsymbolell\_p\$-balls}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2025},
  url = {https://openreview.net/forum?id=ONc9vWkwCp},
}

@inproceedings{neurips2025_o_77894,
  title = {{\$O(sqrtT)\$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2025},
  url = {https://openreview.net/forum?id=YmbQ0qnQ76},
}

@inproceedings{neurips2025_uniform_78345,
  title = {{Uniform Wrappers: Bridging Concave to Quadratizable Functions in Online Optimization}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2025},
  url = {https://openreview.net/forum?id=dgQRSJdo6a},
}