Age-weighted Loss in Age Estimation

• Age-weighted loss is a family of objective functions that adjust optimization pressure based on age ordinal structure and sample ambiguity.
• It includes methods like progressive margins, stage-wise adaptive weighting, and mean-residue reweighting to better handle long-tailed and variable age distributions.
• These approaches improve model performance and fairness by adapting loss functions to reflect age-related uncertainty, demographic groups, and temporal recency.

Searching arXiv for the cited works and closely related papers on age-weighted loss in age estimation. arXiv search query: all:"Progressive Margin Loss for Long-tailed Age Classification" OR all:"Stage-wise Adaptive Label Distribution for Facial Age Estimation" OR all:"Adaptive Mean-Residue Loss for Robust Facial Age Estimation" OR all:"Maximum Weighted Loss Discrepancy" Age-weighted loss denotes a family of objective constructions in which optimization pressure is modulated by age-dependent structure rather than assigning uniform importance to all samples, classes, groups, or past observations. In facial age estimation and long-tailed age classification, this modulation appears as class- and sample-dependent margins, stage-specific mixtures of cross-entropy and label-distribution losses, or penalties that suppress probability mass assigned to implausible ages while preserving ordinal neighborhoods. In fairness analysis, age can define groups whose loss discrepancies are explicitly weighted. In online prediction, the “age” of a loss can denote temporal recency, so older losses are discounted. Across these uses, the common premise is that age-related heterogeneity—ordinality, ambiguity, imbalance, demographic grouping, or temporal recency—should alter the loss landscape (Deng et al., 2021, Wu et al., 30 Aug 2025, Khani et al., 2019, Chernov et al., 2010).

1. Conceptual scope

Within the literature represented here, age-weighted loss is not a single formula but a set of related design patterns. In facial age modeling, the objective is typically to respect the ordinal structure of age labels and the nonuniform uncertainty associated with different ages or age stages. In fairness-oriented analysis, the aim is instead to quantify or reduce disparities between age groups. In online learning, weighting by “age” refers to discounting old losses so that the impact of old losses may gradually vanish.

Setting	Mechanism	Representative quantity
Long-tailed age classification	Progressive, age-aware logit margins	$M_{pj} = \lambda M_o^* + \beta M_v$
Facial age estimation	Stage-wise weighting of KL and CE	$L_{\mathrm{SAW}}$
Facial age estimation	Mean-residue weighting over age probabilities	$L = L_s + \lambda_1 L_m + \lambda_2 L_r$
Age-group fairness	Weighted discrepancy between group and population loss	$D_{\mathrm{age}}(w,\ell,f)$
Online learning	Discounting older losses	$L_t = \alpha_{t-1} L_{t-1} + \ell_t$

Two recurring premises connect the age-estimation formulations. First, age labels are ordinal; adjacent ages exhibit high visual similarity and correlated label distributions, so treating each age as an independent class can distort supervision (Deng et al., 2021). Second, age ambiguity is not uniform across the lifespan: stage-wise patterns appear in embedding similarity analyses, motivating stage-specific variance and weighting rather than a fixed global label-distribution shape (Wu et al., 30 Aug 2025).

2. Progressive margins for long-tailed age classification

"Progressive Margin Loss for Long-tailed Age Classification" formulates age-weighted loss as a decision-boundary adjustment mechanism inside a globally tuned deep classifier (Deng et al., 2021). The setting is unconstrained facial age classification under long-tailed age distributions, where standard cross-entropy or KL losses tend to optimize for head ages and underfit tail ages. The method maps a scalar age $y \in \{0,\ldots,100\}$ to a Gaussian label distribution $y \in \mathbb{R}^{101}$,

$$y_k = \frac{1}{\sigma \sqrt{2\pi}} \exp\!\left(-\frac{(k-y)^2}{2\sigma^2}\right), \qquad k \in [0,100],$$

and replaces the baseline KL/CE objective

$L = -\frac{1}{n}\sum_{i=1}^n y_i \log \hat y_i$

with

$$L_{m_p} = -\frac{1}{n}\sum_{i=1}^n y_i \log \hat y_i^*.$$

