CausalSmith · seminar slides

Chebyshev Schedules for Low-Budget Rollouts

With a polynomial rollout mean curve and a sharp round-mean variance envelope, Chebyshev-Lobatto measurement fractions attain the minimax exponential variance-amplification rate for extrapolating from partial rollout q<1q<1 to full adoption.

Overview

  • We want the full-adoption contrast, but the experiment observes treated fractions only up to q<1q<1.
  • Low-order interference motivates a degree-β\beta polynomial mean curve along the rollout path.
  • Linear unbiased estimation becomes polynomial extrapolation from [0,q][0,q] to 11.
  • Under the variance envelope, schedule quality is exactly a weight-amplification problem.
  • Chebyshev-Lobatto schedules attain the minimax amplification rate up to constants.

informal · Theorem T-2 Under low-budget rollout and oversampling kcβk\ge c\beta, Chebyshev-Lobatto schedules have amplification at most the same exponential order that every admissible schedule must face.

Motivation

  • Rollout experiments often stop before universal adoption.
  • In networked settings, partial adoption can still move outcomes through spillovers.
  • The target is the endpoint contrast between no adoption and full adoption.
  • The design question is where to measure along the rollout path before the budget qq.
  • Example: a platform can expose at most 20 percent of users during the experiment, but wants the full-launch effect.
No adoption rollout fraction 0 Measurement rounds along rollout path before budget q Budget q rollout stops before universal adoption Spillovers partial adoption moves outcomes Extrapolation from 0 through q to target 1 Full adoption target fraction 1 Endpoint contrast no vs full adoption
illustrative Box-and-arrow schematic showing rollout fractions from 0 through intermediate measurement rounds to budget q, followed by extrapolation to the full-adoption target 1.

Research Question

  • The econometrician chooses k+1k+1 treated fractions 0=p0<<pk=q0=p_0<\cdots<p_k=q.
  • At each fraction, we observe a finite-population round mean.
  • We combine the round means linearly to estimate the endpoint contrast.
  • The question is: which measurement fractions minimize worst-case variance amplification?

Setup

  • UnU_n is the finite population of nn units.
  • ZjZ_j is the assignment vector at rollout measurement jj.
  • Yˉj\bar Y_j is the observed finite-population mean at that measurement.
  • The schedule p=(p0,,pk)p=(p_0,\ldots,p_k) records target treated fractions from 0 to qq.
  • The endpoint contrast is τP=mP(1)mP(0)\tau_P=m_P(1)-m_P(0).
Assumption A-1 (Static Rollout Consistency)

At each rollout measurement jj, the observed round mean is Yˉj=n1iUnYi(Zj). \bar Y_j = n^{-1}\sum_{i\in U_n} Y_i(Z_j). The potential outcomes Yi(Zj)Y_i(Z_j) depend on the contemporaneous assignment vector ZjZ_j, but not on earlier rollout steps.

Polynomial Structure

  • The rollout mean curve mP(u)m_P(u), the mean response at treated fraction uu, is assumed polynomial.
  • The order β\beta is the maximum degree of the rollout mean curve.
  • In the running example, β\beta summarizes how many low-order exposure interactions are carried by the mean path.
  • Once mPm_P is polynomial, the full-adoption contrast is a coefficient functional.
Assumption A-2 (Polynomial Rollout Mean)

For every law PP, the rollout mean curve satisfies mP(u)==0βaP,u m_P(u)=\sum_{\ell=0}^{\beta} a_{P,\ell}u^\ell for all u[0,1]u\in[0,1].

informal · Lemma L-1 Under static rollout consistency and the degree-β\beta mean restriction, the endpoint treatment contrast is the sum of the nonconstant polynomial coefficients.

Variance Envelope

  • The variance scale σ02/n\sigma_0^2/n bounds each round mean.
  • The envelope allows any positive-semidefinite cross-round covariance matrix consistent with that diagonal bound.
  • This isolates the cost of treated-fraction placement from model-specific covariance restrictions.
  • In the platform example, the condition is read as a common bound on the noise of each rollout mean.
Assumption A-3 (Round-Mean Variance Envelope)

For every law PP, every admissible schedule pp, and every rollout measurement jj, Varπ(Yˉj)σ02n. \operatorname{Var}_\pi(\bar Y_j)\le \frac{\sigma_0^2}{n}.

