activity
20192021
most citedSafe Reinforcement Learning with Linear Function Approximation

2 citations · 4 across the 3 of their papers we have counts for

collaborators

6 papers

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.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…

cs.LG2019

Safe Linear Thompson Sampling with Side Information

Ahmadreza Moradipari, Sanae Amani, Mahnoosh Alizadeh +1

The design and performance analysis of bandit algorithms in the presence of stage-wise safety or reliability constraints has recently garnered significant interest. In this work, w…

cs.LG2019

Linear Stochastic Bandits Under Safety Constraints

Sanae Amani, Mahnoosh Alizadeh, Christos Thrampoulidis

Bandit algorithms have various application in safety-critical systems, where it is important to respect the system constraints that rely on the bandit's unknown parameters at every…