Temporal-Adjusted Loss (TAL)

• Temporal-Adjusted Loss (TAL) is a design pattern that modifies loss functions by incorporating temporal structures to dynamically adjust supervision during training.
• It is applied in temporal action localization using boundary-aware masking and step-level IoU rewards, leading to measurable improvements in metrics such as mIoU and detection precision.
• TAL also addresses temporal imbalances in class-incremental learning and video diffusion by reweighting supervision based on recent temporal evidence and discrepancy measures.

Temporal-Adjusted Loss (TAL) is best understood as a family of time-aware loss modifications rather than a single universally standardized objective. In the supplied literature, TAL refers either to an explicit loss construction that models supervision over time or to a reconstructed umbrella term for objectives that alter masking, weighting, or rewards according to temporal structure. In “Masked Diffusion Vision-LLMs for Temporal Action Localization” (Wang et al., 28 May 2026), the paper does not literally name a loss “Temporal-Adjusted Loss (TAL),” but in substance the Planned Training Objective and Step-Level IoU Reward form a temporal-adjusted training objective for Temporal Action Localization. In “Temporal Imbalance of Positive and Negative Supervision in Class-Incremental Learning” (Ma et al., 2 Mar 2026), TAL is the explicit name of a cross-entropy modification driven by a temporal decay kernel. Related formulations also appear as motion-aware loss reweighting in text-to-video diffusion (Wu et al., 28 Jan 2026), T-batching-aware objective design in dynamic network representation learning (Loghmani et al., 2023), and Temporal Predicted Loss in stream-based active learning (Schmidt et al., 2023). This suggests that TAL denotes objectives in which training loss depends on when evidence appears, how temporal discrepancy is measured, or how temporal supervision accumulates.

1. Terminology and conceptual scope

The most stable conceptual core of TAL is loss adjustment by temporal structure. Across the supplied works, the adjustment takes several forms: delaying the recovery of temporal boundary tokens until semantic context is available; dynamically reweighting negative supervision according to a class’s recent supervision history; up-weighting latent regions with high frame-to-frame discrepancy; or removing batch-size-induced bias introduced by temporally constrained batching. These are not identical mechanisms, but they share the property that the loss is no longer static with respect to time.

A central distinction in this literature is between temporal content and temporal supervision. In Temporal Action Localization, the relevant temporal structure is the start and end of an action segment, and the loss must reflect temporal IoU rather than only token identity (Wang et al., 28 May 2026). In Class-Incremental Learning, the relevant temporal structure is the order in which classes receive positive and negative supervision; earlier classes receive stronger negative supervision toward the end of training, leading to asymmetric precision and recall (Ma et al., 2 Mar 2026). In text-to-video diffusion, the relevant temporal structure is motion intensity measured by latent temporal discrepancy, which is used as a motion prior to guide loss weighting (Wu et al., 28 Jan 2026). In dynamic networks trained with T-batching, the relevant temporal structure is the chronology-preserving batching process itself, which can distort per-event loss weighting if prediction loss is normalized by batch size (Loghmani et al., 2023).

A plausible implication is that TAL is less a single named loss than a design pattern: identify a temporal mismatch in the training objective, define a temporal state or temporal score, and use it to alter the loss so that optimization aligns with the sequential structure of the task.

2. Temporal-adjusted objectives in temporal action localization

For Temporal Action Localization formulated with masked diffusion vision-LLMs, the paper identifies two TAL-specific mismatches when using standard masked diffusion training: schedule mismatch and loss mismatch (Wang et al., 28 May 2026). Standard diffusion corrupts all positions uniformly; time tokens are treated like text tokens, even though time tokens are only reliable after sufficient semantic context is recovered. Standard cross-entropy treats every wrong token equally, even though temporal IoU depends on numerical closeness of boundaries.