The modified prediction inserts progressive margins into the logits:

$L_{\mathrm{SAW}}$0

with dot-product similarity $L_{\mathrm{SAW}}$1. The key quantity is the class-specific margin $L_{\mathrm{SAW}}$2, which is derived from learned class geometry.

PML maintains a per-class center

$L_{\mathrm{SAW}}$3

and, for mini-batch training, uses the recursive update

$L_{\mathrm{SAW}}$4

It further computes an inter-class variance vector

$L_{\mathrm{SAW}}$5

where $L_{\mathrm{SAW}}$6 denotes cosine distance, and an intra-class variance

$L_{\mathrm{SAW}}$7

These statistics feed two margin components. The ordinal margin is learned as

$L_{\mathrm{SAW}}$8

and discretized into a one-vs-all matrix $L_{\mathrm{SAW}}$9. Functionally, $L = L_s + \lambda_1 L_m + \lambda_2 L_r$0 enforces larger margins between more distant ages and smaller margins between adjacent ages. The variational margin is learned from residual dynamics between iterations or curricula,

$L = L_s + \lambda_1 L_m + \lambda_2 L_r$1

$L = L_s + \lambda_1 L_m + \lambda_2 L_r$2

For a sample in class $L = L_s + \lambda_1 L_m + \lambda_2 L_r$3, the final progressive margin vector is

$L = L_s + \lambda_1 L_m + \lambda_2 L_r$4

The paper’s decision-boundary interpretation is central: subtracting $L = L_s + \lambda_1 L_m + \lambda_2 L_r$5 from the logit is equivalent to multiplying the unnormalized score by $L = L_s + \lambda_1 L_m + \lambda_2 L_r$6. Larger $L = L_s + \lambda_1 L_m + \lambda_2 L_r$7 down-weights a class’s score and shifts decision boundaries away from it. When larger margins are assigned to head ages, the mechanism reduces head dominance in a manner similar in effect to age-weighted losses, but it does so through structured, age-aware logit modification rather than explicit scalar loss weights.

Optimization is further stabilized by curriculum learning. PML uses a sequence of indicator curricula

$L = L_s + \lambda_1 L_m + \lambda_2 L_r$8

with

$L = L_s + \lambda_1 L_m + \lambda_2 L_r$9

Across curricula, a balanced instructor $D_{\mathrm{age}}(w,\ell,f)$0 from the previous, more balanced course is used to define

$D_{\mathrm{age}}(w,\ell,f)$1

which in turn yields $D_{\mathrm{age}}(w,\ell,f)$2. The gradients remain standard with respect to the shifted logits,

$D_{\mathrm{age}}(w,\ell,f)$3

and

$D_{\mathrm{age}}(w,\ell,f)$4

Because the margins alter $D_{\mathrm{age}}(w,\ell,f)$5, head classes receive reduced gradient magnitude when assigned larger margins, whereas tail classes receive comparatively stronger updates.

3. Stage-wise adaptive weighting in label distribution learning

"Stage-wise Adaptive Label Distribution for Facial Age Estimation" treats age-weighted loss as a learned stage-wise convex combination of distribution matching and hard classification, coupled to stage-specific label uncertainty (Wu et al., 30 Aug 2025). The method begins from a standard label distribution learning setup over discrete ages $D_{\mathrm{age}}(w,\ell,f)$6. For an image $D_{\mathrm{age}}(w,\ell,f)$7 with ground-truth age $D_{\mathrm{age}}(w,\ell,f)$8, the model outputs logits $D_{\mathrm{age}}(w,\ell,f)$9 and probabilities

$L_t = \alpha_{t-1} L_{t-1} + \ell_t$0

The target soft label is a discrete normalized Gaussian centered at $L_t = \alpha_{t-1} L_{t-1} + \ell_t$1, but its standard deviation is stage-dependent:

$L_t = \alpha_{t-1} L_{t-1} + \ell_t$2

The KL term is

$L_t = \alpha_{t-1} L_{t-1} + \ell_t$3

