atlas

Research map / Probabilistic and scientific modeling / Treatment effects

Optimistic Algorithms for Adaptive Estimation of the Average Treatment Effect

ICML 2025 · Probabilistic and scientific modeling › Treatment effects · approach: Meta-learners and partial identification · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes OPTrack, an optimistic adaptive allocation algorithm for ATE estimation with AIPW that plays the feasible allocation closest to 1/2 under a confidence sequence for the Neyman allocation, achieving logarithmic Neyman regret.

Problem

Adaptive estimation of the average treatment effect with finite-sample guarantees, where prior adaptive methods either are asymptotic, use suboptimal IPW estimators, or incur linear Neyman regret.

Approach

Use the AIPW (A2IPW) estimator and an optimism principle: play the allocation closest to 1/2 among those consistent with a confidence sequence for the Neyman allocation, and define Neyman regret against the minimum variance over all estimator-allocation pairs, yielding logarithmic regret.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use optimistic policy tracking: select the feasible Neyman allocation closest to 1/2, with adaptive AIPW reward estimatesAdaptive ATE estimation · Bernoulli ATE simulations, six problem instances; small Tnormalized MSE (T · MSE): 10-15 percent improvementHelped
Use optimistic policy tracking instead of clipping-based allocation trackingAdaptive ATE estimation · Bernoulli ATE simulations, six problem instancesnormalized MSE (T · MSE)Helped
Use optimistic policy tracking instead of reward estimation oracle allocationAdaptive ATE estimation · Some problem instances with moderate Neyman allocationnormalized MSE (T · MSE)Mixed
Use optimistic policy tracking instead of clipping-based allocation trackingAdaptive ATE estimation · Bernoulli ATE simulations, larger Tnormalized MSE (T · MSE)No clear effect
Use ClipSMT or ClipOGD rather than an estimator-and-allocation method that attains the minimum varianceAdaptive ATE estimation · Adaptive ATE estimationNeyman regret: linear Neyman regretHurt

Surprising findings

Limitations

Experimental setup

Benchmarks: simulated Bernoulli bandit instances (6 problem instances, T from 100 to 2000)

Metrics: normalized MSE (T * MSE) Neyman regret

Baselines: ClipSDT Reward estimation oracle (Neyman allocation with sequentially estimated reward) Neyman allocation oracle with true reward

Builds on: A2IPW ClipSDT ClipSMT ClipOGD

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy