Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Elias Bingham

dblp:396/5499 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Trustworthy machine learning · 50% Learning theory · 25% Probabilistic and Bayesian machine learning · 25%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › causal machine learning
debiased machine learning
0.812024
Automated Efficient Estimation using Monte Carlo Efficient Influence Functions · NeurIPS 2024
Machine learning › Trustworthy machine learning › causal machine learning
double machine learning
0.812024
Automated Efficient Estimation using Monte Carlo Efficient Influence Functions · NeurIPS 2024
Machine learning › Probabilistic and Bayesian machine learning
efficient influence function
0.812024
Automated Efficient Estimation using Monte Carlo Efficient Influence Functions · NeurIPS 2024
Machine learning › Learning theory
statistical estimation
0.812024
Automated Efficient Estimation using Monte Carlo Efficient Influence Functions · NeurIPS 2024

Methods — techniques the papers use, named apart from their topics

targeted minimum loss estimation · 1.5monte carlo estimation · 1.5influence functions · 0.8influence function · 0.8
YearPublicationVenuePosition
2024 Automated Efficient Estimation using Monte Carlo Efficient Influence Functions
abstract
Many practical problems involve estimating low dimensional statistical quantities with high-dimensional models and datasets. Several approaches address these estimation tasks based on the theory of influence functions, such as debiased/double ML or targeted minimum loss estimation. We introduce \textit{Monte Carlo Efficient Influence Functions} (MC-EIF), a fully automated technique for approximating efficient influence functions that integrates seamlessly with existing differentiable probabilistic programming systems. MC-EIF automates efficient statistical estimation for a broad class of models and functionals that previously required rigorous custom analysis. We prove that MC-EIF is consistent, and that estimators using MC-EIF achieve optimal $\sqrt{N}$ convergence rates. We show empirically that estimators using MC-EIF are at parity with estimators using analytic EIFs. Finally, we present a novel capstone example using MC-EIF for optimal portfolio selection.
Raj Agrawal, Sam Witty, Andy Zane, Elias Bingham
NeurIPS4