Age stages are constructed data-dependently rather than by fixed decade bins. Using EfficientNetV2 embeddings $L_t = \alpha_{t-1} L_{t-1} + \ell_t$4, the method computes age-class prototypes

$L_t = \alpha_{t-1} L_{t-1} + \ell_t$5

clusters $L_t = \alpha_{t-1} L_{t-1} + \ell_t$6 with K-means into $L_t = \alpha_{t-1} L_{t-1} + \ell_t$7 clusters,

$L_t = \alpha_{t-1} L_{t-1} + \ell_t$8

and then sorts and merges clusters into contiguous stage intervals $L_t = \alpha_{t-1} L_{t-1} + \ell_t$9. The paper uses $y \in \{0,\ldots,100\}$0 stages. This construction is motivated by an embedding-similarity analysis showing that label ambiguity exhibits clear stage-wise patterns.

The stage-wise adaptive weighted loss, SAW, combines classification, distribution, and regression terms. The hard-label cross-entropy is

$y \in \{0,\ldots,100\}$1

and the regression term is

$y \in \{0,\ldots,100\}$2

Each stage $y \in \{0,\ldots,100\}$3 has a learned weight $y \in \{0,\ldots,100\}$4, with $y \in \{0,\ldots,100\}$5, and the per-sample loss is

$y \in \{0,\ldots,100\}$6

The adaptive variance term, SAV, assigns a unique $y \in \{0,\ldots,100\}$7 to each stage, typically via

$y \in \{0,\ldots,100\}$8

The paper states that SAW “learns the weights for classification and distribution at each stage”; a practical parameterization is $y \in \{0,\ldots,100\}$9. The reported optimization protocol trains SAV jointly with the network, evaluates on a validation split, and accepts updates to $y \in \mathbb{R}^{101}$0 and $y \in \mathbb{R}^{101}$1 when the validation $y \in \mathbb{R}^{101}$2 age error improves.

Relative to standard LDL with a fixed-variance Gaussian target and unweighted KL, SA-LDL changes gradient behavior in two ways. SAV sharpens the target in low-ambiguity stages and broadens it in high-ambiguity ones. SAW emphasizes distribution matching where ambiguity is high and hard classification where ambiguity is low. This directly targets the claim that adjacent ages do not exhibit uniform ambiguity across the age spectrum.

4. Mean-residue weighting over age probabilities

"Adaptive Mean-Residue Loss for Robust Facial Age Estimation" defines an age-weighted loss without requiring a target label distribution (Zhao et al., 2022). Ages are modeled as ordered classes $y \in \mathbb{R}^{101}$3, and a CNN produces logits $y \in \mathbb{R}^{101}$4 and softmax probabilities

$y \in \mathbb{R}^{101}$5

The predicted mean age is the expectation of the age distribution,

$y \in \mathbb{R}^{101}$6

The first component, the mean loss, penalizes deviation between the expected age and the ground-truth age:

$y \in \mathbb{R}^{101}$7

This term is age-weighted in the literal sense that the numeric magnitude of ages shapes the gradient through the expectation.

The second component, residue loss, acts on the probability mass outside an adaptive top-$y \in \mathbb{R}^{101}$8 neighborhood. For each sample, the rank of the ground-truth age is

$y \in \mathbb{R}^{101}$9

and the adaptive neighborhood size is

$$y_k = \frac{1}{\sigma \sqrt{2\pi}} \exp\!\left(-\frac{(k-y)^2}{2\sigma^2}\right), \qquad k \in [0,100],$$0

Let $$y_k = \frac{1}{\sigma \sqrt{2\pi}} \exp\!\left(-\frac{(k-y)^2}{2\sigma^2}\right), \qquad k \in [0,100],$$1 denote the indices of the $$y_k = \frac{1}{\sigma \sqrt{2\pi}} \exp\!\left(-\frac{(k-y)^2}{2\sigma^2}\right), \qquad k \in [0,100],$$2 largest probabilities. The residue loss is the entropy outside this set:

$$y_k = \frac{1}{\sigma \sqrt{2\pi}} \exp\!\left(-\frac{(k-y)^2}{2\sigma^2}\right), \qquad k \in [0,100],$$3

