Kernel-based off-policy estimation without overlap: Instance optimality beyond semiparametric efficiency
Wenlong Mou, Peng Ding, Martin J. Wainwright, Peter L. Bartlett

TL;DR
This paper develops optimal estimation procedures for linear functionals in observational data settings without the strict overlap assumption, providing bounds and estimators that interpolate between semi-parametric and non-parametric rates.
Contribution
It introduces a non-asymptotic local minimax bound for linear functional estimation without overlap and proposes a simple kernel-based estimator achieving this bound.
Findings
Derived a refined minimax lower bound for estimation error.
Proposed a kernel regression estimator that attains the lower bound.
Uncovered a spectrum of convergence rates bridging classical and non-parametric theories.
Abstract
We study optimal procedures for estimating a linear functional based on observational data. In many problems of this kind, a widely used assumption is strict overlap, i.e., uniform boundedness of the importance ratio, which measures how well the observational data covers the directions of interest. When it is violated, the classical semi-parametric efficiency bound can easily become infinite, so that the instance-optimal risk depends on the function class used to model the regression function. For any convex and symmetric function class , we derive a non-asymptotic local minimax bound on the mean-squared error in estimating a broad class of linear functionals. This lower bound refines the classical semi-parametric one, and makes connections to moduli of continuity in functional estimation. When is a reproducing kernel Hilbert space, we prove that this lower…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Causal Inference Techniques · Machine Learning and Algorithms · Advanced Bandit Algorithms Research
