Fetching the paper…
Reading the bibliography…
While large machine learning models have shown remarkable performance in various domains, their training typically requires iterating for many passes over the training data.
Über quadratische formen mit reellen koeffizienten
Ernst Fischer · 1905
Earlier work this paper cites.
Minimax and interlacing thoerems for matrices
David Carlson · 1983
Earlier work this paper cites.
Generalized minimax and interlacing theorems
David Carlson and E. Marquesw De Sa · 1984
Earlier work this paper cites.
Sequential Karhunen-Loeve basis extraction and its application to images
A Levey and M Lindenbaum · 2000
Earlier work this paper cites.
Fundamentals of adaptive filtering
Ali H Sayed · 2003
Earlier work this paper cites.
Streamed learning: one-pass svms
Piyush Rai, Hal Daumé, and Suresh Venkatasubramanian · 2009
Earlier work this paper cites.
Matrix Analysis
Roger A. Horn and Charles R. Johnson · 2012
Earlier work this paper cites.
One-pass auc optimization
Wei Gao, Rong Jin, Shenghuo Zhu, and Zhi-Hua Zhou · 2013
Earlier work this paper cites.
One pass learning for generalized classifier neural network
Buse Melis Ozyildirim and Mutlu Avci · 2016
Earlier work this paper cites.
One-pass online learning: A local approach
Zhaoze Zhou, Wei-Shi Zheng, Jian-Fang Hu, Yong Xu, and Jane You · 2016
Earlier work this paper cites.
Stochastic gradient/mirror descent: Minimax optimality and implicit regularization
Navid Azizan and Babak Hassibi · 2018
Earlier work this paper cites.
One-pass learning with incremental and decremental features
Chenping Hou and Zhi-Hua Zhou · 2018
Cited alongside, same era.
Neural tangent kernel: Convergence and generalization in neural networks
Arthur Jacot, Franck Gabriel, and Clément Hongler · 2018
Cited alongside, same era.
Measuring catastrophic forgetting in neural networks
Ronald Kemker, Marc McClure, Angelina Abitino, Tyler Hayes, and Christopher Kanan · 2018
Cited alongside, same era.
Learning overparameterized neural networks via stochastic gradient descent on structured data
Yuanzhi Li and Yingyu Liang · 2018
Cited alongside, same era.
Online deep learning: learning deep neural networks on the fly
Doyen Sahoo, Quang Pham, Jing Lu, and Steven CH Hoi · 2018
Cited alongside, same era.
A convergence theory for deep learning via over-parameterization
Zeyuan Allen-Zhu, Yuanzhi Li, and Zhao Song · 2019
Orthogonal gradient descent for continual learning
Mehrdad Farajtabar, Navid Azizan, Alex Mott, and Ang Li · 2020
Later among the works it cites.
A continual learning survey: Defying forgetting in classification tasks
Matthias Delange, Rahaf Aljundi, Marc Masana, Sarah Parisot, Xu Jia, Ales Leonardis, Greg Slabaugh, and Tinne Tuytelaars · 2021
Later among the works it cites.
Huiyi Hu, Ang Li, Daniele Calandriello, and Dilan Gorur · 2021
Later among the works it cites.
Sketching curvature for efficient out-of-distribution detection for deep neural networks
Apoorva Sharma, Navid Azizan, and Marco Pavone · 2021
Later among the works it cites.
Revisiting recursive least squares for training deep neural networks
Chunyuan Zhang, Qi Song, Hui Zhou, Yigui Ou, Hongyao Deng, and Laurence Tianruo Yang · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Reconciling modern machine-learning practice and the classical bias–variance trade-off
Mikhail Belkin, Daniel Hsu, Siyuan Ma, and Soumik Mandal · 2019
Cited alongside, same era.
Wide neural networks of any depth evolve as linear models under gradient descent
Jaehoon Lee, Lechao Xiao, Samuel Schoenholz, Yasaman Bahri, Roman Novak, Jascha Sohl-Dickstein, and Jeffrey Pennington · 2019
Cited alongside, same era.
Online incremental machine learning platform for big data-driven smart traffic management
Dinithi Nallaperuma, Rashmika Nawaratne, Tharindu Bandaragoda, Achini Adikari, Su Nguyen, Thimal Kempitiya, Daswin De Silva, Damminda Alahakoon, and Dakshan Pothuhera · 2019
Cited alongside, same era.
Large scale incremental learning
Yue Wu, Yinpeng Chen, Lijuan Wang, Yuancheng Ye, Zicheng Liu, Yandong Guo, and Yun Fu · 2019
Cited alongside, same era.
Benign overfitting in linear regression
Peter L Bartlett, Philip M Long, Gábor Lugosi, and Alexander Tsigler · 2020
Cited alongside, same era.
Distribution-free one-pass learning
Peng Zhao, Xinqiang Wang, Siyu Xie, Lei Guo, and Zhi-Hua Zhou · 2021
Later among the works it cites.
Stochastic mirror descent on overparameterized nonlinear models
Navid Azizan, Sahin Lale, and Babak Hassibi · 2022
Closest in time.
One-pass learning via bridging orthogonal gradient descent and recursive least-squares
Youngjae Min, Kwangjun Ahn, and Navid Azizan · 2022
Closest in time.
Recursive least squares for training and pruning convolutional neural networks
Tianzong Yu, Chunyuan Zhang, Yuan Wang, Meng Ma, and Qi Song · 2022
Closest in time.
Sketchogd: Memory-efficient continual learning
Benjamin Wright, Youngjae Min, Jeremy Bernstein, and Navid Azizan · 2023
Closest in time.
Π \Pi -ORFit: One-pass learning with bregman projection
Namhoon Cho, Youngjae Min, Hyo-Sang Shin, and Navid Azizan · 2024
Closest in time.