The full objective is

$$y_k = \frac{1}{\sigma \sqrt{2\pi}} \exp\!\left(-\frac{(k-y)^2}{2\sigma^2}\right), \qquad k \in [0,100],$$4

with hard-label softmax loss

$$y_k = \frac{1}{\sigma \sqrt{2\pi}} \exp\!\left(-\frac{(k-y)^2}{2\sigma^2}\right), \qquad k \in [0,100],$$5

The adaptive mechanism is intended to avoid the failure modes of a fixed neighborhood. Early in training, when $$y_k = \frac{1}{\sigma \sqrt{2\pi}} \exp\!\left(-\frac{(k-y)^2}{2\sigma^2}\right), \qquad k \in [0,100],$$6 is diffuse and $$y_k = \frac{1}{\sigma \sqrt{2\pi}} \exp\!\left(-\frac{(k-y)^2}{2\sigma^2}\right), \qquad k \in [0,100],$$7 is large, $$y_k = \frac{1}{\sigma \sqrt{2\pi}} \exp\!\left(-\frac{(k-y)^2}{2\sigma^2}\right), \qquad k \in [0,100],$$8 is also large, so $$y_k = \frac{1}{\sigma \sqrt{2\pi}} \exp\!\left(-\frac{(k-y)^2}{2\sigma^2}\right), \qquad k \in [0,100],$$9 does not over-constrain the distribution. As training progresses and the true age rises in rank, $L = -\frac{1}{n}\sum_{i=1}^n y_i \log \hat y_i$0 shrinks automatically, sharpening the distribution around a plausible age neighborhood. The paper explicitly contrasts this design with Gaussian label-distribution learning, mean-variance losses, Earth Mover’s Distance, ordinal regression losses, and sample- or class-weighted cross-entropy. Its distinctive claim is that AMR performs “probability reweighting” within each sample by suppressing mass far from an adaptively chosen plausible set that is guaranteed to contain the true class.

5. Age-group weighting, discrepancy, and fairness

"Maximum Weighted Loss Discrepancy" uses age-weighted loss in a different but formally precise sense: age defines groups whose conditional losses are compared with the population loss under an explicit weighting function (Khani et al., 2019). Let $L = -\frac{1}{n}\sum_{i=1}^n y_i \log \hat y_i$1, let $L = -\frac{1}{n}\sum_{i=1}^n y_i \log \hat y_i$2 be a predictor, and let the bounded per-example loss satisfy $L = -\frac{1}{n}\sum_{i=1}^n y_i \log \hat y_i$3. The population loss is

$L = -\frac{1}{n}\sum_{i=1}^n y_i \log \hat y_i$4

Partition the population into age groups $L = -\frac{1}{n}\sum_{i=1}^n y_i \log \hat y_i$5, with indicators $L = -\frac{1}{n}\sum_{i=1}^n y_i \log \hat y_i$6 if $L = -\frac{1}{n}\sum_{i=1}^n y_i \log \hat y_i$7 and proportions $L = -\frac{1}{n}\sum_{i=1}^n y_i \log \hat y_i$8. The group loss is

$L = -\frac{1}{n}\sum_{i=1}^n y_i \log \hat y_i$9

With a weighting function $$L_{m_p} = -\frac{1}{n}\sum_{i=1}^n y_i \log \hat y_i^*.$$0, the age-only maximum weighted loss discrepancy is

$$L_{m_p} = -\frac{1}{n}\sum_{i=1}^n y_i \log \hat y_i^*.$$1

The paper studies the family

$$L_{m_p} = -\frac{1}{n}\sum_{i=1}^n y_i \log \hat y_i^*.$$2

where $$L_{m_p} = -\frac{1}{n}\sum_{i=1}^n y_i \log \hat y_i^*.$$3 is group mass. For finite age groups, estimation is straightforward via plug-in estimators for $$L_{m_p} = -\frac{1}{n}\sum_{i=1}^n y_i \log \hat y_i^*.$$4, $$L_{m_p} = -\frac{1}{n}\sum_{i=1}^n y_i \log \hat y_i^*.$$5, and $$L_{m_p} = -\frac{1}{n}\sum_{i=1}^n y_i \log \hat y_i^*.$$6:

