paper-with-me

Papers

Eigenspace Restructuring: a Principle of Space and Frequency in Neural Networks

2021-12-10 · Lechao Xiao

Understanding the fundamental principles behind the massive success of neural networks is one of the most important open questions in deep learning. However, due to the highly complex nature of the problem, progress has been relatively slow. In this note, through the lens of infinite-width networks, a.k.a. neural kernels, we present one such principle resulting from hierarchical localities. It is well-known that the eigenstructure of infinite-width multilayer perceptrons (MLPs) depends solely on the concept frequency, which measures the order of interactions. We show that the topologies from deep convolutional networks (CNNs) restructure the associated eigenspaces into finer subspaces. In addition to frequency, the new structure also depends on the concept space, which measures the spatial distance among nonlinear interaction terms. The resulting fine-grained eigenstructure dramatically improves the network's learnability, empowering them to simultaneously model a much richer class of interactions, including Long-Range-Low-Frequency interactions, Short-Range-High-Frequency interactions, and various interpolations and extrapolations in-between. Additionally, model scaling can improve the resolutions of interpolations and extrapolations and, therefore, the network's learnability. Finally, we prove a sharp characterization of the generalization error for infinite-width CNNs of any depth in the high-dimensional setting. Two corollaries follow: (1) infinite-width deep CNNs can break the curse of dimensionality without losing their expressivity, and (2) scaling improves performance in both the finite and infinite data regimes.

📄 PDF Abstract BibTeX arXiv:2112.05611

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

An Optimal-Storage Approach to Semidefinite Programming using Approximate Complementarity

2019-02-09 · Lijun Ding, Alp Yurtsever, Volkan Cevher, Joel A. Tropp 외

This paper develops a new storage-optimal algorithm that provably solves generic semidefinite programs (SDPs) in standard form. This method is particularly effective for weakly constrained SDPs. The key idea is to formul…

Learning Laplacian Eigenspace with Mass-Aware Neural Operators on Point Clouds

2026-05-23 · Zherui Yang, Tao Du, Ligang Liu arxiv

The eigendecomposition of the Laplace--Beltrami Operator (LBO) is fundamental to geometric analysis, yet computing its low-frequency eigenmodes remains a significant bottleneck due to the high cost of iterative solvers o…

Zero-shot GeneralizationPoint Clouds

Improving Axial Resolution of Optical Resolution Photoacoustic Microscopy with Advanced Frequency Domain Eigenspace Based Minimum Variance Beamforming Method

2023-09-18 · Yu-Hsiang Yu, Meng-Lin Li

Optical resolution photoacoustic microscopy (OR-PAM) leverages optical focusing and acoustic detection for microscopic optical absorption imaging. Intrinsically it owns high optical lateral resolution and poor acoustic a…

Deep Eigenspace Network for Parametric Non-self-adjoint Eigenvalue Problems

2025-12-23 · H. Li, J. Sun, Z. Zhang arxiv

We consider operator learning for efficiently solving parametric non-self-adjoint eigenvalue problems. To overcome the spectral instability and mode switching associated with non-self-adjoint operators, we choose to lear…

Constructing fast approximate eigenspaces with application to the fast graph Fourier transforms

2020-02-22 · Cristian Rusu, Lorenzo Rosasco

We investigate numerically efficient approximations of eigenspaces associated to symmetric and general matrices. The eigenspaces are factored into a fixed number of fundamental components that can be efficiently manipula…