mlsanityData to 14 Oct 2026

AdaMuS: Adaptive Multi-view Sparsity Learning for Dimensionally Unbalanced Data

arXiv 2603.17610 ↗First posted 18 Mar 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Multi-view learning primarily aims to fuse multiple features to describe data comprehensively. Most prior studies implicitly assume that different views share similar dimensions. In practice, however, severe dimensional disparities often exist among different views, leading to the unbalanced multi-view learning issue. For example, in emotion recognition tasks, video frames often reach dimensions of 106, while physiological signals comprise only 101 dimensions. Existing methods typically face two main challenges for this problem: (1) They often bias towards high-dimensional data, overlooking the low-dimensional views. (2) They struggle to effectively align representations under extreme dimensional imbalance, which introduces severe redundancy into the low-dimensional ones. To address these issues, we propose the Adaptive Multi-view Sparsity Learning (AdaMuS) framework. First, to prevent ignoring the information of low-dimensional views, we construct view-specific encoders to map them into a unified dimensional space. Given that mapping low-dimensional data to a high-dimensional space often causes severe overfitting, we design a parameter-free pruning method to adaptively remove redundant parameters in the encoders. Furthermore, we propose a sparse fusion paradigm that flexibly suppresses redundant dimensions and effectively aligns each view. Additionally, to learn representations with stronger generalization, we propose a self-supervised learning paradigm that obtains supervision information by constructing similarity graphs. Extensive evaluations on a synthetic toy dataset and seven real-world benchmarks demonstrate that AdaMuS consistently achieves superior performance and exhibits strong generalization across both classification and semantic segmentation tasks.

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

Builds on

24 of 63 references.

References · 24

  1. 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,403
  2. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  3. 2017Multimodal Machine Learning: A Survey and Taxonomycited by 1,013
  4. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
  5. 2020What is the State of Neural Network Pruning?cited by 583
  6. 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 442
  7. 2019What Makes Training Multi-Modal Classification Networks Hard?cited by 344
  8. 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 315
  9. 2017A Survey of Model Compression and Acceleration for Deep Neural Networkscited by 301
  10. 2022Balanced Multimodal Learning via On-the-fly Gradient Modulationcited by 264
  11. 2023Multimodal Deep Learningcited by 258
  12. 2017Gated Multimodal Units for Information Fusioncited by 248
12 more
  1. 2019MetaPruning: Meta Learning for Automatic Neural Network Channel Pruningcited by 227
  2. 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 202
  3. 2022Trusted Multi-View Classification with Dynamic Evidential Fusioncited by 168
  4. 2016On Deep Multi-View Representation Learning: Objectives and Optimizationcited by 162
  5. 2018AutoPruner: An End-to-End Trainable Filter Pruning Method for Efficient Deep Model Inferencecited by 77
  6. 2020Deep Partial Multi-View Learningcited by 71
  7. 2023CoVR-2: Automatic Data Construction for Composed Video Retrievalcited by 52
  8. 2024Reliable Conflictive Multi-View Learningcited by 45
  9. 2020Unbalanced Incomplete Multi-view Clustering via the Scheme of View Evolution: Weak Views are Meat; Strong Views do Eatcited by 30
  10. 2023Incomplete Contrastive Multi-View Clustering with High-Confidence Guidingcited by 15
  11. 2024Balanced Multi-Relational Graph Clusteringcited by 10
  12. 2024Rethinking Multi-view Representation Learning via Distilled Disentanglingcited by 5

Built on by

Not cited yet.