activity
20212025
most citedA Simple and Optimal Policy Design with Safety against Heavy-Tailed Risk for Stochastic Bandits

1 citations · 2 across the 6 of their papers we have counts for

collaborators

6 papers

cs.LG2025

From Confounding to Learning: Dynamic Service Fee Pricing on Third-Party Platforms

Rui Ai, David Simchi-Levi, Feng Zhu

We study the pricing behavior of third-party platforms facing strategic agents. Assuming the platform is a revenue maximizer, it observes market features that generally affect dema…

stat.ME2024

Online Resource Allocation with Average Budget Constraints

Ruicheng Ao, Hongyu Chen, David Simchi-Levi +1

We consider the problem of online resource allocation with average budget constraints. At each time point the decision maker makes an irrevocable decision of whether to accept or r…

stat.ML2023

Regret Distribution in Stochastic Bandits: Optimal Trade-off between Expectation and Tail Risk

David Simchi-Levi, Zeyu Zheng, Feng Zhu

We study the optimal trade-off between expectation and tail risk for regret distribution in the stochastic multi-armed bandit model. We fully characterize the interplay among three…

cs.DC2023

ABS: Adaptive Bounded Staleness Converges Faster and Communicates Less

Qiao Tan, Feng Zhu, Jingjing Zhang

Wall-clock convergence time and communication rounds are critical performance metrics in distributed learning with parameter-server setting. While synchronous methods converge fast…

stat.ML2022★ 1 cited

A Simple and Optimal Policy Design with Safety against Heavy-Tailed Risk for Stochastic Bandits

David Simchi-Levi, Zeyu Zheng, Feng Zhu

We study the stochastic multi-armed bandit problem and design new policies that enjoy both worst-case optimality for expected regret and light-tailed risk for regret distribution.…

stat.ML2021★ 1 cited

Offline Planning and Online Learning under Recovering Rewards

David Simchi-Levi, Zeyu Zheng, Feng Zhu

Motivated by emerging applications such as live-streaming e-commerce, promotions and recommendations, we introduce and solve a general class of non-stationary multi-armed bandit pr…