|
Poster
|
Wed 14:00
|
Optimal Weak to Strong Learning
Kasper Green Larsen · Martin Ritzert
|
|
|
Workshop
|
|
Accelerated Riemannian Optimization: Handling Constraints to Bound Geometric Penalties
David Martinez-Rubio · Sebastian Pokutta
|
|
|
Poster
|
Wed 9:00
|
Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness
Sarah Sachs · Hedi Hadiji · Tim van Erven · Cristóbal Guzmán
|
|
|
Poster
|
|
Near-Optimal Regret Bounds for Multi-batch Reinforcement Learning
Zihan Zhang · Yuhang Jiang · Yuan Zhou · Xiangyang Ji
|
|
|
Poster
|
Thu 14:00
|
Benign Underfitting of Stochastic Gradient Descent
Tomer Koren · Roi Livni · Yishay Mansour · Uri Sherman
|
|
|
Poster
|
Wed 14:00
|
Graph Neural Network Bandits
Parnian Kassraie · Andreas Krause · Ilija Bogunovic
|
|
|
Poster
|
Wed 9:00
|
Batch Bayesian optimisation via density-ratio estimation with guarantees
Rafael Oliveira · Louis Tiao · Fabio Ramos
|
|
|
Poster
|
Wed 14:00
|
Optimal Query Complexities for Dynamic Trace Estimation
David Woodruff · Fred Zhang · Richard Zhang
|
|
|
Poster
|
Tue 9:00
|
Better Best of Both Worlds Bounds for Bandits with Switching Costs
Idan Amir · Guy Azov · Tomer Koren · Roi Livni
|
|
|
Poster
|
Tue 14:00
|
Estimating the Arc Length of the Optimal ROC Curve and Lower Bounding the Maximal AUC
Song Liu
|
|
|
Poster
|
Wed 9:00
|
A Communication-efficient Algorithm with Linear Convergence for Federated Minimax Learning
Zhenyu Sun · Ermin Wei
|
|
|
Poster
|
Tue 9:00
|
Will Bilevel Optimizers Benefit from Loops
Kaiyi Ji · Mingrui Liu · Yingbin Liang · Lei Ying
|
|
