Online mirror descent and dual averaging: keeping pace in the dynamic case H Fang, NJA Harvey, VS Portella, MP Friedlander Journal of Machine Learning Research 23 (121), 1-38, 2022 | 27 | 2022 |
Regret bounds without Lipschitz continuity: online learning with relative-Lipschitz losses Y Zhou, V Sanches Portella, M Schmidt, N Harvey Advances in Neural Information Processing Systems 33, 2020 | 22 | 2020 |
Continuous Prediction with Experts' Advice VS Portella, C Liaw, NJA Harvey arXiv preprint arXiv:2206.00236, 2022 | 3 | 2022 |
Efficient and Optimal Fixed-Time Regret with Two Experts L Greenstreet, NJA Harvey, VS Portella International Conference on Algorithmic Learning Theory, 436-464, 2022 | 3 | 2022 |
Searching for optimal per-coordinate step-sizes with multidimensional backtracking F Kunstner, V Sanches Portella, M Schmidt, N Harvey Advances in Neural Information Processing Systems 36, 2024 | 2 | 2024 |
Lower Bounds for Private Estimation of Gaussian Covariance Matrices under All Reasonable Parameter Regimes VS Portella, N Harvey arXiv preprint arXiv:2404.17714, 2024 | | 2024 |
Online convex optimization: algorithms, learning, and duality VS Portella Universidade de São Paulo, 2019 | | 2019 |
Almost Linear Time Algorithms for Flows in Graphs VS Portella | | 2016 |