activity
20192022
most citedStage-wise Conservative Linear Bandits

6 citations · 10 across the 5 of their papers we have counts for

collaborators

8 papers

cs.LG2022

Multi-Environment Meta-Learning in Stochastic Linear Bandits

Ahmadreza Moradipari, Mohammad Ghavamzadeh, Taha Rajabzadeh +2

In this work we investigate meta-learning (or learning-to-learn) approaches in multi-task linear stochastic bandit problems that can originate from multiple environments. Inspired…

cs.LG20212 cited

Safe Reinforcement Learning with Linear Function Approximation

Sanae Amani, Christos Thrampoulidis, Lin F. Yang

Safety in reinforcement learning has become increasingly important in recent years. Yet, existing solutions either fail to strictly avoid choosing unsafe actions, which may lead to…

cs.LG20211 cited

UCB-based Algorithms for Multinomial Logistic Regression Bandits

Sanae Amani, Christos Thrampoulidis

Out of the rich family of generalized linear bandits, perhaps the most well studied ones are logisitc bandits that are used in problems with binary rewards: for instance, when the…

cs.LG20201 cited

Decentralized Multi-Agent Linear Bandits with Safety Constraints

Sanae Amani, Christos Thrampoulidis

We study decentralized stochastic linear bandits, where a network of agents acts cooperatively to efficiently solve a linear bandit-optimization problem over a -dimensional…

cs.LG20206 cited

Stage-wise Conservative Linear Bandits

Ahmadreza Moradipari, Christos Thrampoulidis, Mahnoosh Alizadeh

We study stage-wise conservative linear stochastic bandits: an instance of bandit optimization, which accounts for (unknown) safety constraints that appear in applications such as…

cs.LG2020

Regret Bounds for Safe Gaussian Process Bandit Optimization

Sanae Amani, Mahnoosh Alizadeh, Christos Thrampoulidis

Many applications require a learner to make sequential decisions given uncertainty regarding both the system's payoff function and safety constraints. In safety-critical systems, i…