A note on time-uniform concentration inequality for matrix products
Abstract
This short note contains a simple argument that allows us to go from fixed-time to any-time bounds for the concentration of matrix products. The result presented here is motivated by the analysis of Oja's algorithms.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.