The proposed remedy has three terms. A standard sequence-level cross-entropy provides the base reconstruction signal. The Planned Training Objective delays the recovery of boundary tokens relative to semantic tokens and emphasizes denoising stages where fine temporal information is available. The Step-Level IoU Reward introduces tIoU-aware supervision at each denoising step. The complete objective is

$$\mathcal{L} = \lambda_{\text{ce}} \mathcal{L}_{\text{ce}} + \lambda_{\text{plan}} \mathcal{L}_{\text{plan}} + \lambda_{\text{iou}} \mathcal{L}_{\text{iou}},$$

with default weights

$$(\lambda_{\text{plan}}, \lambda_{\text{iou}}, \lambda_{\text{ce}}) = (1.0,\, 0.5,\, 0.2).$$

The Planned Training Objective uses boundary-aware masking. Token indices are partitioned into the boundary set $\mathcal{B}$ and the non-boundary set $\mathcal{N}$. The type-specific keep probabilities are

$$\kappa_t^{\mathcal{B}} = \left(1 - \frac{t}{S}\right)^{\gamma}, \quad \kappa_t^{\mathcal{N}} = \left(1 - \frac{t}{S}\right)^{\eta}, \quad \gamma > \eta > 0.$$

Because $\gamma > \eta$, boundary tokens stay masked longer than semantic tokens. The reconstruction term is step-weighted, with lower-noise stages receiving higher weight:

$w_t = \frac{2(S-t+1)}{S(S+1)}.$

Implementation uses $S = 64$, $N = 100$ time tokens $\langle t_0\rangle,\dots,\langle t_{99}\rangle$, and boundary-aware masking exponents $$(\lambda_{\text{plan}}, \lambda_{\text{iou}}, \lambda_{\text{ce}}) = (1.0,\, 0.5,\, 0.2).$$0.

The Step-Level IoU Reward computes soft temporal IoU from boundary-token distributions at each denoising step. Start and end logits are restricted to the time-token vocabulary, converted to distributions, then reduced to soft boundary indices by expectation. The resulting soft segment yields a differentiable surrogate

$$(\lambda_{\text{plan}}, \lambda_{\text{iou}}, \lambda_{\text{ce}}) = (1.0,\, 0.5,\, 0.2).$$1

IoU reward is activated only when both boundaries are unmasked:

$$(\lambda_{\text{plan}}, \lambda_{\text{iou}}, \lambda_{\text{ce}}) = (1.0,\, 0.5,\, 0.2).$$2

The loss includes a per-step overlap term, a monotonic refinement term that penalizes non-improving trajectories, and an advantage-weighted cross-entropy term on boundaries.

The empirical evidence is specifically temporal. On ActivityNet-RTL, Base MDVLM yields mIoU $$(\lambda_{\text{plan}}, \lambda_{\text{iou}}, \lambda_{\text{ce}}) = (1.0,\, 0.5,\, 0.2).$$3, while adding Planned Training raises mIoU to $$(\lambda_{\text{plan}}, \lambda_{\text{iou}}, \lambda_{\text{ce}}) = (1.0,\, 0.5,\, 0.2).$$4 and improves $$(\lambda_{\text{plan}}, \lambda_{\text{iou}}, \lambda_{\text{ce}}) = (1.0,\, 0.5,\, 0.2).$$5. Using both-boundary gating in the IoU reward yields mIoU $$(\lambda_{\text{plan}}, \lambda_{\text{iou}}, \lambda_{\text{ce}}) = (1.0,\, 0.5,\, 0.2).$$6 with full MDVLM-TAL. On THUMOS-14, MDVLM-TAL 8B achieves 60.1 at tIoU 0.7 versus prior best 48.2, and on ActivityNet-1.3 at tIoU 0.95 it achieves 9.8 versus prior best 9.6. The paper’s own summary is that these components form a temporal-adjusted loss tailored for TAL within a masked diffusion VL model (Wang et al., 28 May 2026).

3. Explicit TAL in class-incremental learning

