default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhan-Minh Nguyen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c5]Huy Tuan Pham, Phan-Minh Nguyen:
Global Convergence of Three-layer Neural Networks in the Mean Field Regime. ICLR 2021- [c4]Huy Tuan Pham, Phan-Minh Nguyen:
Limiting fluctuation and trajectorial stability of multilayer neural networks with mean field training. NeurIPS 2021: 4843-4855 - [i10]Phan-Minh Nguyen:
Analysis of feature learning in weight-tied autoencoders via the mean field lens. CoRR abs/2102.08373 (2021) - [i9]Huy Tuan Pham, Phan-Minh Nguyen:
Global Convergence of Three-layer Neural Networks in the Mean Field Regime. CoRR abs/2105.05228 (2021) - [i8]Huy Tuan Pham, Phan-Minh Nguyen:
Limiting fluctuation and trajectorial stability of multilayer neural networks with mean field training. CoRR abs/2110.15954 (2021) - 2020
- [i7]Phan-Minh Nguyen, Huy Tuan Pham:
A Rigorous Framework for the Mean Field Limit of Multilayer Neural Networks. CoRR abs/2001.11443 (2020) - [i6]Huy Tuan Pham, Phan-Minh Nguyen:
A Note on the Global Convergence of Multilayer Neural Networks in the Mean Field Regime. CoRR abs/2006.09355 (2020)
2010 – 2019
- 2019
- [c3]Ping Li, Phan-Minh Nguyen:
On Random Deep Weight-Tied Autoencoders: Exact Asymptotic Analysis, Phase Transitions, and Implications to Training. ICLR 2019 - [i5]Phan-Minh Nguyen:
Mean Field Limit of the Learning Dynamics of Multilayer Neural Networks. CoRR abs/1902.02880 (2019) - 2018
- [i4]Song Mei, Andrea Montanari, Phan-Minh Nguyen:
A Mean Field View of the Landscape of Two-Layers Neural Networks. CoRR abs/1804.06561 (2018) - 2017
- [c2]Andrea Montanari, Phan-Minh Nguyen:
Universality of the elastic net error. ISIT 2017: 2338-2342 - [i3]Raphaël Berthier, Andrea Montanari, Phan-Minh Nguyen:
State Evolution for Approximate Message Passing with Non-Separable Functions. CoRR abs/1708.03950 (2017) - 2016
- [j3]Dor Shaviv
, Phan-Minh Nguyen, Ayfer Özgür Aydin:
Capacity of the Energy-Harvesting Channel With a Finite Battery. IEEE Trans. Inf. Theory 62(11): 6436-6458 (2016) - 2015
- [j2]Phan-Minh Nguyen, Marc André Armand:
On Capacity Formulation With Stationary Inputs and Application to a Bit-Patterned Media Recording Channel Model. IEEE Trans. Inf. Theory 61(11): 5906-5930 (2015) - [c1]Dor Shaviv, Phan-Minh Nguyen, Ayfer Özgür:
Capacity of the energy harvesting channel with a finite battery. ISIT 2015: 131-135 - [i2]Dor Shaviv, Phan-Minh Nguyen, Ayfer Özgür:
Capacity of the Energy Harvesting Channel with a Finite Battery. CoRR abs/1506.02024 (2015) - [i1]Phan-Minh Nguyen, Marc André Armand:
On Capacity Formulation with Stationary Inputs and Application to a Bit-Patterned Media Recording Channel Model. CoRR abs/1509.02297 (2015) - 2013
- [j1]Phan-Minh Nguyen, Marc André Armand, Tong Wu:
On the Watermark String in the Davey-MacKay Construction. IEEE Commun. Lett. 17(9): 1830-1833 (2013)
Coauthor Index
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-25 05:53 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:
