Cost-Sensitive Learning for Long-Tailed Temporal Action Segmentation
Zhanzhong Pang, Fadime Sener, Shrinivas Ramasubramanian, Angela Yao
TL;DR
The paper tackles long-tail challenges in temporal action segmentation by identifying a bi-level learning bias: class-level bias from imbalance and transition-level bias from uneven transition frequencies. It introduces learning-state-aware constrained optimization and a cost-sensitive loss that adaptively weights frames based on action and transition learning states, cast as a Lagrangian min–max problem. A transition confusion tensor defines per-class and per-transition learning states, guiding constraints and reweighting, while Segment Nearest Class Mean (S-NCM) helps stabilize inference. Across Breakfast, 50Salads, and Assembly101 with MSTCN, ASFormer, and DiffAct backbones, the approach yields strong per-class improvements, especially for tail classes, without sacrificing global metrics, and demonstrates enhanced transition-detection capability and robust tail balancing. These contributions offer a practical route to balanced temporal segmentation in long-tailed real-world videos, with manageable computational overhead during training.
Abstract
Temporal action segmentation in untrimmed procedural videos aims to densely label frames into action classes. These videos inherently exhibit long-tailed distributions, where actions vary widely in frequency and duration. In temporal action segmentation approaches, we identified a bi-level learning bias. This bias encompasses (1) a class-level bias, stemming from class imbalance favoring head classes, and (2) a transition-level bias arising from variations in transitions, prioritizing commonly observed transitions. As a remedy, we introduce a constrained optimization problem to alleviate both biases. We define learning states for action classes and their associated transitions and integrate them into the optimization process. We propose a novel cost-sensitive loss function formulated as a weighted cross-entropy loss, with weights adaptively adjusted based on the learning state of actions and their transitions. Experiments on three challenging temporal segmentation benchmarks and various frameworks demonstrate the effectiveness of our approach, resulting in significant improvements in both per-class frame-wise and segment-wise performance.
