Optimal CUR Matrix Decompositions (Q2968164): Difference between revisions

From MaRDI portal
Merged Item from Q5259569
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Bounds on the Sample Complexity for Private Learning and Private Data Release / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing the sample complexity of private learners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Private Learning and Sanitization: Pure vs. Approximate Differential Privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collusion-secure fingerprinting for digital data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster private release of marginals on small databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds in Differential Privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Our Data, Ourselves: Privacy Via Distributed Noise Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of differentially private data release / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for privately releasing marginals via convex relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Efficient Attacks on Statistical Disclosure Control Mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privately Releasing Conjunctions and the Statistical Query Barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Constructions and Private Data Release / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geometry of differential privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of privately releasing contingency tables and the spectra of random matrices with correlated rows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Geometry of Differential Privacy: The Small Database and Approximate Cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential Privacy and the Fat-Shattering Dimension of Linear Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive privacy via the median mechanism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms for Privately Releasing Marginals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Answering n <sub>{2+o(1)}</sub> counting queries with differential privacy is hard / rank
 
Normal rank

Revision as of 09:42, 10 July 2024

scientific article; zbMATH DE number 6451563
  • Optimal CUR matrix decompositions
Language Label Description Also known as
English
Optimal CUR Matrix Decompositions
scientific article; zbMATH DE number 6451563
  • Optimal CUR matrix decompositions

Statements

Optimal CUR Matrix Decompositions (English)
0 references
Optimal CUR matrix decompositions (English)
0 references
0 references
0 references
10 March 2017
0 references
26 June 2015
0 references
randomized algorithms
0 references
numerical linear algebra
0 references
low-rank approximations
0 references
CUR decomposition
0 references
singular value decomposition
0 references
CUR
0 references
SVD
0 references
adaptive sampling
0 references
column subset selection
0 references
input-sparsity-time
0 references
leverage scores
0 references
low rank matrix decomposition
0 references
spectral sparsification
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references