Fetching the paper…
Reading the bibliography…
We consider the setting of online logistic regression and consider the regret with respect to the 2-ball of radius B.
Marteau-Ferey, U., Ostrovskii, D., Bach, F., and Rudi, A. (2019) · 1902
Earlier work this paper cites.
Mourtada, J. and Gaïffas, S. (2019) · 1912
Earlier work this paper cites.
Application of the logistic function to bio-assay
Berkson, J. (1944) · 1944
Earlier work this paper cites.
Theory of reproducing kernels
Aronszajn, N. (1950) · 1950
Earlier work this paper cites.
On weak learning
Helmbold, D. P. and Warmuth, M. K. (1995) · 1995
Earlier work this paper cites.
A game of prediction with expert advice
Vovk, V. (1998) · 1998
Earlier work this paper cites.
Relative loss bounds for on-line density estimation with the exponential family of distributions
Azoury, K. S. and Warmuth, M. K. (2001) · 2001
Earlier work this paper cites.
Competitive on-line statistics
Vovk, V. (2001) · 2001
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
Zinkevich, M. (2003) · 2003
Cited alongside, same era.
Prediction, learning, and games
Cesa-Bianchi, N. and Lugosi, G. (2006) · 2006
Cited alongside, same era.
Logarithmic regret algorithms for online convex optimization
Hazan, E., Agarwal, A., and Kale, S. (2007) · 2007
Cited alongside, same era.
Follow-the-regularized-leader and mirror descent: Equivalence theorems and l1 regularization
McMahan, H. B. (2011) · 2011
Cited alongside, same era.
Matrix computations
Golub, G. H. and Van Loan, C. F. (2012) · 2012
Cited alongside, same era.
Logistic regression: Tight bounds for stochastic and online optimization
Hazan, E., Koren, T., and Levy, K. Y. (2014) · 2014
Cited alongside, same era.
Introduction to online convex optimization
Hazan, E. et al. (2016) · 2016
Later among the works it cites.
Fast rates with high probability in exp-concave statistical learning
Mehta, N. A. (2016) · 2016
Later among the works it cites.
Efficient second-order online kernel learning with adaptive embedding
Calandriello, D., Lazaric, A., and Valko, M. (2017) · 2017
Later among the works it cites.
Sampling from a log-concave distribution with projected langevin monte carlo
Bubeck, S., Eldan, R., and Lehec, J. (2018) · 2018
Later among the works it cites.
Logistic regression: The importance of being improper
Foster, D. J., Kale, S., Luo, H., Mohri, M., and Sridharan, K. (2018) · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Convex optimization: Algorithms and complexity
Bubeck, S. et al. (2015) · 2015
Cited alongside, same era.
Gaillard, P., Gerchinovitz, S., Huard, M., and Stoltz, G. (2018) · 2018
Later among the works it cites.
Efficient online learning with kernels for adversarial large scale problems
Jézéquel, R., Gaillard, P., and Rudi, A. (2019) · 2019
Later among the works it cites.