In Class-Incremental Learning, TAL is defined explicitly as a modification of cross-entropy that addresses temporal imbalance of positive and negative supervision (Ma et al., 2 Mar 2026). The paper’s core claim is that earlier classes receive stronger negative supervision toward the end of training, leading to asymmetric precision and recall. Existing methods mainly attribute prediction bias toward new classes to intra-task class imbalance; this work highlights temporal imbalance as an overlooked factor.

The formalization begins with a supervision polarity sequence for each class $$(\lambda_{\text{plan}}, \lambda_{\text{iou}}, \lambda_{\text{ce}}) = (1.0,\, 0.5,\, 0.2).$$7:

$$(\lambda_{\text{plan}}, \lambda_{\text{iou}}, \lambda_{\text{ce}}) = (1.0,\, 0.5,\, 0.2).$$8

A decay memory kernel $$(\lambda_{\text{plan}}, \lambda_{\text{iou}}, \lambda_{\text{ce}}) = (1.0,\, 0.5,\, 0.2).$$9 models the residual influence of past supervision, and the temporal positive supervision strength is

$\mathcal{B}$0

The paper chooses exponential decay,

$\mathcal{B}$1

which yields a simple recursion. The quantity $\mathcal{B}$2 summarizes recent net positivity for class $\mathcal{B}$3: larger $\mathcal{B}$4 means recent positive supervision dominates; smaller $\mathcal{B}$5 means net negative supervision dominates.

TAL modifies the cross-entropy denominator by reweighting negative supervision with a class-specific factor derived from $\mathcal{B}$6:

$\mathcal{B}$7

where

$\mathcal{B}$8

If $\mathcal{B}$9 is small, then $\mathcal{N}$0 is small and negative supervision for class $\mathcal{N}$1 is downweighted. If $\mathcal{N}$2 is close to $\mathcal{N}$3, then $\mathcal{N}$4 and the class receives full negative supervision.

A theoretical property is that TAL degenerates to standard cross-entropy under balanced conditions. The paper introduces $\mathcal{N}$5 so that, under temporal uniformity and class balance, average negative weight equals 1. It also proves a temporal-imbalance theorem: among two classes with the same total number of positive samples, the one whose positive examples are later in time ends with larger $\mathcal{N}$6. This explains why earlier classes show higher precision but lower recall, whereas later classes show higher recall but lower precision.

Algorithmically, TAL is a drop-in replacement for CE. It requires maintaining a vector $\mathcal{N}$7 and updating it online. Theoretical complexity remains $\mathcal{N}$8, and the empirical overhead is small: full training time increase across multiple CIL baselines on CIFAR-100 is about 0.76% on average. On CIFAR-100, ImageNet-100, and Food101, across 10-task and 20-task regimes, adding TAL to iCaRL, FOSTER, DER, MEMO, and TagFex consistently improves both $\mathcal{N}$9 and $$\kappa_t^{\mathcal{B}} = \left(1 - \frac{t}{S}\right)^{\gamma}, \quad \kappa_t^{\mathcal{N}} = \left(1 - \frac{t}{S}\right)^{\eta}, \quad \gamma > \eta > 0.$$0 (Ma et al., 2 Mar 2026).

4. Temporal discrepancy reweighting in video diffusion and dynamic networks

A second major lineage treats TAL as temporal loss reweighting rather than cross-entropy restructuring. In text-to-video diffusion, the paper does not literally use the term “Temporal-Adjusted Loss (TAL),” but it does propose exactly such an idea: using Latent Temporal Discrepancy as a motion prior to reweight the diffusion training loss in space and time (Wu et al., 28 Jan 2026). In dynamic network representation learning with T-batching, the proposed alternatives remove batch-size-dependent weighting so that each temporally observed interaction contributes according to its true occurrence rather than to incidental batch size (Loghmani et al., 2023).

In the text-to-video setting, the clean latent video is

