12 citations · 15 across the 4 of their papers we have counts for
4 papers
Efficient Opportunistic Approachability
Teodor Vanislavov Marinov, Mehryar Mohri, Princewill Okoroafor +2
We study the problem of opportunistic approachability: a generalization of Blackwell approachability where the learner would like to obtain stronger guarantees (i.e., approach a sm…
Pushing the Efficiency-Regret Pareto Frontier for Online Learning of Portfolios and Quantum States
Julian Zimmert, Naman Agarwal, Satyen Kale
We revisit the classical online portfolio selection problem. It is widely assumed that a trade-off between computational complexity and regret is unavoidable, with Cover's Universa…
Efficient Methods for Online Multiclass Logistic Regression
Naman Agarwal, Satyen Kale, Julian Zimmert
Multiclass logistic regression is a fundamental task in machine learning with applications in classification and boosting. Previous work (Foster et al., 2018) has highlighted the i…
Distributed Optimization of Multi-Class SVMs
Maximilian Alber, Julian Zimmert, Urun Dogan +1
Training of one-vs.-rest SVMs can be parallelized over the number of classes in a straight forward way. Given enough computational resources, one-vs.-rest SVMs can thus be trained…