|
Poster
|
Thu 9:00
|
Single-pass Streaming Lower Bounds for Multi-armed Bandits Exploration with Instance-sensitive Sample Complexity
Sepehr Assadi · Chen Wang
|
|
|
Poster
|
Thu 14:00
|
Convergence for score-based generative modeling with polynomial complexity
Holden Lee · Jianfeng Lu · Yixin Tan
|
|
|
Poster
|
Wed 9:00
|
On-Demand Sampling: Learning Optimally from Multiple Distributions
Nika Haghtalab · Michael Jordan · Eric Zhao
|
|
|
Poster
|
Thu 9:00
|
Lifting the Information Ratio: An Information-Theoretic Analysis of Thompson Sampling for Contextual Bandits
Gergely Neu · Iuliia Olkhovskaia · Matteo Papini · Ludovic Schwartz
|
|
|
Poster
|
Tue 14:00
|
Near-Optimal Sample Complexity Bounds for Constrained MDPs
Sharan Vaswani · Lin Yang · Csaba Szepesvari
|
|
|
Poster
|
Tue 14:00
|
Confident Approximate Policy Iteration for Efficient Local Planning in qπ-realizable MDPs
Gellért Weisz · András György · Tadashi Kozuno · Csaba Szepesvari
|
|
|
Poster
|
Tue 14:00
|
Multi-block-Single-probe Variance Reduced Estimator for Coupled Compositional Optimization
Wei Jiang · Gang Li · Yibo Wang · Lijun Zhang · Tianbao Yang
|
|
|
Poster
|
Thu 9:00
|
A gradient sampling method with complexity guarantees for Lipschitz functions in high and low dimensions
Damek Davis · Dmitriy Drusvyatskiy · Yin Tat Lee · Swati Padmanabhan · Guanghao Ye
|
|
|
Poster
|
Tue 14:00
|
Learning Mixed Multinomial Logits with Provable Guarantees
Yiqun Hu · David Simchi-Levi · Zhenzhen Yan
|
|
|
Poster
|
Tue 14:00
|
Minimax-Optimal Multi-Agent RL in Markov Games With a Generative Model
Gen Li · Yuejie Chi · Yuting Wei · Yuxin Chen
|
|
|
Poster
|
Tue 9:00
|
Stochastic Second-Order Methods Improve Best-Known Sample Complexity of SGD for Gradient-Dominated Functions
Saeed Masiha · Saber Salehkaleybar · Niao He · Negar Kiyavash · Patrick Thiran
|
|
|
Poster
|
Wed 9:00
|
Constrained Langevin Algorithms with L-mixing External Random Variables
Yuping Zheng · Andrew Lamperski
|
|
