285 citations · 499 across the 55 of their papers we have counts for
5 papers · 1 filter
Adaptive LSQR Preconditioning from One Small Sketch
Jung Eun Huh, Coralia Cartis, Yuji Nakatsukasa
We propose APLICUR, an adaptive preconditioning framework for large-scale linear least-squares (LLS) problems. Using a single small sketch computed once at initialization, APLICUR…
Tensor-based Dinkelbach method for computing generalized tensor eigenvalues and its applications
Haibin Chen, Wenqi Zhu, Coralia Cartis
In this paper, we propose a novel tensor-based Dinkelbach--Type method for computing extremal tensor generalized eigenvalues. We show that the extremal tensor generalized eigenvalu…
Hashing embeddings of optimal dimension, with applications to linear least squares
Coralia Cartis, Jan Fiala, Zhen Shao
The aim of this paper is two-fold: firstly, to present subspace embedding properties for -hashing sketching matrices, with , that are optimal in the projection dimensio…
A new and improved quantitative recovery analysis for iterative hard thresholding algorithms in compressed sensing
Coralia Cartis, Andrew Thompson
We present a new recovery analysis for a standard compressed sensing algorithm, Iterative Hard Thresholding (IHT) (Blumensath and Davies, 2008), which considers the fixed points of…
An exact tree projection algorithm for wavelets
Coralia Cartis, Andrew Thompson
We propose a dynamic programming algorithm for projection onto wavelet tree structures. In contrast to other recently proposed algorithms which only give approximate tree projectio…