arXiv Machine Learning August 3, 2026 By Kate\v{r}ina Henclov\'a, V\'aclav \v{S}m\'idl

GEMSS: A Variational Method for Discovering Multiple Sparse Solutions in Classification and Regression Problems

Read the original on arXiv Machine Learning →

arXiv:2602. 08913v3 Announce Type: replace Abstract: In underdetermined regression and classification problems, multiple feature subsets often yield equivalent predictive performance.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Statistics ML

Sep 10

Regularized Estimation and Feature Selection in Mixtures of Generalized Linear Experts

arXiv:1907.06994v2 Announce Type: replace-cross Abstract: Mixtures of experts (MoE) are conditional mixture models in which both the mixing proportions and the component densities depend on the predi...

By Thin Nguyen-Van, Faicel Chamroukhi, Ha Hoang Van, Bao Tuyen Huynh

efficiency benchmarks

arXiv Machine Learning

Jul 7

Efficient Cross-Validation for Sparse Linear Regression

arXiv:2306. 14851v5 Announce Type: replace-cross Abstract: Given a high-dimensional covariate matrix and a response vector, ridge-regularized sparse linear regression selects a subset of features that explains the relationship between covariates and the response in an interpretable manner.

By Ryan Cory-Wright, Andr\'es G\'omez

efficiency

arXiv AI

Jun 9

Scaling Decision-Focused Learning to Large Problems with Lagrangian Decomposition

arXiv:2606. 08797v1 Announce Type: cross Abstract: Decision-focused learning has shown great promise for addressing predict-then-optimize problems, particularly in the presence of under-specified models.

By St\'ephane Eilles-Chan Way, Hugo Percot, Quentin Cappart, Tias Guns, Louis-Martin Rousseau

benchmarks

arXiv Machine Learning

Jun 15

Decompose Sparsely Where You Should, Absorb Densely Where You Should No

arXiv:2606. 14040v1 Announce Type: new Abstract: Sparse autoencoders (SAEs) are typically trained to reconstruct the \textbf{entire} residual stream through a sparse dictionary, implicitly assuming that all activation content is amenable to sparse, monosemantic decomposition.

By Ruixuan Deng, Zehao Jin, Zekun Wang, Zihan Dong

efficiency benchmarks safety

arXiv Machine Learning

Jun 2

How Optimality Structures Sparse Dictionaries: A Theory for Understanding SAE Representations

arXiv:2606. 02385v1 Announce Type: cross Abstract: Sparse Autoencoders (SAEs) have found success parsing neural representations into interpretable concepts, providing a basis for understanding and control.

By William Dorrell

arXiv Machine Learning

Jun 16

Unsupervised Learning for Missing Modalities in Multimodal Learning

arXiv:2606. 15743v1 Announce Type: new Abstract: This paper addresses the missing-modality challenge in multi-modal learning by introducing Unsupervised Learning for Missing Modalities in Multi-Modal Learning (UL4M4), a flexible framework that imputes missing feature embeddings in a task-independent manner before supervised prediction.

By Hassan Ismkhan, Hamid Bouchahcia

rag multimodal benchmarks

One email a morning, machine-written

Related stories

Regularized Estimation and Feature Selection in Mixtures of Generalized Linear Experts

Efficient Cross-Validation for Sparse Linear Regression

Scaling Decision-Focused Learning to Large Problems with Lagrangian Decomposition

Decompose Sparsely Where You Should, Absorb Densely Where You Should No

How Optimality Structures Sparse Dictionaries: A Theory for Understanding SAE Representations

Unsupervised Learning for Missing Modalities in Multimodal Learning