Assumption A-4 (Low-Budget Cap)

The rollout budget and its cap satisfy 0<qmaxandqqmax<1. 0<q_{\max}\quad\text{and}\quad q\le q_{\max}<1.

Linear Unbiased Estimation

  • We estimate τP\tau_P with a weighted sum of the observed round means.
  • The weights are chosen to be exact for every polynomial of degree at most β\beta.
  • The intercept weight sums to zero; every nonconstant monomial contributes one unit to the endpoint contrast.
  • With at least β+1\beta+1 distinct nodes, such weights exist.

informal · Lemma L-9 When kβk\ge\beta and the schedule is admissible, there exists a linear weight vector that is unbiased for every degree-β\beta rollout mean curve.

Design Criterion

  • The variance envelope turns risk into the squared total variation of the weights.
  • A fixed schedule is good when it admits unbiased weights with small 1\ell^1 norm.
  • The minimax design chooses the schedule with the smallest attainable amplification.
  • This is the optimal-design problem behind the talk.
Theorem T-1 (TV Envelope Design Bound)

Let n,k,βn,k,\beta be integers, let qRq\in\mathbb R, and let σ02R\sigma_0^2\in\mathbb R. Fix a finite assignment space Ω\Omega, a finite design π\pi on Ω\Omega, rollout assignment vectors Z0,,ZkZ_0,\ldots,Z_k, round means Yˉ0,,Yˉk\bar Y_0,\ldots,\bar Y_k, a rollout mean curve mPm_P, polynomial coefficients aP,a_{P,\ell}, and a schedule p=(p0,,pk)p=(p_0,\ldots,p_k). Suppose that

  • (Order.) 1βk1\le \beta\le k.
  • (Envelope scale.) σ020\sigma_0^2\ge 0.
  • (Schedule.) pSk,qp\in S_{k,q}, in the sense of Definition P-1.
  • (Law class.) The design, rollout variables, round means, mean curve, coefficients, envelope scale, and schedule satisfy the rollout law-class restrictions Pβ\mathcal P_\beta in Definition P-2.

Then Wβ(p)W_\beta(p), as defined in Definition P-3, is nonempty. Moreover, for every wWβ(p)w\in W_\beta(p), Eπ ⁣[j=0kwjYˉj]=mP(1)mP(0) \mathbb E_\pi\!\left[\sum_{j=0}^k w_j\bar Y_j\right]=m_P(1)-m_P(0) and Varπ ⁣(j=0kwjYˉj)σ02n(j=0kwj)2. \operatorname{Var}_\pi\!\left(\sum_{j=0}^k w_j\bar Y_j\right) \le \frac{\sigma_0^2}{n}\left(\sum_{j=0}^k |w_j|\right)^2 . For every such ww, there also exists a positive semidefinite (k+1)×(k+1)(k+1)\times(k+1) matrix Γ\Gamma such that Γjjσ02nfor every j=0,,k, \Gamma_{jj}\le \frac{\sigma_0^2}{n}\quad\text{for every }j=0,\ldots,k, and i=0kj=0kwiΓijwj=σ02n(j=0kwj)2. \sum_{i=0}^k\sum_{j=0}^k w_i\Gamma_{ij}w_j = \frac{\sigma_0^2}{n}\left(\sum_{j=0}^k |w_j|\right)^2 . Consequently, with Aβ()A_\beta(\cdot) and Mβ,k,qM_{\beta,k,q} as in Definition P-5, inf{v: wWβ(p) with v=σ02n(j=0kwj)2}=σ02nAβ(p), \inf\left\{ v:\ \exists w\in W_\beta(p)\text{ with } v=\frac{\sigma_0^2}{n}\left(\sum_{j=0}^k |w_j|\right)^2 \right\} = \frac{\sigma_0^2}{n}A_\beta(p), and inf{v: pSk,q with v=σ02nAβ(p)}=σ02nMβ,k,q. \inf\left\{ v:\ \exists p'\in S_{k,q}\text{ with } v=\frac{\sigma_0^2}{n}A_\beta(p') \right\} = \frac{\sigma_0^2}{n}M_{\beta,k,q}. Finally, if pSk,qp^\star\in S_{k,q} satisfies Aβ(p)=Mβ,k,q, A_\beta(p^\star)=M_{\beta,k,q}, then for every pSk,qp'\in S_{k,q}, σ02nAβ(p)σ02nAβ(p). \frac{\sigma_0^2}{n}A_\beta(p^\star) \le \frac{\sigma_0^2}{n}A_\beta(p').

