Lightning Talks
summary
Seven three-minute updates cover concrete results: a streaming correlation-clustering multipass implementation and covering-in-streams algorithms with tight lower bounds; improved bounds and matching lower bound for the fast JL giving faster embedding time; a random-matrix proof that a sketch pseudoinverse ≈ regularized inverse with explicit mapping between mu and lambda and empirical matches for CountSketch vs SRHT; streaming algorithms and data structures for distribution ID and frequency counts; bit-complexity LP solvers using backward-stable inverse maintenance.
AI-written summary · about