Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/115143
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Applied Mathematics | en_US |
| dc.creator | Zhang, S | en_US |
| dc.creator | Zhao, H | en_US |
| dc.creator | Zhong, Y | en_US |
| dc.creator | Zhou, H | en_US |
| dc.date.accessioned | 2025-09-10T01:09:54Z | - |
| dc.date.available | 2025-09-10T01:09:54Z | - |
| dc.identifier.issn | 2049-8764 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10397/115143 | - |
| dc.language.iso | en | en_US |
| dc.rights | © The Author(s) 2025. Published by Oxford University Press on behalf of the Institute of Mathematics and its Applications. | en_US |
| dc.rights | This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/ 4.0/), which permits unrestricted reuse, distribution, and reproduction in any medium, provided the original work is properly cited. | en_US |
| dc.rights | The following publication Zhang, S., Zhao, H., Zhong, Y., & Zhou, H. (2025). Why shallow networks struggle to approximate and learn high frequencies. Information and Inference: A Journal of the IMA, 14(3) is available at https://doi.org/10.1093/imaiai/iaaf022. | en_US |
| dc.subject | Generalized Fourier analysis | en_US |
| dc.subject | Gram matrix | en_US |
| dc.subject | Llow-pass filter | en_US |
| dc.subject | Radon transform | en_US |
| dc.subject | Rashomon set | en_US |
| dc.subject | Shallow neural networks | en_US |
| dc.title | Why shallow networks struggle to approximate and learn high frequencies | en_US |
| dc.type | Journal/Magazine Article | en_US |
| dc.identifier.volume | 14 | en_US |
| dc.identifier.issue | 3 | en_US |
| dc.identifier.doi | 10.1093/imaiai/iaaf022 | en_US |
| dcterms.abstract | In this work, we present a comprehensive study combining mathematical and computational analysis to explain why a two-layer neural network struggles to handle high frequencies in both approximation and learning, especially when machine precision, numerical noise and computational cost are significant factors in practice. Specifically, we investigate the following fundamental computational issues: (1) the minimal numerical error achievable under finite precision, (2) the computational cost required to attain a given accuracy and (3) the stability of the method with respect to perturbations. The core of our analysis lies in the conditioning of the representation and its learning dynamics. Explicit answers to these questions are provided, along with supporting numerical evidence. | en_US |
| dcterms.accessRights | open access | en_US |
| dcterms.bibliographicCitation | Information and inference, Sept 2025, v. 14, no. 3, iaaf022 | en_US |
| dcterms.isPartOf | Information and inference | en_US |
| dcterms.issued | 2025-09 | - |
| dc.identifier.eissn | 2049-8772 | en_US |
| dc.identifier.artn | iaaf022 | en_US |
| dc.description.validate | 202509 bcch | en_US |
| dc.description.oa | Version of Record | en_US |
| dc.identifier.FolderNumber | OA_TA | - |
| dc.description.fundingSource | Others | en_US |
| dc.description.fundingText | S.Z. was partially supported by start-up fund P0053092 from The Hong Kong Polytechnic University. H.Z. was partially supported by NSF grants (DMS-2309551), and (DMS-2012860). Y.Z. was partially supported by NSF grant (DMS-2309530) and H.Z. was partially supported by NSF grant (DMS2307465). | en_US |
| dc.description.pubStatus | Published | en_US |
| dc.description.TA | OUP (2025) | en_US |
| dc.description.oaCategory | TA | en_US |
| Appears in Collections: | Journal/Magazine Article | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| iaaf022.pdf | 3.13 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.



