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

20 results for “Sparse approximation”

CS papers only

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

Want pure semantic search? Try claim verification →

cs.DSmath.NATheoreticalRecentJun 10, 2026

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products

Christoper Musco, Indu Ramesh

This paper provides a nearly sharp characterization of the matvec query complexity of sparse matrix approximation.

View →
eess.SPEmpiricalRecentOct 26, 2026

Efficient SCA Algorithms for Sparse Bayesian Learning

Esa Ollila, Majdoddin Esfandiari, Daniel P. Palomar, Xinjue Wang

This paper develops new algorithms for covariance learning within the successive convex approximation framework.

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 →
math.PRcs.DSTheoreticalRecentJun 18, 2026

Optimal Sparsification of Gaussian Processes

Shivam Nadimpalli

The paper proves an optimal dimension-free sparsification theorem for suprema of centered Gaussian processes.

View →
cs.DSTheoreticalRecentJun 18, 2026

Sparsify Submodular Functions under Cardinality Constraints

Zhengting Bao, Dongrun Cai, Xue Chen

The paper studies submodular sparsification and provides efficient constructions of size-$O(n k^2 \log n)$ sparsifiers for summations of arbitrary submodular functions under cardinality constraints.

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.DSTheoreticalRecentJul 17, 2026

A Unified Theory of Sparsification

Sanjeev Khanna, Aaron Putterman, Madhu Sudan

This paper introduces a structural theorem for the sparsifiability of real-valued codes, which generalizes both combinatorial and continuous notions of sparsification.

View →
cs.CLcs.AIRecentMay 27, 2026

PrunePath: Towards Highly Structured Sparse Language Models

Zhexuan Gu, Zixun Fu, Yancheng Yuan

PrunePath introduces a budget-adaptive structured sparsification framework that efficiently prunes Feed-forward networks in large language models, achieving hardware-friendly sparsity and measurable s…

View →
cs.DScs.DCTheoreticalRecentJul 27, 2026

Parallel Spectral Graph Sparsification via Low Diameter Decompositions

Yves Baumann, Gernot Zöcklein

A new solver-free parallel spectral sparsification algorithm for weighted graphs is presented, relying on low-diameter decompositions and independent sampling, eliminating dependence on target approxi…

View →
cs.DScs.LGTheoreticalRecentAug 3, 2026

The Condition-Number Barrier in Sparse Least Squares

Honghao Lin, Vahab Mirrokni, David P. Woodruff

The paper establishes a lower bound for the improvement of linear dependence on the restricted condition number in sparse convex optimization, using the Small-Set Expansion Hypothesis.

View →
cs.DScs.CCmath.CORecentMay 29, 2026

High-Dimensional Expanders, the Sparsest Cut Problem, and Steurer's Conjecture

Farzam Ebrahimnejad, Shayan Oveis Gharan

The paper refutes Steurer's conjecture regarding the existence of large constant-separated sets within families of unit-norm vectors with low average correlation, using high-dimensional expanders to s…

View →
cs.DSmath.COTheoreticalRecentJul 9, 2026

Optimal Sparsifiers for Abelian Cayley Graphs

Arpon Basu, Pravesh K. Kothari, Raghu Meka, Stefan Tudose

This paper proves that for any finite abelian group, there exists a spectral sparsifier for its Cayley graph with log(|G|) generators. This result improves upon previous work for constructing code spa…

View →
cs.DSTheoreticalRecentOct 19, 2026

A Tight Oracle Threshold for \(k\)-Submodular Maximization

Siyuan Chen

The paper proves a lower bound on the number of value-oracle queries required for a certain type of approximation algorithm.

View →
cs.CCmath.NTTheoreticalRecentAug 12, 2026

Euclidean SVP is deterministically NP-hard to approximate within any constant factor

Daqing Wan

The Euclidean shortest vector problem is deterministically NP-hard to approximate within any constant factor for arbitrary constants.

View →
cs.DScs.CGcs.LGTheoreticalRecentJul 3, 2026

Dimension Reduction for Curves: Simplified and Generalized

Matthijs Ebbens, Jie Lu, Alexander Munteanu

This paper simplifies the proof of the bound on the target dimension for reducing the dimension of high-dimensional polygonal curves using random projections, extending it to various distance measures…

View →