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

Andy Zane

dblp:372/7507 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 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
2025 A Counterfactual Semantics for Hybrid Dynamical Systems
abstract
Models of hybrid dynamical systems are widely used to answer questions about the causes and effects of dynamic events in time. Unfortunately, existing causal reasoning formalisms lack support for queries involving the dynamically triggered, discontinuous interventions that characterize hybrid dynamical systems. This mismatch can lead to ad-hoc and error-prone causal analysis workflows in practice. To bridge the gap between the needs of hybrid systems users and current causal inference capabilities, we develop a rigorous counterfactual semantics by formalizing interventions as transformations to the constraints of hybrid systems. Unlike interventions in a typical structural causal model, however, interventions in hybrid systems can easily render the model ill-posed. Thus, we identify mild conditions under which our interventions maintain solution existence, uniqueness, and measurability by making explicit connections to established hybrid systems theory. To illustrate the utility of our framework, we formalize a number of canonical causal estimands and explore a case study on the probabilities of causation with applications to fishery management. Our work simultaneously expands the modeling possibilities available to causal inference practitioners and begins to unlock decades of causality research for users of hybrid systems.
Andy Zane, Dmitry Batenkov, Rafal Urbaniak, Jeremy Zucker, Sam Witty
NeurIPS1
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
NeurIPS3