activity
20162026
most citedConservative Contextual Linear Bandits

45 citations · 89 across the 5 of their papers we have counts for

collaborators
Showing cs.LGShow all

7 papers · 1 filter

cs.LG2026

LLM Value Functions for Credit Assignment in Agentic RL

Kaijie Zhu, Weixiang Yan, Omar Attia +3

Reinforcement learning (RL) for large language model (LLM) agents remains challenging in long-horizon tasks with sparse outcome rewards, where assigning credit to individual action…

cs.LG2026

RLTLDR: Self-improvement by Internalizing Self-generated Feedback

Michael Kirchhof, Eleonora Gualdoni, Andrew Szot +6

The common paradigm of reinforcement learning with verifiable rewards (RLVR) is to let agents make multiple attempts at a task, and optimize towards the successful ones. This becom…

cs.LG2023

Practical Policy Optimization with Personalized Experimentation

Mia Garrard, Hanson Wang, Ben Letham +9

Many organizations measure treatment effects via an experimentation platform to evaluate the casual effect of product variations prior to full-scale deployment. However, standard e…

cs.LG2020

Multi-armed Bandits with Cost Subsidy

Deeksha Sinha, Karthik Abinav Sankararama, Abbas Kazerouni +1

In this paper, we consider a novel variant of the multi-armed bandit (MAB) problem, MAB with cost subsidy, which models many real-life applications where the learning agent has to…

cs.LG2020★ 7 cited

Active Learning for Skewed Data Sets

Abbas Kazerouni, Qi Zhao, Jing Xie +2

Consider a sequential active learning problem where, at each round, an agent selects a batch of unlabeled data points, queries their labels and updates a binary classifier. While t…

cs.LG2019

Best Arm Identification in Generalized Linear Bandits

Abbas Kazerouni, Lawrence M. Wein

Motivated by drug design, we consider the best-arm identification problem in generalized linear bandits. More specifically, we assume each arm has a vector of covariates, there is…

cs.LG2017★ 37 cited

A Tutorial on Thompson Sampling

Daniel Russo, Benjamin Van Roy, Abbas Kazerouni +2

Thompson sampling is an algorithm for online decision problems where actions are taken sequentially in a manner that must balance between exploiting what is known to maximize immed…