arXiv:2101.10229

Universal Approximation Properties for an ODENet and a ResNet: Mathematical Analysis and Numerical Experiments

Yuto Aizawa, Masato Kimura, Kazunori Matsui

제출 2020-12-22

원문 초록

We prove a universal approximation property (UAP) for a class of ODENet and a class of ResNet, which are simplified mathematical models for deep learning systems with skip connections. The UAP can be stated as follows. Let $n$ and $m$ be the dimension of input and output data, and assume $m\leq n$. Then we show that ODENet of width $n+m$ with any non-polynomial continuous activation function can approximate any continuous function on a compact subset on $\mathbb{R}^n$. We also show that ResNet has the same property as the depth tends to infinity. Furthermore, we derive the gradient of a loss function explicitly with respect to a certain tuning variable. We use this to construct a learning algorithm for ODENet. To demonstrate the usefulness of this algorithm, we apply it to a regression problem, a binary classification, and a multinomial classification in MNIST.

함께 살펴볼 논문

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

arXiv:2506.21002공통 태그 Binary Classification공식 코드 · Papers with Code

Inverse Scene Text Removal

토론

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