arXiv:2604.20219v3 cs.LG

Layer-wise Geometric Approximation Rates for Deep Networks

Shijun Zhang, Zuowei Shen, Yuesheng Xu

제출 2026-11-17

원문 초록

Depth is widely viewed as a central contributor to the success of deep neural networks, yet standard approximation results typically give error bounds only for the final output of a network. Inspired by classical multiscale expansions and multigrade deep learning, we give depth a scale-dependent interpretation by constructing a single network whose intermediate readouts approximate the target at successively finer scales. For any $f\in L^p([0,1]^d)$ with $1\le p <\infty$ and any integer $N\ge2$, we construct a single network of width $3dN+2d+4$ with the same activation pattern in every hidden layer, using sine in the first two neurons and $\mathtt{ReLU}$ in the rest. For every $\ell\ge0$, the $L^p$ approximation error of the readout $\Phi_\ell$ at layer $\ell+4$ is bounded by $(2d+1)\omega_{f,p}(N^{-\ell})$, where $\omega_{f,p}$ denotes the $L^p$ translation modulus of $f$. Under the H\"older condition $\omega_{f,p}(t)\le Ct^\alpha$ with $C>0$ and $0< \alpha \le 1$, this estimate yields the geometric bound $(2d+1)C N^{-\alpha\ell}$. More generally, if $\omega_{f,p}(t)$ has a known upper bound that tends to zero as $t\downarrow0$, we obtain a stopping rule for adaptive depth selection. We can stop at the first depth where the error bound meets the desired tolerance and later append layers to meet a tighter tolerance while keeping all earlier maps and readouts fixed.

제출 이력

확인된 버전만 표시합니다. 전체 제출 이력은 arXiv 원문에서 확인하세요.

  1. arXiv:2604.20219v3제출 시각 미확인
  2. arXiv:2604.20219v2제출 시각 미확인

함께 살펴볼 논문

공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.

공통 태그로 연결된 공개 논문이 아직 없습니다.

토론

이 논문과 연결된 포럼 글이 아직 없습니다.