~/talk

Counterfactual Inference For Sequential Experiment Design

Talkat Learning from Interventions 2022 · 2022-02-14..02-17· [machine-learning]
links:none on file
slides:none on file

A policy-agnostic nearest-neighbor estimator treats each treatment as an N-by-T matrix and reduces counterfactuals to sequential matrix completion, proving consistency under a bilinear latent-factor model and a central limit theorem (normal fluctuations at rate sqrt(N_neighbors)) for Lipschitz nonlinearity at the final time. Requirements are lower-bounded sampling probabilities, diverse time factors, non-adversarial noise and slow adaptive changes (a small gamma term). Tuning uses cross-validation and a preprint is on arXiv.

AI-written summary · about

  1. 0:00Introduction
  2. 1:23Setup
  3. 4:13Outline
  4. 7:09Reduction
  5. 8:17Approximation
  6. 10:42Latent Factor Model
  7. 20:30Central Limit Theorem
  8. 23:55Expected squared error bound
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.