$$L_{m_p} = -\frac{1}{n}\sum_{i=1}^n y_i \log \hat y_i^*.$$7

A major theoretical distinction concerns group scope. The paper proves that it is statistically impossible to estimate $$L_{m_p} = -\frac{1}{n}\sum_{i=1}^n y_i \log \hat y_i^*.$$8 when all groups have equal weight across the class of all measurable groups, but it explicitly notes that this impossibility does not apply when one restricts attention to a finite set of age groups. It also derives a tight relation between MWLD with $$L_{m_p} = -\frac{1}{n}\sum_{i=1}^n y_i \log \hat y_i^*.$$9 and loss variance:

$L_{\mathrm{SAW}}$00

For age-only analysis, the corresponding coarse loss variance uses $L_{\mathrm{SAW}}$01, and the paper recommends regularization objectives of the form

$L_{\mathrm{SAW}}$02

where $L_{\mathrm{SAW}}$03 is the empirical mean loss for age bin $L_{\mathrm{SAW}}$04. In this framework, age-weighted loss is not an age-estimation objective; it is a fairness or robustness criterion that controls age-dependent loss disparities.

6. Discounted loss and the temporal age of errors

"Prediction with Expert Advice under Discounted Loss" uses age-weighted loss in a temporal sense: the age of a loss is its recency, and older losses are discounted (Chernov et al., 2010). In the online protocol, the learner and experts incur round-wise losses $L_{\mathrm{SAW}}$05 and $L_{\mathrm{SAW}}$06. An “Accountant” announces a discount factor $L_{\mathrm{SAW}}$07, and cumulative discounted loss evolves by

$L_{\mathrm{SAW}}$08

with the same recursion for each expert:

$L_{\mathrm{SAW}}$09

Defining

$L_{\mathrm{SAW}}$10

and

$L_{\mathrm{SAW}}$11

the weight of loss $L_{\mathrm{SAW}}$12 inside $L_{\mathrm{SAW}}$13 is

$L_{\mathrm{SAW}}$14

so that

$L_{\mathrm{SAW}}$15

For exponential discounting with constant $L_{\mathrm{SAW}}$16,

$L_{\mathrm{SAW}}$17

The effective horizon $L_{\mathrm{SAW}}$18 replaces the ordinary horizon $L_{\mathrm{SAW}}$19 in regret bounds. Under mixability, the discounted Aggregating Algorithm yields

$L_{\mathrm{SAW}}$20

For bounded convex losses, the discounted EWA or Weak AA guarantee is

$L_{\mathrm{SAW}}$21

The same formalism extends to discounted online regression. For linear predictors $L_{\mathrm{SAW}}$22 and square loss, with discount matrix

$L_{\mathrm{SAW}}$23

the paper gives a discounted Aggregating Algorithm for Regression bound,

$L_{\mathrm{SAW}}$24

In this literature, age-weighting is therefore a weighting by temporal age, not by chronological age label or demographic age group.

7. Empirical evidence, design implications, and limitations

