Orthogonal range searching in moderate dimensions: kd trees and range trees strike back
Timothy M Chan · 2019
Later among the works it cites.
Solving linear programs in the current matrix multiplication time
Michael B Cohen, Yin Tat Lee, and Zhao Song · 2019
Later among the works it cites.
An equivalence class for orthogonal vectors
Lijie Chen and Ryan Williams · 2019
Later among the works it cites.
Gradient descent provably optimizes over-parameterized neural networks
Simon S Du, Xiyu Zhai, Barnabas Poczos, and Aarti Singh · 2019
Later among the works it cites.
Quadratic suffices for over-parametrization via matrix chernoff bound
Original
Zhao Song and Xin Yang · 2019
Later among the works it cites.
An improved analysis of training over-parameterized deep neural networks
Difan Zou and Quanquan Gu · 2019
Later among the works it cites.
Fast convergence of natural gradient descent for over-parameterized neural networks
Guodong Zhang, James Martens, and Roger B Grosse · 2019
Later among the works it cites.
On the hardness of approximate and exact (bichromatic) maximum inner product
Lijie Chen · 2020
Later among the works it cites.
Mongoose: A learnable lsh framework for efficient neural network training
Beidi Chen, Zichang Liu, Binghui Peng, Zhaozhuo Xu, Jonathan Lingjie Li, Tri Dao, Zhao Song, Anshumali Shrivastava, and Christopher Re · 2020
Later among the works it cites.
Slide: In defense of smart algorithms over hardware acceleration for large-scale deep learning systems
Beidi Chen, Tharun Medini, James Farwell, Sameh Gobriel, Charlie Tai, and Anshumali Shrivastava · 2020
Later among the works it cites.
Learning space partitions for nearest neighbor search
Original
Yihe Dong, Piotr Indyk, Ilya Razenshteyn, and Tal Wagner · 2020
Later among the works it cites.
Polylogarithmic width suffices for gradient descent to achieve arbitrarily small test error with shallow relu networks
Ziwei Ji and Matus Telgarsky · 2020
Later among the works it cites.
Reformer: The efficient transformer
Original
Nikita Kitaev, Łukasz Kaiser, and Anselm Levskaya · 2020
Later among the works it cites.
On closest pair in euclidean metric: Monochromatic is as hard as bichromatic
CS Karthik and Pasin Manurangsi · 2020
Later among the works it cites.
Generalized leverage score sampling for neural networks
Jason D Lee, Ruoqi Shen, Zhao Song, Mengdi Wang, and Zheng Yu · 2020
Later among the works it cites.
Toward moderate overparameterization: Global convergence guarantees for training shallow neural networks
Samet Oymak and Mahdi Soltanolkotabi · 2020
Later among the works it cites.
Over-parameterized adversarial training: An analysis overcoming the curse of dimensionality
Original
Yi Zhang, Orestis Plevrakis, Simon S Du, Xingguo Li, Zhao Song, and Sanjeev Arora · 2020
Later among the works it cites.
Training (overparametrized) neural networks in near-linear time
Jan van den Brand, Binghui Peng, Zhao Song, and Omri Weinstein · 2021
Later among the works it cites.
Mongoose: A learnable lsh framework for efficient neural network training
Beidi Chen, Zichang Liu, Binghui Peng, Zhaozhuo Xu, Jonathan Lingjie Li, Tri Dao, Zhao Song, Anshumali Shrivastava, and Christopher Re · 2021
Later among the works it cites.
Fl-ntk: A neural tangent kernel-based framework for federated learning convergence analysis
Baihe Huang, Xiaoxiao Li, Zhao Song, and Xin Yang · 2021
Later among the works it cites.
Does preprocessing help training over-parameterized neural networks?
Zhao Song, Shuo Yang, and Ruizhe Zhang · 2021
Later among the works it cites.
Training multi-layer over-parametrized neural network in subquadratic time
Original
Zhao Song, Lichen Zhang, and Ruizhe Zhang · 2021
Later among the works it cites.
Hardness for triangle problems under even more believable hypotheses: Reductions from real apsp, real 3sum, and ov
Original
Timothy M Chan, Virginia Vassilevska Williams, and Yinzhan Xu · 2022
Closest in time.
Hardness of approximate diameter: Now for undirected graphs
Mina Dalirrooyfard, Ray Li, and Virginia Vassilevska Williams · 2022
Closest in time.
Speeding up optimizations via data structures: Faster search, sample and maintenance
Lichen Zhang · 2022
Closest in time.