Key Idea

  • Polynomial extrapolation is controlled by the largest endpoint movement compatible with bounded values at the observed nodes.
  • Weight minimization and polynomial extremality are dual views of the same object.
  • Chebyshev polynomials are extremal for this endpoint problem.
  • Lobatto nodes discretize the interval while preserving that extremal control under oversampling.

informal · Lemma L-4 The minimum 1\ell^1 norm of unbiased weights equals the largest possible endpoint contrast of a degree-β\beta polynomial bounded at the schedule nodes.

Chebyshev Schedule

  • Shifted Chebyshev-Lobatto nodes put more measurements near 0 and qq.
  • Mechanism: use k+1k+1 Lobatto points on [0,q][0,q], with kcβk\ge c\beta.
  • Intuition: endpoint clustering controls the polynomial near the observed interval boundaries, where extrapolation to 1 is most sensitive.
  • In the running example, this means spending more measurement rounds near no adoption and near the maximum feasible rollout.

informal · Lemma L-8 For every k1k\ge1 and q(0,1]q\in(0,1], the shifted Chebyshev-Lobatto schedule is admissible.

Budget interval 0 to q observed range Lobatto nodes shifted Chebyshev endpoint-dense Schedule pᶜʰ_j(k,q) more end rounds Oversampling k ≥ cβ discrete control Unbiased weights construction from measurements Extrapolation endpoint to 1 polynomial target Minimax amplification base ((1+√(1−q))²/q) exponent 2β
illustrative Box-and-arrow schematic from the budget interval [0,q][0,q] through endpoint-dense shifted Chebyshev--Lobatto nodes and oversampling kcβk\ge c\beta to unbiased weights, endpoint extrapolation, and the minimax amplification scale.

Main Result

Theorem T-2 (Chebyshev Minimax Amplification)

Fix a budget cap qmax(0,1)q_{\max}\in(0,1). There exists a constant C(qmax)>0C_-(q_{\max})>0 such that, for every oversampling ratio c>1c>1, there exists a constant C+(c,qmax)>0C_+(c,q_{\max})>0 with the following property. For every pair of integers β,k\beta,k, every rollout budget qq, and every schedule pp, suppose that

  • (Order and oversampling.) β1\beta\ge 1 and kcβk\ge c\beta.
  • (Low-budget regime.) q>0q>0 and the low-budget cap condition of Assumption A-4 holds for (q,qmax)(q,q_{\max}).
  • (Admissible schedule.) When pp is used below, pSk,qp\in S_{k,q} as in Definition P-1.

Then, with Aβ()A_\beta(\cdot) and Mβ,k,qM_{\beta,k,q} as in Definition P-5 and pCh(k,q)p^{\mathrm{Ch}}(k,q) as in Definition P-4, Aβ(p)C(qmax)((1+1q)2q)2β, A_\beta(p) \ge C_-(q_{\max}) \left(\frac{(1+\sqrt{1-q})^2}{q}\right)^{2\beta}, and Aβ ⁣(pCh(k,q))C+(c,qmax)((1+1q)2q)2β. A_\beta\!\left(p^{\mathrm{Ch}}(k,q)\right) \le C_+(c,q_{\max}) \left(\frac{(1+\sqrt{1-q})^2}{q}\right)^{2\beta}. Moreover, the minimax amplification satisfies the matching two-sided bound C(qmax)((1+1q)2q)2βMβ,k,qC+(c,qmax)((1+1q)2q)2β. C_-(q_{\max}) \left(\frac{(1+\sqrt{1-q})^2}{q}\right)^{2\beta} \le M_{\beta,k,q} \le C_+(c,q_{\max}) \left(\frac{(1+\sqrt{1-q})^2}{q}\right)^{2\beta}.

  • The base ((1+1q)2q)2β\left(\frac{(1+\sqrt{1-q})^2}{q}\right)^{2\beta} is the unavoidable low-budget extrapolation scale under the envelope.
  • Chebyshev-Lobatto placement attains this scale up to constants depending only on qmaxq_{\max} and cc.
  • The schedule problem is solved at the level of the exponential rate.

