Testing Positive Semidefiniteness and Eigenvalue Approximation

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=Ooyidh88_AA


Duration: 34:53
340 views
9

David Woodruff (Carnegie Mellon University)
https://simons.berkeley.edu/talks/david-woodruff-carnegie-mellon-university-2023-10-10
Sketching and Algorithm Design



Other Videos By Simons Institute for the Theory of Computing


2023-10-12A Near-Linear Time Algorithm for the Chamfer Distance
2023-10-12Robustness of Sketches to Adaptive nputs
2023-10-12Tight Bounds for Volumetric Spanners in All Norms
2023-10-12A Simple (1−eps)-Approximation Adaptive Sketching Algorithm for Maximum (Weighted) Matching
2023-10-11Sketching Algorithms for Max-DICUT and other CSPs
2023-10-11Error Correction for Streaming Messages
2023-10-11Streaming Lower Bounds for the Needle Problems
2023-10-11Streaming Euclidean k-median and k-means with o(log n) Space
2023-10-11Capacity Analysis of Vector Symbolic Architectures
2023-10-11Improved Frequency Estimation Algorithms with and without Predictions
2023-10-11Testing Positive Semidefiniteness and Eigenvalue Approximation
2023-10-11Sketching Techniques for Kernel Density Estimation or for Optimal Transport Computations
2023-10-11Sketching and Projecting
2023-10-10Lightning Talks
2023-10-10Memory-Regret Tradeoff for Online Learning
2023-10-09Memory-Regret Tradeoff for Online Learning
2023-10-09Sketching Techniques for Kernel Density Estimation
2023-10-09Sketching for Proving Generalization of Support Vector Machines
2023-10-09Fast Attention Requires Bounded Entries
2023-10-09Randomized Embeddings and Neural Networks
2023-10-09Sublinear Time Eigenvalue Approximation via Random Sampling


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Sketching and Algorithm Design
David Woodruff