BEAR: Sketching BFGS Algorithm for Ultra-High Dimensional Feature Selection in Sublinear Memory

J. Nocedal, “Updating quasi-Newton matrices with limited storage,” Math. Comput

1980

Earlier work this paper cites.

M. Charikar, K. Chen, and M. Farach-Colton, “Finding frequent items in data streams,” in Intl. Colloquium on Automata, Languages, and Programming

2002

Earlier work this paper cites.

D. D. Lewis, Y. Yang, T. G. Rose, and F. Li, “RCV1: A new benchmark collection for text categorization research,” J. Mach. Learn. Res

2004

Earlier work this paper cites.

S. Webb, J. Caverlee, and C. Pu, “Introducing the Webb Spam Corpus: Using Email Spam to Identify Web Spam Automatically.,” in CEAS

2006

Earlier work this paper cites.

K. Weinberger, A. Dasgupta, J. Langford, A. Smola, and J. Attenberg, “Feature hashing for large scale multitask learning,” in Proc. of the 26 t ​ h 26^{th} Annual Intl. Conf. on Machine Learning

2009

Earlier work this paper cites.

A. Maleki and D. L. Donoho, “Optimally tuned iterative reconstruction algorithms for compressed sensing,” IEEE J Selected Topics in Sig. Proces

2010

Earlier work this paper cites.

S. Deorowicz and S. Grabowski, “Compression of DNA sequence reads in FASTQ format,” Bioinformatics

2011

Earlier work this paper cites.

M. Yu, L. Jose, and R. Miao, “Software Defined Traffic Measurement with OpenSketch,” in Proc. Symposium on Networked Systems Design and Implementation (NSDI)

2013

Earlier work this paper cites.

D. Kane and J. Nelson, “Sparser Johnson-Lindenstrauss transforms,” J. ACM

2014

Earlier work this paper cites.

D. Woodruff et al

2014

Cited alongside, same era.

A. Mokhtari and A. Ribeiro, “Global convergence of online limited memory BFGS,” J. Mach. Learn. Res

2015

Cited alongside, same era.

J. A. Tropp, “An introduction to matrix concentration inequalities,” arXiv preprint arXiv:1501.01571

Original

2015

Cited alongside, same era.

K. Vervier, P. Mahé, M. Tournoud, J. Veyrieras, and J. Vert, “Large-scale machine learning for metagenomics sequence classification,” Bioinformatics

2016

Cited alongside, same era.

A. Aghazadeh, A. Y. Lin, M. A. Sheikh, A. L. Chen, L. M. Atkins, C. L. Johnson, J. F. Petrosino, R. A. Drezek, and R. G. Baraniuk, “Universal microbial diagnostics using random DNA probes,” Sci. Adv

2016

Cited alongside, same era.

Z. Yao, A. Gholami, K. Keutzer, and M. Mahoney, “Pyhessian: Neural networks through the lens of the Hessian,” arXiv preprint arXiv:1912.07145

Original

2019

Later among the works it cites.

R. Bollapragada, R. H. Byrd, and J. Nocedal, “Exact and inexact subsampled newton methods for optimization,” IMA Journal of Numerical Analysis

2019

Later among the works it cites.

T. O’Leary-Roseberry, N. Alger, and O. Ghattas, “Inexact newton methods for stochastic nonconvex optimization with applications to neural network training,” arXiv preprint arXiv:1905.06738

Original

2019

Later among the works it cites.

N. Ivkin, D. Rothchild, E. Ullah, V. Braverman, I. Stoica, and R. Arora, “Communication-efficient distributed SGD with Sketching,” arXiv preprint arXiv:1903.04488

Original

2019

Later among the works it cites.

V. Gupta, S. Kadhe, T. Courtade, M. W. Mahoney, and K. Ramchandran, “Oversketched Newton: Fast convex optimization for serverless systems,” arXiv preprint arXiv:1903.08857