default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhenyu Zhu
- > Home > Persons > Zhenyu Zhu
Publications
- 2025
[c39]Zhenyu Zhu, Fanghui Liu, Volkan Cevher:
How Gradient descent balances features: A dynamical analysis for two-layer neural networks. ICLR 2025- [i12]Thomas Pethick, Wanyun Xie, Kimon Antonakopoulos
, Zhenyu Zhu, Antonio Silveti-Falls, Volkan Cevher:
Training Deep Learning Models with Norm-Constrained LMOs. CoRR abs/2502.07529 (2025) - [i11]Yongtao Wu, Luca Viano, Yihang Chen, Zhenyu Zhu, Kimon Antonakopoulos, Quanquan Gu, Volkan Cevher:
Multi-Step Alignment as Markov Games: An Optimistic Online Gradient Descent Approach with Convergence Guarantees. CoRR abs/2502.12678 (2025) - 2023
- [c33]Zhenyu Zhu, Fanghui Liu, Grigorios Chrysos, Francesco Locatello, Volkan Cevher:
Benign Overfitting in Deep Neural Networks under Lazy Training. ICML 2023: 43105-43128 - [c31]Jiayuan Ye, Zhenyu Zhu, Fanghui Liu, Reza Shokri, Volkan Cevher:
Initialization Matters: Privacy-Utility Analysis of Overparameterized Neural Networks. NeurIPS 2023 - [c30]Zhenyu Zhu, Francesco Locatello, Volkan Cevher:
Sample Complexity Bounds for Score-Matching: Causal Discovery and Generative Modeling. NeurIPS 2023 - [i8]Zhenyu Zhu, Fanghui Liu, Grigorios G. Chrysos, Francesco Locatello, Volkan Cevher:
Benign Overfitting in Deep Neural Networks under Lazy Training. CoRR abs/2305.19377 (2023) - [i7]Zhenyu Zhu, Francesco Locatello, Volkan Cevher:
Sample Complexity Bounds for Score-Matching: Causal Discovery and Generative Modeling. CoRR abs/2310.18123 (2023) - [i6]Jiayuan Ye, Zhenyu Zhu, Fanghui Liu, Reza Shokri, Volkan Cevher:
Initialization Matters: Privacy-Utility Analysis of Overparameterized Neural Networks. CoRR abs/2310.20579 (2023) - 2022
- [c26]Zhenyu Zhu, Fabian Latorre, Grigorios Chrysos, Volkan Cevher:
Controlling the Complexity and Lipschitz Constant improves Polynomial Nets. ICLR 2022 - [c24]Yongtao Wu, Zhenyu Zhu, Fanghui Liu, Grigorios Chrysos, Volkan Cevher:
Extrapolation and Spectral Bias of Neural Nets with Hadamard Product: a Polynomial Net Study. NeurIPS 2022 - [c23]Zhenyu Zhu, Fanghui Liu, Grigorios Chrysos, Volkan Cevher:
Generalization Properties of NAS under Activation and Skip Connection Search. NeurIPS 2022 - [c22]Zhenyu Zhu, Fanghui Liu, Grigorios Chrysos, Volkan Cevher:
Robustness in deep learning: The good (width), the bad (depth), and the ugly (initialization). NeurIPS 2022 - [i5]Zhenyu Zhu, Fabian Latorre, Grigorios G. Chrysos, Volkan Cevher:
Controlling the Complexity and Lipschitz Constant improves polynomial nets. CoRR abs/2202.05068 (2022) - [i4]Zhenyu Zhu, Fanghui Liu, Grigorios G. Chrysos, Volkan Cevher:
Generalization Properties of NAS under Activation and Skip Connection Search. CoRR abs/2209.07238 (2022) - [i3]Zhenyu Zhu, Fanghui Liu, Grigorios G. Chrysos, Volkan Cevher:
Robustness in deep learning: The good (width), the bad (depth), and the ugly (initialization). CoRR abs/2209.07263 (2022) - [i2]Yongtao Wu, Zhenyu Zhu, Fanghui Liu, Grigorios G. Chrysos, Volkan Cevher:
Extrapolation and Spectral Bias of Neural Nets with Hadamard Product: a Polynomial Net Study. CoRR abs/2209.07736 (2022)
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.
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.
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.
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 2025-06-12 22:54 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:
