|
Poster
|
Tue 9:00
|
The Query Complexity of Cake Cutting
Simina Branzei · Noam Nisan
|
|
|
Poster
|
Wed 14:00
|
Optimal Weak to Strong Learning
Kasper Green Larsen · Martin Ritzert
|
|
|
Poster
|
Wed 14:00
|
Optimal Query Complexities for Dynamic Trace Estimation
David Woodruff · Fred Zhang · Richard Zhang
|
|
|
Workshop
|
|
Stochastic Adaptive Regularization Method with Cubics: A High Probability Complexity Bound
Katya Scheinberg · Miaolan Xie
|
|
|
Poster
|
Tue 14:00
|
Near-Optimal Sample Complexity Bounds for Constrained MDPs
Sharan Vaswani · Lin Yang · Csaba Szepesvari
|
|
|
Poster
|
Thu 9:00
|
Single-pass Streaming Lower Bounds for Multi-armed Bandits Exploration with Instance-sensitive Sample Complexity
Sepehr Assadi · Chen Wang
|
|
|
Poster
|
Tue 14:00
|
A Projection-free Algorithm for Constrained Stochastic Multi-level Composition Optimization
Tesi Xiao · Krishnakumar Balasubramanian · Saeed Ghadimi
|
|
|
Poster
|
Tue 14:00
|
Submodular Maximization in Clean Linear Time
Wenxin Li · Moran Feldman · Ehsan Kazemi · Amin Karbasi
|
|
|
Poster
|
Wed 9:00
|
Lower Bounds and Nearly Optimal Algorithms in Distributed Learning with Communication Compression
Xinmeng Huang · Yiming Chen · Wotao Yin · Kun Yuan
|
|
|
Poster
|
Thu 9:00
|
Improved Bounds on Neural Complexity for Representing Piecewise Linear Functions
Kuan-Lin Chen · Harinath Garudadri · Bhaskar D Rao
|
|
|
Poster
|
Thu 9:00
|
Statistically Meaningful Approximation: a Case Study on Approximating Turing Machines with Transformers
Colin Wei · Yining Chen · Tengyu Ma
|
|
|
Poster
|
|
On Batch Teaching with Sample Complexity Bounded by VCD
Farnam Mansouri · Hans Simon · Adish Singla · Sandra Zilles
|
|
