20 results for “Sparse approximation”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper provides a nearly sharp characterization of the matvec query complexity of sparse matrix approximation.
This paper develops new algorithms for covariance learning within the successive convex approximation framework.
This paper introduces a new data-adaptive, learnt transform for sparse signal representation.
The paper proves an optimal dimension-free sparsification theorem for suprema of centered Gaussian processes.
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.
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…
This paper introduces a structural theorem for the sparsifiability of real-valued codes, which generalizes both combinatorial and continuous notions of sparsification.
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…
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…
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.
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…
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…
The paper proves a lower bound on the number of value-oracle queries required for a certain type of approximation algorithm.
The Euclidean shortest vector problem is deterministically NP-hard to approximate within any constant factor for arbitrary constants.
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…