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<1 to full adoption.
slides for Chebyshev Rollout Schedules for Polynomial Extrapolation under Low-Order Interference
Overview
- We want the full-adoption contrast, but the experiment observes treated fractions only up to q<1.
- Low-order interference motivates a degree-β polynomial mean curve along the rollout path.
- Linear unbiased estimation becomes polynomial extrapolation from [0,q] to 1.
- 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 k≥cβ, 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 q.
- Example: a platform can expose at most 20 percent of users during the experiment, but wants the full-launch effect.
Research Question
- The econometrician chooses k+1 treated fractions 0=p0<⋯<pk=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
- Un is the finite population of n units.
- Zj is the assignment vector at rollout measurement j.
- Yˉj is the observed finite-population mean at that measurement.
- The schedule p=(p0,…,pk) records target treated fractions from 0 to q.
- The endpoint contrast is τP=mP(1)−mP(0).
At each rollout measurement j, the observed round mean is Yˉj=n−1i∈Un∑Yi(Zj). The potential outcomes Yi(Zj) depend on the contemporaneous assignment vector Zj, but not on earlier rollout steps.
Polynomial Structure
- The rollout mean curve mP(u), the mean response at treated fraction u, is assumed polynomial.
- The order β is the maximum degree of the rollout mean curve.
- In the running example, β summarizes how many low-order exposure interactions are carried by the mean path.
- Once mP is polynomial, the full-adoption contrast is a coefficient functional.
For every law P, the rollout mean curve satisfies mP(u)=ℓ=0∑βaP,ℓuℓ for all u∈[0,1].
informal · Lemma L-1 Under static rollout consistency and the degree-β mean restriction, the endpoint treatment contrast is the sum of the nonconstant polynomial coefficients.
Variance Envelope
- The variance scale σ02/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.
For every law P, every admissible schedule p, and every rollout measurement j, Varπ(Yˉj)≤nσ02.
The rollout budget and its cap satisfy 0<qmaxandq≤qmax<1.
Linear Unbiased Estimation
- We estimate τP with a weighted sum of the observed round means.
- The weights are chosen to be exact for every polynomial of degree at most β.
- The intercept weight sums to zero; every nonconstant monomial contributes one unit to the endpoint contrast.
- With at least β+1 distinct nodes, such weights exist.
informal · Lemma L-9 When k≥β and the schedule is admissible, there exists a linear weight vector that is unbiased for every degree-β 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 norm.
- The minimax design chooses the schedule with the smallest attainable amplification.
- This is the optimal-design problem behind the talk.
Let n,k,β be integers, let q∈R, and let σ02∈R. Fix a finite assignment space Ω, a finite design π on Ω, rollout assignment vectors Z0,…,Zk, round means Yˉ0,…,Yˉk, a rollout mean curve mP, polynomial coefficients aP,ℓ, and a schedule p=(p0,…,pk). Suppose that
- (Order.) 1≤β≤k.
- (Envelope scale.) σ02≥0.
- (Schedule.) p∈Sk,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β in Definition P-2.
Then Wβ(p), as defined in Definition P-3, is nonempty. Moreover, for every w∈Wβ(p), Eπ[j=0∑kwjYˉj]=mP(1)−mP(0) and Varπ(j=0∑kwjYˉj)≤nσ02(j=0∑k∣wj∣)2. For every such w, there also exists a positive semidefinite (k+1)×(k+1) matrix Γ such that Γjj≤nσ02for every j=0,…,k, and i=0∑kj=0∑kwiΓijwj=nσ02(j=0∑k∣wj∣)2. Consequently, with Aβ(⋅) and Mβ,k,q as in Definition P-5, inf⎩⎨⎧v: ∃w∈Wβ(p) with v=nσ02(j=0∑k∣wj∣)2⎭⎬⎫=nσ02Aβ(p), and inf{v: ∃p′∈Sk,q with v=nσ02Aβ(p′)}=nσ02Mβ,k,q. Finally, if p⋆∈Sk,q satisfies Aβ(p⋆)=Mβ,k,q, then for every p′∈Sk,q, nσ02Aβ(p⋆)≤nσ02Aβ(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 norm of unbiased weights equals the largest possible endpoint contrast of a degree-β polynomial bounded at the schedule nodes.
Chebyshev Schedule
- Shifted Chebyshev-Lobatto nodes put more measurements near 0 and q.
- Mechanism: use k+1 Lobatto points on [0,q], with k≥cβ.
- 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 k≥1 and q∈(0,1], the shifted Chebyshev-Lobatto schedule is admissible.
Main Result
Fix a budget cap qmax∈(0,1). There exists a constant C−(qmax)>0 such that, for every oversampling ratio c>1, there exists a constant C+(c,qmax)>0 with the following property. For every pair of integers β,k, every rollout budget q, and every schedule p, suppose that
- (Order and oversampling.) β≥1 and k≥cβ.
- (Low-budget regime.) q>0 and the low-budget cap condition of Assumption A-4 holds for (q,qmax).
- (Admissible schedule.) When p is used below, p∈Sk,q as in Definition P-1.
Then, with Aβ(⋅) and Mβ,k,q as in Definition P-5 and pCh(k,q) as in Definition P-4, Aβ(p)≥C−(qmax)(q(1+1−q)2)2β, and Aβ(pCh(k,q))≤C+(c,qmax)(q(1+1−q)2)2β. Moreover, the minimax amplification satisfies the matching two-sided bound C−(qmax)(q(1+1−q)2)2β≤Mβ,k,q≤C+(c,qmax)(q(1+1−q)2)2β.
- The base (q(1+1−q)2)2β is the unavoidable low-budget extrapolation scale under the envelope.
- Chebyshev-Lobatto placement attains this scale up to constants depending only on qmax and c.
- The schedule problem is solved at the level of the exponential rate.
Benchmarks
- Equal spacing gives a simple feasible design with exactly β+1 nodes.
- Its bound is useful as a scale comparison, since the displayed upper bound grows with β/q.
- At q=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 nodes on [0,q], amplification is at most 9(β/q)2β.
informal · Lemma L-3 At q=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 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 1 into the low-budget base.
informal · Lemma L-5 A degree-β polynomial bounded by 1 on [−1,1] is bounded at any exterior point by the corresponding Chebyshev value.
informal · Lemma L-6 With k≥cβ, values on the Lobatto grid control the full interval sup norm up to a constant depending only on c.
informal · Lemma L-7 Uniformly for 0<q≤qmax<1, the endpoint extrapolation size is controlled above and below by constants times λ(q)β.
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).
informal · Lemma L-12 With k=⌈cβ⌉, 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)(∑j∣wj∣)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-β 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 k≥cβ.
- 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.