Tensor decomposition and approximation schemes for constraint satisfaction problems

  title={Tensor decomposition and approximation schemes for constraint satisfaction problems},
  author={Wenceslas Fernandez de la Vega and Marek Karpinski and Ravi Kannan and Santosh S. Vempala},
  booktitle={Symposium on the Theory of Computing},
The only general class of MAX-rCSP problems for which Polynomial Time Approximation Schemes (PTAS) are known are the dense problems. In this paper, we give PTAS's for a much larger class of weighted MAX-rCSP problems which includes as special cases the dense problems and, for r = 2, all metric instances (where the weights satisfy the triangle inequality) and quasimetric instances; for r > 2, our class includes a generalization of metrics. Our algorithms are based on low-rank approximations with… 

Spectral methods for matrices and tensors

This survey describes methods for low-rank approximation which extend to tensors and finds that for any matrix, a random submatrix of rows/columns picked with probabilities proportional to the squared lengths, yields estimates of the singular values as well as an approximation to the whole matrix.

Approximate Low-Rank Decomposition for Real Symmetric Tensors

Two main theorems on symmetric tensor rank with ε -room of tolerance are proved, which are based on some techniques in geometric functional analysis and rigorous complexity estimates.

Tensor sparsification via a bound on the spectral norm of random tensors

A simple, element-wise sparsification algorithm that zeroes out all sufficiently small elements, keeps all sufficiently large elements of A, and retains some of the remaining elements with probabilities proportional to the square of their magnitudes is presented.

Most Tensor Problems Are NP-Hard

It is proved that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard and how computing the combinatorial hyperdeterminant is NP-, #P-, and VNP-hard.

Matrix Decompositions and Sparse Graph Regularity

It turns out that cut pseudorandomness unifies several important pseudorRandomness concepts in prior work, and it is shown that upper regularity and a version of low threshold rank are both special cases, thus implying weak and strong regularity lemmas for these graph classes where only weak ones were previously known.

The approximate rank of a matrix and its algorithmic applications: approximate rank

Borders are given on the ε-rank of a real matrix A, defined for any ε > 0 as the minimum rank over matrices that approximate every entry of A to within an additive ε.

Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems

A unified method of showing approximation schemes based on the Sherali-Adams linear programming relaxation hierarchy to show new algorithmic results on the optimization version of the hypergraph isomorphism problem.



Random sampling and approximation of MAX-CSP problems

A new efficient sampling method for approximating r-dimensional Maximum Constraint Satisfaction Problems, MAX-rCSP, on n variables up to an additive error εnr, which gives for the first time a polynomial in ε—1 bound on the sample size necessary to carry out the above approximation.

The regularity lemma and approximation schemes for dense problems

  • A. FriezeR. Kannan
  • Mathematics
    Proceedings of 37th Conference on Foundations of Computer Science
  • 1996
The central point here is that the Regularity Lemma provides an explanation of why these Max-SNP hard problems turn out to be easy in dense graphs.

Quick Approximation to Matrices and Applications

The matrix approximation is generalized to multi-dimensional arrays and from that derive approximation algorithms for all dense Max-SNP problems and the Regularity Lemma is derived.

Polynomial time approximation schemes for dense instances of NP-hard problems

We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut, graph bisection, graph

Fast monte-carlo algorithms for finding low-rank approximations

This paper develops an algorithm which is qualitatively faster provided the entries of the matrix are sampled according to a natural probability distribution and the algorithm takes time polynomial in k, 1//spl epsiv/, log(1//spl delta/) only, independent of m, n.

A sublinear time approximation scheme for clustering in metric spaces

  • P. Indyk
  • Computer Science, Mathematics
    40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
  • 1999
This paper shows an approximation scheme for the metric 2-clustering problem, which involves partitioning X into two sets S(1) and S(2) in order to minimize the value of Sigmasub i/spl sub/S(i)/d(u,v).

Spectral partitioning of random graphs

  • Frank McSherry
  • Computer Science, Mathematics
    Proceedings 2001 IEEE International Conference on Cluster Computing
  • 2001
This paper shows that a simple spectral algorithm can solve all three problems above in the average case, as well as a more general problem of partitioning graphs based on edge density.

The online median problem

This work introduces a natural variant of the (metric uncapacitated) k-median problem that is similar in spirit to the recent primal-dual-based facility location algorithm of Jain and Vazirani, but the approach is more elementary and yields an improved running time.

Approximation schemes for clustering problems

The first polynomial time approximation schemes for clustering problems are given, and the running time of the algorithms is a vast improvement overprevious work.

Approximation schemes for Metric Bisection and partitioning

We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of distances across the