mlsanityData to 14 Oct 2026

Resource-Constrained Affect Modelling via Variance Regularisation Pruning

arXiv 2605.27479 ↗First posted 26 May 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Affective computing systems are increasingly embedded in pervasive and interactive environments, such as adaptive games, assistive technologies, and resource-constrained platforms, where computational efficiency must be balanced with reliability across diverse users. Model pruning offers an effective way to reduce computational demands, yet existing approaches typically optimise for sparsity alone, without accounting for how parameter removal impacts robustness across individuals. In this work, we introduce Variance-Regularised Pruning (VR), a pruning framework that explicitly incorporates cross-participant stability into the sparsification process. Rather than relying solely on average prediction error, VR evaluates each connection based on its joint contribution to both prediction accuracy and variability across users, prioritising parameters that remain reliable under distributional differences. We evaluate the proposed approach on the AGAIN dataset, which includes arousal annotations collected across nine affect-eliciting game environments. Experimental results demonstrate that VR maintains competitive Concordance Correlation Coefficient (CCC) performance even at 80% sparsity without additional fine-tuning, highlighting its suitability for deployment in real-world, resource-limited affect-aware systems. Overall, the proposed framework supports the development of compact, robust affective models that can operate reliably in real-world interactive environments.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 24 of its 31 references that are in the map. First posted on arXiv 26 May 2026.

Builds on

24 of 31 references.

References · 24

  1. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  2. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  3. 2019Invariant Risk Minimizationcited by 1,854
  4. 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
  5. 2016Pruning Filters for Efficient ConvNetscited by 1,143
  6. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
  7. 2020Out-of-Distribution Generalization via Risk Extrapolation (REx)cited by 742
  8. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 702
  9. 2019Importance Estimation for Neural Network Pruningcited by 541
  10. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 479
  11. 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 202
  12. 2020Methods for Pruning Deep Neural Networkscited by 49
12 more
  1. 2019Improving Cross-Corpus Speech Emotion Recognition with Adversarial Discriminative Domain Generalization (ADDoG)cited by 19
  2. 2021The Arousal video Game AnnotatIoN (AGAIN) Datasetcited by 18
  3. 2025Handling Out-of-Distribution Data: A Surveycited by 14
  4. 2019PAGAN: Video Affect Annotation Made Easycited by 12
  5. 2023From the Lab to the Wild: Affect Modeling via Privileged Informationcited by 12
  6. 2023Affective Game Computing: A Surveycited by 11
  7. 2022The Invariant Ground Truth of Affectcited by 6
  8. 2023Knowing Your Annotator: Rapidly Testing the Reliability of Affect Annotationcited by 5
  9. 2024GameVibe: A Multimodal Affective Game Corpuscited by 5
  10. 2024Across-Game Engagement Modelling via Few-Shot Learningcited by 4
  11. 2025Privileged Contrastive Pretraining for Multimodal Affect Modellingcited by 3
  12. 2025Learning Annotation Consensus for Continuous Emotion Recognitioncited by 2

Built on by

Not cited yet.