Online forecasting of total-variation-bounded sequences D Baby, YX Wang Advances in Neural Information Processing Systems 32, 2019 | 31 | 2019 |
Optimal dynamic regret in exp-concave online learning D Baby, YX Wang Conference on Learning Theory, 359-409, 2021 | 18 | 2021 |
Optimal dynamic regret in proper online learning with strongly convex losses and beyond D Baby, YX Wang International Conference on Artificial Intelligence and Statistics, 1805-1845, 2022 | 10 | 2022 |
Adaptive online estimation of piecewise polynomial trends D Baby, YX Wang Advances in Neural Information Processing Systems 33, 20462-20472, 2020 | 9 | 2020 |
An optimal reduction of tv-denoising to adaptive online learning D Baby, X Zhao, YX Wang International Conference on Artificial Intelligence and Statistics, 2899-2907, 2021 | 5 | 2021 |
Optimal dynamic regret in LQR control D Baby, YX Wang arXiv preprint arXiv:2206.09257, 2022 | 4 | 2022 |
Initial-state and next-state value folding JR Baumgartner, RL Kanzelman, PK NALLA, RK Gajavelly, D BABY US Patent US10621297B1, 2020 | 4 | 2020 |
Second Order Path Variationals in Non-Stationary Online Learning D Baby, YX Wang arXiv preprint arXiv:2205.01921, 2022 | | 2022 |
Dynamic Regret for Strongly Adaptive Methods and Optimality of Online KRR D Baby, H Hasson, Y Wang arXiv preprint arXiv:2111.11550, 2021 | | 2021 |
Non-Stationary Contextual Pricing with Safety Con-straints D Baby, J Xu, YX Wang | | |
Revisiting Dynamic Regret of Strongly Adaptive Methods D Baby, H Hasson, B Wang | | |
Supplementary Material for: An Optimal Reduction of TV-Denoising to Adaptive Online Learning D Baby, X Zhao, YX Wang | | |