Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functions

Lijun Zhang 0005, Guanghui Wang 0006, Wei-Wei Tu, Wei Jiang, Zhi-Hua Zhou. Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functions. In Marc'Aurelio Ranzato, Alina Beygelzimer, Yann N. Dauphin, Percy Liang, Jennifer Wortman Vaughan, editors, Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual. pages 24968-24980, 2021. [doi]

@inproceedings{ZhangWTJZ21,
  title = {Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functions},
  author = {Lijun Zhang 0005 and Guanghui Wang 0006 and Wei-Wei Tu and Wei Jiang and Zhi-Hua Zhou},
  year = {2021},
  url = {https://proceedings.neurips.cc/paper/2021/hash/d1588e685562af341ff2448de4b674d1-Abstract.html},
  researchr = {https://researchr.org/publication/ZhangWTJZ21},
  cites = {0},
  citedby = {0},
  pages = {24968-24980},
  booktitle = {Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual},
  editor = {Marc'Aurelio Ranzato and Alina Beygelzimer and Yann N. Dauphin and Percy Liang and Jennifer Wortman Vaughan},
}