1

Lasso Bandit with Compatibility Condition on Optimal Arm

We consider a stochastic sparse linear bandit problem where only a sparse subset of context features affects the expected reward …

Harin Lee, Taehyun Hwang, Min-hwan Oh

Combinatorial Neural Bandits

We consider a contextual combinatorial bandit problem where in each round a learning agent selects a subset of arms and receives …

Taehyun Hwang, Kyuwook Chai, Min-hwan Oh

Model-Based Reinforcement Learning with Multinomial Logistic Function Approximation

We study model-based reinforcement learning (RL) for episodic Markov decision processes (MDP) whose transition probability is …

Taehyun Hwang, Min-hwan Oh