Optimal Weight (OW): Methods & Applications

• Optimal Weight (OW) is a set of optimization-based schemes assigning nonnegative, normalized weights to inputs to meet criteria like orness, covariate balance, and efficiency.
• These methods cover closed-form constructions for OWA operators, overlap weighting in causal inference, and optimal tree weights in ensemble learning, each with proven theoretical and empirical advantages.
• OW approaches also extend to continuous treatments and experimental design, emphasizing computational tractability and regularization to avoid extreme weight concentration.

Optimal Weight (OW) is not a single universally standardized construction. In the research literature, the term denotes several optimization-based weighting schemes that assign nonnegative coefficients to ordered inputs, treatment groups, base learners, code coordinates, design points, or observed records so as to satisfy a prescribed structural property such as target orness, exact covariate balance, minimum asymptotic variance, minimum surrogate risk, or representative moment matching. Prominent instances include closed-form weights for Ordered Weighted Averaging (OWA) operators, overlap weighting in causal inference, optimal weighting of random-forest trees, optimized weighted decoding in ternary ECOC, and convex sample-reweighting frameworks for representative weighting (Duarte et al., 2018, Lu et al., 20 Jan 2026, Chen et al., 2023, Zhang, 2013, Barratt et al., 2020).

1. Closed-form OW for Ordered Weighted Averaging

For OWA operators, the weight vector $w=(w_1,\dots,w_n)$ defines the aggregation

$y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$

where $x_{(1)}\ge x_{(2)}\ge \dots \ge x_{(n)}$, $\sum_{i=1}^n w_i=1$, and $0\le w_i\le 1$. The central design variable is Yager’s orness measure,

$$\mathrm{orness}(w)=\frac{\sum_{i=1}^n (n-i)w_i}{n-1},$$

which interpolates between pure AND / min at $\mathrm{orness}=0$, pure OR / max at $\mathrm{orness}=1$, and the simple average at $\mathrm{orness}=0.5$ (Duarte et al., 2018).

The Duarte–Téllez construction addresses the inverse problem: given a target $\alpha\in[0,1]$, construct a weight vector that exactly attains that orness without numerical iteration. For $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$0, with $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$1 and $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$2, the method introduces

$y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$3

allocates

$y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$4

and distributes the remaining mass linearly over the first $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$5 coordinates: $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$6 Using Faulhaber sums

$y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$7

the normalization and orness constraints reduce to a $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$8 linear system, yielding

$y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$9

For $x_{(1)}\ge x_{(2)}\ge \dots \ge x_{(n)}$0, the construction is symmetric: compute weights for $x_{(1)}\ge x_{(2)}\ge \dots \ge x_{(n)}$1 and reverse them (Duarte et al., 2018).

This OW family is direct, symmetric about $x_{(1)}\ge x_{(2)}\ge \dots \ge x_{(n)}$2, and runs in $x_{(1)}\ge x_{(2)}\ge \dots \ge x_{(n)}$3 arithmetic operations with no root-finding. Its reference point is the Maximum-Entropy OWA, which maximizes

$x_{(1)}\ge x_{(2)}\ge \dots \ge x_{(n)}$4

under normalization and orness constraints. The closed-form linear method is explicitly described as suboptimal according to the Maximum Entropy criterion, but empirically close to optimal: for $x_{(1)}\ge x_{(2)}\ge \dots \ge x_{(n)}$5 and $x_{(1)}\ge x_{(2)}\ge \dots \ge x_{(n)}$6, the entropy gap $x_{(1)}\ge x_{(2)}\ge \dots \ge x_{(n)}$7 is on the order of $x_{(1)}\ge x_{(2)}\ge \dots \ge x_{(n)}$8–$x_{(1)}\ge x_{(2)}\ge \dots \ge x_{(n)}$9, with the worst-case sub-optimality near $\sum_{i=1}^n w_i=1$0 and “within 99.9% of the optimal entropy” in the reported comparisons (Duarte et al., 2018).

2. Overlap weighting in causal inference

In causal inference with binary treatment $\sum_{i=1}^n w_i=1$1 and propensity score $\sum_{i=1}^n w_i=1$2, overlap weighting defines

$\sum_{i=1}^n w_i=1$3

