mlsanityData to 14 Oct 2026

Multiview Representation Learning via Distributed Joint Latent Space Structuring

arXiv 2504.18455 ↗First posted 25 Apr 2025stat.ML cs.IT cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

We study distributed multiview representation learning, a problem in which K clients each observe a distinct but possibly statistically correlated view. The clients independently extract local representations from their views, which are then used by a central decoder for joint target estimation. One central difficulty is that, since the clients are not allowed to communicate with each other, they must autonomously decide what to encode. We study this coordination problem from a generalization error perspective. For both classification and regression tasks, we derive novel generalization bounds expressed in terms of the Minimum Description Length (MDL) of the joint latent variables across all views and across both training and test datasets. Our structure-aware bound reveals that statistical correlations among the extracted representations tighten the bound, providing theoretical grounding for the empirically observed benefits of cross-view feature alignment. Perhaps counterintuitively, our findings imply that encoders may benefit from extracting redundant representations. Motivated by these bounds, we introduce a data-dependent Gaussian product mixture prior that can be learned and applied in a fully distributed manner. The joint structure of this multiview prior captures inter-view dependencies that are typically discarded by marginal-only approaches. Comprehensive experiments across multiple datasets, encoder architectures, numbers of views, and distortion settings demonstrate the effectiveness of our proposed approach.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 58 of its 100 references that are in the map. First posted on arXiv 25 Apr 2025.

Builds on

58 of 100 references.

References · 58

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  2. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  3. 2013Auto-Encoding Variational Bayescited by 4,053
  4. 2016Deep Variational Information Bottleneckcited by 930
  5. 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 533
  6. 2017A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networkscited by 314
  7. 2018Stronger generalization bounds for deep nets via a compression approachcited by 307
  8. 2017Information-theoretic analysis of generalization capability of learning algorithmscited by 303
  9. 2020Learning Robust Representations via Multi-View Information Bottleneckcited by 191
  10. 2020Reasoning About Generalization via Conditional Mutual Informationcited by 147
  11. 2019Information-Theoretic Generalization Bounds for SGLD via Data-Dependent Estimatescited by 119
  12. 2019Tightening Mutual Information Based Bounds on Generalization Errorcited by 117
38 more
  1. 2020Tighter risk certificates for neural networkscited by 112
  2. 2021Information-Theoretic Generalization Bounds for Stochastic Gradient Descentcited by 84
  3. 2017Entropy-SGD optimizes the prior of a PAC-Bayes bound: Generalization properties of Entropy-SGD and data-dependent priorscited by 81
  4. 2020The Conditional Entropy Bottleneckcited by 75
  5. 2017Nonlinear Information Bottleneckcited by 71
  6. 2018Learning Representations for Neural Network-Based Classification Using the Information Bottleneck Principlecited by 70
  7. 2021Intrinsic Dimension, Persistent Homology and Generalization in Neural Networkscited by 70
  8. 2020PAC-Bayes Analysis Beyond the Usual Boundscited by 63
  9. 2020Hausdorff Dimension, Heavy Tails, and Generalization in Neural Networkscited by 62
  10. 2016A Strongly Quasiconvex PAC-Bayesian Boundcited by 54
  11. 2020Proper Learning, Helly Number, and an Optimal SVM Boundcited by 53
  12. 2021Information-theoretic generalization bounds for black-box learning algorithmscited by 49
  13. 2019Generalization Error Bounds Via R'enyi-, f-Divergences and Maximal Leakagecited by 48
  14. 2019In Defense of Uniform Convergence: Generalization via derandomization with an application to interpolating predictorscited by 44
  15. 2021Heavy Tails in SGD and Compressibility of Overparametrized Neural Networkscited by 44
  16. 2020On Information Plane Analyses of Neural Network Classifiers -- A Reviewcited by 37
  17. 2018Caveats for information bottleneck in deterministic scenarioscited by 34
  18. 2021Generalization bounds via distillationcited by 34
  19. 2019Universal Bayes consistency in metric spacescited by 33
  20. 2020Learning Optimal Representations with the Decodable Information Bottleneckcited by 33
  21. 2018Distributed Variational Representation Learningcited by 32
  22. 2020Stable Sample Compression Schemes: New Applications and an Optimal SVM Margin Boundcited by 32
  23. 2020Individually Conditional Individual Mutual Information Bound on Generalization Errorcited by 30
  24. 2021Towards a Unified Information-Theoretic Framework for Generalizationcited by 30
  25. 2020On the Information Bottleneck Problems: Models, Connections, Applications and Information Theoretic Viewscited by 28
  26. 2021Improving Transformers with Probabilistic Attention Keyscited by 28
  27. 2022A New Family of Generalization Bounds Using Samplewise Evaluated CMIcited by 28
  28. 2021Generalization Bounds using Lower Tail Exponents in Stochastic Optimizerscited by 27
  29. 2022Generalization Bounds via Convex Analysiscited by 27
  30. 2022Rate-Distortion Theoretic Generalization Bounds for Stochastic Learning Algorithmscited by 22
  31. 2022On PAC-Bayesian reconstruction guarantees for VAEscited by 20
  32. 2018Sample Compression for Real-Valued Learnerscited by 19
  33. 2022Limitations of Information-Theoretic Generalization Bounds for Gradient Descent Methods in Stochastic Convex Optimizationcited by 19
  34. 2023Information Theoretic Lower Bounds for Information Theoretic Upper Boundscited by 17
  35. 2019The Convex Information Bottleneck Lagrangiancited by 16
  36. 2023Statistical Guarantees for Variational Autoencoders using PAC-Bayesian Theorycited by 16
  37. 2023A Novel Approach for Effective Multi-View Clustering with Information-Theoretic Perspectivecited by 14
  38. 2022Gacs-Korner Common Information Variational Autoencodercited by 12

50 most cited of 58 All 58 (JSON)

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.