mlsanityData to 7 Oct 2026

Compressed Active Subspaces for Scalable Bayesian Inference

arXiv 2609.19539 ↗First posted 17 Sep 2026cs.LG cs.AI stat.MEcited by 0

Not on the map. Why?

Abstract (arXiv)

Active subspace methods provide a framework for quantifying predictive uncertainty in high-dimensional models by identifying and performing inference along parameter directions that have the greatest influence on the model output. However, the construction of active subspaces requires storing many full-dimensional model gradients, which becomes prohibitive as model size increases. We address this limitation by proposing Compressed Active Subspaces (CAS), a scalable approach that first maps the model parameters to a compressed space using a structured isometric embedding and then constructs the active subspace within this reduced parameterization. Our approach substantially reduces the memory required for active subspace construction and enables Bayesian inference for large models where standard active subspace methods become impractical. We demonstrate the scalability of CAS on neural networks of increasing size while maintaining predictive performance and robust uncertainty estimates.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 27 references that are in the map. First posted on arXiv 17 Sep 2026.

Builds on

21 of 27 references.

References · 21

  1. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  2. 2018Pyro: Deep Universal Probabilistic Programmingcited by 379
  3. 2019PowerSGD: Practical Low-Rank Gradient Compression for Distributed Optimizationcited by 234
  4. 2023Bayesian Low-rank Adaptation for Large Language Modelscited by 112
  5. 2019Subspace Inference for Bayesian Deep Learningcited by 94
  6. 2021Learning Neural Network Subspacescited by 82
  7. 2019Communication-efficient distributed SGD with Sketchingcited by 81
  8. 2015Newton Sketch: A Linear-time Optimization Algorithm with Linear-Quadratic Convergencecited by 72
  9. 2021Smoothness Matrices Beat Smoothness Constants: Better Communication Compression Techniques for Distributed Optimizationcited by 21
  10. 2021Layer Adaptive Node Selection in Bayesian Neural Networks: Statistical Guarantees and Implementation Detailscited by 14
  11. 2025Scalable Bayesian Low-Rank Adaptation of Large Language Models via Stochastic Variational Subspace Inferencecited by 11
  12. 2023Learning Active Subspaces for Effective and Scalable Uncertainty Quantification in Deep Neural Networkscited by 9
9 more
  1. 2025C-LoRA: Contextual Low-Rank Adaptation for Uncertainty Estimation in Large Language Modelscited by 9
  2. 2024Training Bayesian Neural Networks with Sparse Subspace Variational Inferencecited by 7
  3. 2025Uni-LoRA: One Vector is All You Needcited by 7
  4. 2023Spike-and-slab shrinkage priors for structurally sparse Bayesian neural networkscited by 4
  5. 2024Bayesian Semi-structured Subspace Inferencecited by 3
  6. 2024Problem-dependent convergence bounds for randomized linear gradient compressioncited by 3
  7. 2024Leveraging Active Subspaces to Capture Epistemic Model Uncertainty in Deep Generative Models for Molecular Designcited by 2
  8. 2024Enhancing Generative Molecular Design via Uncertainty-guided Fine-tuning of Variational Autoencoderscited by 2
  9. 2025Uncertainty-Aware Adaptation of Large Language Models for Protein-Protein Interaction Analysiscited by 2

Built on by

Not cited yet.