Multi-Armed Bandits with Abstention

no code implementations • 23 Feb 2024 • Junwen Yang, Tianyuan Jin, Vincent Y. F. Tan

Our results offer valuable quantitative insights into the benefits of the abstention option, laying the groundwork for further exploration in other online decision-making problems with such an option.

Decision Making Multi-Armed Bandits

Nested Elimination: A Simple Algorithm for Best-Item Identification from Choice-Based Feedback

no code implementations • 13 Jul 2023 • Junwen Yang, Yifan Feng

NE is simple in structure, easy to implement, and has a strong theoretical guarantee for sample complexity.

Combinatorial Optimization

Optimal Clustering with Bandit Feedback

no code implementations • 9 Feb 2022 • Junwen Yang, Zixin Zhong, Vincent Y. F. Tan

This paper considers the problem of online clustering with bandit feedback.

Clustering Online Clustering

Auto-Pipeline: Synthesizing Complex Data Pipelines By-Target Using Reinforcement Learning and Search

1 code implementation • 25 Jun 2021 • Junwen Yang, Yeye He, Surajit Chaudhuri

We in this work propose to automate multiple such steps end-to-end, by synthesizing complex data pipelines with both string transformations and table-manipulation operators.

reinforcement-learning Reinforcement Learning (RL)

Minimax Optimal Fixed-Budget Best Arm Identification in Linear Bandits

no code implementations • 27 May 2021 • Junwen Yang, Vincent Y. F. Tan

We study the problem of best arm identification in linear bandits in the fixed-budget setting.