Edvard Bakhitov

dblp:324/3461 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
—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 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 1 · 1 first-author · 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.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 61% Kernel, tree and ensemble methods · 39%

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

TopicWeightPapersLastEvidence papers
Computational social science and digital humanities › causal inference
interference
1.012026
Experimentation on Endogenous Graphs · AAAI 2026
Computational social science and digital humanities › online controlled experiments
network experimentation
1.012026
Experimentation on Endogenous Graphs · AAAI 2026
Mathematical optimization
causal inference
1.012026
Experimentation on Endogenous Graphs · AAAI 2026
Mathematical optimization › causal inference
treatment effect estimation
1.012026
Experimentation on Endogenous Graphs · AAAI 2026
Machine learning › Probabilistic and Bayesian machine learning
causal inference
0.612022
Causal Gradient Boosting: Boosted Instrumental Variable Regression · EC 2022
Machine learning › Kernel, tree and ensemble methods
gradient boosting
0.612022
Causal Gradient Boosting: Boosted Instrumental Variable Regression · EC 2022
Machine learning › Probabilistic and Bayesian machine learning › causal inference
instrumental variable regression
0.612022
Causal Gradient Boosting: Boosted Instrumental Variable Regression · EC 2022
Machine learning › Kernel, tree and ensemble methods › ensemble learning
boosting
0.212022
Causal Gradient Boosting: Boosted Instrumental Variable Regression · EC 2022

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

graph interference modeling · 2.0asymptotic normality · 2.0two-stage least squares · 0.6instrumental variable regression · 0.6gradient boosting · 0.6
YearPublicationVenuePosition
2026 Experimentation on Endogenous Graphs
abstract
We study experimentation under endogenous network interference. Interference patterns are mediated by an endogenous graph, where edges can be formed or eliminated as a result of treatment. We show that conventional estimators are biased in these circumstances, and present a class of unbiased, consistent and asymptotically normal estimators of total treatment effects in the presence of such interference. We show via simulation that our estimator outperforms existing estimators in the literature. Our results apply both to bipartite experimentation, in which the units of analysis and measurement differ, and the standard network experimentation case, in which they are the same.
Edvard Bakhitov, Dominic Coey
AAAI2
2022 Causal Gradient Boosting: Boosted Instrumental Variable Regression
abstract
Recent advances in the literature have demonstrated that standard supervised learning algorithms are ill-suited for problems with endogenous explanatory variables. To correct for this, many variants of nonparameteric instrumental variable regression methods have been developed. In this paper, we propose an alternative algorithm called boostIV that builds on the traditional gradient boosting algorithm and corrects for the endogeneity bias. The algorithm is very intuitive and resembles an iterative version of the standard 2SLS estimator. The proposed estimator is data driven and does not require any functional form approximation assumptions besides specifying a weak learner. We demonstrate that our estimator is consistent under mild conditions. We carry out extensive Monte Carlo simulations to demonstrate the finite sample performance of our algorithm compared to other recently developed methods. We show that boostIV is at worst on par with the existing methods and on average significantly outperforms them.
Edvard Bakhitov
EC1