Algorithms from Randomized Numerical Linear Algebra (RandNLA) are known ...
Sketch-and-project is a framework which unifies many known iterative met...
Algorithmic Gaussianization is a phenomenon that can arise when using
ra...
Stochastic variance reduction has proven effective at accelerating
first...
We consider minimizing a smooth and strongly convex objective function u...
We present a framework for speeding up the time it takes to sample from
...
In second-order optimization, a potential bottleneck can be computing th...
Consider a regression problem where the learner is given a large collect...
For a tall n× d matrix A and a random m× n sketching matrix
S, the sketc...
In distributed second order optimization, a standard strategy is to aver...
Determinantal point processes (DPPs) are a useful probabilistic model fo...
It is often desirable to reduce the dimensionality of a large dataset by...
Randomized Numerical Linear Algebra (RandNLA) uses randomness to develop...
We define a notion of isotropy for discrete set distributions. If μ is a...
The Column Subset Selection Problem (CSSP) and the Nyström method are am...
Double descent refers to the phase transition that is exhibited by the
g...
We analyze the convergence rate of the Randomized Newton Method (RNM)
in...
In linear regression we wish to estimate the optimum linear least square...
In experimental design, we are given n vectors in d dimensions, and our
...
We study the complexity of sampling from a distribution over all index
s...
In distributed optimization and distributed numerical linear algebra, we...