1 citations · 1 across the 12 of their papers we have counts for
4 papers · 1 filter
Variance-Adaptive Optimal Algorithm for Reinforcement Learning with Multinomial Logit Function Approximation
Wonyoung Kim, Min-Hwan Oh, Garud Iyengar +1
Reinforcement learning with multinomial logistic (MNL) function approximation has become an important framework due to its flexibility and broad applicability. While existing studi…
The Cost of Learning Under Multiple Change Points
Tomer Gafni, Garud Iyengar, Assaf Zeevi
We consider an online learning problem in environments with multiple change points. In contrast to the single change point problem that is widely studied using classical "high conf…
Linear Bandits with Partially Observable Features
Wonyoung Kim, Sungwoo Park, Garud Iyengar +2
We study the linear bandit problem that accounts for partially observable features. Without proper handling, unobserved features can lead to linear regret in the decision horizon $…
A Doubly Robust Approach to Sparse Reinforcement Learning
Wonyoung Kim, Garud Iyengar, Assaf Zeevi
We propose a new regret minimization algorithm for episodic sparse linear Markov decision process (SMDP) where the state-transition distribution is a linear function of observed fe…