default search action
Aurélien Bibaut
Person information
- affiliation: Netflix
- affiliation: University of California, Berkeley, Division of Biostatistics, Ca, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c7]Allen Tran, Aurélien Bibaut, Nathan Kallus:
Inferring the Long-Term Causal Effects of Long-Term Treatments from Short-Term Experiments. ICML 2024 - [c6]Aurélien Bibaut
, Winston Chou
Learning the Covariance of Treatment Effects Across Many Weak Experiments. KDD 2024: 153-162 - 2021
- [b1]Aurélien F. Bibaut:
Statistical methods for causal inference fromsequentially collected data and sequential decisionmaking. University of California, Berkeley, USA, 2021 - [c5]Aurélien Bibaut, Nathan Kallus, Maria Dimakopoulou, Antoine Chambaz, Mark J. van der Laan:
Risk Minimization from Adaptively Collected Data: Guarantees for Supervised and Policy Learning. NeurIPS 2021: 19261-19273 - [c4]Aurélien Bibaut, Maria Dimakopoulou, Nathan Kallus, Antoine Chambaz, Mark J. van der Laan:
Post-Contextual-Bandit Inference. NeurIPS 2021: 28548-28559 - [i7]Ivana Malenica, Aurélien Bibaut, Mark J. van der Laan:
Adaptive Sequential Design for a Single Time-Series. CoRR abs/2102.00102 (2021) - [i6]Aurélien Bibaut, Antoine Chambaz
Post-Contextual-Bandit Inference. CoRR abs/2106.00418 (2021) - [i5]Aurélien Bibaut, Antoine Chambaz, Maria Dimakopoulou, Nathan Kallus, Mark J. van der Laan:
Risk Minimization from Adaptively Collected Data: Guarantees for Supervised and Policy Learning. CoRR abs/2106.01723 (2021) - 2020
- [c3]Aurélien Bibaut, Antoine Chambaz, Mark J. van der Laan:
Generalized Policy Elimination: an efficient algorithm for Nonparametric Contextual Bandits. UAI 2020: 1099-1108 - [i4]Aurélien F. Bibaut, Antoine Chambaz
Generalized Policy Elimination: an efficient algorithm for Nonparametric Contextual Bandits. CoRR abs/2003.02873 (2020) - [i3]Aurélien F. Bibaut, Antoine Chambaz, Mark J. van der Laan:
Rate-adaptive model selection over a collection of black-box contextual bandit algorithms. CoRR abs/2006.03632 (2020)
2010 – 2019
- 2019
- [c2]Aurélien Bibaut, Ivana Malenica, Nikos Vlassis, Mark J. van der Laan:
More Efficient Off-Policy Evaluation through Regularized Targeted Learning. ICML 2019: 654-663 - [c1]Nikos Vlassis, Aurélien Bibaut, Maria Dimakopoulou, Tony Jebara:
On the Design of Estimators for Bandit Off-Policy Evaluation. ICML 2019: 6468-6476 - [i2]Aurélien F. Bibaut, Ivana Malenica, Nikos Vlassis, Mark J. van der Laan:
More Efficient Off-Policy Evaluation through Regularized Targeted Learning. CoRR abs/1912.06292 (2019) - 2017
- [i1]Cheng Ju, Aurélien Bibaut, Mark J. van der Laan:
The Relative Performance of Ensemble Methods with Deep Convolutional Neural Networks for Image Classification. CoRR abs/1704.01664 (2017)
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-21 23:41 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: