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 | 37 | 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 |
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, 2725-2767, 2023 | 6 | 2023 |
Lower Bounds for Private Estimation of Gaussian Covariance Matrices under All Reasonable Parameter Regimes VS Portella, N Harvey arXiv preprint arXiv:2404.17714, 2024 | 4 | 2024 |
Continuous Prediction with Experts' Advice NJA Harvey, C Liaw, VS Portella Journal of Machine Learning Research 25 (228), 1-32, 2024 | 4* | 2024 |
Efficient and Optimal Fixed-Time Regret with Two Experts L Greenstreet, NJA Harvey, VS Portella International Conference on Algorithmic Learning Theory, 436-464, 2022 | 4 | 2022 |
Privacy, experts, and martingales: an investigation on the use of analytical tools V Sanches Portella University of British Columbia, 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 |