or, in balancing-weights form,

$\sum_{i=1}^n w_i=1$4

The corresponding estimand is the Average Treatment Effect in the Overlap population (ATO), with overlap density proportional to $\sum_{i=1}^n w_i=1$5 (Lu et al., 20 Jan 2026).

A defining property is exact mean covariate balance under logistic propensity-score models. If

$\sum_{i=1}^n w_i=1$6

then the score equations imply $\sum_{i=1}^n w_i=1$7, and OW yields

$\sum_{i=1}^n w_i=1$8

In sample form, under a fitted logistic model, OW uniquely ensures

$\sum_{i=1}^n w_i=1$9

for every covariate in $0\le w_i\le 1$0 (Lu et al., 20 Jan 2026). In randomized trials, the same property is framed as complete removal of chance imbalance for covariates entering the logistic propensity-score fit, in contrast to IPW, which typically reduces but does not eliminate mean imbalance (Zeng et al., 2020).

The designation “optimal” refers to asymptotic variance within the balancing-weights family. Li, Morgan and Zaslavsky showed that among weights of the form $0\le w_i\le 1$1, choosing $0\le w_i\le 1$2 yields the smallest large-sample variance for the difference in weighted means (Lu et al., 20 Jan 2026). Under limited overlap, this is operationally important because OW down-weights extreme-propensity units smoothly rather than discarding them. In the observational-study simulations of Zhou et al., OW, matching weights, and entropy weights consistently outperform IPW in bias, root mean squared error, and coverage probability under limited overlap and misspecified propensity-score models; OW is also reported as uniformly the most efficient among OW, MW, and EW (Zhou et al., 2020).

In randomized clinical trials, OW is presented as a design-based alternative to ANCOVA. For a continuous outcome, the OW estimator attains the same semiparametric variance lower bound as the most efficient ANCOVA estimator and the IPW estimator, and closed-form sandwich variance estimators are derived for additive and ratio estimands (Zeng et al., 2020). In the BestAIR application, fitting a logistic propensity model and using $0\le w_i\le 1$3 produced exact absolute standardized difference $0\le w_i\le 1$4 for all 9 covariates in the reported analysis (Zeng et al., 2020).

OW has also been extended to right-censored survival outcomes with restricted mean survival time (RMST) targets. In that setting, OW is combined with inverse probability of censoring weighting through

$0\le w_i\le 1$5

and the overlap-population RMST is estimated by a weighted Nelson–Aalen or equivalent Hajek-type form. The paper reports that, regardless of overlap, OW has advantages over IPTW and trimming in bias, variance, and 95% confidence interval coverage when the estimand is defined based on RMST (Cao et al., 2023).

3. Continuous-treatment and model-free extensions

For continuous treatments, Kallus and Santacatterina proposed Kernel Optimal Orthogonality Weighting (KOOW). With iid observations $0\le w_i\le 1$6, KOOW constructs nonnegative weights $0\le w_i\le 1$7, $0\le w_i\le 1$8, $0\le w_i\le 1$9, so that the continuous treatment and confounders become “orthogonal” under the weighted empirical distribution (Kallus et al., 2019).

The key object is the weighted functional covariance

$$\mathrm{orness}(w)=\frac{\sum_{i=1}^n (n-i)w_i}{n-1},$$0

and KOOW minimizes the worst-case normalized covariance over an RKHS: $$\mathrm{orness}(w)=\frac{\sum_{i=1}^n (n-i)w_i}{n-1},$$1 With kernel matrix $$\mathrm{orness}(w)=\frac{\sum_{i=1}^n (n-i)w_i}{n-1},$$2, this becomes

$$\mathrm{orness}(w)=\frac{\sum_{i=1}^n (n-i)w_i}{n-1},$$3

and the estimator solves the convex quadratic program

$$\mathrm{orness}(w)=\frac{\sum_{i=1}^n (n-i)w_i}{n-1},$$4

