default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClaire Vernade
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]Mohammad Javad Azizi, Thang Duong, Yasin Abbasi-Yadkori, András György, Claire Vernade, Mohammad Ghavamzadeh:
Non-stationary Bandits and Meta-Learning with a Small Set of Optimal Arms. RLC 2024: 2461-2491- [e1]Claire Vernade, Daniel Hsu:
International Conference on Algorithmic Learning Theory, 25-28 February 2024, La Jolla, California, USA. Proceedings of Machine Learning Research 237, PMLR 2024 [contents] - [i23]Nicolas Nguyen, Imad Aouali, András György, Claire Vernade:
Prior-Dependent Allocations for Bayesian Fixed-Budget Best-Arm Identification in Structured Bandits. CoRR abs/2402.05878 (2024) - [i22]Onno Eberhard, Claire Vernade, Michael Muehlebach:
A Pontryagin Perspective on Reinforcement Learning. CoRR abs/2405.18100 (2024) - [i21]Mirabel Reid, Tom Sühr, Claire Vernade, Samira Samadi:
Online Decision Deferral under Budget Constraints. CoRR abs/2409.20489 (2024) - 2023
- [j1]Khimya Khetarpal, Claire Vernade, Brendan O'Donoghue, Satinder Singh, Tom Zahavy:
POMRL: No-Regret Learning-to-Plan with Increasing Horizons. Trans. Mach. Learn. Res. 2023 (2023) - [c17]Alexandre Marthe, Aurélien Garivier, Claire Vernade:
Beyond Average Return in Markov Decision Processes. NeurIPS 2023 - [i20]Alexandre Marthe, Aurélien Garivier, Claire Vernade:
Beyond Average Return in Markov Decision Processes. CoRR abs/2310.20266 (2023) - 2022
- [c16]Ian Gemp, Brian McWilliams, Claire Vernade, Thore Graepel:
EigenGame Unloaded: When playing games is better than optimizing. ICLR 2022 - [i19]Mohammad Javad Azizi, Thang Duong, Yasin Abbasi-Yadkori, András György, Claire Vernade, Mohammad Ghavamzadeh:
Non-stationary Bandits and Meta-Learning with a Small Set of Optimal Arms. CoRR abs/2202.13001 (2022) - [i18]Khimya Khetarpal, Claire Vernade, Brendan O'Donoghue, Satinder Singh, Tom Zahavy:
POMRL: No-Regret Learning-to-Plan with Increasing Horizons. CoRR abs/2212.14530 (2022) - 2021
- [c15]Ilja Kuzborskij, Claire Vernade, András György, Csaba Szepesvári:
Confident Off-Policy Evaluation and Selection through Self-Normalized Importance Weighting. AISTATS 2021: 640-648 - [c14]Johannes Kirschner, Tor Lattimore, Claire Vernade, Csaba Szepesvári:
Asymptotically Optimal Information-Directed Sampling. COLT 2021: 2777-2821 - [c13]Ian Gemp, Brian McWilliams, Claire Vernade, Thore Graepel:
EigenGame: PCA as a Nash Equilibrium. ICLR 2021 - [i17]Ian Gemp, Brian McWilliams, Claire Vernade, Thore Graepel:
EigenGame Unloaded: When playing games is better than optimizing. CoRR abs/2102.04152 (2021) - 2020
- [c12]Cindy Trinh, Emilie Kaufmann, Claire Vernade, Richard Combes:
Solving Bernoulli Rank-One Bandits with Unimodal Thompson Sampling. ALT 2020: 862-889 - [c11]Anne Gael Manegueu, Claire Vernade, Alexandra Carpentier, Michal Valko:
Stochastic bandits with arm-dependent delays. ICML 2020: 3348-3356 - [c10]Claire Vernade, Alexandra Carpentier, Tor Lattimore, Giovanni Zappella, Beyza Ermis, Michael Brückner:
Linear bandits with Stochastic Delayed Feedback. ICML 2020: 9712-9721 - [c9]Claire Vernade, András György, Timothy A. Mann:
Non-Stationary Delayed Bandits with Intermediate Observations. ICML 2020: 9722-9732 - [i16]Claire Vernade, András György, Timothy A. Mann:
Non-Stationary Bandits with Intermediate Observations. CoRR abs/2006.02119 (2020) - [i15]Anne Gael Manegueu, Claire Vernade, Alexandra Carpentier, Michal Valko:
Stochastic bandits with arm-dependent delays. CoRR abs/2006.10459 (2020) - [i14]Ilja Kuzborskij, Claire Vernade, András György, Csaba Szepesvári:
Confident Off-Policy Evaluation and Selection through Self-Normalized Importance Weighting. CoRR abs/2006.10460 (2020) - [i13]Ian Gemp, Brian McWilliams, Claire Vernade, Thore Graepel:
EigenGame: PCA as a Nash Equilibrium. CoRR abs/2010.00554 (2020) - [i12]Alexandra Carpentier, Claire Vernade, Yasin Abbasi-Yadkori:
The Elliptical Potential Lemma Revisited. CoRR abs/2010.10182 (2020) - [i11]Johannes Kirschner, Tor Lattimore, Claire Vernade, Csaba Szepesvári:
Asymptotically Optimal Information-Directed Sampling. CoRR abs/2011.05944 (2020)
2010 – 2019
- 2019
- [c8]Yoan Russac, Claire Vernade, Olivier Cappé:
Weighted Linear Bandits for Non-Stationary Environments. NeurIPS 2019: 12017-12026 - [i10]Yoan Russac, Claire Vernade, Olivier Cappé:
Weighted Linear Bandits for Non-Stationary Environments. CoRR abs/1909.09146 (2019) - [i9]Cindy Trinh, Emilie Kaufmann, Claire Vernade, Richard Combes:
Solving Bernoulli Rank-One Bandits with Unimodal Thompson Sampling. CoRR abs/1912.03074 (2019) - 2018
- [i8]Claire Vernade, Alexandra Carpentier, Giovanni Zappella, Beyza Ermis, Michael Brückner:
Contextual Bandits under Delayed Feedback. CoRR abs/1807.02089 (2018) - 2017
- [c7]Sumeet Katariya, Branislav Kveton, Csaba Szepesvári, Claire Vernade, Zheng Wen:
Stochastic Rank-1 Bandits. AISTATS 2017: 392-401 - [c6]Joon Kwon, Vianney Perchet, Claire Vernade:
Sparse Stochastic Bandits. COLT 2017: 1269-1270 - [c5]Sumeet Katariya, Branislav Kveton, Csaba Szepesvári, Claire Vernade, Zheng Wen:
Bernoulli Rank-1 Bandits for Click Feedback. IJCAI 2017: 2001-2007 - [c4]Mastane Achab
, Stéphan Clémençon, Aurélien Garivier, Anne Sabourin, Claire Vernade:
Max K-Armed Bandit: On the ExtremeHunter Algorithm and Beyond. ECML/PKDD (2) 2017: 389-404 - [c3]Claire Vernade, Olivier Cappé, Vianney Perchet:
Stochastic Bandit Models for Delayed Conversions. UAI 2017 - [i7]Sumeet Katariya, Branislav Kveton, Csaba Szepesvári, Claire Vernade, Zheng Wen:
Bernoulli Rank-1 Bandits for Click Feedback. CoRR abs/1703.06513 (2017) - [i6]Joon Kwon, Vianney Perchet, Claire Vernade:
Sparse Stochastic Bandits. CoRR abs/1706.01383 (2017) - [i5]Claire Vernade, Olivier Cappé, Vianney Perchet:
Stochastic Bandit Models for Delayed Conversions. CoRR abs/1706.09186 (2017) - [i4]Mastane Achab, Stéphan Clémençon, Aurélien Garivier, Anne Sabourin, Claire Vernade:
Max K-armed bandit: On the ExtremeHunter algorithm and beyond. CoRR abs/1707.08820 (2017) - 2016
- [c2]Paul Lagrée, Claire Vernade, Olivier Cappé:
Multiple-Play Bandits in the Position-Based Model. NIPS 2016: 1597-1605 - [i3]Paul Lagrée, Claire Vernade, Olivier Cappé:
Multiple-Play Bandits in the Position-Based Model. CoRR abs/1606.02448 (2016) - [i2]Sumeet Katariya, Branislav Kveton, Csaba Szepesvári, Claire Vernade, Zheng Wen:
Stochastic Rank-1 Bandits. CoRR abs/1608.03023 (2016) - 2015
- [c1]Claire Vernade, Olivier Cappé:
Learning from missing data using selection bias in movie recommendation. DSAA 2015: 1-9 - [i1]Claire Vernade, Olivier Cappé:
Learning From Missing Data Using Selection Bias in Movie Recommendation. CoRR abs/1509.09130 (2015)
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-11-13 23:53 CET 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:
