← Search

Dimitri Meunier

9 accepted papers

2026

Outcome-Aware Spectral Feature Learning for Instrumental Variable Regression

ICML 2026poster

We address the problem of causal effect estimation in the presence of hidden confounders using nonparametric instrumental variable (IV) regression. An established approach is to use estimators based on learned \emph{spectral features}, that is, features spanning the top singular subspaces of the ope…

Cited by 0SourceScholar
2025

Demystifying Spectral Feature Learning for Instrumental Variable Regression

NeurIPS 2025poster

We address the problem of causal effect estimation in the presence of hidden confounders, using nonparametric instrumental variable (IV) regression. A leading strategy employs \emph{spectral features} - that is, learned features spanning the top eigensubspaces of the operator linking treatments to i…

Cited by 0SourceScholar
2025

Density Ratio-Free Doubly Robust Proxy Causal Learning

NeurIPS 2025poster

We study the problem of causal function estimation in the Proxy Causal Learning (PCL) framework, where confounders are not observed but proxies for the confounders are available. Two main approaches have been proposed: outcome bridge-based and treatment bridge-based methods. In this work, we propos…

Cited by 0SourceScholar
2025

Density Ratio-based Proxy Causal Learning Without Density Ratios

AISTATS 2025poster

We address the setting of Proxy Causal Learning (PCL), which has the goal of estimating causal effects from observed data in the presence of hidden confounding. Proxy methods accomplish this task using two proxy variables related to the latent confounder: a treatment proxy (related to the treatment)…

Cited by 0SourceScholar
2025

Optimality and Adaptivity of Deep Neural Features for Instrumental Variable Regression

ICLR 2025poster

We provide a convergence analysis of \emph{deep feature instrumental variable} (DFIV) regression (Xu et al., 2021), a nonparametric approach to IV regression using data-adaptive features learned by deep neural networks in two stages. We prove that the DFIV algorithm achieves the minimax optimal lear…

Cited by 1SourcePDFScholar
2025

Regularized least squares learning with heavy-tailed noise is minimax optimal

NeurIPS 2025spotlight

This paper examines the performance of ridge regression in reproducing kernel Hilbert spaces in the presence of noise that exhibits a finite number of higher moments. We establish excess risk bounds consisting of subgaussian and polynomial terms based on the well known integral operator framework.…

Cited by 0SourceScholar
2024

Optimal Rates for Vector-Valued Spectral Regularization Learning Algorithms

NeurIPS 2024poster

We study theoretical properties of a broad class of regularized algorithms with vector-valued output. These spectral algorithms include kernel ridge regression, kernel principal component regression and various implementations of gradient descent. Our contributions are twofold. First, we rigorously…

Cited by 5SourcePDFScholar
2022

Distribution Regression with Sliced Wasserstein Kernels

ICML 2022spotlight

The problem of learning functions over spaces of probabilities - or distribution regression - is gaining significant interest in the machine learning community. The main challenge in these settings is to identify a suitable representation capturing all relevant properties of a distribution. The well…

2022

Optimal Rates for Regularized Conditional Mean Embedding Learning

NeurIPS 2022accept

We address the consistency of a kernel ridge regression estimate of the conditional mean embedding (CME), which is an embedding of the conditional distribution of $Y$ given $X$ into a target reproducing kernel Hilbert space $\mathcal{H}_Y$. The CME allows us to take conditional expectations of targ…

Cited by 57SourcePDFScholar