Benchmarks

  • Equal spacing gives a simple feasible design with exactly β+1\beta+1 nodes.
  • Its bound is useful as a scale comparison, since the displayed upper bound grows with β/q\beta/q.
  • At q=1q=1, extrapolation disappears and the endpoint rule has bounded amplification.
  • These benchmarks separate feasibility from minimax low-budget control.

informal · Lemma L-2 For equally spaced β+1\beta+1 nodes on [0,q][0,q], amplification is at most 9(β/q)2β9(\beta/q)^{2\beta}.

informal · Lemma L-3 At q=1q=1, the baseline and final round means give an unbiased endpoint contrast with amplification at most 4.

Proof Sketch

  • The envelope theorem reduces variance to 1\ell^1 weight amplification.
  • Duality converts weight amplification into an extremal polynomial problem.
  • Chebyshev extremality gives the lower bound any schedule must respect.
  • Oversampled Lobatto norming transfers continuous Chebyshev control to the finite measurement grid.
  • The endpoint bound converts the exterior point 11 into the low-budget base.

informal · Lemma L-5 A degree-β\beta polynomial bounded by 1 on [1,1][-1,1] is bounded at any exterior point by the corresponding Chebyshev value.

informal · Lemma L-6 With kcβk\ge c\beta, values on the Lobatto grid control the full interval sup norm up to a constant depending only on cc.

informal · Lemma L-7 Uniformly for 0<qqmax<10<q\le q_{\max}<1, the endpoint extrapolation size is controlled above and below by constants times λ(q)β\lambda(q)^\beta.

Exact Covariance

  • The envelope problem allows all positive-semidefinite covariance matrices with the same diagonal bound.
  • The exact nested rollout problem uses the covariance matrix generated by the rollout law.
  • The envelope comparison gives an exact-risk upper bound at every admissible schedule.
  • Chebyshev-Lobatto schedules therefore give a feasible finite-population exact-risk rate.

informal · Lemma L-11 For every admissible schedule, the exact nested risk is at most the envelope amplification bound (σ02/n)Aβ(p)(\sigma_0^2/n)A_\beta(p).

informal · Lemma L-12 With k=cβk=\lceil c\beta\rceil, the Chebyshev-Lobatto schedule has exact finite-population variance at most the same low-budget exponential upper rate as in the envelope theorem.

Also in the Paper

informal · Lemma L-10 The round-mean variance envelope yields the (σ02/n)(jwj)2(\sigma_0^2/n)(\sum_j |w_j|)^2 upper bound, and a positive-semidefinite covariance matrix attains that value.

informal · Definition P-7 The exact covariance question asks whether Chebyshev-Lobatto placement attains the nested exact-risk infimum, separately from the proved rate-feasibility bound.

Related Literature

  • Rubin (1974) and Imbens and Rubin (2015) frame the potential-outcomes baseline.
  • Manski (1993, 2013) motivates spillovers and social interactions as identification targets.
  • Horvitz and Thompson (1952) provide the linear-unbiased design template.
  • Aronow and Samii (2017), Sävje et al. (2017), Eckles et al. (2017), and Ugander et al. (2013) develop design-based interference tools.
  • Cortez et al. (2022), Cortez-Rodriguez et al. (2022), Cortez-Rodriguez et al. (2024), Eichhorn et al. (2024), Jiang and Wang (2023), Cai et al. (2023), and Fan et al. (2025) develop the low-order and network-interference design lineage.
  • Smith (1918), Kiefer and Wolfowitz (1959), Kiefer (1974), Pukelsheim (1993), and Karlin and Studden (1966) supply the optimal-design and Chebyshev-system foundation.

Conclusion

  • We turn low-budget rollout placement into a polynomial extrapolation design problem.
  • Under static rollout consistency, degree-β\beta polynomial means, and the round-mean variance envelope, worst-case variance equals a total-variation amplification criterion.
  • Chebyshev-Lobatto schedules attain the minimax low-budget exponential rate when kcβk\ge c\beta.
  • For the exact nested rollout covariance problem, the same schedule is proved rate-feasible through the envelope upper bound.
  • The remaining design question is covariance-specific exact optimality for the true nested rollout risk.