|
Poster
|
Thu 9:00
|
Nearly-Tight Bounds for Testing Histogram Distributions
Clément L Canonne · Ilias Diakonikolas · Daniel Kane · Sihan Liu
|
|
|
Poster
|
Thu 14:00
|
Faster Linear Algebra for Distance Matrices
Piotr Indyk · Sandeep Silwal
|
|
|
Poster
|
Wed 14:00
|
Algorithms and Hardness for Learning Linear Thresholds from Label Proportions
Rishi Saket
|
|
|
Workshop
|
|
The Trade-offs of Incremental Linearization Algorithms for Nonsmooth Composite Problems
Krishna Pillutla · Vincent Roulet · Sham Kakade · Zaid Harchaoui
|
|
|
Poster
|
Wed 9:00
|
A Communication-efficient Algorithm with Linear Convergence for Federated Minimax Learning
Zhenyu Sun · Ermin Wei
|
|
|
Poster
|
Tue 14:00
|
Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions
Jiafan He · Dongruo Zhou · Tong Zhang · Quanquan Gu
|
|
|
Poster
|
Wed 14:00
|
A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits
Jiafan He · Tianhao Wang · Yifei Min · Quanquan Gu
|
|
|
Poster
|
Thu 14:00
|
DGD^2: A Linearly Convergent Distributed Algorithm For High-dimensional Statistical Recovery
Marie Maros · Gesualdo Scutari
|
|
|
Poster
|
Tue 9:00
|
Collaborative Linear Bandits with Adversarial Agents: Near-Optimal Regret Bounds
Aritra Mitra · Arman Adibi · George J. Pappas · Hamed Hassani
|
|
|
Poster
|
Wed 14:00
|
Learning-Augmented Algorithms for Online Linear and Semidefinite Programming
Elena Grigorescu · Young-San Lin · Sandeep Silwal · Maoyuan Song · Samson Zhou
|
|
|
Poster
|
Tue 9:00
|
Group Meritocratic Fairness in Linear Contextual Bandits
Riccardo Grazzi · Arya Akhavan · John IF Falk · Leonardo Cella · Massimiliano Pontil
|
|
|
Poster
|
Tue 9:00
|
An Algorithm for Learning Switched Linear Dynamics from Data
Guillaume Berger · Monal Narasimhamurthy · Kandai Watanabe · Morteza Lahijanian · Sriram Sankaranarayanan
|
|
