default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSanae Amani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[b1]Sanae Amani:
Learning in Safety-critical, Lifelong, and Multi-agent Systems: Bandits and RL Approaches. University of California, Los Angeles, USA, 2023- [c11]Sanae Amani, Lin Yang, Ching-An Cheng:
Provably Efficient Lifelong Reinforcement Learning with Linear Representation. ICLR 2023 - [c10]Sanae Amani, Tor Lattimore, András György, Lin Yang:
Distributed Contextual Linear Bandits with Minimax Optimal Communication Cost. ICML 2023: 691-717 - [i9]Sanae Amani, Khushbu Pahwa, Vladimir Braverman, Lin F. Yang:
Scaling Distributed Multi-task Reinforcement Learning with Experience Sharing. CoRR abs/2307.05834 (2023) - 2022
- [c9]Sanae Amani, Lin F. Yang
:
Doubly Pessimistic Algorithms for Strictly Safe Off-Policy Optimization. CISS 2022: 113-118 - [i8]Sanae Amani, Tor Lattimore, András György, Lin F. Yang:
Distributed Contextual Linear Bandits with Minimax Optimal Communication Cost. CoRR abs/2205.13170 (2022) - [i7]Sanae Amani, Lin F. Yang, Ching-An Cheng:
Provably Efficient Lifelong Reinforcement Learning with Linear Function Approximation. CoRR abs/2206.00270 (2022) - 2021
- [j1]Ahmadreza Moradipari, Sanae Amani, Mahnoosh Alizadeh, Christos Thrampoulidis:
Safe Linear Thompson Sampling With Side Information. IEEE Trans. Signal Process. 69: 3755-3767 (2021) - [c8]Sanae Amani, Christos Thrampoulidis:
Decentralized Multi-Agent Linear Bandits with Safety Constraints. AAAI 2021: 6627-6635 - [c7]Ahmadreza Moradipari, Sanae Amani, Mahnoosh Alizadeh, Christos Thrampoulidis:
Safe Linear Bandits. CISS 2021: 1 - [c6]Sanae Amani, Christos Thrampoulidis, Lin Yang:
Safe Reinforcement Learning with Linear Function Approximation. ICML 2021: 243-253 - [c5]Sanae Amani, Mahnoosh Alizadeh, Christos Thrampoulidis:
Regret Bounds for Safe Gaussian Process Bandit Optimization. ISIT 2021: 527-532 - [c4]Sanae Amani, Christos Thrampoulidis:
UCB-based Algorithms for Multinomial Logistic Regression Bandits. NeurIPS 2021: 2913-2924 - [i6]Sanae Amani, Christos Thrampoulidis:
UCB-based Algorithms for Multinomial Logistic Regression Bandits. CoRR abs/2103.11489 (2021) - [i5]Sanae Amani, Christos Thrampoulidis, Lin F. Yang:
Safe Reinforcement Learning with Linear Function Approximation. CoRR abs/2106.06239 (2021) - 2020
- [c3]Sanae Amani, Mahnoosh Alizadeh, Christos Thrampoulidis:
Generalized Linear Bandits with Safety Constraints. ICASSP 2020: 3562-3566 - [c2]Sanae Amani, Mahnoosh Alizadeh, Christos Thrampoulidis:
Regret Bound for Safe Gaussian Process Bandit Optimization. L4DC 2020: 158-159 - [i4]Sanae Amani, Mahnoosh Alizadeh, Christos Thrampoulidis:
Regret Bounds for Safe Gaussian Process Bandit Optimization. CoRR abs/2005.01936 (2020) - [i3]Sanae Amani, Christos Thrampoulidis:
Decentralized Multi-Agent Linear Bandits with Safety Constraints. CoRR abs/2012.00314 (2020)
2010 – 2019
- 2019
- [c1]Sanae Amani, Mahnoosh Alizadeh, Christos Thrampoulidis:
Linear Stochastic Bandits Under Safety Constraints. NeurIPS 2019: 9252-9262 - [i2]Sanae Amani, Mahnoosh Alizadeh, Christos Thrampoulidis:
Linear Stochastic Bandits Under Safety Constraints. CoRR abs/1908.05814 (2019) - [i1]Ahmadreza Moradipari, Sanae Amani, Mahnoosh Alizadeh, Christos Thrampoulidis:
Safe Linear Thompson Sampling. CoRR abs/1911.02156 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-14 23:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
