2 citations · 4 across the 4 of their papers we have counts for
4 papers
Invariant subspaces and PCA in nearly matrix multiplication time
Aleksandros Sobczyk, Marko Mladenović, Mathieu Luisier
Approximating invariant subspaces of generalized eigenvalue problems (GEPs) is a fundamental computational problem at the core of machine learning and scientific computing. It is,…
Approximate Euclidean lengths and distances beyond Johnson-Lindenstrauss
Aleksandros Sobczyk, Mathieu Luisier
A classical result of Johnson and Lindenstrauss states that a set of high dimensional data points can be projected down to dimensions such that the square of th…
pylspack: Parallel algorithms and data structures for sketching, column subset selection, regression and leverage scores
Aleksandros Sobczyk, Efstratios Gallopoulos
We present parallel algorithms and data structures for three fundamental operations in Numerical Linear Algebra: (i) Gaussian and CountSketch random projections and their combinati…
Estimating leverage scores via rank revealing methods and randomization
Aleksandros Sobczyk, Efstratios Gallopoulos
We study algorithms for estimating the statistical leverage scores of rectangular dense or sparse matrices of arbitrary rank. Our approach is based on combining rank revealing meth…