The penalty $$\mathrm{orness}(w)=\frac{\sum_{i=1}^n (n-i)w_i}{n-1},$$5 controls extreme weights, and with a universal kernel, driving $$\mathrm{orness}(w)=\frac{\sum_{i=1}^n (n-i)w_i}{n-1},$$6 implies independence; with a polynomial kernel it implies uncorrelatedness of all polynomial transformations of $$\mathrm{orness}(w)=\frac{\sum_{i=1}^n (n-i)w_i}{n-1},$$7 and $$\mathrm{orness}(w)=\frac{\sum_{i=1}^n (n-i)w_i}{n-1},$$8 (Kallus et al., 2019).

A model-free binary-treatment generalization appears in Causal Optimal Transport (COT). There, one reweights each treatment-group empirical measure toward the full-sample empirical measure by minimizing entropically regularized optimal transport distances. With subgroup measures $$\mathrm{orness}(w)=\frac{\sum_{i=1}^n (n-i)w_i}{n-1},$$9 and full-sample empirical measure $\mathrm{orness}=0$0, the central objective is

$\mathrm{orness}=0$1

where $\mathrm{orness}=0$2 is the Sinkhorn divergence (Dunipace, 2021). The resulting weights are used in the Hájek estimator

$\mathrm{orness}=0$3

KOOW and COT share a nonparametric balancing orientation but differ materially in their primitives. KOOW minimizes worst-case penalized functional covariance in an RKHS, whereas COT minimizes transport discrepancies between empirical distributions. COT is described as semiparametrically efficient and model-free, while also allowing additional moment-balance constraints and nonparametric estimation of conditional mean outcome functions and missing potential outcomes (Dunipace, 2021). This suggests a broader technical split within OW-type causal methods between orthogonality-based balance criteria and distributional-balance criteria.

4. OW in ensemble learning and multiclass decoding

In regression random forests, “Optimal Weight” refers to nonuniform weighting of trees rather than equal-weight aggregation. Let $\mathrm{orness}=0$4 base learners produce fitted vectors $\mathrm{orness}=0$5, and let $\mathrm{orness}=0$6 satisfy $\mathrm{orness}=0$7 and $\mathrm{orness}=0$8. The weighted-forest predictor is

$\mathrm{orness}=0$9

and the target is minimization of a Mallows-type surrogate of the conditional risk $\mathrm{orness}=1$0 over the simplex $\mathrm{orness}=1$1 (Chen et al., 2023).

Two algorithms are proposed. The one-step method solves

$\mathrm{orness}=1$2

where $\mathrm{orness}=1$3 is cubic in $\mathrm{orness}=1$4. The accelerated two-step method first estimates a common variance $\mathrm{orness}=1$5 under equal weights, solves a quadratic program for $\mathrm{orness}=1$6, forms residuals $\mathrm{orness}=1$7, and then solves a second quadratic program for $\mathrm{orness}=1$8. Under stated regularity conditions, both 1step-WRF$\mathrm{orness}=1$9 and 2steps-WRF$\mathrm{orness}=0.5$0 are asymptotically optimal in the sense that their squared loss and risk are asymptotically identical to those of the infeasible best possible model averaging estimator (Chen et al., 2023).

Empirically, both optimal forests typically outperform the equal-weight forest and two other weighted RFs in 9–11 out of 12 data sets under both MSFE and MAFE, and 2steps-WRF$\mathrm{orness}=0.5$1 is reported as only marginally lower-risk than 1step-WRF$\mathrm{orness}=0.5$2 while being 10–100× faster in practice because it solves two quadratic programs rather than one cubic problem (Chen et al., 2023).

A different use of OW appears in ternary ECOC as Optimized Weighted decoding. Here the code matrix $\mathrm{orness}=0.5$3 is fixed, and OW decoding introduces a class-specific weight matrix $\mathrm{orness}=0.5$4 with constraints $\mathrm{orness}=0.5$5 if $\mathrm{orness}=0.5$6, $\mathrm{orness}=0.5$7 if $\mathrm{orness}=0.5$8, and $\mathrm{orness}=0.5$9 for each class $\alpha\in[0,1]$0. The learning problem is a linear program that minimizes total slack $\alpha\in[0,1]$1 under margin constraints comparing the true class against every alternative class (Zhang, 2013).

The OW decoding LP is reformulated in a single-slack form and solved by a cutting-plane algorithm. Theoretical results establish equivalence between single-slack and multi-slack formulations and a monotonicity property: as new dichotomizers are added, the optimal training risk never increases. In the reported experiments, WOLC-ECOC with OW achieved average rank 2.14 across 16 coding+decoding methods with AdaBoost, and often used substantially shorter codes than one-vs-one while retaining or improving accuracy (Zhang, 2013).

