{"ID":2837162,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2511.20794","arxiv_id":"2511.20794","title":"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.","short_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.","url_abs":"https://arxiv.org/abs/2511.20794","url_pdf":"https://arxiv.org/pdf/2511.20794v1","authors":"[\"Tuan Pham\",\"Alessandro Rinaldo\"]","published":"2025-11-25T19:35:31Z","proceeding":"math.FA","tasks":"[\"math.FA\",\"math.PR\",\"math.ST\"]","methods":"[]","has_code":false}