$$\kappa_t^{\mathcal{B}} = \left(1 - \frac{t}{S}\right)^{\gamma}, \quad \kappa_t^{\mathcal{N}} = \left(1 - \frac{t}{S}\right)^{\eta}, \quad \gamma > \eta > 0.$$1

and the dynamic intensity for frame $$\kappa_t^{\mathcal{B}} = \left(1 - \frac{t}{S}\right)^{\gamma}, \quad \kappa_t^{\mathcal{N}} = \left(1 - \frac{t}{S}\right)^{\eta}, \quad \gamma > \eta > 0.$$2 is defined by a sliding-window average of inter-frame latent differences:

$$\kappa_t^{\mathcal{B}} = \left(1 - \frac{t}{S}\right)^{\gamma}, \quad \kappa_t^{\mathcal{N}} = \left(1 - \frac{t}{S}\right)^{\eta}, \quad \gamma > \eta > 0.$$3

A logarithmic stabilization then produces the motion-aware weight

$$\kappa_t^{\mathcal{B}} = \left(1 - \frac{t}{S}\right)^{\gamma}, \quad \kappa_t^{\mathcal{N}} = \left(1 - \frac{t}{S}\right)^{\eta}, \quad \gamma > \eta > 0.$$4

leading to the effective TAL form

$$\kappa_t^{\mathcal{B}} = \left(1 - \frac{t}{S}\right)^{\gamma}, \quad \kappa_t^{\mathcal{N}} = \left(1 - \frac{t}{S}\right)^{\eta}, \quad \gamma > \eta > 0.$$5

with

$$\kappa_t^{\mathcal{B}} = \left(1 - \frac{t}{S}\right)^{\gamma}, \quad \kappa_t^{\mathcal{N}} = \left(1 - \frac{t}{S}\right)^{\eta}, \quad \gamma > \eta > 0.$$6

The paper reports improvements of 3.31% on VBench and 3.58% on VMBench, with gains especially in motion quality.

In dynamic networks, the original T-batched JODIE loss averages prediction error by batch size, which gives interactions in small batches larger impact per sample. The proposed alternatives are

$$\kappa_t^{\mathcal{B}} = \left(1 - \frac{t}{S}\right)^{\gamma}, \quad \kappa_t^{\mathcal{N}} = \left(1 - \frac{t}{S}\right)^{\eta}, \quad \gamma > \eta > 0.$$7

and

$$\kappa_t^{\mathcal{B}} = \left(1 - \frac{t}{S}\right)^{\gamma}, \quad \kappa_t^{\mathcal{N}} = \left(1 - \frac{t}{S}\right)^{\eta}, \quad \gamma > \eta > 0.$$8

Both remove batch-size dependence in the prediction term. The paper’s theoretical analysis shows that the original loss can shift the decision boundary away from the true optimal predictor, whereas the proposed losses restore the correct optimal decision boundary. On the Myket dataset, $$\kappa_t^{\mathcal{B}} = \left(1 - \frac{t}{S}\right)^{\gamma}, \quad \kappa_t^{\mathcal{N}} = \left(1 - \frac{t}{S}\right)^{\eta}, \quad \gamma > \eta > 0.$$9 improves MRR from 0.093 to 0.120 and Recall@10 from 0.179 to 0.208; $\gamma > \eta$0 improves MRR to 0.118 and Recall@10 to 0.200 (Loghmani et al., 2023).

Taken together, these two lines suggest that TAL need not be tied to a specific architecture. It can appear either as a motion-aware weight field in diffusion objectives or as a temporally fair per-event aggregation rule in sequential representation learning.

5. Temporal derivatives in stream-based active learning

A third formulation appears in stream-based active learning, where the concrete name is Temporal Predicted Loss rather than Temporal-Adjusted Loss. The paper explicitly states that TPL is a temporal adjustment of a loss or uncertainty signal (Schmidt et al., 2023). A loss prediction module $\gamma > \eta$1 predicts task loss for each input frame,

