arXiv Machine Learning

Reducing Learner Redundancy in Boosting via Residual Orthogonalization

arXiv:2606. 17567v1 Announce Type: new Abstract: While sequential residual fitting is the bedrock of standard boosting frameworks, it inherently breeds learner redundancy by repeatedly revisiting correlated error components.

arXiv Machine Learning
Sep 24

CORE-STACK+: Meta-Learning for Deep Stacked Generalization

CORE-STACK+ is a new meta‑learning framework for deep stacked generalization that tackles two key problems in heterogeneous vision ensembles: prediction‑space multicollinearity and calibration collapse. It introduces a four‑step preconditioning pipeline—kernelized redundancy filtering, a lightweight differentiable meta‑feature gate, a spectrum‑adaptive ridge penalty, and a Laplace‑approximate Bayesian blender—to jointly improve conditioning and calibration. Across six vision benchmarks, CORE‑STACK+ boosts accuracy, reduces model count and inference cost, and significantly lowers expected calibration error compared to existing methods.

By Noor Islam S. Mohammad
arXiv Machine Learning
Jun 15

Ensembling Sparse Autoencoders

arXiv:2505. 16077v2 Announce Type: replace Abstract: Sparse autoencoders (SAEs) are used to decompose neural network activations into human-interpretable features.

By Soham Gadgil, Chris Lin, Su-In Lee
arXiv Machine Learning
Jul 13

Spectrally Deconfounded Gradient Boosting

arXiv:2607. 09371v1 Announce Type: cross Abstract: Flexible machine-learning methods can be sensitive to hidden confounding: they may learn associations induced by unobserved confounders rather than stable signals.

By Andrea Nava, Peter B\"uhlmann, Fabio Sigrist
arXiv Machine Learning
Aug 24

SPARCL: Spectral Partitioned Analytic Continual Learning

SPARCL introduces a spectral partitioned analytic continual learning method that addresses forgetting in analytic class‑incremental learning. By decomposing the running autocorrelation into a high‑energy core and a residual complement, SPARCL freezes core components for old classes and updates only the residual block, ensuring closed‑form updates with an invariance guarantee. Experiments on CIFAR‑100, CUB‑200, ImageNet‑R, and ImageNet‑A with a frozen ViT‑B/16 protocol show that SPARCL narrows the performance gap between classical analytic learners and strong representation matchers while complementing sparse feature‑decorrelation approaches.

By James Hartley, Zeropy Surio, Daniel Whitmore, Hannah Clarke, Thomas Reed
arXiv Machine Learning
1d ago

Output-aware Residual Stream Pruning for Large Language Models

The paper proposes a sensitivity‑aware residual‑stream pruning method for large language models that goes beyond minimizing activation reconstruction error. By using a second‑order approximation of output KL divergence, the authors derive a spectral upper bound that selects pruning subspaces based on both activation covariance and output sensitivity, enabling efficient eigendecomposition. Experiments on instruction‑tuned language models show that this approach consistently reduces calibration KL divergence, improves perplexity, and enhances downstream task performance across various compression levels.

By Chayne Thrash, Kevin Chen, Soheil Kolouri
arXiv Machine Learning
Jul 14

Vertical Fusion: Condensing Internal Representations for Robust ViT Classification

arXiv:2607. 10391v1 Announce Type: cross Abstract: Despite exposing rich intermediate representations, Vision Transformers (ViTs) are almost exclusively utilized as black-box feature extractors, where only the last layer is considered for downstream tasks.

By Francesco Di Salvo, Shyam Nandan Rai, Hamed Damirchi, Ignacio Meza De la Jara, Sebastian Doerrich, Marco Lents, Christian Ledig