2 citations · 3 across the 11 of their papers we have counts for
3 papers · 1 filter
A fast diagonalization algorithm to enable singular value decomposition of large matrices for efficient template matching
Matthew Giammar, Bronwyn Lucas, Alexander Strang
Many computational problems possess the following three features: (1) the problem could be solved efficiently if a linear operator could be diagonalized, (2) direct diagonalization…
Sample continuation in Bayesian hierarchical model via variational inference
Yucong Liu, Zilai Si, Alexander Strang
Posterior distributions arising in ill-posed Bayesian inverse problems are often both analytically intractable and highly sensitive to parameters of the chosen prior family. We aim…
Stochastic Gradient Descent in the Saddle-to-Saddle Regime of Deep Linear Networks
Guillaume Corlouer, Avi Semler, Alexander Strang +1
Deep linear networks (DLNs) are used as an analytically tractable model of the training dynamics of deep neural networks. While gradient descent in DLNs is known to exhibit saddle-…