Matches in SemOpenAlex for { <https://semopenalex.org/work/W2963773752> ?p ?o ?g. }
- W2963773752 startingPage "21" @default.
- W2963773752 abstract "Understanding the singular value spectrum of an n x n matrix A is a fundamental task in countless numerical computation and data analysis applications. In matrix multiplication time, it is possible to perform a full SVD of A and directly compute the singular values sigma_1,...,sigma_n. However, little is known about algorithms that break this runtime barrier.Using tools from stochastic trace estimation, polynomial approximation, and fast linear system solvers, we show how to efficiently isolate different ranges of A's spectrum and approximate the number of singular values in these ranges. We thus effectively compute an approximate histogram of the spectrum, which can stand in for the true singular values in many applications.We use our histogram primitive to give the first algorithms for approximating a wide class of symmetric matrix norms and spectral sums faster than the best known runtime for matrix multiplication. For example, we show how to obtain a (1 + epsilon) approximation to the Schatten 1-norm (i.e. the nuclear or trace norm) in just ~ O((nnz(A)n^{1/3} + n^2)epsilon^{-3}) time for A with uniform row sparsity or tilde O(n^{2.18} epsilon^{-3}) time for dense matrices. The runtime scales smoothly for general Schatten-p norms, notably becoming tilde O (p nnz(A) epsilon^{-3}) for any real p >= 2.At the same time, we show that the complexity of spectrum approximation is inherently tied to fast matrix multiplication in the small epsilon regime. We use fine-grained complexity to give conditional lower bounds for spectrum approximation, showing that achieving milder epsilon dependencies in our algorithms would imply triangle detection algorithms for general graphs running in faster than state of the art matrix multiplication time. This further implies, through a reduction of (Williams & William, 2010), that highly accurate spectrum approximation algorithms running in subcubic time can be used to give subcubic time matrix multiplication. As an application of our bounds, we show that precisely computing all effective resistances in a graph in less than matrix multiplication time is likely difficult, barring a major algorithmic breakthrough." @default.
- W2963773752 created "2019-07-30" @default.
- W2963773752 creator A5007012613 @default.
- W2963773752 creator A5023229845 @default.
- W2963773752 creator A5024805876 @default.
- W2963773752 creator A5086787265 @default.
- W2963773752 creator A5091108132 @default.
- W2963773752 date "2018-01-01" @default.
- W2963773752 modified "2023-09-27" @default.
- W2963773752 title "Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness" @default.
- W2963773752 doi "https://doi.org/10.4230/lipics.itcs.2018.8" @default.
- W2963773752 hasPublicationYear "2018" @default.
- W2963773752 type Work @default.
- W2963773752 sameAs 2963773752 @default.
- W2963773752 citedByCount "17" @default.
- W2963773752 countsByYear W29637737522018 @default.
- W2963773752 countsByYear W29637737522019 @default.
- W2963773752 countsByYear W29637737522020 @default.
- W2963773752 countsByYear W29637737522021 @default.
- W2963773752 crossrefType "proceedings-article" @default.
- W2963773752 hasAuthorship W2963773752A5007012613 @default.
- W2963773752 hasAuthorship W2963773752A5023229845 @default.
- W2963773752 hasAuthorship W2963773752A5024805876 @default.
- W2963773752 hasAuthorship W2963773752A5086787265 @default.
- W2963773752 hasAuthorship W2963773752A5091108132 @default.
- W2963773752 hasConcept C106487976 @default.
- W2963773752 hasConcept C109282560 @default.
- W2963773752 hasConcept C11413529 @default.
- W2963773752 hasConcept C114614502 @default.
- W2963773752 hasConcept C118615104 @default.
- W2963773752 hasConcept C121332964 @default.
- W2963773752 hasConcept C134306372 @default.
- W2963773752 hasConcept C138885662 @default.
- W2963773752 hasConcept C158693339 @default.
- W2963773752 hasConcept C159985019 @default.
- W2963773752 hasConcept C17349429 @default.
- W2963773752 hasConcept C17744445 @default.
- W2963773752 hasConcept C191795146 @default.
- W2963773752 hasConcept C192562407 @default.
- W2963773752 hasConcept C195906000 @default.
- W2963773752 hasConcept C199539241 @default.
- W2963773752 hasConcept C22789450 @default.
- W2963773752 hasConcept C2780595030 @default.
- W2963773752 hasConcept C33923547 @default.
- W2963773752 hasConcept C41895202 @default.
- W2963773752 hasConcept C45374587 @default.
- W2963773752 hasConcept C62520636 @default.
- W2963773752 hasConcept C75291252 @default.
- W2963773752 hasConcept C78045399 @default.
- W2963773752 hasConcept C84114770 @default.
- W2963773752 hasConcept C92207270 @default.
- W2963773752 hasConceptScore W2963773752C106487976 @default.
- W2963773752 hasConceptScore W2963773752C109282560 @default.
- W2963773752 hasConceptScore W2963773752C11413529 @default.
- W2963773752 hasConceptScore W2963773752C114614502 @default.
- W2963773752 hasConceptScore W2963773752C118615104 @default.
- W2963773752 hasConceptScore W2963773752C121332964 @default.
- W2963773752 hasConceptScore W2963773752C134306372 @default.
- W2963773752 hasConceptScore W2963773752C138885662 @default.
- W2963773752 hasConceptScore W2963773752C158693339 @default.
- W2963773752 hasConceptScore W2963773752C159985019 @default.
- W2963773752 hasConceptScore W2963773752C17349429 @default.
- W2963773752 hasConceptScore W2963773752C17744445 @default.
- W2963773752 hasConceptScore W2963773752C191795146 @default.
- W2963773752 hasConceptScore W2963773752C192562407 @default.
- W2963773752 hasConceptScore W2963773752C195906000 @default.
- W2963773752 hasConceptScore W2963773752C199539241 @default.
- W2963773752 hasConceptScore W2963773752C22789450 @default.
- W2963773752 hasConceptScore W2963773752C2780595030 @default.
- W2963773752 hasConceptScore W2963773752C33923547 @default.
- W2963773752 hasConceptScore W2963773752C41895202 @default.
- W2963773752 hasConceptScore W2963773752C45374587 @default.
- W2963773752 hasConceptScore W2963773752C62520636 @default.
- W2963773752 hasConceptScore W2963773752C75291252 @default.
- W2963773752 hasConceptScore W2963773752C78045399 @default.
- W2963773752 hasConceptScore W2963773752C84114770 @default.
- W2963773752 hasConceptScore W2963773752C92207270 @default.
- W2963773752 hasLocation W29637737521 @default.
- W2963773752 hasOpenAccess W2963773752 @default.
- W2963773752 hasPrimaryLocation W29637737521 @default.
- W2963773752 hasRelatedWork W113406481 @default.
- W2963773752 hasRelatedWork W1483804921 @default.
- W2963773752 hasRelatedWork W1621098854 @default.
- W2963773752 hasRelatedWork W1839953896 @default.
- W2963773752 hasRelatedWork W1965952671 @default.
- W2963773752 hasRelatedWork W1990457366 @default.
- W2963773752 hasRelatedWork W2033961328 @default.
- W2963773752 hasRelatedWork W2037483935 @default.
- W2963773752 hasRelatedWork W2057450058 @default.
- W2963773752 hasRelatedWork W2157988812 @default.
- W2963773752 hasRelatedWork W2606931951 @default.
- W2963773752 hasRelatedWork W2607911764 @default.
- W2963773752 hasRelatedWork W2764280570 @default.
- W2963773752 hasRelatedWork W2963586518 @default.
- W2963773752 hasRelatedWork W2963684020 @default.
- W2963773752 hasRelatedWork W2964003194 @default.
- W2963773752 hasRelatedWork W2995847732 @default.
- W2963773752 hasRelatedWork W3105113144 @default.
- W2963773752 hasRelatedWork W826455576 @default.