<p>As the simplest structure of interval neural networks (INNs), the single-layer interval perceptron (SIP) has the advantages of uncomplicated structure and fast computation, making it well-suited for handling various uncertain data. While <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40314_2025_3180_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="19" /> </InlineMediaObject> <EquationSource Format="TEX">\(L_0\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>L</mi> <mn>0</mn> </msub> </math></EquationSource> </InlineEquation> regularization yields the sparsest solution among all <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40314_2025_3180_Article_IEq5.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="21" /> </InlineMediaObject> <EquationSource Format="TEX">\(L_n\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>L</mi> <mi>n</mi> </msub> </math></EquationSource> </InlineEquation> regularization methods, optimizing <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40314_2025_3180_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="19" /> </InlineMediaObject> <EquationSource Format="TEX">\(L_0\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>L</mi> <mn>0</mn> </msub> </math></EquationSource> </InlineEquation> regularization poses a challenge as it is an NP-hard problem. Therefore, <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40314_2025_3180_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="19" /> </InlineMediaObject> <EquationSource Format="TEX">\(L_0\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>L</mi> <mn>0</mn> </msub> </math></EquationSource> </InlineEquation> regularization is approximated using smoothing functions. The incorporation of smoothing Group <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40314_2025_3180_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="19" /> </InlineMediaObject> <EquationSource Format="TEX">\(L_0\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>L</mi> <mn>0</mn> </msub> </math></EquationSource> </InlineEquation> regularization retains the sparse solution characteristics of <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40314_2025_3180_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="19" /> </InlineMediaObject> <EquationSource Format="TEX">\(L_0\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>L</mi> <mn>0</mn> </msub> </math></EquationSource> </InlineEquation> regularization and effectively resolves its NP-hard problem. Building upon the aforementioned content, a modified learning algorithm based on smoothing Group <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40314_2025_3180_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="19" /> </InlineMediaObject> <EquationSource Format="TEX">\(L_0\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>L</mi> <mn>0</mn> </msub> </math></EquationSource> </InlineEquation> regularization for interval perceptron with interval weights (MIPSG<InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40314_2025_3180_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="19" /> </InlineMediaObject> <EquationSource Format="TEX">\(L_0\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>L</mi> <mn>0</mn> </msub> </math></EquationSource> </InlineEquation>) is proposed, where the interval perceptron take real numbers as inputs, weights and outputs are represented as intervals. The radius of each interval weight is expressed through a quadratic term rather than an absolute value function, ensuring a positive radius and preventing oscillations phenomenon. The monotonicity, the strong and weak convergence of the proposed algorithm is rigorously demonstrated under moderate assumptions. Moreover, experimental results on one-class approximation and one-class classification simulations reveal that the proposed algorithm exhibits superior performance in terms of training and testing mean squared error (MSE), pruning weights and accuracy.</p>

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

A gradient-based learning method with smoothing group \(L_0\) regularization for interval perceptron and interval weights

  • Yan Liu,
  • Jinru Cui,
  • Rui Wang,
  • Yuanquan Liu,
  • Jian Li

摘要

As the simplest structure of interval neural networks (INNs), the single-layer interval perceptron (SIP) has the advantages of uncomplicated structure and fast computation, making it well-suited for handling various uncertain data. While \(L_0\) L 0 regularization yields the sparsest solution among all \(L_n\) L n regularization methods, optimizing \(L_0\) L 0 regularization poses a challenge as it is an NP-hard problem. Therefore, \(L_0\) L 0 regularization is approximated using smoothing functions. The incorporation of smoothing Group \(L_0\) L 0 regularization retains the sparse solution characteristics of \(L_0\) L 0 regularization and effectively resolves its NP-hard problem. Building upon the aforementioned content, a modified learning algorithm based on smoothing Group \(L_0\) L 0 regularization for interval perceptron with interval weights (MIPSG \(L_0\) L 0 ) is proposed, where the interval perceptron take real numbers as inputs, weights and outputs are represented as intervals. The radius of each interval weight is expressed through a quadratic term rather than an absolute value function, ensuring a positive radius and preventing oscillations phenomenon. The monotonicity, the strong and weak convergence of the proposed algorithm is rigorously demonstrated under moderate assumptions. Moreover, experimental results on one-class approximation and one-class classification simulations reveal that the proposed algorithm exhibits superior performance in terms of training and testing mean squared error (MSE), pruning weights and accuracy.