Matrix sparsification and the sparse null space problem

Authors:
Lee-Ad Gottlieb;Tyler Neylon
Affiliations:
Weizmann Institute of Science;Bynomial, Inc.
Venue:
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Year:
2010

Citing 21
Cited 1

The null space problem I. complexity

SIAM Journal on Algebraic and Discrete Methods
Direct methods for sparse matrices

Direct methods for sparse matrices
Computing a sparse basis for the null space

SIAM Journal on Algebraic and Discrete Methods
A hierarchical algorithm for making sparse matrices sparser

Mathematical Programming: Series A and B
The Sparse Basis Problem and Multilinear Algebra

SIAM Journal on Matrix Analysis and Applications
Sparse Approximate Solutions to Linear Systems

SIAM Journal on Computing
The complexity and approximability of finding maximum feasible subsystems of linear relations

Theoretical Computer Science
The hardness of approximate optima in lattices, codes, and systems of linear equations

Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
Near-optimal sparse fourier representations via sampling

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Polynomially bounded minimization problems that are hard to approximate

Nordic Journal of Computing
Sparse Greedy Matrix Approximation for Machine Learning

ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Sparse null bases and marriage theorems

Sparse null bases and marriage theorems
Approximating CVP to Within Almost-Polynomial Factors is NP-Hard

Combinatorica
Incremental Methods for Simple Problems in Time Series: Algorithms and Experiments

IDEAS '05 Proceedings of the 9th International Database Engineering & Application Symposium
Theoretical and experimental analysis of a randomized algorithm for Sparse Fourier transform analysis

Journal of Computational Physics
Sparse solutions for linear prediction problems

Sparse solutions for linear prediction problems
Understanding and Using Linear Programming (Universitext)

Understanding and Using Linear Programming (Universitext)
On sparse representations in arbitrary redundant bases

IEEE Transactions on Information Theory
Greed is good: algorithmic results for sparse approximation

IEEE Transactions on Information Theory
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

IEEE Transactions on Information Theory
Just relax: convex programming methods for identifying sparse signals in noise

IEEE Transactions on Information Theory

Exact recovery of sparsely-used dictionaries

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We revisit the matrix problems sparse null space and matrix sparsification, and show that they are equivalent. We then proceed to seek algorithms for these problems: We prove the hardness of approximation of these problems, and also give a powerful tool to extend algorithms and heuristics for sparse approximation theory to these problems.