|
Poster
|
Thu 7:30
|
Revisiting Projection-free Online Learning: the Strongly Convex Case
Ben Kretzu · Dan Garber
|
|
|
Poster
|
Tue 14:00
|
An Optimal Reduction of TV-Denoising to Adaptive Online Learning
Dheeraj Baby · Xuandong Zhao · Yu-Xiang Wang
|
|
|
Poster
|
Wed 6:00
|
On Riemannian Stochastic Approximation Schemes with Fixed Step-Size
Alain Durmus · Pablo Jiménez · Eric Moulines · Salem SAID
|
|
|
Poster
|
Thu 7:30
|
Online Sparse Reinforcement Learning
Botao Hao · Tor Lattimore · Csaba Szepesvari · Mengdi Wang
|
|
|
Poster
|
Tue 14:00
|
An Efficient Algorithm For Generalized Linear Bandit: Online Stochastic Gradient Descent and Thompson Sampling
QIN DING · Cho-Jui Hsieh · James Sharpnack
|
|
|
Poster
|
Tue 14:00
|
Differentially Private Online Submodular Maximization
Sebastian Perez-Salazar · Rachel Cummings
|
|
|
Poster
|
Wed 12:45
|
Toward a General Theory of Online Selective Sampling: Trading Off Mistakes and Queries
Steve Hanneke · Liu Yang
|
|
|
Oral
|
Thu 15:30
|
Misspecification in Prediction Problems and Robustness via Improper Learning
Annie Marsden · John Duchi · Gregory Valiant
|
|
|
Poster
|
Tue 14:00
|
Active Online Learning with Hidden Shifting Domains
Yining Chen · Haipeng Luo · Tengyu Ma · Chicheng Zhang
|
|
|
Poster
|
Wed 6:00
|
The Sample Complexity of Level Set Approximation
Francois Bachoc · Tommaso Cesari · Sébastien Gerchinovitz
|
|
|
Poster
|
Wed 12:45
|
Power of Hints for Online Learning with Movement Costs
Aditya Bhaskara · Ashok Cutkosky · Ravi Kumar · Manish Purohit
|
|
|
Poster
|
Tue 14:00
|
Misspecification in Prediction Problems and Robustness via Improper Learning
Annie Marsden · John Duchi · Gregory Valiant
|
|
