Outcome-free Records and the Minimax Precision of Conditional Treatment Effect Estimation
The verified characterization makes a substantial theoretical contribution with careful scope control, but extensive repetition and formal bookkeeping require substantial editorial restructuring for journal publication.
- Global; estimation; sharp precision; appendices The manuscript repeatedly defines identical rates and decisions, restates parameter lists and rate branches, and explains arguments before presenting them again in deferred proofs. The acquisition proposition reproduces much of the sharp-frontier theorem, while the appendix separates supporting arguments from main proofs with an intervening verification note. Extensive constant construction and elementary bookkeeping make the statistical ideas difficult to locate.
5 findings — 1 major · 3 minor · 1 nit Read the entire review →
- Submitted
- 2 Oct 2026 (v1) · last revised 4 Oct 2026 (v7)
- Cite as
-
CSWP-2026-035· https://causalsmith.org/papers/stat_twosample_pointcate_annotation_frontier_v1/
@techreport{causalsmith_stat_twosample_pointcate_annotation_frontier_v1,
title = {Outcome-free records and the minimax precision of conditional treatment effect estimation},
author = {{CausalSmith}},
year = {2026},
month = oct,
institution = {CausalSmith Working Papers},
number = {CSWP-2026-035},
url = {https://causalsmith.org/papers/stat_twosample_pointcate_annotation_frontier_v1/},
note = {Version 7, revised 4 Oct 2026. Machine-generated; formal statements verified in Lean 4 at commit 44d8edc}
} https://causalsmith.org/papers/stat_twosample_pointcate_annotation_frontier_v1/ Cites version 7 of 4 Oct 2026. Abstract
We characterize the value of outcome-free covariate-treatment records for estimating a conditional average treatment effect at the center of the unit covariate cube. The experiment combines independent labeled and outcome-free samples from a common population. Under a known uniform covariate design, conditional exchangeability, a public overlap level with propensity values in , binary responses with arm means in , and public Hölder regularity, we establish the sharp minimax expected absolute-error rate uniformly over labeled counts of at least two and every nonnegative auxiliary count. The propensity and control-mean smoothness orders lie in , the contrast smoothness order lies in , and the common public Hölder radius satisfies . The rate is the maximum of a labeled-sample term and a term involving the product of labeled and total treatment-record counts. A guarded local polynomial estimator with a rectangular projection correction attains this rate. The matching lower bound combines fixed-size mixtures of the original records, which govern the product-of-counts regime, with a two-hypothesis bound under a supplied propensity, which gives the labeled-sample floor. The characterization yields necessary and sufficient sample-growth conditions for attaining the supplied-propensity order and for improving strictly over labeled records alone. It also gives simultaneous acquisition requirements on response labels and total treatment records for a target error scale. The rate exponents do not depend on , while the comparison constants may depend on it together with the other fixed public parameters.
Introduction
This paper establishes a sharp pointwise precision benchmark for conditional average treatment effect estimation when responses are observed on a smaller collection of records than covariates and treatment assignments. We consider , the labeled-record count, and , the independent outcome-free covariate-treatment record count. For the specified potential-outcome class in Definition 3, with known uniform covariate design and the public parameter restrictions stated below, the minimax expected absolute error is where is the covariate dimension, and are the Hölder smoothness orders of the propensity, control response mean, and causal contrast, respectively. The target is the conditional causal contrast at the cube’s center. The comparison holds uniformly over both record counts, with constants depending on the fixed public class parameters. A fully specified decision based on the observed records attains this order, as established in Theorem 2.
The model fixes the covariate distribution to be uniform on , with , and assumes conditional treatment exchangeability. Treatment and potential responses are binary. For a fixed public , the propensity lies in , and both potential-response means lie in throughout the cube. The public smoothness orders satisfy and , with , the common public Hölder radius, satisfying . These restrictions define the primitive law class in Definition 3; the independent, common-population record blocks follow Assumption 9. Admissible conditional-margin witnesses satisfy the restrictions over the whole cube. Their continuous contrast, together with full-support design and the identifying assumptions, determines the point target uniquely from the observed law.
The distinction between record types has a direct acquisition interpretation. Response ascertainment through chart review can yield labeled records containing covariates, treatment, and the true response, while routine records supply covariates and treatment. Surrogate-assisted treatment-effect estimation provides a related electronic-record setting (Cheng et al., 2021). Within the present sampling model, adding a new independent labeled record changes to . Labeling one already-counted outcome-free record changes the composition to at fixed total count; if the record index is fixed in advance, or chosen by a randomization independent of all records, the resulting dataset follows the stated sampling law at . Adding a new outcome-free record changes to . The sharp risk formula benchmarks these sample compositions under the stated independent-sampling assumptions.
The estimator combines a coarse local polynomial fit with a finer projection correction. It splits the original records into independent outcome and treatment roles, whose sizes are proportional to the labeled and total treatment-record counts. A rectangular average across these roles corrects the local estimating moments for the unknown nuisance functions. An empirical eigenvalue guard and clipping produce a finite Borel decision for every dataset. Under the stated model conditions, Theorem 1 bounds its risk by effect approximation, nuisance approximation, localized response sampling, and rectangular sampling terms. Public tuning balances these terms to attain the sharp rate.
The matching lower bound retains the original fixed-size observation experiment. The construction in Theorem 4 couples propensity and response perturbations while preserving identical auxiliary-only mixture laws across hypotheses. Its information bound supplies the nuisance converse in Lemma 6 over the range where the product-of-counts term governs precision. The supplied-propensity comparison in Theorem 3 establishes the labeled-sample order over the same primitive class and every auxiliary count. Together, these lower bounds and the attaining estimator give the uniform minimax characterization, including randomized decisions.
The characterization distinguishes strict improvement from attainment of the supplied-propensity order. Write , the combined nuisance smoothness, and let denote the smoothness threshold and the total-record growth exponent: At and above the threshold, labeled records alone attain the supplied-propensity order. Below it, attainment along an auxiliary-size sequence requires total treatment-record counts to remain at least a positive constant times . Below the smoothness threshold, strict asymptotic improvement over labeled records alone occurs exactly when the auxiliary-to-labeled ratio diverges. Proposition 1 also translates a target absolute-error scale into simultaneous requirements on the labeled count and the product of labeled and total counts. These are risk requirements up to parameter-dependent constants, with exact equivalences for the displayed rate.
The closest supervised comparison is Kennedy et al. (2024). At zero auxiliary records, our rate has the same numerical exponents and smoothness cutoff, as recorded in Lemma 7. Their statistical guarantees concern their bounded-density model and stated attainment conditions; the lower bound for our known-uniform class combines the original-record construction in Theorem 4 and Lemma 6, which covers smoothness below with total count at most , with the labeled-sample floor from the constant-nuisance subfamily in Theorem 3. Semi-supervised analyses of average and quantile treatment effects characterize nuisance-dependent expansions and inference for marginal targets (Chakrabortty et al., 2022). Our contribution characterizes worst-case pointwise absolute error and its acquisition requirements for the specified conditional target. The projection construction connects local residualized regression (Kennedy, 2023) with finite-rank second-order correction (Robins et al., 2009).
The exposition proceeds through related work, setup and assumptions, the estimator construction, sharp precision and sample requirements, and discussion and limitations. The upper-bound argument is organized in Section A, the original-record converse in Section B, and the acquisition algebra in Section C.
Related work
The closest comparison is Kennedy et al. (2024), who characterize supervised pointwise CATE estimation under Hölder smoothness. Write for the labeled sample size, for the covariate dimension, and , , and for the propensity, control-mean, and treatment-effect smoothness orders. With , their absolute-error exponents are Published attainment requires their matrix regularity, smooth nuisance-estimation errors, boundedness conditions, and control of the third-order remainder involving covariate-distribution estimation. Their localized second-order projection correction balances effect approximation, nuisance approximation, and sampling variation.
The algebraic comparison appears in Lemma 7. It identifies the supervised exponents obtained by specializing the sample-size expression to zero auxiliary records. Its interpretation follows the published source model, which permits a bounded covariate density and uses a construction-specific design in the lower-bound argument. The present potential-outcome law class with known uniform design, specified in Definition 3, fixes the covariate distribution throughout. Within that class, Theorem 4 and Lemma 6 supply the original-record testing argument. These results establish the lower bound in the experiment actually observed by the decision maker, while the published benchmark supplies the numerical supervised comparison.
This distinction becomes consequential when information arrives in unequal amounts. The sampling experiment combines labeled records with independent outcome-free covariate-treatment records; its sampling law is given in Assumption 9. The pointwise absolute-error characterization in Theorem 2 retains both record counts, and Theorem 3 identifies the precision attainable when the propensity function is supplied. Together, these results connect the amount of treatment information to the accuracy of a conditional causal contrast under the paper’s fixed design, overlap, and smoothness conditions.
Related semi-supervised treatment-effect analyses study population functionals through asymptotic expansions. Chakrabortty et al. (2022) separate labeled residual variation from averaging over the enlarged covariate sample for average treatment effect estimation. Their corollary addresses a vanishing labeled fraction with a correctly specified propensity model, retaining explicit nuisance remainders; asymptotic normality follows under the stated remainder conditions. The corresponding quantile treatment effect expansions additionally account for the density at the target quantile (Chakrabortty et al., 2022). These expansions explain robustness and efficiency for marginal causal functionals. The present risk characterization instead evaluates a conditional contrast at a fixed interior profile and quantifies worst-case absolute error over the specified Hölder class.
The information carried by auxiliary records also distinguishes the surrogate-assisted setting of Cheng et al. (2021). Their records include outcome-predictive surrogate variables, potentially measured after treatment, alongside baseline covariates and treatment. An imputation-based ATE estimator exploits these variables, with robustness to imputation-model misspecification and local efficiency under their ideal semi-supervised model; perturbation resampling supports inference. Their electronic health records application illustrates the role of surrogate information when chart-reviewed outcomes are scarce. Here, auxiliary observations contribute covariate-treatment information, and their value is characterized through the pointwise risk and sample requirements in Theorem 2 and Proposition 1.
A further comparison concerns the statistical criterion used to measure precision. Kato (2025) derive two-sample ATE efficiency bounds for regular estimators and establish attainment through cross-fitted estimation under nuisance consistency and product-rate conditions. Their auxiliary sample contains covariates, and their analysis allows distinct labeled and auxiliary covariate distributions subject to support conditions. With coincident distributions and the stated evaluation weighting, the efficiency bound separates outcome residual variation from variation in the conditional effect across covariate profiles. Those conclusions characterize asymptotic variance at a fixed positive sampling fraction. The present minimax criterion, defined in Definition 5, measures pointwise absolute error across the primitive class and accommodates every auxiliary-record count in the stated experiment.
Supplied-predictor conditional estimation offers another route for using auxiliary information. Sui et al. (2026) combine labeled observations, unlabeled covariates, and a supplied predictor to estimate conditional moment targets. Their Sobolev-equivalent reproducing kernel Hilbert space conditions support pointwise error bounds and confidence intervals, with prediction and residual components determining variance. Structure-adaptive CATE estimation uses different restrictions: Kim (2026) give a pointwise squared-error result under bounded ambient-RKHS and overlap conditions when the contrast lies in the designated lower-complexity subspace; their broader analysis also treats integrated squared error, source conditions, known lower-dimensional representations, and model selection. Those results use supervised outcomes and RKHS/Sobolev structure. Our experiment instead fixes a Hölder class, measures pointwise absolute error, and studies the extra information supplied by outcome-free covariate-treatment records.
Methodologically, the projection correction belongs to the higher-order influence-function tradition. Finite-rank orthogonal projections provide a tractable representation of second-order corrections in nonlinear functional estimation (Robins et al., 2009). Orthogonal regression supplies the conditional-effect estimating structure: residualized treatment and outcome regression underlie the R-learner (Nie et al., 2021), and local polynomial double-residual regression connects this structure to pointwise smoothness-based estimation (Kennedy, 2023). The rectangular projection estimator in Algorithm 2 and Definition 11 combines localization with independent treatment and outcome roles. Its upper bound in Theorem 1 makes the separate sampling contributions explicit, linking the projection architecture to the unequal information available from labeled and outcome-free records.
Setup and assumptions
Throughout, and denote finite positive constants whose values may change between appearances. At fixed public parameters, these constants are independent of the sample sizes. We write when , and when both and . Vector norms are Euclidean unless otherwise indicated. We use and write for the positive integers. Counts and polynomial multi-indices may be zero; dimensions, resolutions, and sample-index ranges carry their displayed positive lower bounds. The symbol always denotes the total treatment-record count.
Fix the public parameters Here is the covariate dimension, are the propensity, control-mean, and causal-contrast smoothness orders, respectively, is the common Hölder radius, and is the overlap level. These parameters remain fixed as the sample sizes vary.
Primitive variables and identifying restrictions
We use a coordinate-partial convention for Hölder regularity. For a function and a regularity order , the norm controls coordinate derivatives indexed by the nonnegative-integer multi-index , together with their highest-order Hölder variation. The following definition specifies the convention, including at integer smoothness orders.
The extended-real Hölder norm , for , , and , is Here , and is the iterated derivative within , evaluated on coordinate directions with coordinate repeated times. The differentiability condition means continuous differentiability of the indicated order within the cube. Both suprema are taken in the extended nonnegative reals, with an empty supremum equal to zero.
⊢ LeanFor positive , this convention uses derivatives through order and a highest-order Hölder exponent of . Thus integer orders use a Lipschitz condition on derivatives of one lower order. Every regularity restriction below is evaluated within the unit cube.
A full record consists of a covariate vector , a binary treatment indicator , and binary potential responses and under control and treatment. Let denote their primitive Borel law. The observed response selects the potential response corresponding to the realized treatment.
The observed response for a full record , where is the covariate vector for a nonnegative integer , is the treatment indicator, and are the potential responses under control and treatment, is defined by The corresponding observed record is .
⊢ LeanThe evaluation profile is the fixed interior point . We write for an admissible propensity witness, and for admissible control and treated conditional-mean witnesses, and for the canonical continuous causal contrast. Their precise admissibility requirements are collected in Definition 3. The identifying restrictions begin with the covariate design and treatment assignment.
The covariate vector satisfies
⊢ LeanThe known uniform design fixes the distribution used for localization and integration and gives full support on the cube. It is the maintained uniform-design restriction of the bounded-density framework considered by (Kennedy et al., 2024). Treatment assignment is linked to the potential responses through conditional exchangeability.
The treatment indicator and the potential responses satisfy where is the covariate vector.
⊢ LeanConditional exchangeability allows treatment-specific observed means to identify the corresponding potential-response means after conditioning on the covariates (Chakrabortty et al., 2022). Both treatment arms must also be represented throughout the evaluation domain.
The overlap condition for a primitive law , at the overlap level , is together with the requirement that the raw Borel propensity witness carried by takes values in at every .
⊢ LeanBounded overlap keeps both conditional treatment probabilities away from zero, as in the pointwise conditional-effect framework of (Kennedy et al., 2024). Here the endpoints are the public values and , with , and the restriction applies at every point of the cube.
The regularity conditions distinguish the two nuisance functions from the causal contrast. We first impose isotropic Hölder regularity on the propensity.
The designated Borel propensity witness satisfies
⊢ LeanIsotropic Hölder propensity regularity controls how treatment probabilities vary across nearby covariate profiles (Kennedy et al., 2024). The order is common across coordinates, and the radius bounds both the function and its Hölder variation. The control response mean has its own smoothness order.
The designated Borel control-mean witness satisfies
⊢ LeanIsotropic Hölder control-mean regularity governs variation in the baseline response surface (Kennedy et al., 2024). Allowing to differ from separates outcome regularity from treatment-assignment regularity. The target surface is controlled directly by the following restriction.
The canonical continuous causal contrast satisfies
⊢ LeanIsotropic Hölder contrast regularity controls the local variation of the conditional treatment effect itself (Kennedy et al., 2024). The separate order permits a smoother causal contrast than either nuisance function and specifies the regularity used to estimate its value at .
The binary-response model also requires pointwise probability bounds on the designated arm means. We state these restrictions explicitly because admissible witnesses are functions defined throughout the cube.
The designated Borel control-mean witness satisfies
⊢ LeanThis pointwise control-response restriction is specific to the present analysis and keeps the designated control mean within the Bernoulli probability range, including its endpoints. The corresponding treated mean obeys the same numerical bounds.
The designated Borel treated-mean witness satisfies
⊢ LeanThe treated-response restriction is likewise specific to this analysis. Together, the two arm bounds ensure that the designated contrast takes values in everywhere on the cube.
Membership in the primitive class is existential: a law belongs when it admits conditional-mean witnesses satisfying the stated restrictions. Let denote this class, abbreviated to at the fixed public parameters.
is the class of primitive Borel laws , where is the covariate vector, is the binary treatment indicator, and and are the binary potential responses under control and treatment. For public parameters and , membership is defined by the following properties:
(Uniform design.) The law satisfies Assumption 1.
(Exchangeability.) The law satisfies Assumption 2.
(Conditional means.) There exist Borel functions such that
(Overlap and smoothness.) These functions satisfy Assumptions 3, 4, 5, and 6, with , , and as the propensity, control mean, and causal contrast.
(Response bounds.) The arm means satisfy Assumptions 7 and 8.
For each admitted law, designate admissible functions , respectively. The function is the canonical continuous representative of the almost-sure conditional causal contrast, and the designated functions satisfy
⊢ LeanThe witness formulation separates almost-sure conditional-expectation identities from restrictions imposed at every covariate profile. Under the positive smoothness orders fixed above, , , and are continuous; the identity in Definition 3 then gives continuity of as well.
Observed response selection, conditional exchangeability, and overlap yield Consequently, the observed-record law identifies the causal contrast almost everywhere under the covariate distribution. Uniform design assigns positive probability to every nonempty relatively open subset of the cube. Continuous representatives that agree almost everywhere therefore agree everywhere, which makes a uniquely defined, identified point target. The continuous representative gives substantive meaning to evaluation at a fixed profile even though conditional expectations are initially defined through almost-sure identities.
Sampling experiment and risk
Write for the observed-record law induced by Definition 2, and for the covariate-treatment marginal. For and , the original dataset consists of independent labeled records with law and independent outcome-free records with law : The two blocks are independent. A uniform randomizer on , independent of both blocks, is available to decisions. Thus the product sampling law in Assumption 9 is The following condition makes this sampling experiment explicit.
The original dataset and independent uniform randomizer have joint law where is the product sampling law of the original dataset and randomizer.
⊢ LeanIndependent fixed-size labeled and outcome-free samples from a shared law provide the two-channel sampling structure used in semi-supervised causal estimation (Chakrabortty et al., 2022); the independent randomizer permits randomized decisions. In this experiment, each labeled record supplies covariates, treatment, and a response, while each outcome-free record supplies covariates and treatment. The common marginal makes both blocks informative about treatment assignment.
A decision is a Borel real-valued function of the dataset and randomizer. Its absolute-error risk measures expected error in estimating the identified point contrast.
The absolute-error risk is Here is a Borel real-valued decision using the original dataset and independent uniform randomizer , is the fixed interior covariate profile, and is the product sampling law of the original dataset and randomizer. The target is the canonical conditional causal contrast from Definition 3.
⊢ LeanAbsolute loss expresses precision on the scale of the conditional response difference. To assess precision uniformly across admissible primitive laws, the minimax risk optimizes the worst-case value of this loss over all Borel decisions.
Here is the primitive law class at the fixed public parameters, and is the expected absolute error for the point contrast under law . The infimum ranges over Borel real-valued decisions using the original dataset of labeled records and independent outcome-free treatment records, together with an independent uniform randomizer.
⊢ LeanThe sample sizes enter separately because response information is supplied by the labeled block and treatment-assignment information is supplied by both blocks. A complementary experiment supplies the entire admissible propensity function to the decision. Denote such a decision by , and its minimax risk by .
The supplied propensity minimax risk , for and , is the extended nonnegative quantity Here is the primitive law class at these parameters, and and are its designated admissible propensity function and canonical causal contrast, as defined in Definition 3. The evaluation profile is . The original dataset comprises labeled records and independent outcome-free treatment records; is the independent uniform randomizer on , and is their product sampling law from Assumption 9. The infimum ranges over real-valued decisions receiving the dataset, randomizer, and a supplied function from the covariate space to , with Borel measurability in for every fixed supplied function.
⊢ LeanSupplying gives a reference experiment in which treatment probabilities are available throughout the cube. Measurability is required in the observed data and randomizer for each fixed supplied function. Comparing Definitions 5 and 6 quantifies how the original sampling experiment approaches the precision available with supplied treatment probabilities.
Rate notation
We introduce the rate notation as a single family. Let be the total treatment-record count and the sum of the two nuisance smoothness orders. Define the tuning denominator , nuisance-smoothness cutoff , and total-record comparison exponent by The supplied-propensity reference order and the unequal-channel upper-rate expression are These expressions distinguish a term indexed by the response-bearing sample size from a term indexed by the product of the labeled and total treatment-record counts. Their statistical interpretation is supplied by Theorems 1, 2, and 3.
The notation also makes the sample-size comparison transparent. Algebraically, When , the exponent satisfies , so meets this comparison. For , one has , and the comparison requires total treatment-record growth beyond the labeled count. This division organizes the precision and sample-requirement statements that follow.
Estimation with outcome-free records
The estimator allocates labeled and outcome-free records to two independent statistical roles. One role supplies response information; the other supplies treatment-assignment information. A local polynomial fit estimates the contrast at the target profile , while a finer projection corrects its empirical moments for the unknown propensity and control mean. Separate localization and projection scales allow the construction to use the smoothness of the effect and the combined smoothness of the nuisance functions.
We first specify the neighborhood associated with the localization scale and its probability measure.
For an integer , let . For , define the localization cube of side length , centered at , by The uniform probability measure on has density with respect to -dimensional Lebesgue measure on : Equivalently, for every Borel set ,
The localization cube lies inside the covariate domain. Its uniform probability measure defines the inner product for both polynomial spaces below. Under Assumption 1, weighting an observed covariate by the localization density converts a population average into an integral under this local probability measure.
The coarse basis consists of scaled tensor-product Legendre polynomials of total degree at most two. This degree accommodates local polynomial approximation throughout the stipulated effect-smoothness range.
The coarse polynomial basis vector , for dimension and scale , is defined at each by Division by zero is interpreted as zero, so this definition also specifies at .
⊢ LeanFor , , and an integer , let , , and . Partition each coordinate interval of into intervals of length , taking each interval half-open on the right except for the last interval, which includes the outer right endpoint. Their Cartesian products form the partition . The center of is Write For each cell index and multi-index with , define The vector collects these functions, ordered lexicographically by cell index and then by multi-index. Its dimension is These functions form the positive-leading-coefficient cellwise scaled Legendre orthonormal basis, under , of the space of polynomials of total degree at most two on each partition cell. Set for . Thus the associated kernel is uniquely specified by
The vector is the coarse orthonormal basis and has coordinates. Write for its value at the target profile. A coefficient vector represents the coarse polynomial ; evaluating the fitted contrast therefore amounts to evaluating its coefficient vector against . The prescribed fine basis is from the preceding definition. It has coordinates and spans the already specified cellwise space ; the associated projection is defined next.
Here is the fine-cell side length, is the localization scale, is the grid resolution, is the cellwise orthonormal fine polynomial basis vector, and is the uniform probability measure on the localization cube . Weighted basis expressions are zero outside .
⊢ LeanThe projection kernel represents the orthogonal projection onto . The coarse fit operates across the entire localization cube, whereas the projection resolves nuisance variation on cells of side length . Refining the grid from to a multiple of subdivides every cell, so and the correction space is enriched; at every resolution , contains the coarse polynomials, so the projection reproduces them.
We next assign the original observations to independent roles under the sampling law in Assumption 9.
The concatenated treatment sequence retains the covariate coordinate and treatment coordinate of each record. The outcome-role count is proportional to the labeled sample size, while the treatment-role count is proportional to the total treatment-record count. Their index sets, and , select disjoint records. Thus additional outcome-free observations enlarge the treatment role while the response information remains tied to the labeled sample. The split also makes products of empirical averages across roles suitable for estimating products of population moments.
To interpret the response correction, write using the designated witnesses from Definition 3. At the population level, residualizing treatment against its propensity gives The empirical construction implements this local moment relation through a finite projection and independent roles. Its outcome projection uses the observed response, and its treatment role supplies the assignment factor in the projection correction.
Given the original dataset of labeled records and independent outcome-free treatment records, form the two roles as follows.
Concatenate the covariate-treatment pairs, with total treatment-record count : Here denotes the covariate vector and the binary treatment indicator; tildes denote auxiliary records.
Define the outcome-role count , treatment-role count , and their index sets:
Output the outcome-role labeled records and treatment-role covariate-treatment pairs: Here is the observed response. Outcomes from treatment-role records are discarded.
The empirical outcome projection estimates . In the response vector , the first average estimates the treated-response moment and the rectangular average supplies its projected treatment-response correction. The raw matrix applies the corresponding correction to the local polynomial design. Symmetrization produces the matrix used for inversion.
Define the population matrix and population response vector by where expectations are taken under the original sampling experiment. These are the population counterparts of the projected local estimating equations. Polynomial reproduction links those equations to approximation of the contrast, and overlap supplies the population positivity used to control inversion; the respective statements are Lemmas 1 and 2.
For the sample decision, an eigenvalue guard supplies a criterion for inversion at the public overlap level. We use the clipping operator which projects a real number onto the contrast range implied by the probability-valued arm means in Definition 3. The guard level is half the population Gram margin supplied by overlap. The complete decision combines the empirical moments, guard, and clipping.
Given the original dataset , localization scale , grid resolution , localization cube , localization density , coarse polynomial basis vector , and fine projection kernel , compute the moments as follows.
Form the independent outcome and treatment roles, with counts and index sets The treatment sequence consists of the covariate-treatment pairs Use labeled records for in the outcome role and pairs for in the treatment role. Treatment-role outcomes are discarded. Weighted basis expressions are zero outside .
Define the outcome-role empirical projection:
Define the empirical response vector: The response factor in the rectangular correction is , and the first summand uses . The nested and rectangular expressions define the same vector.
Define the unsymmetrized empirical matrix:
Output the response vector and symmetrized matrix: All inputs are observed in , including when .
The guarded decision evaluates the fitted polynomial when the empirical matrix meets the eigenvalue cutoff and returns zero otherwise. Clipping bounds the decision on both branches. Together, these operations permit a risk guarantee over every admissible localization scale and grid resolution, including choices with sparse local observations.
The public choices of localization scale and grid resolution balance approximation and sampling error. They determine the tuned decision using the sample sizes and the public class parameters.
The local polynomial decision is defined by Here is the coarse polynomial basis vector evaluated at the target profile, is the symmetrized corrected empirical matrix, and is the corrected empirical response vector. The operator projects a real value onto , and denotes the smallest eigenvalue. For the public overlap level , the inversion threshold is
⊢ LeanWhen , the grid choice is . When , the grid becomes finer as the localization scale shrinks, making comparable in order to . Thus nuisance approximation can use a finer spatial scale than the local effect fit. The localization choice then balances these approximation terms against the two sampling terms stated below.
For use in the decision-theoretic comparison, the same estimator is recorded as the original-record decision .
The localization scale , grid resolution , and tuned decision are where is the total treatment-record count, is the sum of the propensity and control-mean Hölder orders, and is the denominator governing the unequal-channel rate exponent.
⊢ LeanFor every original dataset and independent uniform randomizer , this decision uses the prescribed empirical moments, empirical eigenvalue cutoff, clipping, role split, and public tuning parameters and . Its value is independent of .
⊢ LeanThe following guarantee gives the construction’s four statistical terms once: effect approximation , nuisance approximation , localized response sampling , and rectangular sampling . The public tuning balances them. The approximation, positivity, and sampling ingredients are isolated in Lemmas 1, 2, and 3; their proofs are organized in Section A.
Fix public parameters satisfying
(Dimension.) is an integer with .
(Smoothness.) , , and .
(Radius.) .
(Overlap.) .
Let be the primitive class at these fixed parameters from Definition 3, and use the absolute-error risk from Definition 4. There exists a finite constant , depending only on these public parameters, with both of the following guarantees.
For every pair of integers and , every , and every integer , the estimator from Definition 11, viewed as a decision on the original dataset and randomizer that ignores the randomizer, is Borel measurable and satisfies, for every ,
Define the supplied-propensity point-estimation order and the denominator governing the unequal-channel rate exponent by and define the upper rate by For every pair of integers and , the publicly tuned decision from Definition 12, likewise viewed as a decision that ignores the randomizer, is Borel measurable and satisfies, for every ,
⊢ LeanThis theorem completes the main-body estimator construction. The approximation, sampling, and inversion arguments are organized in Section A.
Sharp precision and sample requirements
The sharp precision bound separates the information supplied by response labels from that supplied by all covariate-treatment records. The rate and attaining decision are defined once in Definitions 14 and 13. The following result gives their uniform minimax comparison, explicit sample-size regimes, and extension to randomized decisions.
The sharp rate at the public class parameters is where is the maximum of the supplied-propensity and unequal-channel rate orders.
⊢ LeanFix the covariate dimension , the propensity and control-mean smoothness orders , the effect smoothness order , the Hölder radius , and the overlap level , satisfying:
(Dimension.) .
(Nuisance smoothness.) and .
(Effect smoothness.) .
(Radius.) .
(Overlap.) .
Let denote the primitive class at these fixed parameters, and let , , and be the sharp rate, total data-only decision, and minimax risk of Definitions 14, 13, and 5, respectively. There exist real constants , depending only on the fixed parameters, such that, simultaneously for every with , is Borel measurable and Moreover, every Borel real-valued decision using the original dataset and the independent uniform randomizer satisfies
Define the total treatment-record count , the combined nuisance smoothness , the exponent denominator , the smoothness threshold , the total-record growth exponent , and the supplied-propensity order by For these sample sizes, the sharp rate has the branches Whenever , the two rate formulas coincide:
⊢ LeanThe two terms express complementary precision requirements. The supplied-propensity term reflects the labeled-sample requirement for estimating the smooth contrast at a point; the product term reflects the joint requirement on labeled and treatment-record counts when the nuisance functions are unknown. If , the labeled count already supports the supplied-propensity order. Equality belongs to this regime: then , and the necessary inequality places every admissible sample pair at or beyond the saturation threshold. If , the exponent creates an intermediate regime , in which precision depends on the product . At , the two terms coincide; for larger total counts, the supplied-propensity term governs the rate.
The lower bound concerns the original records and includes every Borel decision using the independent uniform randomizer. Thus the comparison applies to both deterministic and randomized estimation procedures. The original-record construction in Theorem 4 underlies the sparse-range nuisance converse in Lemma 6. That converse supplies the product-of-counts lower bound in the range where it governs precision. Combined with the supplied-propensity lower bound below, it yields the sharp comparison across all sample imbalances. The matching upper bound is attained by the publicly tuned decision through Theorem 1.
To interpret saturation, the next result evaluates the same primitive class when the designated propensity function is supplied to the decision. This benchmark identifies the labeled-sample precision against which the value of outcome-free records is measured. Its attaining known-design decision uses Here , and and the degree-two basis use the centered localization measure from Definitions 7 and 8. These formulas are defined for every bandwidth ; the supplied-propensity smoother below uses only , which lies in for and can exceed for small . This is a known-design polynomial evaluation average, not an empirical local least-squares fit.
Fix public parameters satisfying
(Dimension.) and .
(Nuisance smoothness.) and .
(Effect smoothness.) .
(Radius.) .
(Overlap.) .
Let be the primitive class at these parameters in Definition 3, and let be the supplied-propensity minimax absolute-error risk in Definition 6. Define the supplied-propensity rate and the evaluation profile by There exist real constants , depending only on the fixed public parameters, such that, for every with ,
The upper bound is attained by the explicit degree-two smoother under the known uniform design, applied to the inverse-propensity pseudo-outcomes at bandwidth with final clipping to . Here the smoother uses its localization weight and coarse polynomial basis at this bandwidth for every , including . For every , the resulting decision is measurable as a function of the dataset and randomizer when supplied with the designated admissible propensity , satisfies for every dataset and randomizer value, and obeys The sampling law is the product law of independent labeled records, independent outcome-free covariate-treatment records, and an independent uniform randomizer , as specified in Assumption 9.
The same lower bound holds for the supplied-propensity minimax risk over the same-class subfamily with constant propensity and control mean: where the constant-witness equalities hold on the unit cube and the infimum ranges over the supplied-propensity decisions of Definition 6.
⊢ LeanThe upper-bound localization formula uses the same centered cube and uniform localization measure as Definition 7, evaluated at the single bandwidth , which may exceed . Because the cube has side length and is centered at , it lies inside . The rectangular estimator in Theorem 1 retains its stated restriction .
With the propensity supplied, inverse-propensity weighting gives a response whose conditional mean is the causal contrast. Local polynomial estimation can therefore target the contrast’s smoothness directly, yielding the order . The same-class lower bound with constant propensity and control mean isolates the remaining response information requirement: even within this subfamily, the minimax risk is bounded below by a constant times for every auxiliary count. Since a supplied-propensity decision can also implement any decision based on the original data, this lower bound provides the labeled-sample floor in Theorem 2.
The sample requirements for attaining this benchmark can be expressed as a region of admissible counts. For a tolerance , the annotation region records the pairs whose sharp rate lies within that tolerance of the supplied-propensity order.
The annotation region at tolerance is where is the sharp rate and is the supplied-propensity point-estimation order.
⊢ LeanFor , the explicit rate gives the equivalent count condition In particular, gives the exact rate-level saturation region. Allowing a fixed finite tolerance gives attainment of the supplied-propensity order up to constants. The complete sequence equivalence, strict-improvement criterion, and target-error conditions are collected in Proposition 1 and proved in Section C.
Attainment of the supplied-propensity order and strict improvement over the labeled-only order impose distinct count requirements. Under , strict improvement occurs exactly when , whereas supplied-propensity attainment requires the total count to remain at least a positive constant times . Consequently, diverging auxiliary-to-labeled ratios can improve the minimax order while leaving precision in the intermediate product-of-counts regime. A bounded auxiliary-to-labeled ratio preserves the labeled-only order up to constants. At and above the smoothness threshold, every auxiliary-size sequence attains the supplied-propensity order.
For acquisition planning, Proposition 1 gives two simultaneous requirements. For a target absolute-error scale , the labeled count must support point-estimation precision at scale , and the product of labeled and total counts must support nuisance adjustment at scale . These requirements are necessary up to a constant depending on and sufficient up to another such constant for uniform expected absolute error at most . Their rate-level form is exact. Thus increasing either count can satisfy the product requirement, while the labeled-count requirement specifies the response information needed at the target precision.
A one-dimensional example makes the threshold concrete. Set , , and , with any fixed and . Then and The labeled-only rate is , and the exact branch boundary is . Total counts of order therefore attain the supplied-propensity order up to constants. For example, with , the branch boundary is , corresponding to outcome-free records. These counts describe equality of the rate formulas; the minimax risk retains constants that may depend on and . In the same example, the exact rate-level requirements for target scale are Taking the labeled count at order consequently requires a total count at order , illustrating how response labels and routine covariate-treatment records jointly determine attainable precision.
Discussion and limitations
The acquisition region in Definition 15 provides a benchmark for allocating response labels and routine covariate-treatment records under the model in Definition 3 and Assumption 9. It identifies sample-size pairs for which the sharp rate is within a specified factor of the supplied-propensity order. Through Theorem 2, this rate comparison translates into a minimax precision comparison up to constants depending on the public class parameters. For an absolute-error target, Proposition 1 instead gives simultaneous requirements on the labeled count and the product of labeled and total treatment-record counts. These requirements offer a basis for comparing acquisition plans once their costs are specified.
A chart-review setting illustrates the distinction between the two record types. A labeled record contains covariates, treatment, and a true response ascertained through review; an outcome-free record contains the covariates and treatment available from routine records. Adding a new independent labeled record changes to and increases the total count. Reviewing a response for one record already present in the auxiliary block changes the composition to at fixed total count; if the record index is fixed in advance, or chosen by a randomization independent of all records, the resulting dataset follows the stated sampling law at . Adding a new routine record changes to . The sample requirements benchmark these alternative compositions under the specified independent, common-population experiment; acquisition costs determine which transition is relevant in an application.
The two channels address distinct sources of statistical difficulty. Response labels carry information about the probability-valued conditional response means and the causal contrast. The arm-mean conditions in Assumptions 7 and 8 place both means in , and Theorem 3 characterizes the labeled-sample precision when the propensity function is supplied. Outcome-free records carry information about treatment assignment conditional on covariates. Their contribution enters the second component of the sharp rate in Definition 14, where the product of labeled and total counts governs the cost of nuisance adjustment. Increasing the routine-record count can reduce that component until the supplied-propensity order determines the overall rate.
Public nuisance regularity determines how much routine information is needed to reach this benchmark. The rate exponent depends on the sum of the propensity and control-mean Hölder orders, while the effect Hölder order governs the supplied-propensity precision. Greater nuisance regularity can reduce the total-record growth needed at a given labeled count. In the sufficiently smooth regime characterized by Theorem 2, labeled records alone attain the supplied-propensity order; in the lower-regularity regime, additional outcome-free records can improve the minimax order until saturation. These comparisons concern rates, with constants depending on the fixed class parameters. Because the regularity parameters are public, they also determine the estimator’s localization and projection choices in Definition 12. Acquisition planning and estimator tuning thus use the same description of the statistical model.
Limitations and future work
The analysis uses a known uniform covariate distribution on the unit cube, a fixed public overlap level , binary responses with arm means in , and independent record blocks from a common population. Extending the acquisition benchmark to general, potentially unknown covariate distributions is a direction for future work. Covariate-dependent or adaptive selection of records for review would also change the labeled-record law and requires a sampling or missingness model beyond the experiment studied here. Covariate shift between reviewed and routine records would introduce an additional transport problem. These extensions would help connect the benchmark to populations with uneven support and heterogeneous record availability.
Unknown smoothness raises a separate question of adaptation. The present tuning and acquisition comparisons use public Hölder orders and a public radius. Procedures that select tuning parameters from the data would need risk guarantees over multiple regularity classes, together with an assessment of any adaptation cost. Uncertainty quantification also requires further analysis: the expected absolute-error bounds characterize point-estimation precision, whereas confidence intervals require coverage guarantees and control of approximation bias.
Alternative losses and causal targets may change the allocation requirements. Squared-error loss, integrated estimation of the treatment-effect function, average treatment effects, and policy-value targets each call for their own precision benchmark. Richer auxiliary information is another direction, including response proxies, repeated measurements, and additional variables predictive of the response. Such information would enlarge the observation model beyond covariate-treatment pairs and require an explicit account of how the auxiliary measurements relate to the true response.
Appendices
Upper-bound proofs
The upper bounds in Theorems 1 and 3 combine local polynomial approximation with control of the corresponding empirical moments. For the rectangular estimator, the two-scale construction in Definition 10 and the public role split in Algorithm 1 are statistical inputs: the coarse polynomial targets the smooth contrast, the fine projection controls nuisance approximation, and the independent roles separate response information from treatment-assignment information. The auxiliary results below follow this dependency order.
Local approximation and projection
Fix a primitive law from Definition 3 and admissible localization and resolution inputs . Retain the notation for the expected response vector and for the expected symmetrized matrix: Both expectations concern the empirical moments in Algorithm 2. Let denote the Taylor polynomial of at , with degree , and let denote its coefficient vector in the coarse basis. Since , this Taylor degree lies within the degree-two polynomial space used by the estimator. The following result collects the approximation and projection properties needed for the population estimating equations and their sampling bounds.
Fix public parameters and satisfying:
(Dimension.) .
(Smoothness.) , , and .
(Radius.) .
(Overlap.) .
There exists a finite constant such that, for every primitive law as defined in Definition 3, every with , and every integer , the following conclusions hold for the bases and projection of Definition 10.
Write for the evaluation center, for the localization cube, and for its uniform probability measure. Let be the Taylor polynomial of the canonical contrast at , with Taylor degree : There exists a coarse coefficient vector whose represented polynomial satisfies and
The coarse basis vector and fine projection kernel satisfy and where is the number of coarse multi-indices of total degree at most two:
Finally, with fine-cell side length , every coarse basis coordinate satisfies where is the designated admissible propensity witness, and the designated admissible control-mean witness satisfies
⊢ LeanAll constants constructed below depend only on the fixed public parameters. Write Thus the coarse coordinates are We use the designated functions supplied by Definition 3 and the localized measure and projection of Definition 10.
Taylor coefficients and approximation. We first construct a positive constant , uniform over admitted laws and localization scales.
If , then . Let Since , this gives By Definitions 1 and 3, For equal arguments the second inequality follows from its zero left-hand side; for distinct arguments it is the order-zero Hölder bound. Moreover, for , The inclusion follows from . Consequently, The representation also gives .
Suppose now that . Define The public range of implies In particular, at and , the pairs are and , respectively. The same two definitions supply continuous derivatives through order and the bounds The second inequality includes equal arguments, where both sides vanish.
For , set The segment lies in the design cube. The chain rule, together with symmetry of the continuous derivatives, yields Each coordinate of has absolute value at most . There are terms, so the top-derivative modulus gives Grouping the coordinate derivatives by their multiplicities gives The Lagrange remainder for the Taylor polynomial of degree provides such that, after subtracting the degree- term, Since and , this implies To obtain a constant uniform in the fractional order, observe that Hence, with we have
We next represent in the coarse basis by an explicit change of coefficients. Define the matrix, whose rows and columns are indexed by , Direct substitution gives Its entries satisfy Put Since , Expanding the product of the one-dimensional identities gives Indeed, a nonzero term has in every coordinate, so its total degree remains at most .
Define the coarse vector by zero extension: Exchanging the finite sums proves Furthermore, Thus, defining we obtain At , every positive-degree centered monomial vanishes and the zero-degree coefficient is ; therefore . Both cases construct a finite positive .
Basis and kernel bounds. For , the three reference polynomials satisfy For the last inequality we used , which gives . It follows that
Here is the fine-cell apparatus used for the kernel calculations. Define For each coordinate, let These cells partition , with every terminal face assigned to the last interval. To see coverage explicitly, for define Then . Distinct indices give disjoint cells: in a coordinate where their indices differ, the smaller interval’s right endpoint is at or before the larger interval’s left endpoint, and the smaller interval excludes its right endpoint. These conventions also apply when .
The fine coordinates are In particular, all fine coordinates vanish outside . The orthonormality specified in Definition 10 reads Its normalization can also be seen directly: the reference integrals satisfy by integrating the displayed polynomials. On a common cell, the change of variables contributes Different cells have disjoint supports, and the assigned faces have zero Lebesgue measure.
The coordinate bound gives, for every , The constant coordinate on a cell is Consequently, where the second inequality uses .
If , disjointness reduces the kernel to The triangle inequality and the preceding bounds therefore give For outside all cells, , so the same bound holds there.
There are cells and coordinates per cell; hence the fine index set has elements. Expanding the squared finite kernel and factoring the product integrals yields All terms are integrable by the square integrability of the basis coordinates. Define We have proved together with the exact squared-kernel identity.
Control-mean residual. For square-integrable functions, write The coarse constant coordinate equals one, so coarse orthonormality gives Thus is a probability measure supported on .
The centers satisfy . For two points in the same cell, coordinatewise interval bounds give By Definitions 1 and 3 and , Indeed, , so the Hölder norm bounds the function and its order-zero modulus; equal arguments satisfy the modulus inequality directly.
Define the fine coefficient vector and its expansion by The cell assignments imply Set For , the modulus and distance bounds give Because is a probability measure,
We now derive the projection comparison used here and in the next step. For any and any real fine coefficient vector , put Expanding the kernel integral in Definition 10 gives Orthonormality then implies and The last identity makes the cross term in the squared norm vanish, giving Apply this identity to and use the displayed projection identity: The bounded control mean and its finite-basis approximant are square integrable. Taking and , and then taking square roots, proves Therefore the positive constant satisfies
Propensity-weighted residuals. Similarly, and Definitions 1 and 3 give Fix , and define On , , so it is square integrable under .
We construct a fine-basis expansion that equals on each cell. Define Rows and columns are indexed by . Substitution into the three reference polynomials verifies For , Define the tensor coefficients Expanding the product of the affine identities gives Only indices with contribute, and hence every contributing index has total degree at most two.
Now set Disjointness of the cells and the tensor identity imply the everywhere defined formula Define For , The probability normalization therefore gives Applying the projection comparison from the preceding step to this fine-basis expansion yields Thus the positive constant satisfies, uniformly in ,
A common residual constant. Define Since , the preceding estimates imply
Combination of the bounds. Finally, choose This is finite, positive, and depends only on the public parameters. The inequalities allow every bound above to be enlarged to the claimed constant . The same Taylor coefficient vector retains its exact center value and its equality with on , while the squared-kernel integral retains the exact value . These conclusions hold for every admitted , every , and every integer .
The Taylor approximation controls variation of the contrast across the localization cube while reproducing its value exactly at the evaluation profile. The bounded coefficient vector and coarse basis provide uniform control of polynomial evaluation. For the fine projection, the integral bound controls its action on bounded approximation errors, whereas the squared-kernel identity records the sampling cost of its rank. The two nuisance residual bounds concern different functions: the propensity multiplied by a coarse basis coordinate, and the control mean. Their respective orders account for the combined nuisance approximation term in Theorem 1.
Population positivity
The corrected empirical matrix has a population counterpart whose stability is determined by overlap and orthogonal projection geometry. The next identity separates its quadratic form into an overlap-weighted polynomial norm and a squared projection residual.
Suppose the following conditions hold:
(Public parameters.) The dimension is an integer with , the smoothness parameters satisfy and , the radius satisfies , and the overlap parameter satisfies .
(Primitive law.) The law belongs to the primitive class at these public parameters, as specified in Definition 3. Let be its designated admissible propensity witness.
(Sample sizes.) The sample counts are nonnegative integers with .
(Localization and projection.) The localization scale satisfies , and the grid resolution is an integer with . Use the projection from Definition 10.
Let be the uniform localization measure on the localization cube , with For every coefficient vector , indexed by the multi-indices of total degree at most two, define its coarse-basis polynomial and the population matrix by where are the scaled orthonormal coarse polynomial basis functions and is the symmetrized corrected empirical matrix. Then
⊢ LeanFix . We compute the population entries, contract them with , and then obtain the energy decomposition and lower bound.
The localization density and fine-basis coordinates are Here , and the density is as in Definition 7. The role counts from Algorithm 1 satisfy For fixed , the localized basis products are bounded and measurable, so all expectations and integrals below are finite.
For coarse indices , expand the kernel in Definition 10 inside the raw matrix of Algorithm 2. This gives Under the product sampling law of Assumption 9, each covariate-treatment pair has marginal law . Each treatment-role record is independent of each outcome-role record: for a labeled treatment-role record their indices are distinct, and for an auxiliary record independence follows from the product sampling law. Taking expectations term by term therefore yields For any of the functions the designated conditional treatment mean and uniform design in Definition 3 give The localization cube lies in , so these identities use the designated witness on its specified domain. Substitution gives a formula symmetric in . Consequently, the symmetrization in Algorithm 2 preserves its expectation, and
Define the weighted coarse-basis coefficients by Multiplying the entry formula by , summing, and using , we obtain Indeed, the integral term follows by expanding the finite double sum, and the correction follows from
The finite kernel expansion in Definition 10 and linearity of integration give The fine basis in that definition is orthonormal. Expanding the square and integrating therefore gives Thus
The finite coarse expansion makes square-integrable, and bounded overlap makes square-integrable. The projection expansion just established also yields Expanding the residual square and using this equality gives the Pythagorean identity Meanwhile, the pointwise identity gives Combining these two identities with the quadratic-form formula proves
The scaled coarse polynomials of Definition 8 satisfy To see this, integrate their tensor products over the localization cube and rescale each coordinate to . Direct integration of the three normalized one-dimensional polynomials in that definition gives unit squared norms and zero pairwise inner products. When , every coordinate factor is one; when , some multi-index coordinate differs and its factor is zero. Hence finite expansion gives
Class membership supplies Assumption 3. Since is supported on , for -almost every , Multiplying by and integrating therefore yields Finally, so the decomposition from the preceding step implies
The overlap restriction in Assumption 3 supplies the lower bound through the first integral. The second integral is nonnegative and makes the contribution of finite projection explicit. Thus the population matrix retains a fixed positivity margin at every admissible resolution. This margin supplies the population reference for the empirical eigenvalue guard in Definition 11.
Rectangular sampling
The public split assigns disjoint observations to the outcome and treatment roles under Assumption 9. Their counts in Algorithm 1 are proportional to and , respectively, including when . Consequently, the sampling analysis distinguishes ordinary localized averages from the rectangular averages formed across the two roles. The next result controls both the response vector and the matrix used for inversion.
Fix the covariate dimension , the smoothness parameters , the Hölder radius , and the overlap parameter , satisfying
(Dimension.) .
(Nuisance smoothness.) and .
(Effect smoothness.) .
(Radius.) .
(Overlap parameter.) .
There exists a finite constant such that the following bound holds for every primitive law from Definition 3, and every and satisfying
(Sample sizes.) and .
(Localization.) .
(Resolution.) .
Take expectations under , the product sampling law specified in Assumption 9. Write for the total treatment-record count, for the number of polynomial multi-indices of total degree at most two, and for the fine projection rank: For the empirical response vector and symmetrized corrected empirical matrix from Algorithm 2, define their population expectations by Then
⊢ LeanDefine the dimension-dependent constants These constants are finite and positive. Fix an admitted law and admissible , and set We will bound each response coordinate and each raw-matrix coordinate by , then sum the bounds after symmetrization.
We first establish the explicit basis bounds used in the coordinate estimates. Write and define the reference polynomial factors, for , by For , and consequently The product formula in Definition 8 therefore gives
For completeness, the same factors give an explicit row-integral bound for the fine kernel. Set Let be the product of the intervals with the right endpoint included when . Thus these cells partition . The fine basis coordinates of Definition 10 are In particular, their values are zero outside their supporting cells, and With , the constant coordinate satisfies where the last identity is its orthonormal normalization. Pointwise, so integration yields If , only that cell contributes to the kernel, and hence It follows that If belongs to no fine cell, every fine basis coordinate at is zero, and the same bound holds. Thus The basis-product formula also gives
We now express the two coordinate types through a common marked kernel. Define the role counts Both are positive because and . Let and be independent generic treatment-role and outcome-role records, respectively: Their covariate marginals are uniform by Definition 3. The product sampling law and the disjoint roles in Algorithm 1 give independent records independent within and between the two roles.
Use the coordinate tags For each tag, define the three mark functions by on the full record domains displayed above. Binary marks have absolute value at most one. The coarse-coordinate bound from the preceding step therefore gives Define These expressions vanish termwise whenever a localization weight is zero. The rectangular formulas in Algorithm 2 give exactly In the response identity, expanding the empirical projection gives the rectangular formula on ; outside , its defining zero value and the zero localization weight give the same identity.
The localized mark and kernel energies admit explicit bounds. Since uniform design gives Thus Similarly, bounding both marks and integrating over the two independent covariates gives using the kernel-square identity in Lemma 1.
Define the integrated slices on the full record domains by where each expectation integrates an independent record with the law specified above. The row-integral estimate gives Consequently, Kernel symmetry gives the corresponding bound with the roles reversed: Squaring and integrating yields All the displayed features and kernels are measurable and square-integrable. In particular, their means, centered squares, and finite-sum integrals are well defined.
We derive the rectangular variance formula used with these energies. Define Fubini’s theorem gives and Indeed, the first two identities follow by integrating the other record first, and the third follows from independence and centering. Expanding the residual square therefore gives Also, Hence and centering each slice gives
To compute the rectangular second moment, recall the independent-sample identity. For independent identically distributed square-integrable real variables , define Expanding the square and factoring the mixed expectations gives Apply this identity first to the outcome-record average, with the treatment records fixed, and then to the treatment-record averages. Finite-sum integration commutes with taking the slice means. Since has mean zero, the resulting identity is Substituting the residual-energy identity above reduces this to The three preceding energy comparisons imply
We convert this inequality to the sampling envelope and then include the first-order term. The floor split satisfies Therefore and These inequalities apply for every , including .
By the definition of , The slice and kernel bounds thus give The independent-sample mean identity also gives and Linearity of expectation gives the centered-difference identity The pointwise inequality follows from . Applying it to the centered difference yields because . This argument accommodates the shared outcome records in the two terms.
Applying the preceding estimate to the response tags gives Applying it to the raw-matrix tags gives The square-integrability established above applies to every coordinate in these two displays.
Define the centered raw matrix by The symmetrization formula in Algorithm 2 and linearity of expectation give and therefore Every symmetrized coordinate is square-integrable as an average of two square-integrable raw coordinates.
For each sample, since the difference between the right and left sides is . Summing and exchanging the two indices gives the pointwise contraction
Integrability permits exchanging expectation and each finite sum. Summing the response-coordinate bounds gives Integrating the pointwise matrix contraction and summing the raw-coordinate bounds gives Adding these inequalities, and using , yields The chosen constant depends on , and hence has the permitted dependence on the fixed public parameters. All estimates hold uniformly over the admitted law and the admissible sample sizes and tuning inputs.
The first term reflects labeled information within the localization cube. The second couples the two record counts and increases with the fine projection rank. Because , its square-root order is the rectangular sampling term in Theorem 1. The same bound covers fluctuations of the response moments and of the empirical matrix, so it supplies the sampling control needed for the guarded local fit.
Guarded inversion and public tuning
The decision in Definition 11 uses the empirical cutoff against the population positivity margin in Lemma 2. This half-margin gap connects matrix fluctuations to the stability of the inversion branch. The complementary branch returns zero, and clipping confines the decision to the contrast range supplied by Assumptions 7 and 8. These operations give the total, finite, Borel decision covered by Theorem 1; the resulting constants may depend on the fixed overlap level.
The roles of the auxiliary results are distinct. Lemma 1 supplies the effect approximation order , the nuisance projection orders, and bounded polynomial coefficients. Lemma 2 supplies population stability, while Lemma 3 controls empirical departures from the population moments. Together, these ingredients underlie the four contributions in the uniform risk bound of Theorem 1: effect approximation, combined nuisance approximation, labeled sampling, and rectangular sampling. Clipping supplies the constant bound represented by the minimum with one.
The public tuning in Definition 12 assigns the fine resolution according to , the sum of nuisance smoothness orders. When , the resolution increases as the localization scale decreases, placing nuisance approximation at the effect approximation order. When , the choice provides the required approximation control. The ceiling preserves an integer resolution while changing its order by a bounded factor.
The localization scale balances the labeled sampling requirement and the rectangular sampling requirement. Its two candidate orders correspond to the two terms in Definition 14, with denominator for the unequal-count term. Taking their maximum yields the publicly tuned risk guarantee in Theorem 1. The resulting precision has a direct statistical interpretation: response labels govern the ordinary local sampling term, while the total treatment-record count reduces the sampling cost of the fine projection correction.
The supplied-propensity upper bound
The decision displayed in Theorem 3 uses the designated propensity from Definition 3 to form an inverse-propensity-weighted response. Under exchangeability and overlap, this response has conditional mean equal to the canonical contrast and bounded magnitude. The known uniform covariate distribution then supplies the design measure for the degree-two local polynomial average.
Polynomial reproduction makes the contrast smoothness the relevant approximation order for this decision. Its bandwidth , specified in Theorem 3, balances local approximation with labeled sampling. Clipping preserves the bounded contrast range. These are the statistical ingredients of the upper-bound component of that result, which attains the order uniformly over the primitive class and every auxiliary-record count. This benchmark identifies the labeled-sample precision attained by the rectangular estimator when its combined approximation and sampling costs are controlled at the same order.
Original-record lower bounds
The lower bounds use a marked-component lower-bound experiment within the primitive class of Definition 3. Under each hypothesis, a finite prior on primitive laws induces a mixture of the original sampling experiment: each primitive law generates exactly labeled records and outcome-free treatment records before mixing. Write for this fixed-size mixture law under hypothesis . The construction separates the point contrasts while controlling the statistical distance between the two complete-data mixtures. We use the following normalization of that distance.
For a primitive Borel probability law on , define its treatment-record marginal by Thus is the probability law on satisfying for every Borel set .
For with , , and the finite priors produced by Algorithm 3 on its probability-valued domain, define where , , and . Thus and are the positive- and negative-hypothesis probability laws of the original-record dataset , with labeled records and outcome-free treatment records. Under each mixture, one primitive law is drawn from the corresponding prior and all records are drawn conditionally independently from that law through their respective observation channels.
The unhalved squared Hellinger distance measures the distinguishability of the two hypotheses using both record types. The finite-prior construction of Algorithm 3 below couples propensity and response perturbations through correlated sign pairs. A smooth localization bump controls the contrast near the evaluation profile, while a finer smooth frame controls the spatial dependence of the perturbations.
The squared Hellinger distance between the positive- and negative-hypothesis mixture laws and is
⊢ LeanThe real-valued arm-mean functions and are defined for every dimension , real scales , real propensity perturbation amplitude , real response perturbation amplitude , hypothesis sign , and response sign array by Here , the finite frame index set, , the localization bump, and , the localized frame entries, use the defining formulas in Algorithm 3, evaluated at dimension and the stated real parameter values. The hypothesis sign and response signs encode Boolean values by assigning to true and to false. Each is the encoded second component of the Boolean sign pair at ; the first component is arbitrary. Control and treatment correspond to false and true arm values, respectively.
⊢ LeanIn Algorithm 3, is the propensity perturbation amplitude and is the scalar response-mean perturbation amplitude. The arm means are centered at the shared function , with offsets under control and under treatment. Consequently, the shared perturbation cancels from their difference, leaving exactly . Here the scalar is distinct from the estimator’s fine polynomial basis vector in Definition 10.
In Algorithm 3, the product sign-pair weights encode the hypothesis through the correlation between the two perturbations. The construction itself depends only on and ; the parameters enter only through the admissibility, occupancy, and information constants of the construction certificate. The deterministic contrast is shared by every primitive law within a hypothesis. Thus mixing over nuisance functions preserves an exact target separation. The compensating terms in the arm means link this separation to the singleton cancellation stated in the construction certificate below.
The information argument uses conditional factorization over spatial components. The calculus in Lemma 4, stated after the construction, records how squared Hellinger distance behaves under products, conditioning on a common marginal, and the addition of a common independent coordinate.
The construction takes inputs satisfying and , at the public parameters and fixed interior covariate profile .
Define the real functions and, for each , The two expressions at agree.
For and , define the localization bump and fine-scale frame by
For sign arrays , define For each hypothesis index , define the sign-pair correlation and product weights by
Define the propensity, contrast, and potential-response means by The probability-valued domain consists of inputs satisfying On this domain, define the primitive Borel law by Here is the covariate vector, is the binary treatment indicator, and are the binary potential responses under control and treatment. The prescribed functions are the designated conditional-margin functions of this law.
Output the contrasts and finite pushforward measures where is the unit point mass at the primitive law .
The product inequality in Lemma 4 aggregates component distances. Its conditional identity integrates these distances over the common covariate distribution, subject to the stated measurable-density condition. The final identity accommodates the independent randomizer available to decisions in Definition 4.
To translate mixture separation into expected absolute error, the analysis uses the fuzzy testing bound of Kennedy et al. (2024). Lemma 5, stated after the Hellinger calculus, fixes both its loss and its Hellinger normalization.
For probability laws on a common measurable space, use the normalization of Definition 18: The following statements hold on arbitrary measurable spaces.
For any finite family of pairs of probability laws , each pair on its respective common measurable space,
Let be a probability law on the conditioning space, and let be probability kernels into a common measurable space. Suppose there exists a common s-finite reference kernel such that both kernels are represented, at every , by nonnegative extended-real densities with respect to that reference kernel, with both densities jointly measurable in the conditioning and outcome coordinates. Then
For any probability laws on a common measurable space and any probability law on another measurable space,
⊢ LeanWe first establish the finite-reference identity used below. Whenever a real Radon–Nikodym density is used, its value is taken to be zero where the extended-real derivative is infinite; for finite measures, this changes the derivative on a null set.
Let be a finite measure on the common space , and suppose measurable nonnegative real densities satisfy Define using the real-density convention above. Radon–Nikodym reconstruction and the chain rule give and, -almost everywhere, For these nonnegative densities, Thus changing measure in the normalization of Definition 18 yields
Finite products. Write for the finite indexing set and for the measurable space of the pair indexed by . Define again as real densities. They are measurable, nonnegative, and integrable, and reconstruction gives with Define the coordinate affinity by The square roots are square-integrable, so their product is integrable. Expanding the square in the finite-reference identity gives
On the product space, define To verify the product-density representation, take measurable sets Product integration gives The same calculation applies to . Uniqueness of finite product measures therefore yields In particular, Applying the finite-reference identity and expanding the square as above gives Nonnegativity of the coordinate densities implies the pointwise identity Product integration consequently gives
The affinities satisfy and hence For every subset , induction on its cardinality gives A second induction gives the required affinity-defect bound. The empty product is one and the empty sum is zero. For , the induction step is Taking and multiplying by two proves The empty family is included by the stated empty-product and empty-sum conventions.
A common conditioning marginal. Let and be the conditioning and outcome spaces. Choose the s-finite reference kernel and jointly measurable densities supplied by the hypothesis, writing them as so that, for every , Define the sum kernel and normalized densities by and These are jointly measurable real functions on all of , and because each numerator lies between zero and its positive finite denominator; the other cases have value zero.
For every , and the nonnegative extended integral satisfies Thus the sum of the densities is finite -almost everywhere. Where that sum is zero, both densities are zero. Cancellation therefore gives, -almost everywhere, Consequently, for every ,
Define the finite joint reference measure by The kernel density representations and joint measurability imply Moreover, The normalized-density bounds give and hence The measurable square-root difference is therefore integrable against . Applying the finite-reference identity and then integration over the kernel gives For each , the same finite-reference identity and the conditional density representations yield Substitution proves
A common independent probability factor. For the given , use with the real-density convention above. The sum of the product laws is The product Radon–Nikodym identities give, -almost everywhere, Substituting into the defining square-root formula and integrating a function of the first coordinate gives where the last equality uses .
For the original-record lower bound, the testing comparison concerns the law of the entire fixed-size dataset. At this level, the observation space contains both record blocks, and the testing statement can be used with product count one. This formulation preserves the unequal record counts in the experiment. The certificate also records an exact equality of the auxiliary mixture laws; the relevant marginal is the treatment-record marginal of Definition 16.
Let and be probability kernels from a common measurable index space to a common measurable observation space, and let be a probability prior on the index space. Let be an integer, let be a model of measures containing and for every , and let be a real-valued functional on measures. Use the squared Hellinger distance of Definition 18, with normalization Suppose the following conditions hold:
(Constants.) The separation bound and distance bound satisfy and .
(Separation.) For every pair of indices ,
(Mixture distance.) The product-law mixtures satisfy
Then every measurable real-valued decision on the -observation sample space satisfies where the nonnegative loss integral is interpreted in the extended sense. This is the absolute-loss specialization of (Kennedy et al., 2024).
⊢ LeanFix a measurable decision . All loss integrals and their suprema below take values in .
Define the testing submodel, its component risks, and its worst-case risk by Every member of is a probability measure. The finite-product maps and are probability kernels. Define their mixture laws by Both mixtures are probability measures, since their component laws and the prior are probability measures. The distance hypothesis therefore gives
The probability prior ensures that the index space is nonempty. Choose an index . Separation gives Thus the nonempty set of values is bounded above. Define the finite real numbers For each index , separation with every gives Consequently, Define the measurable threshold event on the sample space by
We derive the Hellinger testing comparison for these mixtures. Define Choose nonnegative versions of the densities. They are integrable, and For every measurable sample event , Applying the integral triangle inequality on each of and , then adding, yields
The normalization in Definition 18 gives The square roots of the densities are square integrable. The pointwise identities therefore imply Also, by nonnegativity and the pointwise bound , Cauchy–Schwarz now gives Combining the preceding bounds proves, for every measurable ,
Define the total variation distance of the mixtures by Taking the supremum in the preceding event bound gives The complementary-event identity implies Since , Monotonicity of the square root consequently yields
The threshold separation gives the pointwise loss bounds, for every index , Indeed, on the decision lies below , while lies at least above it. On its complement the decision lies at or above the threshold, while lies at least below it. Outside the respective events, the displayed left-hand sides vanish.
Integrating these inequalities under the component product laws gives Kernel event probabilities are measurable functions of the index. Integrating their bounds against the probability prior therefore gives Adding yields the extended nonnegative inequality
Combining the testing and risk inequalities gives The bracket is nonnegative under . Using and cancelling the finite positive factor in , we obtain Finally, every member of equals or for some index ; either membership hypothesis places that measure in . Thus Transitivity proves the asserted bound, including when the supremum is infinite.
The marginal in Definition 16 is the sampling law of each outcome-free record. The next result establishes model membership, target separation, and the information bound for the prescribed smooth-frame construction. Its occupancy condition restricts the expected number of treatment records at the fine spatial scale.
Fix the primitive class of Definition 3, with public parameters satisfying There exist constants , , and , depending only on these public parameters, such that the following holds for every choice satisfying:
(Record counts.) , , with total record count .
(Scales.) .
(Propensity amplitude.) .
(Response amplitude.) .
(Effect calibration.) .
(Occupancy.) .
The prescribed construction of Algorithm 3, evaluated at , has the following properties for both hypothesis indices .
Its weights on the finite sign arrays are nonnegative and normalized: Every constructed law belongs to , and its canonical contrast agrees with the deterministic constructed contrast everywhere on the unit cube: Thus the finite prior is supported on . The designated propensity functions, restricted to the unit cube, have the same distribution under and .
At the interior center , the contrasts satisfy For the fixed-size original-record mixture laws and , the unhalved squared Hellinger distance of Definition 18 satisfies
For every integer , the auxiliary-record mixtures agree: Their explicit conditional auxiliary kernels also agree at every collection of covariates in . For either hypothesis and every , the singleton labeled mixture conditional on is uniform on the four values of .
Conditional on every collection of all covariates in the unit cube, form the graph whose vertices are all records. Join two distinct vertices when both covariates lie in the localization cube and their maximum-norm distance is at most ; records exterior to are isolated vertices. The conditional mixed density equals the product of the component densities over all connected components of this graph, including the exterior singleton components. Every auxiliary-only component and every component consisting of a single labeled record has the same conditional density, and hence the same conditional law, under the two hypotheses.
⊢ LeanThe information bound in Theorem 4 reflects where the two hypotheses can be distinguished. Their common propensity distribution gives identical auxiliary mixtures for every auxiliary sample size, including equality conditional on the auxiliary covariates. Compensation in the response means also makes a singleton labeled mixture uniform under either hypothesis. Conditional component factorization therefore locates distinguishing information in components containing a labeled record and at least one additional nearby record.
The factor in the distance bound corresponds to record pairs involving a labeled member, while records the localization and proximity scales. The squared perturbation factor is , and the target separation is . Under the stated sparse-occupancy gate , with occupancy constant , the certificate bounds the aggregate information by this pair-scale expression. These clauses give the component structure needed by Lemma 4 and the separation needed by the testing bound of Lemma 5.
The next result packages the smoothness, contrast, and occupancy calibrations into a minimax lower bound. Its sample-size interval is the range in which the unequal-count rate is at least the supplied-propensity order.
Fix and , where is the overlap level. Define the nuisance smoothness sum , the smoothness threshold , the record-growth exponent , and the rate denominator by Suppose that:
(Dimension.) .
(Nuisance smoothness.) and .
(Effect smoothness.) .
(Radius.) .
(Overlap level.) .
(Frontier regime.) .
There exists a constant , depending on the fixed public parameters , such that for every with , the total treatment-record count satisfying obeys the following bound for the minimax absolute-error risk of Definition 5, evaluated at these fixed parameters:
⊢ LeanPublic constants. Take the constants supplied by Theorem 4, writing its amplitude constant as : They depend only on the fixed public parameters. The parameter conditions give Define Thus and Since , , and , Also, so the information constant satisfies Finally, define the separation constant and the claimed lower-bound constant by
Admissible scales. Fix arbitrary in the stated range, and write In particular, and . Choose The frontier condition implies because . Consequently, Monotonicity of positive-base powers for now gives The amplitude definitions then give .
Separation and contrast calibration. Using and , multiplication of positive-base powers yields Likewise, The bounds , , and therefore imply
Occupancy, class membership, and mixture distance. The definitions of the rate parameters give Substituting the scale and collecting powers therefore gives Here the boundary condition makes the positive ratio at most one, and . The remaining amplitude hypotheses follow from :
All hypotheses of Theorem 4 are thus satisfied for the construction of Algorithm 3. For its finite lattice index set , write The certificate supplies probability priors and, for every , , and , At the evaluation profile this gives
Define the mixtures of the original data blocks by The certificate also supplies To evaluate its right-hand side, first note that Hence The inequality proves
The target as a functional of the experiment law. The randomized observation space and the marked experiment model are When , the auxiliary-record factor is the one-point empty product.
We show that equal marked experiment laws have equal point targets. Take two constructed laws where both hypothesis indices belong to and both sign pairs belong to , and suppose Since , projection onto the first labeled record gives Both covariate laws are uniform. Uniqueness of conditional probability kernels therefore gives For the independent Bernoulli construction, with the response selection of Definition 2, the four conditional cells are The same formulas hold for . Summing the first two equal cells identifies the propensity. The equal cells with , together with overlap, then identify the arm means: Indeed, the factors used for division satisfy Conditional independence in the prescribed construction now gives Integration against their common uniform covariate law proves equality of the full primitive laws.
Their common primitive law thus gives identical Bernoulli margin laws for , so admissible conditional-margin versions agree almost everywhere. The positive Hölder orders give continuity of , and gives continuity of the treated mean; the same holds for . Since the uniform law has full support on the cube, these continuous versions agree everywhere. In particular,
We may consequently define a functional on all nonnegative Borel measures on by The equality just proved makes the first case independent of the representative. Thus throughout the marked family.
A common prior for testing. Use the finite index space Define the common prior by its point masses: The nonnegative weights and their unit sums from Theorem 4 make a probability measure. Define the two probability kernels by Their values belong to . For every , the target identities give
Summing out the unused sign pair in each kernel gives the mixture identities The uniform factor is the independent randomizer. By the common-factor identity in Lemma 4 and symmetry of the squared difference in Definition 18,
Testing implies a minimax bound. Apply Lemma 5 to the model , the functional , and the preceding kernels and prior, with Here one observation is the entire randomized data block; the one-fold product space is identified with that block by its sole coordinate. For every Borel real-valued decision on , the testing bound gives The numerical overlap factor satisfies Moreover, the target representation and Definition 4 give where the last inequality uses the certified class membership. Thus every such decision satisfies Taking the infimum over the decisions in Definition 5 proves All loss integrals and suprema here retain their extended nonnegative interpretation.
Substitution of the separation scale. The identity now yields The positive constant depends only on the fixed public parameters, and the sample sizes were arbitrary in the stated range.
Under the low-nuisance-smoothness condition in Lemma 6, the exponent exceeds one. The stated interval consequently covers total record counts from the fully labeled experiment through the crossover to supplied-propensity precision. Within this interval, the lower bound captures the joint contribution of labeled and outcome-free records through their count product.
The complete minimax characterization in Theorem 2 organizes the lower bounds into complementary ranges. When and , Lemma 6 supplies the unequal-count term. Supplying the propensity enlarges the information available to a decision, so the supplied-propensity risk in Definition 6 is a lower bound for the original-record minimax risk in Definition 5. For , the supplied-propensity lower bound in Theorem 3 supplies the order , which is the larger term in the sharp rate. When , that same order is the larger term for every . Thus the supplied-propensity floor resolves the ranges complementary to the sparse-occupancy construction.
Together with Theorem 1, these lower bounds yield the matching characterization in Theorem 2. For the formal crosswalk, the rate and attaining decision are collected in the ordered pair of Definition 20 in Section D.
The statistical interpretation and count consequences of this pair are stated once in Theorem 2 and Proposition 1.
Acquisition consequences and supervised comparison
The sample requirements in Proposition 1 follow from the two terms of the sharp rate. Throughout the acquisition analysis, fix , , , , and an overlap level , as in Theorems 2 and 3. Retain the total treatment-record count , summed nuisance smoothness , rate denominator , smoothness threshold , and total-record exponent defined there. The identities below express how labeled responses and treatment records jointly determine precision.
Complete acquisition statement
Fix public parameters satisfying
(Dimension.) and .
(Nuisance smoothness.) and .
(Effect smoothness.) .
(Radius.) .
(Overlap.) .
Let and be the minimax and supplied-propensity risks of Definitions 5 and 6, and let be the sharp rate of Definition 14, with the fixed parameter arguments suppressed. Define the total treatment-record count , the summed nuisance smoothness , the tuning denominator , the smoothness cutoff , the total-record exponent , and the oracle rate by All constants below may depend on the fixed public parameters.
For every sequence , the following equivalences hold: where is the region of Definition 15; the lower limit is understood in the extended nonnegative reals. Moreover, All sequence limits and order relations are as . If , then . For every sequence with , If , then every auxiliary-size sequence satisfies
There exist real constants with such that, for every with , For these sample sizes, the exact rate branches are At every boundary pair with , In particular, for every , Writing for the average nuisance smoothness, the numerical supervised benchmark coincides with : for every , In this identity at , negative powers of zero are assigned the value zero.
Finally, there exist real constants , separate from the preceding pair, such that the following acquisition guarantees hold for every target absolute-error scale and every with . Let be the primitive class at the fixed parameters from Definition 3, and use the risk of Definition 4.
If there exists a Borel decision satisfying then Conversely, if then the sharp decision of Definition 13 is Borel and satisfies The exact rate-level acquisition condition is The total treatment-record count also satisfies .
⊢ LeanOracle attainment and strict benefit
Since , the sharp rate in Definition 14 satisfies Thus, for any finite tolerance , the annotation region in Definition 15 has the exact characterization The tolerance measures the remaining nuisance contribution relative to the supplied-propensity order. At , the count threshold is the point at which the two terms coincide.
For an auxiliary-size sequence , write . The uniform risk comparisons in Theorems 2 and 3 give Consequently, bounded relative risk is equivalent to an eventual positive lower bound on , or, equivalently, This is the oracle-attainment equivalence in Proposition 1. When , the inequality , together with , places every auxiliary-size sequence in this regime.
Strict benefit compares precision with labeled records alone. In the regime , one has and . Hence The first term tends to zero, and the second tends to zero exactly when . For , the rate ratio equals one. The uniform minimax comparisons therefore yield the criterion in Proposition 1: Strict benefit and oracle attainment thus describe distinct acquisition requirements. In the low-smoothness regime, a diverging auxiliary-to-labeled ratio produces a strict improvement, while attainment of the supplied-propensity order requires total treatment information of order at least . A bounded auxiliary-to-labeled ratio preserves the supervised minimax order.
Target-error acquisition
For a target absolute-error scale , inversion of the two rate terms gives the exact identity The first inequality specifies the response-label requirement. The second specifies the joint requirement on labeled and treatment-record counts.
To connect these numerical conditions to risk, let be comparison constants from Theorem 2, so that A Borel decision whose risk is at most uniformly over necessarily satisfies Conversely, the sufficient conditions ensure that the decision in Definition 13 has uniform risk at most . Absorbing the fixed powers of these comparison constants gives the necessity and sufficiency constants in Proposition 1.
At the rate level, a fixed labeled count satisfying the first inequality requires In particular, choosing gives the total-record requirement The smoothness threshold compares these two powers. Below , the treatment-record requirement grows faster than the labeled requirement; at and above the threshold, the labeled count already supplies the required treatment information.
The supervised numerical benchmark
At , the sharp rate becomes Its exponents and smoothness cutoff coincide with the numerical benchmark in Kennedy et al. (2024).
The cited theorem concerns a supervised model with a covariate density bounded above by a constant, an -smooth propensity, a -smooth control regression, and a -smooth contrast. It gives a minimax mean-absolute-error lower bound for sample sizes larger than a constant depending on . Its implicit multiplicative constant is positive and independent of sample size, with the density bound and Hölder constants fixed; these are source-model constants. The density restriction accommodates the construction-specific designs used in the source testing argument (Kennedy et al., 2024). The following identities express the numerical comparison in the notation of this paper.
Let the dimension and smoothness orders satisfy:
(Dimension.) .
(First nuisance smoothness.) .
(Second nuisance smoothness.) .
(Effect smoothness.) .
Put , the average nuisance smoothness. The numerical exponents and smoothness cutoff displayed in Kennedy et al. (2024) satisfy and For every with , the numerical piecewise benchmark satisfies
⊢ LeanThe hypotheses give Define the real denominators Both are strictly positive:
Clearing the positive denominators and simplifying gives Likewise, Since , multiplication by therefore yields These are the asserted exponent identities and cutoff equivalence.
Fix with , so that After substituting the exponent identities, the numerical piecewise benchmark becomes We compare these two powers by splitting at the equivalent cutoff in the preceding step.
Suppose first that Multiplying by , then dividing by , gives Consequently, Multiplying by and dividing by the positive product yields For a base , real powers are nondecreasing in their exponent. Hence and thus The cutoff equivalence selects precisely this first branch of the piecewise benchmark.
In the complementary case, Multiplication by , followed by division by , gives It follows that Multiplying by and dividing by now gives Monotonicity of real powers for therefore implies so The cutoff equivalence selects the second branch, including equality at the cutoff. Substituting the definitions of and proves the asserted maximum identity in both cases.
Lemma 7 identifies both the exponents and the boundary between their regimes. Equality at the cutoff places the supervised benchmark at the supplied-propensity order. Under the present public-parameter restrictions, its maximum is exactly .
For the known-uniform primitive class in Definition 3, the minimax interpretation of this expression follows from the original-record lower bounds. The construction in Theorem 4 and the converse in Lemma 6 provide the nuisance contribution in its governing range. The same-class subfamily with in Theorem 3 provides the labeled-response floor. Together with Theorem 1, these results establish the sharp risk comparison used throughout the acquisition analysis, while Lemma 7 supplies the exponent-and-cutoff identity with the published supervised benchmark.
Verification note
The formal results checked in Lean 4 are the estimator guarantee in Theorem 1, the supplied-propensity benchmark in Theorem 3, the smooth-frame construction certificate in Theorem 4, and the nuisance lower bound in Lemma 6. Their combination yields the minimax sandwich in Theorem 2 and the acquisition consequences in Proposition 1. Auxiliary checked results cover local polynomial projection, population positivity, rectangular sampling error, and Hellinger calculus in Lemmas 1, 2, 3, and 4.
The companion artifact for this paper version, whose working-paper number and version appear in the first-page stamp, is available from https://causalsmith.org/papers/stat_twosample_pointcate_annotation_frontier_v1. Its interactive formal links provide the theorem-to-file crosswalk and exact source excerpts. In the source archive, the checked modules are rooted at CausalSmith/Stat/STAT_TwosamplePointcateAnnotationFrontier_Research; the generated file presentation_crosswalk.json records the mapping from every displayed result to its Lean module and declaration. The crosswalk is regenerated with each paper version, so it describes the results as printed in this version.
The primitive-model and sampling restrictions are assumed inputs. These comprise the known uniform covariate design, conditional exchangeability, a fixed public overlap level , binary potential responses, Hölder restrictions, and probability-valued arm-mean bounds defining Definition 3, together with the independent product experiment and randomizer in Assumption 9. Each guarantee retains its stated public-parameter, sample-size, scale, amplitude, and occupancy conditions.
The absolute-loss testing result in Lemma 5 is proved in the formal artifact without external formal assumptions; Kennedy et al. (2024) remains its bibliographic source and statistical motivation. For the supervised comparison, Lemma 7 checks the numerical exponent identities, smoothness cutoff, and piecewise-rate equality associated with Kennedy et al. (2024). The published statistical lower bound belongs to that source’s model and assumptions. The minimax interpretation for the present known-uniform primitive class is established by Theorem 2, through this paper’s estimator guarantee and original-record lower bounds. The formal numerical identity also assigns totalized negative powers the value zero at ; every statistical risk and acquisition guarantee in the paper uses , so this representation value has no precision interpretation.
For the machine-readable crosswalk, the verified rate and decision are also packaged in the following representation-level handle; no statistical argument depends on this packaging.
The frontier handle is the ordered pair , parameterized by and , where is the overlap parameter. Its components are the sharp rate and decision of Definitions 14 and 13: Here is the original dataset and is the randomizer coordinate. The decision component uses the publicly tuned estimator of Definition 12 with parameters .
⊢ LeanProofs of the main results
Fix the public parameters in the statement. Every constant constructed below depends only on these parameters.
Fix admissible and . Define In particular, and . By Lemma 1, there is a constant , uniform over these choices, and a coefficient vector such that The same result supplies Here , so the bound on follows from the stated uniform coarse-basis bound.
The finite Borel basis functions and the finite moment sums in Algorithm 2 make both empirical moments finite Borel functions of the dataset. The eigenvalue cutoff is Borel: its matrix superlevel set is the intersection of the closed unit-vector quadratic-form inequalities. Matrix inversion on the invertible branch and clipping are Borel. Thus the decision in Definition 11, with value zero on the failed-cutoff branch, is finite and Borel on every dataset. Composing with the dataset coordinate gives a Borel decision on the original dataset and randomizer.
Define the population moments and the localized Taylor remainder by All localized integrals below are over .
The observed-response identity and the exchangeability condition in Definition 3 give, almost surely, Indeed, , and conditional exchangeability factors its conditional mean. Applying the same argument to and adding gives the second identity.
The role counts in Algorithm 1 satisfy Their records are independent under the sampling law in Assumption 9. Consequently, taking expectations in Algorithm 2, using uniform design and factoring each rectangular product, yields The response in the rectangular correction is , so its conditional mean is the second conditional mean displayed above.
For completeness, writing the orthonormal fine basis from Definition 10 as its finite expansion gives, for arbitrary , Orthonormality also gives and These identities show that the population matrix displayed above is symmetric, so it agrees with the expectation of the symmetrized empirical matrix.
Multiplying its entries by , substituting , and using the residual identity gives Cauchy–Schwarz and the two residual bounds from the preceding step imply The coarse coordinates are orthonormal, overlap bounds by one, and projection contraction follows from the displayed Pythagorean identity. Hence Applying Cauchy–Schwarz to the remaining two integrals therefore gives Define Squaring the coordinate bounds, summing over the coordinates, and taking square roots proves
Define the squared deviations, the bias scale, and the good event by The first two functions ignore .
On , the Rayleigh bound is It excludes a nonzero kernel and thus makes the matrix invertible. For arbitrary , set Cauchy–Schwarz then gives and consequently For this is immediate; otherwise division by its positive norm proves it.
The inverse identity and the residual decomposition are The triangle inequality and rowwise Cauchy–Schwarz imply Because both arm means lie in , Clipping toward this interval decreases absolute error: below its lower endpoint the clipped endpoint lies between the value and the target, above its upper endpoint the same holds, and inside the interval clipping preserves the value. Thus, on , Define the positive finite constant All three coefficients in the preceding parentheses are at most . On the complementary event the decision is zero and its error is at most . Combining these branches gives, on every sample,
By Lemma 2, For each such vector, finite Cauchy–Schwarz gives If , every unit-vector quadratic form of is at least , by subtracting this deviation from . Its infimum is therefore at least . Consequently, Define The preceding pointwise bound now becomes
Define the variance scale by By Lemma 3, there is a uniform positive finite constant such that Both deviations are nonnegative. Cauchy–Schwarz under the probability sampling law therefore gives The decision and target both belong to , so their absolute difference is at most and is integrable. Integrating the pointwise inequality and defining proves
Define All these quantities are nonnegative, and . Since , It follows that and hence Define Using also , the preceding risk bound gives If , this is the desired bound with the minimum. If , the pointwise diameter bound gives Thus, uniformly over ,
We next establish the public tuning bound. Define The parameter domain gives , , , and , so these constants are positive and finite.
For fixed and , define the two bandwidth orders Because and , The definition in Definition 12 consequently gives Moreover, using Definition 14.
Taking logarithms of gives Therefore where . Exponentiating yields
Suppose first that . Define Then , and Definition 12 gives Since , these inequalities imply The lower cell-side bound gives Substituting this inequality into the logarithm of the rectangular sampling term and exponentiating proves Similarly, gives As , Consequently,
Suppose instead that , including equality. The exponent in Definition 12 is then zero, so because .
The oracle bandwidth inequality also reads Taking logarithms gives Using , we obtain Since and , Thus both cases give admissible tuning and the four-term balance
Finally, define one constant for both assertions: It is positive and finite, and The fixed-tuning envelope has a nonnegative minimum, so enlarging its constant from to and taking the supremum over proves the first risk assertion.
For the second assertion, the tuning bounds make admissible for the fixed-tuning result. The identity in Definition 12 supplies and hence also its finiteness and Borel measurability. Using the minimum’s upper bound by its four-term argument gives, for every , The rate is nonnegative as the maximum of two positive powers of positive sample counts. All constants are uniform over the primitive class, so taking the supremum proves the tuned assertion.
Fix the public parameters as in the statement. Throughout the proof, use and where the last equality is Definition 14. All sample sizes below satisfy and .
Supplied-propensity lower bound. By Theorem 3, there is a constant , depending on the fixed public parameters, such that Every admissible decision induces a supplied-propensity decision by for every function . For each supplied function this decision is Borel, and its loss under each is Taking the supremum over the same primitive class and then the infimum over decisions, using Definitions 6 and 5, gives Consequently,
A uniform lower constant. First suppose . By Lemma 6, there is a constant , depending on the fixed public parameters, such that Choose
We establish the rate comparisons used in this case and in the remaining smoothness case. The parameter conditions imply Direct substitution gives and
Since , the laws of real powers therefore give the boundary identity The exponent is negative. Thus, when , When , instead, For completeness, if , then where the power comparison uses . Taking the maximum in the definition of consequently gives The boundary identity also gives
Return to the case . If , then , so the nuisance lower bound applies and yields If , the supplied-propensity lower bound yields Here the comparisons of constants preserve the inequalities because both rate terms are nonnegative.
In the remaining case , choose Then , and hence This constructs a positive constant , depending on the fixed public parameters and valid simultaneously for every admissible sample-size pair, such that
Attainment and the upper constant. By Theorem 1, there is a real constant , depending on the fixed public parameters, such that the publicly tuned decision is Borel measurable and its risk under every satisfies By Definitions 13 and 14, Set Then . For every admissible sample-size pair, is Borel measurable, and taking the supremum of the pointwise risk bound gives The last inequality follows from and .
Minimax comparison and arbitrary decisions. Since belongs to the decision class in Definition 5, Together with the bounds already established, this proves For any Borel real-valued decision using the original dataset and the independent uniform randomizer, the same infimum comparison gives The rate comparisons and boundary identity established above supply all three stated branches and their equality at .
Fix the public parameters in the stated domain. Throughout, inverse-propensity quotients are assigned value zero when their denominator is zero: The designated propensity is extended by zero outside .
Define the constant-nuisance subfamily and its supplied-propensity risk by These loss integrals may take the value . Since the subfamily uses the same decision class as Definition 6, restriction of the supremum gives It therefore suffices to establish a lower bound for , a uniform upper bound for the displayed smoother, and its admissibility. We first construct the lower-bound family.
Use the smooth profile from Algorithm 3, with the explicit formulas For this argument, extend the scaled-bump formula to every positive localization width and every covariate vector: Smoothness of the exponential glue function and finite products give In particular,
We need a uniform Hölder bound after scaling. Define Write the iterated derivatives as and define their finite operator-norm bounds by Their finiteness follows from continuity and compact support. Set The derivative bound and the mean-value inequality give, for every , If , use ; if , use . Thus both cases yield
Translation and dilation satisfy Evaluating these multilinear maps in coordinate directions gives the bounds and Here the dimension factors are valid because every coordinate direction has norm at most . Define For and , one has . Applying the norm definition in Definition 1 to the preceding derivative and modulus bounds proves This also covers the integer smoothness endpoints, where .
Choose the public amplitude constant It satisfies For each , define Since and , the power identities give Consequently,
For , define the primitive law by These conditional margins are Borel. Conditional independence gives exchangeability, and their bounds give The constant propensity and control functions have Hölder norms at most , while multiplication by either sign preserves the preceding contrast-norm bound. Thus the construction satisfies every condition of Definition 3.
The designated versions agree with these admissible margins on the cube. Indeed, conditional-margin uniqueness gives almost-sure equality, and continuity together with the full support of the uniform design promotes that equality to pointwise equality. Hence so that
Define the observed-record and full-experiment laws by Use the common probability reference measure on the covariate, treatment, and observed-response coordinates. Relative to this reference, the observed-record density is for and . The amplitude bound implies For any two density values at least , the squared sum of their square roots is at least one. The difference-of-squares identity therefore gives, pointwise, The Hellinger normalization in Definition 18 can be evaluated under : the densities relative to the sum of the two laws are , and the common denominator cancels. Thus Since , the containment and the product volume of this cube give Combining the preceding displays proves
The auxiliary covariate-treatment marginal is identical under the two laws: The product bound and common-factor identity in Lemma 4 therefore yield This applies to every ; at , the auxiliary product is the probability law on the empty record block. The independent uniform randomizer is another common probability factor. Finally, symmetry of the squared square-root difference gives the orientation used below:
The target is a well-defined functional of these full-experiment laws. To see this, equality of two such laws implies equality of their first labeled-record marginals, since . Under either constructed law, the observed conditional probabilities identify the arm means through almost everywhere under the uniform design. Thus equality of the observed laws identifies all three conditional margins. Their conditional product construction then identifies the primitive laws, and uniqueness of the canonical continuous contrast gives In particular, and are distinct because . Define a functional on all measures on the full sample space by It satisfies
The supplied propensity is the same function for both hypotheses, including its extension outside the cube: For any admissible supplied-propensity decision, its section at is measurable. Apply Lemma 5, the absolute-loss bound of (Kennedy et al., 2024), with singleton priors, one observation consisting of the entire record block and randomizer, and the choices The separation is , and the preceding Hellinger bound supplies the distance hypothesis. Consequently, Since , The two primitive laws belong to , so taking the infimum over decisions proves
We next establish the upper bound. For every , define the localization measure and weight by The measure is a probability measure because . For , its support lies in the design cube.
To make the coarse basis explicit, define and the one-dimensional polynomials At the current localization width , the basis and evaluation vector are for every . Define the evaluation kernel and its dimension constant by The constant coordinate belongs to , so and .
Direct integration of the three one-dimensional formulas gives Scaling each coordinate and multiplying these identities yields Expanding the finite sums consequently gives polynomial reproduction and kernel energy: The displayed polynomial formulas also give on . Thus All these identities hold for every .
Fix . Define the supplied-propensity response, its localized record contribution, the raw average, and its mean by These definitions apply to all , binary record coordinates, and every dataset and randomizer, using the quotient convention stated above.
On the design cube, overlap and the binary record coordinates give Outside the cube, the zero extension of the propensity gives Hence the response bound is global, and Borel measurability and this bound supply all integrability and finite second moments used below.
For , exchangeability and the conditional-margin identities in Definition 3, followed by cancellation of the overlap denominators, give Subtracting and using the canonical contrast identity gives Every labeled coordinate has this expectation, while the auxiliary block and randomizer integrate out as probability factors. Since ,
We now bound this mean’s bias over the full range . Define the Taylor polynomial Because , the coarse polynomial basis spans . Thus there exists a coefficient vector with
If , then and . The Hölder norm condition gives the Lipschitz bound, and the geometry of gives
If , then . For each , define the segment function The segment lies in the design cube. Expanding its -th derivative in coordinate partials and using their -Hölder modulus gives Indeed, the multinomial expansion contributes at most , and each top-partial difference is bounded by . The one-dimensional Lagrange remainder at degree , followed by subtraction of the degree- Taylor term, supplies some such that Since and , Using and yields
Define the positive public constants Both cases establish Polynomial reproduction and the mean identity therefore imply At , this becomes
The global response bound gives the recordwise squared bound Under the uniform design, localization and the kernel-energy identity give Independence of the labeled records yields The first inequality uses Cauchy–Schwarz on the probability experiment then gives At , use the target-coordinate bound and to obtain The estimate is uniform in , , and .
The probability-valued arm-mean conditions in Definition 3 imply The displayed smoother equals Projection onto this interval contracts distance to any target inside it. Thus, for every dataset and randomizer, Integrating and applying the preceding two bounds gives Define The bounded measurable raw average and continuous clipping map give measurability of the supplied-propensity section. The clipping formula itself gives the pointwise guarantee for every dataset and randomizer.
For completeness, the smoother has a total admissible extension to arbitrary supplied functions. Define For every fixed Borel , the totalized reciprocal, record-coordinate maps, finite sum, and clipping are Borel; the other section is constant. Since each designated is Borel, this extension agrees with the displayed smoother at every admitted law. It is therefore a candidate in Definition 6, and the uniform bound proves
Finally, retain the lower constant already constructed and set These are finite real constants depending on the fixed public parameters, with Because , enlarging the upper constant preserves both the minimax and individual-decision bounds. Combining the lower bound with subfamily monotonicity gives, for every and , and, for every , Together with the measurability and pointwise clipping bound above, these are all the asserted conclusions.
Fix the public parameters. All constants constructed below depend only on these parameters. We use the functions and sign arrays prescribed by Algorithm 3, extending the displayed function formulas to when taking analytic bounds.
Regularity and membership. Set The function is smooth and flat at zero: each of its derivatives on the positive half-line is a polynomial in multiplied by , and this expression tends to zero as . The denominator defining the scalar angular transition in Algorithm 3 is positive everywhere. Consequently the prescribed sine and cosine pieces join smoothly, including at their support endpoints. The bump is also smooth and compactly supported, and Define the finite derivative bounds and put Translation invariance gives the same derivative bound for every . Telescoping a product of factors bounded by one, and then using , yields
At each point, a nonzero frame entry has, in each coordinate, one of the two lattice indices adjacent to the scaled coordinate. Thus at most entries are nonzero. Each entry has absolute value at most one, so For a difference between two points, entries outside the union of their active index sets contribute zero. That union has at most elements. Therefore For a Hölder order , define When , the Lipschitz bound and give the required Hölder difference bound. When , use the bound instead. Since , the supremum term is covered as well. With the norm of Definition 1, this proves
For the macro bump, use its fixed compact profile . For every integer , define where is the total derivative of order , with the order-zero norm interpreted as absolute value. These constants are finite by smoothness and compact support. For , define The derivative of order has both a bounded supremum and a Lipschitz bound supplied by the next derivative. Splitting at distance one gives Dilation by multiplies a derivative of order by . Evaluating a derivative on coordinate directions bounds a partial derivative by its operator norm times . Hence, for , and Thus, in particular for the orders and ,
Define The public domain gives . Hence , and multiplying any of the five summands preceding the final in by gives at most .
Suppose the amplitude and contrast inequalities hold with . Since , Also and , so The prescribed probabilities therefore satisfy These bounds imply the overlap and both probability-valued arm-mean conditions.
Subadditivity and homogeneity of the Hölder norm give Consequently All the prescribed functions are Borel. The independent conditional Bernoulli construction gives uniform covariates and conditional exchangeability, and its conditional margins are exactly the prescribed functions. Together with the preceding bounds, these facts establish every condition in Definition 3.
To identify the canonical contrast, the prescribed control mean is continuous, and the prescribed treated mean is continuous because it is the sum of the control mean and . Their admissible designated versions agree with them almost surely by uniqueness of conditional margins. Two continuous versions that agree almost everywhere under the uniform design agree everywhere on the cube: a nonzero continuous difference would persist on a relative neighborhood of positive uniform measure, including at a boundary point. Thus
Normalization and singleton cancellation. Define expectation over the finite sign arrays by At each index, direct summation over the four sign pairs gives Multiplying these identities over the finite index set proves The same finite-product summation gives Indeed, matching indices use the scalar sign-pair correlation, while distinct indices include a zero-mean scalar factor.
The sine-cosine identity on each lattice interval gives a sum of squares equal to one. Tensoring it and multiplying by yields For , all nonzero tensor entries lie in the prescribed finite index set; for , both sides vanish. Expanding the finite signed sums therefore gives
Set If the amplitude inequalities hold with , then Thus the raw propensity and both raw arm probabilities lie in , at every covariate, so their Bernoulli atom formulas apply directly.
For a labeled record, define the treatment and observed-response spins by Relative to the uniform probability measure on the four spin pairs, its likelihood is This follows by multiplying the two Bernoulli atom probabilities, each divided by its fair atom probability. Expanding the product gives Hence every atom of the singleton labeled mixture has probability . This proves its uniform conditional law for every hypothesis and every cube covariate.
Equality on uninformative components. For integers and , write The first indices are labeled. A spin assignment has domain Define the record likelihoods by and, for every subset , define Empty products equal one, so .
The sign flip is a bijection, and its weights satisfy Every auxiliary likelihood is unchanged by this flip, because it depends on alone. Reindexing the finite sum consequently gives If with , singleton cancellation instead gives Thus we may take Under its amplitude conditions, every auxiliary-only component and every singleton labeled component has equal densities under the two hypotheses. Equality for all spin assignments gives equality of their full conditional laws.
The component density difference. Define Assume the amplitude inequalities with . Fix and a subset , and define its size by For every record, introduce the contrast-deleted factors The bounds from the previous steps give For labeled records, For auxiliary records, . Since , both cases satisfy
Define Telescoping a product, using an upper bound on both sets of factors, gives Here the telescoping sum replaces one factor at a time; each remaining product is bounded by , which is at most the displayed power. For the empty set both sides are zero. Applying this inequality gives
Flipping preserves every function of and changes the positive weights to the negative weights. Flipping similarly preserves every function of . Consequently Expanding the centered product and using normalization therefore yields Each expectation on the right has absolute value at most . Adding the two contrast-deletion errors gives Finally, Substitution proves For , both densities equal one and the bound is zero.
A positive floor and component Hellinger distance. Define Under the amplitude inequalities with , Thus the treatment factor of a labeled likelihood is at least , and its outcome factor is also at least . Their product is at least . An auxiliary likelihood is at least , hence at least . Averaging the resulting product floor with nonnegative normalized weights gives
Define the common probability reference on the record spins by and define For nonnegative numbers bounded below by , the identity and the denominator bound give Apply this with the preceding component floor and density difference, and integrate against the probability reference. We obtain
Conditional factorization and the count bound. For fixed covariates, define the augmented graph and let The cube is that of Definition 7. Records outside are isolated in this augmented graph and have likelihood one.
If , then Two records sharing a nonzero frame entry therefore satisfy and belong to the same component. Assign each frame index active at any record to this unique component; inactive indices contribute a factor one. The product prior is independent across indices, and each component likelihood depends solely on its assigned indices. Regrouping the finite sign sums by these disjoint groups consequently proves Each component density depends solely on its component spins. Integrating the fixed-sign record product over those fair spins gives one, because every record likelihood is normalized. Averaging signs therefore gives
Define the component affinities by Normalization and imply Integration over disjoint spin blocks multiplies the affinities. The elementary finite-product inequality follows by induction from the fact that all the affinities lie in . Hence
Set Its amplitude conditions permit both the component bound and the uninformative-component equalities. A component containing a labeled record and having size less than two has size one, so its distance is zero by singleton cancellation. A component containing no labeled record is auxiliary-only, so its distance is also zero. Define the informative component counts, for every integer , by Regrouping the remaining component sum by size gives The graph is exactly the graph in the statement: it retains all vertices, including the exterior singleton components, whose density factors equal one.
The labeled-root tree series. Define the common covariate probability measure by For , a component counted by has a labeled root and a spanning tree on its vertex set. For a fixed root, there are choices of the other vertices. Orient a spanning tree toward the root. Each nonroot vertex chooses a parent among the selected vertices, so the number of valid rooted trees is at most .
For a fixed valid tree, integrate its leaf covariates successively. Each child is constrained to a maximum-norm box of side around its parent; intersection with the unit cube has uniform mass at most . The root lies in , whose uniform mass is . Thus the probability of this tree event is at most Dropping the remaining component conditions enlarges the event. Summing these tree witnesses over the possible labeled roots gives For , the count and the binomial coefficient are both zero.
The binomial bound and the exponential series imply For the second inequality, its left side is one nonnegative summand of the exponential series at . Consequently
Define The series defining converges because it is a shifted polynomial-geometric series. These definitions give and .
Under , define Applying the binomial-tree bound with gives For every finite truncation, Multiplying the tree-count inequality by its size weight and summing therefore yields The final inequality replaces by and substitutes the definition of .
Integration for the original experiment. The covariate distribution is for every sign realization and hypothesis. Conditional on these covariates, the original records have density against . Thus, after grouping covariates and spins, the mixture laws have densities and against .
For two densities against a common dominating measure, substitution into Definition 18 gives the integral of their squared square-root difference. Applying this identity and then integrating over covariates yields The finite graph counts are measurable, and all functions in the finite weighted count sum are integrable. Integrating the conditional bound therefore gives Every term is nonnegative, so extending the size sum to the shifted range used above gives Define This proves the required information estimate under the amplitude conditions with and the occupancy condition with .
Common calibration and the remaining equalities. Choose All four constants are positive and at most one, so Fix a tuple satisfying the theorem’s hypotheses with this . Since and , multiplication by their real powers preserves these comparisons. For each , The membership, singleton, uninformative-component, and information estimates established above therefore apply simultaneously. Weight normalization makes the finite pushforward priors probability measures, and the pointwise membership conclusion supports them on .
For the propensity distribution, the sign flip preserves the covariate-treatment marginal: The designated propensity witnesses of these admitted laws are continuous and are versions of the same conditional treatment probability. Uniqueness of conditional margins followed by continuity under the full-support uniform design gives Reindexing the finite pushforwards using proves equality of the distributions of the entire propensity functions restricted to the cube.
At the target, , and hence Because and ,
Finally, for every integer , reindexing by the same sign flip gives For any fixed auxiliary covariates, their conditional mixture kernels are The factors are unchanged by the sign flip, so these kernels also agree for every covariate collection. When , the products are the unit probability measure on the empty tuple, and normalization gives the same equality.
The singleton calculation supplies the stated uniform labeled conditional laws. The conditional factorization and component equalities apply to every cube covariate collection and every spin assignment. Together with the calibrated information bound, these establish all assertions.
Fix the public parameters in the stated domain. The frontier, oracle, and acquisition constants below are finite real numbers depending only on these parameters. In particular, For an arbitrary auxiliary-size sequence, write All asymptotic arguments may be restricted to the tail .
By Theorems 2 and 3, choose constants satisfying such that, uniformly for and , Since these bounds make both risks positive and finite. Dividing the upper bound for one risk by the lower bound for the other gives The same calculation, using the frontier bounds at and , gives The first pair transfers eventual boundedness in both directions. The second pair transfers convergence to zero by squeezing between zero and a fixed multiple of the other ratio. Moreover, positivity of gives Consequently,
If the rate comparison holds, there is a real constant such that Set Then , and the defining inequality in Definition 15 holds eventually. Conversely, eventual membership in that region supplies the rate comparison with constant . Thus
For the extended nonnegative lower limit, the tail characterization is Indeed, a positive lower limit admits a smaller positive finite real number, which bounds every sufficiently late term from below; this also applies when the lower limit is . Conversely, an eventual positive lower bound bounds the lower limit from below.
We now translate annotation-region membership into precisely such a bound. Directly from the definitions, For , this yields Let . Since , the maximum defining and Definition 15 give Here the second equivalence uses the strictly decreasing positive-power map with exponent , whose inverse has exponent ; all bases are positive.
Eventual membership therefore supplies the positive lower bound In the reverse direction, suppose an eventual lower bound is given, and choose Then The displayed count characterization gives eventual membership in . Combining this with [proof:annotation-threshold-risk-rate] proves all four oracle-order equivalences.
To characterize strict improvement, first suppose . The identities above imply and hence Define the positive decay exponent For , the inequality gives The lower-count branch in Theorem 2, applied with , therefore gives Dividing the two terms in the maximum defining by this positive rate yields Thus
The second term tends to zero exactly when . To see the reverse implication explicitly, let If the second term tends to zero, then eventually Inverting this decreasing power gives This proves divergence to . The forward implication follows from the convergence of a strictly negative power to zero at . Since divergence of the total-to-labeled ratio is equivalent to divergence of the auxiliary-to-labeled ratio: an eventual lower bound at any real threshold for either ratio gives the corresponding bound for the other after shifting the threshold by one.
The first term tends to zero. Both terms are nonnegative, so convergence of their maximum to zero implies convergence of the second term by squeezing; conversely, convergence of both terms implies convergence of their maximum. We have proved, in this regime,
For the complementary case , Theorem 2 gives, for every , The ratio therefore has limit one, which excludes convergence to zero. Combining the two cases and the risk-to-rate equivalence proves
The claimed exponent comparison follows from the same positive-denominator identity:
Suppose . Choose a real constant satisfying and define Eventually , and consequently Taking the negative power gives and The oracle term is common to both rates and satisfies Taking maxima therefore gives Using the risk sandwiches, These eventual inequalities prove both stated big- comparisons.
If , the frontier rate equals . For every and , the frontier upper bound and the oracle lower bound consequently give Dividing by the positive oracle risk yields This uniform bound proves the oracle-order comparison for every auxiliary-size sequence.
For the finite-sample conclusions, Theorem 2 supplies, simultaneously for all and , In particular, its upper bound follows by comparing the minimax value with the worst-case risk of . The same cited statement supplies exactly together with Thus furnish the asserted finite-sample constants, including the equality of the two count branches at their boundary.
For , specialize to . If , then , so If , the first branch of Theorem 2 gives . Hence
Define the average nuisance smoothness by By Lemma 7, algebra with positive denominators gives In particular, For , these identities identify the numerical benchmark’s strict split and its two exponents with the supervised branches just established.
The remaining sample sizes are and . At , all power bases equal one, so both the benchmark and equal one. At zero, the numerical formulas use the convention All exponents occurring here are strictly negative: Thus both branches of the benchmark equal zero at , and the two terms in the maximum defining also equal zero. This proves the benchmark equality for every , with the stated formulas for .
For acquisition, define the positive exponents For positive , the power-scaling identity is Choose
For any positive , , and , the defining maximum in Definition 14 gives The second equivalence again inverts strictly decreasing powers of positive bases.
Now let , and suppose a Borel decision satisfies By Definition 5 and the frontier lower bound, Therefore . Apply the exact rate equivalence at the positive scale , and then the scaling identity, to obtain The choice of the minimum gives the common necessity constant:
Conversely, suppose By the choice of the maximum and the scaling identity, and The exact equivalence at scale gives By Theorem 2, the decision from Definition 13 is Borel measurable, and, for every , Thus supply the asserted acquisition constants. Finally, because .
References
- Robins, James M. and Tchetgen Tchetgen, Eric and Li, Lingling and van der Vaart, Aad W. (2009). Semiparametric minimax rates. Electronic Journal of Statistics. doi
- Nie, Xinkun and Wager, Stefan (2021). Quasi-oracle estimation of heterogeneous treatment effects. Biometrika. doi
- Kennedy, Edward H. (2023). Towards optimal doubly robust estimation of heterogeneous causal effects. Electronic Journal of Statistics. doi
- Kennedy, Edward H. and Balakrishnan, Sivaraman and Robins, James M. and Wasserman, Larry (2024). Minimax rates for heterogeneous causal effect estimation. The Annals of Statistics. doi
- Chakrabortty, Abhishek and Dai, Guorong (2022). A General Framework for Treatment Effect Estimation in Semi-Supervised and High Dimensional Settings. . arXiv
- Cheng, David and Ananthakrishnan, Ashwin N. and Cai, Tianxi (2021). Robust and Efficient Semi-Supervised Estimation of Average Treatment Effects with Application to Electronic Health Records Data. Biometrics. doi
- Kim, Seok-Jin (2026). Optimal and Structure-Adaptive {CATE} Estimation with Kernel Ridge Regression. . arXiv
- Sui, Y. and Zhou, J. and Zhou, H. and Dai, X. (2026). Prediction-Powered Conditional Inference. . arXiv
- Kato, M. (2025). Semi-Supervised Treatment Effect Estimation with Unlabeled Covariates for Prediction-Powered Causal Inference. . arXiv
Comments on earlier versions
Anchored to: