ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “dictionary learning”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.AIEmpiricalRecentOct 16, 2026

Beyond SAEs: Consistent Concept Discovery with Sparse Coding

Jinho Choi, Hyesu Lim, Jaegul Choo, Steffen Schneider

The paper proposes Consistent Sparse Dictionary Learning (ConSDL) to improve the reliability and reproducibility of sparse autoencoders.

View →
q-bio.NCcs.LGRecentJun 1, 2026

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

William Dorrell

The paper theoretically analyzes the properties that optimal sparse autoencoder (SAE) dictionaries must satisfy, deriving constraints that explain observed SAE behaviors like hierarchical splitting an…

View →
math.PRcs.ITTheoreticalRecentJun 23, 2026

Conditioning of incoherent sub-dictionaries sampled from a coherent dictionary

Karin Schnass

This paper shows that sub-dictionaries sampled from a coherent dictionary using a coherence rejective Poisson sampling model are well-conditioned with high probability, as long as their expected size…

View →
stat.MLcs.CCcs.DSTheoreticalRecentJul 7, 2026

Boosting with List-Decodable Codes

Addison Prairie, Li-Yang Tan

A new boosting algorithm that strong learns concept classes closed under O(log 1/γ)-XOR using O(log 1/ε) calls to a γ-advantage weak learner and additional samples, by connecting boosting with list-de…

View →
stat.MLcs.LGEmpiricalRecentJun 28, 2026

Gradient boosting with vector-valued leafs

David Cortes

This paper extends gradient boosting to functions of vector inputs using a simple algorithm with histogram-based decision trees.

View →
cs.LGcs.ITmath.STEmpiricalRecentSep 23, 2026

Even Sharper Bounds for Transductive Learning and Its Applications

Yingzhen Yang

The paper introduces Sharper Transductive Local Complexity (STLC), a localized complexity method for transductive learning that achieves the standard inductive rate and matches the transductive minima…

View →
cs.IRcs.AIcs.CLRecentMay 28, 2026

Latent Terms: Dense Retrievers Contain Trivially Extractable BM25-ready Zipfian Vocabularies

Benjamin Clavié, Sean Lee, Aamir Shakir, Makoto P. Kato

The paper introduces Latent Terms, a method that shows dense retrieval models implicitly learn sparse, Zipfian vocabularies that can be used for classical BM25-style sparse scoring without requiring s…

View →
stat.MLcs.DScs.LGTheoreticalRecentAug 13, 2026

Bagging Robustly Learns VC Classes with Linear Sample Complexity

Omar Montasser

This paper improves the sample complexity of learning robust predictors to adversarial examples using a simple algorithm that combines bagging and robust empirical risk minimization.

View →
cs.LGeess.SPmath.OCEmpiricalRecentJun 9, 2026

Learning Doubly Sparse Explicitly Conditioned Transforms

Tudor Pistol

This paper introduces a new data-adaptive, learnt transform for sparse signal representation.

View →
cs.ITTheoreticalRecentJun 29, 2026

Lossy Compression for Sparse Aggregation

Yijun Fan, Fangwei Ye, Raymond W. Yeung

This paper proposes a compression scheme for transmitting sparse local updates in distributed learning systems, and provides a converse based on f-divergence to characterize the communication-accuracy…

View →
cs.LGcs.AIstat.MLRecentMay 28, 2026

The Sample Complexity of Multiclass and Sparse Contextual Bandits

Liad Erez, Fan Chen, Alon Cohen, Tomer Koren +3 more

The paper analyzes the sample complexity of contextual bandits in the $s$-sparse setting, achieving optimal sample bounds for identifying an $\epsilon$-optimal policy.

View →
cs.LGTheoreticalRecentJun 9, 2026

Efficiently Learning Drifting Halfspaces with Massart Noise

Mingchen Ma, Guyang Cao, Jelena Diakonikolas, Ilias Diakonikolas

The paper studies the problem of learning a drifting concept in the presence of Massart noise and provides an efficient learner with improved error rate for margin-separable linear classifiers.

View →
cs.IREmpiricalRecentOct 1, 2026

Adaptive Sparsity Optimization with Learnable Soft Top-K and Per-Term Thresholding for Efficient Retrieval

Wentai Xie, Parker Carlson, Shanxiu He, Tao Yang

This paper proposes a scheme to optimize model sparsity in neural sparse retrieval using adaptive strategies.

View →
eess.ASEmpiricalRecentJun 17, 2026

DASH: Dual-View Self-Distillation with Multi-Layer Hidden Representations for Robust Speech Recognition

Jaeeun Baik, Ui-Hyeop Shin, Jiwoon Lee, Woocheol Jeong +1 more

The paper proposes DASH, a self-distillation framework that improves ASR robustness in noisy environments by learning clean-noisy consistency from paired views.

View →
stat.MLcs.LGmath.STTheoreticalRecentSep 25, 2026

Nonparametric In-Context Learning under Growing Geometric Complexity: Minimax Optimality and Local Geometry-Adaptivity of Transformers

Jaehee Seo, Jisu Kim

This paper studies how transformers exploit task-relevant structure in geometrically heterogeneous data and provides a new estimator and generalization bound for in-context learning.

View →
cs.LGcs.AIRecentMay 31, 2026

When Data Is Scarce: Scaling Sparse Language Models with Repeated Training

Boqian Wu, Qiao Xiao, Patrik Okanovic, Tomasz Sternal +5 more

This paper introduces a new scaling law for sparse language models trained with limited data, demonstrating that sparsity can significantly improve performance and delay data saturation during multi-e…

View →