default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBlair L. Bilodeau
Person information
- affiliation: University of Toronto, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c4]Robert Geirhos, Roland S. Zimmermann, Blair L. Bilodeau, Wieland Brendel, Been Kim:
Don't trust your eyes: on the (un)reliability of feature visualizations. ICML 2024- 2023
- [i6]Robert Geirhos, Roland S. Zimmermann, Blair L. Bilodeau, Wieland Brendel, Been Kim:
Don't trust your eyes: on the (un)reliability of feature visualizations. CoRR abs/2306.04719 (2023) - 2022
- [j2]Blair L. Bilodeau
, David A. Stanford:
High-priority expected waiting times in the delayed accumulating priority queue with applications to health care KPIs. INFOR Inf. Syst. Oper. Res. 60(3): 285-314 (2022) - [c3]Blair L. Bilodeau, Linbo Wang, Daniel M. Roy:
Adaptively Exploiting d-Separators with Causal Bandits. NeurIPS 2022 - [i5]Blair L. Bilodeau, Linbo Wang, Daniel M. Roy:
Adaptively Exploiting d-Separators with Causal Bandits. CoRR abs/2202.05100 (2022) - [i4]Blair L. Bilodeau, Natasha Jaques, Pang Wei Koh, Been Kim:
Impossibility Theorems for Feature Attribution. CoRR abs/2212.11870 (2022) - 2021
- [c2]Jeffrey Negrea, Blair L. Bilodeau, Nicolò Campolongo, Francesco Orabona, Daniel M. Roy:
Minimax Optimal Quantile and Semi-Adversarial Regret via Root-Logarithmic Regularizers. NeurIPS 2021: 26237-26249 - [i3]Jeffrey Negrea, Blair L. Bilodeau, Nicolò Campolongo, Francesco Orabona, Daniel M. Roy:
Minimax Optimal Quantile and Semi-Adversarial Regret via Root-Logarithmic Regularizers. CoRR abs/2110.14804 (2021) - 2020
- [j1]Blair L. Bilodeau, David A. Stanford, Mark Goldszmidt, Andrew Appleton:
Simulated co-location of patients admitted to an inpatient internal medicine teaching unit: potential impacts on efficiency and physician-nurse collaboration. INFOR Inf. Syst. Oper. Res. 58(1): 109-123 (2020) - [c1]Blair L. Bilodeau, Dylan J. Foster, Daniel M. Roy:
Tight Bounds on Minimax Regret under Logarithmic Loss via Self-Concordance. ICML 2020: 919-929 - [i2]Blair L. Bilodeau, Dylan J. Foster, Daniel M. Roy:
Improved Bounds on Minimax Regret under Logarithmic Loss via Self-Concordance. CoRR abs/2007.01160 (2020) - [i1]Blair L. Bilodeau, Jeffrey Negrea, Daniel M. Roy:
Relaxing the I.I.D. Assumption: Adaptive Minimax Optimal Sequential Prediction with Expert Advice. CoRR abs/2007.06552 (2020)
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-04 00:29 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:
