Explore a 25-minute IEEE conference talk on testing positive semi-definiteness through random submatrices. Delve into the research presented by Ainesh Bakshi, Nadiia Chepurko, and Rajesh Jayaram from Carnegie Mellon University and Massachusetts Institute of Technology. Learn about the bounded entry model, problem statement, norms, and eigenvalue identities. Understand the main algorithm, its analysis, and the high-level solution proposed. Discover the concept of indistinguishability and discuss open problems in this field of matrix theory and linear algebra.
Testing Positive Semi-Definiteness via Random Submatrices
Overview
Syllabus
Introduction
Definition
Main Algorithm
Bounded Entry Model
Problem Statement
Norms
Eigenvalue identities
Results
Analysis
Algorithm
Highlevel solution
Indistinguishability
Open Problems
Taught by
IEEE FOCS: Foundations of Computer Science