$\gamma > \eta$2

and temporal structure enters through the derivative of the predicted loss:

$\gamma > \eta$3

In discrete time, the derivative is approximated numerically as

$\gamma > \eta$4

The active-learning score is

$\gamma > \eta$5

The practical interpretation is that successive frames often show almost the same scene with minor motion, so static uncertainty tends to mark a block of similar frames as equally uncertain. TPL instead focuses on frames where the temporal change in uncertainty is high, that is, on transition points between known and unknown regions. The paper reports that TPL demonstrated a gain of 2.5 precent points less required data while being significantly faster than pool-based methods. On GTAVs with ResNet18, TPL reaches the fully trained network baseline with about 21.3% labeled data, whereas competing approaches intersect the baseline between 23 and 23.8%. On A2D2s with VGG11, TPL achieves the fully trained network’s performance at 35.5% labeled data, compared with 37.5% for ALED and 38.5% for loss learning (Schmidt et al., 2023).

This formulation is not a training loss in the same sense as cross-entropy or diffusion MSE. It is a temporally adjusted uncertainty score used for sample selection. Nevertheless, the paper explicitly frames it as a temporal adjustment of a loss or uncertainty signal, and it occupies the same conceptual neighborhood as TAL.

6. Acronym overload, adjacent methods, and comparative interpretation

The abbreviation “TAL” is overloaded. In “Typicalness-Aware Learning for Failure Detection,” TAL stands for Typicalness-Aware Learning, not Temporal-Adjusted Loss (Liu et al., 2024). In “Low Pass Filter for Anti-aliasing in Temporal Action Localization,” TAL refers to Temporal Action Localization as the task acronym, not to a loss (Jin et al., 2021). The paper on masked diffusion for temporal action localization also works on TAL as a task acronym while introducing temporal-adjusted training objectives within that task (Wang et al., 28 May 2026).

Usage	Meaning	Source
TAL	Temporal-Adjusted Loss	(Ma et al., 2 Mar 2026)
TAL	Typicalness-Aware Learning	(Liu et al., 2024)
TAL	Temporal Action Localization	(Jin et al., 2021)

A related neighboring line is meta-learned dynamic loss adjustment. “L2T-DLN: Learning to Teach with Dynamic Loss Network” formulates the loss adjustment as a temporal task by designing a teacher model with memory units (Hai et al., 2023). The loss there is parameterized by a Dynamic Loss Network, updated over time by an LSTM teacher using gradients with respect to the loss parameters. This is not named TAL, but it is directly relevant because it treats loss evolution itself as a temporal process.

Several misconceptions follow from this acronym overload. First, TAL is not a universally fixed formula. The explicit CIL formulation with a temporal decay kernel and supervision strength vector is one concrete TAL (Ma et al., 2 Mar 2026), whereas the temporal-action-localization work uses the term only as a reconstructed description of its loss adjustments (Wang et al., 28 May 2026). Second, not every temporally informed objective is a TAL in the narrow sense. Anti-aliasing with low-pass filters improves Temporal Action Localization but does so by changing feature processing rather than by defining a new temporal-adjusted loss (Jin et al., 2021). Third, TAL does not always mean “temporal”: in failure detection, TAL is a typicalness-aware logit-scaling and loss-blending scheme, and the paper explicitly notes that it is not temporal (Liu et al., 2024).

Taken together, these works suggest a comparative interpretation. A TAL-style objective usually does one or more of the following: it changes when particular targets should be recovered, as in boundary-aware masking; it changes how prediction quality is measured, as in step-level tIoU reward; it changes how much a sample or class contributes, as in temporal discrepancy weighting or supervision-history weighting; or it corrects structural temporal bias introduced by a training protocol, as in T-batching-aware loss design. That comparative pattern, rather than a single canonical equation, is the most accurate encyclopedia-level characterization of Temporal-Adjusted Loss in the current arXiv literature.