Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZeyuan Allen Zhu
- > Home > Persons > Zeyuan Allen Zhu
Publications
- 2023
[c58]Zeyuan Allen-Zhu, Yuanzhi Li:
Backward Feature Correction: How Deep Learning Performs Deep (Hierarchical) Learning. COLT 2023: 4598- [c57]Zeyuan Allen-Zhu, Yuanzhi Li:
Towards Understanding Ensemble, Knowledge Distillation and Self-Distillation in Deep Learning. ICLR 2023 - [c56]Zeyuan Allen-Zhu, Yuanzhi Li:
Forward Super-Resolution: How Can GANs Learn Hierarchical Generative Models for Real-World Distributions. ICLR 2023 - [i61]Zeyuan Allen-Zhu, Yuanzhi Li:
Physics of Language Models: Part 1, Context-Free Grammar. CoRR abs/2305.13673 (2023) - [i59]Zeyuan Allen Zhu, Yuanzhi Li:
Physics of Language Models: Part 3.1, Knowledge Storage and Extraction. CoRR abs/2309.14316 (2023) - [i58]Zeyuan Allen-Zhu, Yuanzhi Li:
Physics of Language Models: Part 3.2, Knowledge Manipulation. CoRR abs/2309.14402 (2023) - 2022
- [c54]Edward J. Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu, Yuanzhi Li, Shean Wang, Lu Wang, Weizhu Chen:
LoRA: Low-Rank Adaptation of Large Language Models. ICLR 2022 - 2021
- [j6]Zeyuan Allen-Zhu, Yuanzhi Li, Aarti Singh, Yining Wang
:
Near-optimal discrete optimization for experimental design: a regret minimization approach. Math. Program. 186(1): 439-478 (2021) - [c53]Zeyuan Allen-Zhu, Yuanzhi Li:
Feature Purification: How Adversarial Training Performs Robust Deep Learning. FOCS 2021: 977-988 - [i56]Zeyuan Allen-Zhu, Yuanzhi Li:
Forward Super-Resolution: How Can GANs Learn Hierarchical Generative Models for Real-World Distributions. CoRR abs/2106.02619 (2021) - [i55]Edward J. Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu, Yuanzhi Li, Shean Wang, Weizhu Chen:
LoRA: Low-Rank Adaptation of Large Language Models. CoRR abs/2106.09685 (2021) - 2020
- [i54]Zeyuan Allen-Zhu, Yuanzhi Li:
Backward Feature Correction: How Deep Learning Performs Deep Learning. CoRR abs/2001.04413 (2020) - [i53]Zeyuan Allen-Zhu, Yuanzhi Li:
Feature Purification: How Adversarial Training Performs Robust Deep Learning. CoRR abs/2005.10190 (2020) - [i52]Zeyuan Allen-Zhu, Yuanzhi Li:
Towards Understanding Ensemble, Knowledge Distillation and Self-Distillation in Deep Learning. CoRR abs/2012.09816 (2020) - 2019
- [c51]Zeyuan Allen-Zhu, Yuanzhi Li, Zhao Song:
A Convergence Theory for Deep Learning via Over-Parameterization. ICML 2019: 242-252 - [c50]Zeyuan Allen-Zhu, Yuanzhi Li, Yingyu Liang:
Learning and Generalization in Overparameterized Neural Networks, Going Beyond Two Layers. NeurIPS 2019: 6155-6166 - [c49]Zeyuan Allen-Zhu, Yuanzhi Li, Zhao Song:
On the Convergence Rate of Training Recurrent Neural Networks. NeurIPS 2019: 6673-6685 - [c48]Zeyuan Allen-Zhu, Yuanzhi Li:
What Can ResNet Learn Efficiently, Going Beyond Kernels? NeurIPS 2019: 9015-9025 - [c47]Zeyuan Allen-Zhu, Yuanzhi Li:
Can SGD Learn Recurrent Neural Networks with Provable Generalization? NeurIPS 2019: 10331-10341 - [i49]Zeyuan Allen-Zhu, Yuanzhi Li:
Can SGD Learn Recurrent Neural Networks with Provable Generalization? CoRR abs/1902.01028 (2019) - [i48]Zeyuan Allen-Zhu, Yuanzhi Li:
What Can ResNet Learn Efficiently, Going Beyond Kernels? CoRR abs/1905.10337 (2019) - 2018
- [c45]Zeyuan Allen-Zhu, Sébastien Bubeck, Yuanzhi Li:
Make the Minority Great Again: First-Order Regret Bound for Contextual Bandits. ICML 2018: 186-194 - [c41]Zeyuan Allen-Zhu, Yuanzhi Li:
NEON2: Finding Local Minima via First-Order Oracles. NeurIPS 2018: 3720-3730 - [c38]Zeyuan Allen-Zhu, Ankit Garg, Yuanzhi Li, Rafael Mendes de Oliveira, Avi Wigderson:
Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing. STOC 2018: 172-181 - [i46]Zeyuan Allen-Zhu, Sébastien Bubeck, Yuanzhi Li:
Make the Minority Great Again: First-Order Regret Bound for Contextual Bandits. CoRR abs/1802.03386 (2018) - [i43]Zeyuan Allen-Zhu, Ankit Garg, Yuanzhi Li, Rafael Mendes de Oliveira, Avi Wigderson:
Operator Scaling via Geodesically Convex Optimization, Invariant Theory and Polynomial Identity Testing. CoRR abs/1804.01076 (2018) - [i41]Zeyuan Allen-Zhu, Yuanzhi Li, Zhao Song:
On the Convergence Rate of Training Recurrent Neural Networks. CoRR abs/1810.12065 (2018) - [i40]Zeyuan Allen-Zhu, Yuanzhi Li, Zhao Song:
A Convergence Theory for Deep Learning via Over-Parameterization. CoRR abs/1811.03962 (2018) - [i39]Zeyuan Allen-Zhu, Yuanzhi Li, Yingyu Liang:
Learning and Generalization in Overparameterized Neural Networks, Going Beyond Two Layers. CoRR abs/1811.04918 (2018) - 2017
- [c37]Zeyuan Allen-Zhu, Yuanzhi Li:
First Efficient Convergence for Streaming k-PCA: A Global, Gap-Free, and Near-Optimal Rate. FOCS 2017: 487-492 - [c36]Zeyuan Allen-Zhu, Yuanzhi Li, Rafael Mendes de Oliveira, Avi Wigderson:
Much Faster Algorithms for Matrix Scaling. FOCS 2017: 890-901 - [c34]Zeyuan Allen-Zhu, Yuanzhi Li:
Doubly Accelerated Methods for Faster CCA and Generalized Eigendecomposition. ICML 2017: 98-106 - [c33]Zeyuan Allen-Zhu, Yuanzhi Li:
Faster Principal Component Regression and Stable Matrix Chebyshev Approximation. ICML 2017: 107-115 - [c32]Zeyuan Allen-Zhu, Yuanzhi Li:
Follow the Compressed Leader: Faster Online Learning of Eigenvectors and Faster MMWU. ICML 2017: 116-125 - [c31]Zeyuan Allen-Zhu, Yuanzhi Li, Aarti Singh, Yining Wang:
Near-Optimal Design of Experiments via Regret Minimization. ICML 2017: 126-135 - [c29]Zeyuan Allen-Zhu, Elad Hazan, Wei Hu, Yuanzhi Li:
Linear Convergence of a Frank-Wolfe Type Algorithm over Trace-Norm Balls. NIPS 2017: 6191-6200 - [i38]Zeyuan Allen Zhu, Yuanzhi Li:
Follow the Compressed Leader: Faster Algorithms for Matrix Multiplicative Weight Updates. CoRR abs/1701.01722 (2017) - [i36]Zeyuan Allen Zhu, Yuanzhi Li, Rafael Mendes de Oliveira, Avi Wigderson:
Much Faster Algorithms for Matrix Scaling. CoRR abs/1704.02315 (2017) - [i35]Zeyuan Allen-Zhu, Elad Hazan, Wei Hu, Yuanzhi Li:
Linear Convergence of a Frank-Wolfe Type Algorithm over Trace-Norm Balls. CoRR abs/1708.02105 (2017) - [i33]Zeyuan Allen-Zhu, Yuanzhi Li, Aarti Singh, Yining Wang:
Near-Optimal Discrete Optimization for Experimental Design: A Regret Minimization Approach. CoRR abs/1711.05174 (2017) - [i32]Zeyuan Allen-Zhu, Yuanzhi Li:
Neon2: Finding Local Minima via First-Order Oracles. CoRR abs/1711.06673 (2017) - 2016
- [c22]Zeyuan Allen Zhu, Yuanzhi Li:
Even Faster SVD Decomposition Yet Without Agonizing Pain. NIPS 2016: 974-982 - [i27]Zeyuan Allen Zhu, Yuanzhi Li:
Even Faster SVD Decomposition Yet Without Agonizing Pain. CoRR abs/1607.03463 (2016) - [i26]Zeyuan Allen Zhu, Yuanzhi Li:
Doubly Accelerated Methods for Faster CCA and Generalized Eigendecomposition. CoRR abs/1607.06017 (2016) - [i25]Zeyuan Allen Zhu, Yuanzhi Li:
Fast Global Convergence of Online PCA. CoRR abs/1607.07837 (2016) - [i24]Zeyuan Allen Zhu, Yuanzhi Li:
Faster Principal Component Regression via Optimal Polynomial Approximation to sgn(x). CoRR abs/1608.04773 (2016)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-09 23:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