5. Optimal weights over design spaces and observed samples

In optimal experimental design for linear models

$\alpha\in[0,1]$2

the design itself is a weight distribution. Classical discrete OED uses weights $\alpha\in[0,1]$3, $\alpha\in[0,1]$4, $\alpha\in[0,1]$5, over rows $\alpha\in[0,1]$6 of the design matrix, producing information matrix

$\alpha\in[0,1]$7

The continuous formulation replaces the finite simplex by a probability measure $\alpha\in[0,1]$8 and

$\alpha\in[0,1]$9

The objectives considered are

$y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$00

Their variational derivatives are computed explicitly, and steepest descent is posed as a Wasserstein gradient flow PDE, discretized by a Monte Carlo particle method (Jin et al., 2024).

The particle approximation represents $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$01 by equal-weight particles $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$02. At each step, the algorithm approximates $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$03, inverts it once, computes particle velocities from the first variation, and updates particles by Euler steps. In the reported elliptic inverse-problem experiments, the resulting design measure concentrates mass on informative measurement locations and changes the A- or D-criterion by 20–50% relative to a uniform design (Jin et al., 2024).

A more general data-reweighting formulation appears in representative sample weighting. Given samples $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$04, feature functions $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$05, target moments $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$06, loss $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$07, and regularizer $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$08, the core OW problem is

$y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$09

If $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$10 and $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$11 are convex, the problem is convex; the KKT conditions provide necessary and sufficient optimality conditions (Barratt et al., 2020).

This formulation includes the combinatorial special case of selecting exactly $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$12 samples with equal weights $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$13, implemented as a nonconvex regularizer that enforces $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$14. The paper advocates ADMM, and the open-source implementation rsw solves both convex weighting and heuristic $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$15-subset selection. On a biased BRFSS subsample, the reported maximum-entropy weighting solve time was approximately 21 s versus 19 min for CVXPY+SCS, and the weighted height and weight CDFs had Kolmogorov–Smirnov distances $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$16 and $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$17, compared with $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$18 and $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$19 unweighted (Barratt et al., 2020).

6. Conceptual distinctions and recurring structure

A persistent source of confusion is terminological rather than mathematical. The surveyed literature uses “OW” for at least five distinct objects: an OWA weight vector indexed by orness, overlap weights for ATO estimation, optimal tree weights in random forests, optimized weighted decoding in ECOC, and optimal sample weights for representative reweighting (Duarte et al., 2018, Lu et al., 20 Jan 2026, Chen et al., 2023, Zhang, 2013, Barratt et al., 2020). These constructions are not interchangeable, and “optimality” is always criterion-relative.

Several structural regularities nonetheless recur. First, the weights are usually nonnegative and normalized, often with simplex constraints such as $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$20. Second, the objective is rarely raw empirical fit alone; it combines fit with a structural desideratum such as entropy, exact balance, asymptotic efficiency, surrogate-risk minimization, or regularity of the weight vector. Third, many OW methods are motivated by avoiding pathological concentration: overlap weighting bounds weights by 1 and sends them to 0 at propensity-score extremes, KOOW penalizes $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$21, the OWA Faulhaber family is designed to be robust for all $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$22, and representative sample weighting explicitly regularizes departures from uniformity (Zhou et al., 2020, Kallus et al., 2019, Duarte et al., 2018, Barratt et al., 2020).

A plausible implication is that OW should be understood as a pattern of constrained weighting rather than a single algorithmic doctrine. In some settings the emphasis is exactness of a target constraint, as with prescribed orness or exact mean balance under logistic propensity scores. In others it is computational tractability, as with one-pass $y = OWA_w(x_1,\dots,x_n)=\sum_{i=1}^n w_i x_{(i)},$23 OWA construction, quadratic-program approximations for weighted random forests, Sinkhorn-based optimal transport, or ADMM for representative weighting. The unifying theme is that the weight vector is treated as the primary object of inference or design, and the scientific meaning of the final estimator or decision rule is determined by the criterion under which that vector is called “optimal.”