<p>We study the universality of complex-valued neural networks with bounded widths and arbitrary depths. Under mild assumptions, we give a full description of those activation functions <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="365_2025_9713_Article_IEq1.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="74" /> </InlineMediaObject> <EquationSource Format="TEX">\(\varrho :\mathbb {C}\rightarrow \mathbb {C}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>ϱ</mi> <mo>:</mo> <mi mathvariant="double-struck">C</mi> <mo stretchy="false">→</mo> <mi mathvariant="double-struck">C</mi> </mrow> </math></EquationSource> </InlineEquation> that have the property that their associated networks are universal, i.e., are capable of approximating continuous functions to arbitrary accuracy on compact domains. Precisely, we show that deep narrow complex-valued networks are universal if and only if their activation function is neither holomorphic, nor antiholomorphic, nor <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="365_2025_9713_Article_IEq2.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="12" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {R}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">R</mi> </math></EquationSource> </InlineEquation>-affine. This is a much larger class of functions than in the dual setting of arbitrary width and fixed depth. Unlike in the real case, the sufficient width differs significantly depending on the considered activation function. We show that a width of <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="365_2025_9713_Article_IEq3.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="90" /> </InlineMediaObject> <EquationSource Format="TEX">\(2n+2m+5\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>2</mn> <mi>n</mi> <mo>+</mo> <mn>2</mn> <mi>m</mi> <mo>+</mo> <mn>5</mn> </mrow> </math></EquationSource> </InlineEquation> is always sufficient and that in general a width of <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="365_2025_9713_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="103" /> </InlineMediaObject> <EquationSource Format="TEX">\(\max \left\{ 2n,2m\right\} \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo movablelimits="true">max</mo> <mfenced close="}" open="{"> <mn>2</mn> <mi>n</mi> <mo>,</mo> <mn>2</mn> <mi>m</mi> </mfenced> </mrow> </math></EquationSource> </InlineEquation> is necessary. We prove, however, that a width of <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="365_2025_9713_Article_IEq5.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="75" /> </InlineMediaObject> <EquationSource Format="TEX">\(n+m+3\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>+</mo> <mi>m</mi> <mo>+</mo> <mn>3</mn> </mrow> </math></EquationSource> </InlineEquation> suffices for a rich subclass of the admissible activation functions. Here, <i>n</i> and <i>m</i> denote the input and output dimensions of the considered networks. Moreover, for the case of smooth and non-polyharmonic activation functions, we provide a quantitative approximation bound in terms of the depth of the considered networks.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Universal approximation with complex-valued deep narrow neural networks

  • Paul Geuchen,
  • Thomas Jahn,
  • Hannes Matt

摘要

We study the universality of complex-valued neural networks with bounded widths and arbitrary depths. Under mild assumptions, we give a full description of those activation functions \(\varrho :\mathbb {C}\rightarrow \mathbb {C}\) ϱ : C C that have the property that their associated networks are universal, i.e., are capable of approximating continuous functions to arbitrary accuracy on compact domains. Precisely, we show that deep narrow complex-valued networks are universal if and only if their activation function is neither holomorphic, nor antiholomorphic, nor \(\mathbb {R}\) R -affine. This is a much larger class of functions than in the dual setting of arbitrary width and fixed depth. Unlike in the real case, the sufficient width differs significantly depending on the considered activation function. We show that a width of \(2n+2m+5\) 2 n + 2 m + 5 is always sufficient and that in general a width of \(\max \left\{ 2n,2m\right\} \) max 2 n , 2 m is necessary. We prove, however, that a width of \(n+m+3\) n + m + 3 suffices for a rich subclass of the admissible activation functions. Here, n and m denote the input and output dimensions of the considered networks. Moreover, for the case of smooth and non-polyharmonic activation functions, we provide a quantitative approximation bound in terms of the depth of the considered networks.