The age-estimation papers report that age-weighted objectives improve performance when the data exhibit imbalance, ambiguity, or ordinal uncertainty. PML reports MAE $L_{\mathrm{SAW}}$25 on Morph II Setting I, $L_{\mathrm{SAW}}$26 on Morph II Setting II, $L_{\mathrm{SAW}}$27 on FG-NET, and $L_{\mathrm{SAW}}$28 on ChaLearn LAP 2015 without pretraining; $L_{\mathrm{SAW}}$29 attains $L_{\mathrm{SAW}}$30 and $L_{\mathrm{SAW}}$31 on ChaLearn. Its curriculum analysis shows MAE decreases as curricula progress from balanced to imbalanced, for example Morph II $L_{\mathrm{SAW}}$32 and ChaLearn $L_{\mathrm{SAW}}$33 (Deng et al., 2021). SA-LDL reports MAE of $L_{\mathrm{SAW}}$34 on MORPH-II and $L_{\mathrm{SAW}}$35 on FG-NET. Its ablations isolate both components: on MORPH-II, SAV yields MAE $L_{\mathrm{SAW}}$36 versus $L_{\mathrm{SAW}}$37 for fixed variance, and SAW yields $L_{\mathrm{SAW}}$38 versus $L_{\mathrm{SAW}}$39 for unweighted KL+CE, $L_{\mathrm{SAW}}$40 for KL only, and $L_{\mathrm{SAW}}$41 for CE only; the combined SA-LDL objective reaches $L_{\mathrm{SAW}}$42 versus $L_{\mathrm{SAW}}$43 for SAV only and $L_{\mathrm{SAW}}$44 for SAW only (Wu et al., 30 Aug 2025). AMR reports, with ResNet-50, FG-NET MAE $L_{\mathrm{SAW}}$45 and CLAP2016 $L_{\mathrm{SAW}}$46, outperforming the ablated softmax-only, mean-plus-softmax, variance-plus-softmax, mean-variance, and residue-plus-softmax variants listed in the paper (Zhao et al., 2022).

These results suggest several distinct implementation rationales. PML is preferable when the age distribution is markedly long-tailed and decision-boundary shifts are more desirable than coarse scalar class weights. SA-LDL is tailored to the claim that label ambiguity is stage-dependent, so a fixed-variance Gaussian target is misspecified. AMR is useful when one wants to exploit ordinal expectation and adaptive neighborhood suppression without constructing a target label distribution. The fairness-oriented MWLD framework addresses a different question: not predictive accuracy on age estimation benchmarks, but whether average loss hides large discrepancies across age groups. In that setting, the paper reports that loss variance regularization can halve the loss variance of a classifier and reduce MWLD without suffering a significant drop in accuracy, and that coarse loss variance with sensitive attributes including age can halve $L_{\mathrm{SAW}}$47 with approximately $L_{\mathrm{SAW}}$48–$L_{\mathrm{SAW}}$49 average loss increase (Khani et al., 2019).

The main limitations are also formulation-specific. PML requires tuning $L_{\mathrm{SAW}}$50, $L_{\mathrm{SAW}}$51, and $L_{\mathrm{SAW}}$52, as well as curriculum splits $L_{\mathrm{SAW}}$53 and sampling function $L_{\mathrm{SAW}}$54; mis-specified margins, noisy age labels, or unreliable centers for extremely sparse classes may destabilize training (Deng et al., 2021). SA-LDL introduces trainable stage parameters $L_{\mathrm{SAW}}$55 and $L_{\mathrm{SAW}}$56, depends on stage construction by K-means, and uses validation $L_{\mathrm{SAW}}$57 acceptance for updating $L_{\mathrm{SAW}}$58 and $L_{\mathrm{SAW}}$59 (Wu et al., 30 Aug 2025). AMR is sensitive to $L_{\mathrm{SAW}}$60, $L_{\mathrm{SAW}}$61, and the behavior of adaptive $L_{\mathrm{SAW}}$62, especially early in training when $L_{\mathrm{SAW}}$63 may be inactive (Zhao et al., 2022). MWLD theory assumes bounded losses, shows impossibility for uniform weights over all measurable groups, and entails slower convergence for smaller weight exponents $L_{\mathrm{SAW}}$64 when one seeks stronger protection for small groups (Khani et al., 2019). Discounted-loss methods replace ordinary horizon dependence by the effective horizon $L_{\mathrm{SAW}}$65, which is advantageous under nonstationarity but tied to the choice of $L_{\mathrm{SAW}}$66 or $L_{\mathrm{SAW}}$67 (Chernov et al., 2010).

Taken together, these formulations show that age-weighted loss is best understood as a structured departure from uniform empirical risk. The structure may encode age ordinality, long-tail correction, stage-wise ambiguity, neighborhood plausibility, disparity across age groups, or temporal recency. The specific meaning of “weighting” therefore depends on whether the objective acts on logits, loss terms, group discrepancies, or time-discounted accumulation.