Uncertainty-Aware Ensemble Deep Randomized Neural Networks for Classification
Summary
The paper proposes intuitionistic fuzzy deep RVFL (IF-dRVFL) and ensemble deep RVFL (IF-edRVFL) frameworks that use sample neighborhood information to improve robustness against noise and outliers in classification tasks, outperforming existing SOTA fuzzy and non-fuzzy approaches on benchmark datasets.
View Cached Full Text
Cached at: 08/12/26, 08:27 AM
# Uncertainty-Aware Ensemble Deep Randomized Neural Networks for Classification
Source: [https://arxiv.org/html/2608.10007](https://arxiv.org/html/2608.10007)
11institutetext:Indian Institute of Technology Indore, Simrol, Indore, India11email:\{phd2101241003,mscphd2207141002,phd2401141001,mtanveer\}@iiti\.ac\.in22institutetext:Qatar University, Qatar22email:p\.n\.suganthan@qu\.edu\.qa###### Abstract
The current state\-of\-the\-art \(SOTA\) deep randomized neural networks, such as deep Random Vector Functional Link \(dRVFL\) and ensemble deep RVFL \(edRVFL\), treat all training samples uniformly, which limits their robustness and effectiveness when applied to real\-world datasets containing noise and outliers\. Furthermore, the propagation of contaminated features across hidden layers negatively influences the decision\-making capability of these models\. To overcome these limitations, we propose intuitionistic fuzzy dRVFL \(IF\-dRVFL\) and intuitionistic fuzzy edRVFL \(IF\-edRVFL\) frameworks that enhance model robustness\. The proposed models unify intuitionistic fuzzy theory to exploit sample neighborhood information in the kernel space by jointly considering membership and non\-membership degrees for each sample\. Membership degrees are computed based on the distance of samples from their respective class centroids, while non\-membership degrees quantify sample heterogeneity within local neighborhoods\. These measures are employed to assign adaptive weights to training samples, enabling effective discrimination among clean, noisy, and outlier data points\. Extensive experiments conducted on UCI and KEEL benchmark datasets, with and without the presence of Gaussian noise, demonstrate the superiority of the proposed IF\-dRVFL and IF\-edRVFL models over existing SOTA fuzzy and non\-fuzzy approaches\. The source code is available at[https://github\.com/mtanveer1/IF\-edRVFL](https://github.com/mtanveer1/IF-edRVFL)\.
## 1Introduction
Artificial Neural Networks \(ANNs\) have achieved remarkable success across a wide range of machine learning tasks; however, their practical deployment is often hindered by slow convergence, sensitivity to learning rates, and susceptibility to local minima\[[10](https://arxiv.org/html/2608.10007#bib.bib10),[16](https://arxiv.org/html/2608.10007#bib.bib16)\]\. To overcome these limitations, Randomized Neural Networks \(RdNNs\), such as the Random Vector Functional Link \(RVFL\) network, have been proposed\[[12](https://arxiv.org/html/2608.10007#bib.bib12)\]\. In RVFL, the weights connecting the input layer to the hidden layer are randomly generated and fixed, while direct links from the input to the output layer act as an inherent regularization mechanism\[[21](https://arxiv.org/html/2608.10007#bib.bib21)\]\. This architecture enables efficient training through closed\-form solutions and offers competitive generalization performance\.
Despite these advantages, the standard RVFL model employs a shallow architecture with a single hidden layer, which restricts its ability to capture complex nonlinear relationships present in real\-world data and often results in unstable classification performance\. To address these shortcomings, two major extensions of RVFL have been explored: ensemble learning\[[13](https://arxiv.org/html/2608.10007#bib.bib13)\]and deep learning\[[19](https://arxiv.org/html/2608.10007#bib.bib19),[17](https://arxiv.org/html/2608.10007#bib.bib17)\]\. Ensemble RVFL models improve stability and robustness by aggregating multiple base learners, while deep RVFL \(dRVFL\) and ensemble deep RVFL \(edRVFL\) introduce multiple hidden layers to enhance representational power\. In particular, edRVFL exploits implicit ensemble learning by treating each hidden layer as an individual RVFL classifier, leading to improved generalization and stability\[[19](https://arxiv.org/html/2608.10007#bib.bib19)\]\. Recently, edRVFL\-based variants have been successfully employed across a wide range of applications, including enhancing interpretability through fuzzy inference systems\[[17](https://arxiv.org/html/2608.10007#bib.bib17)\], time\-series forecasting\[[7](https://arxiv.org/html/2608.10007#bib.bib7)\], Alzheimer’s disease diagnosis\[[18](https://arxiv.org/html/2608.10007#bib.bib18)\], and image recognition systems\[[22](https://arxiv.org/html/2608.10007#bib.bib22)\]\.
Although \(e\)dRVFL\-based models offer faster training and fewer parameters compared to conventional deep networks, they remain vulnerable to noise and outliers commonly encountered in real\-world datasets\. The presence of noisy samples can significantly degrade their learning process and predictive performance\. This limitation motivates the development of robust deep RVFL\-based models capable of effectively handling noisy and outlier\-contaminated data\.
## 2Motivation and Contributions
### 2\.1Motivation
The susceptibility of dRVFL and edRVFL models to noise and outliers arises from two fundamental issues\. First, noisy or corrupted features present in training samples propagate through successive hidden layers, resulting in a mixture of pure and impure features that contaminates higher\-level representations and adversely affects decision\-making\. Second, existing dRVFL\-based models assign uniform importance to all training samples, disregarding the inherent differences between clean, noisy, and outlier instances\. This uniform treatment leads to suboptimal generalization, particularly in challenging environments with significant noise or anomalous data points\.
Fuzzy theory has been widely employed in machine learning to alleviate the adverse effects of noise and outliers by assigning adaptive importance to data samples\[[14](https://arxiv.org/html/2608.10007#bib.bib14)\]\. In particular, intuitionistic fuzzy \(IF\) theory\[[8](https://arxiv.org/html/2608.10007#bib.bib8)\]extends conventional fuzzy sets by jointly considering membership and non\-membership degrees, offering a more expressive framework for modeling uncertainty and data heterogeneity\. By quantifying both the degree of belongingness and non\-belongingness of a sample to a class, IF theory provides a principled mechanism to distinguish reliable samples from noisy or outlier instances\. This capability makes intuitionistic fuzzy theory a natural and effective choice for enhancing the robustness of deep RVFL\-based models\[[6](https://arxiv.org/html/2608.10007#bib.bib6)\]\.
\(a\)
\(b\)
Figure 1:Framework of dRVFL and edRVFL\.
### 2\.2Contributions
The main contributions of this paper are as follows:
- •Novel robust models:We propose two novel models, namely IF\-based dRVFL \(IF\-dRVFL\) and edRVFL \(IF\-edRVFL\)\.
- •Adaptive sample weighting:In the proposed models, each sample is assigned an IF score in the kernel space, derived from its membership value \(based on the distance to the corresponding class centroid\) and non\-membership value \(capturing neighborhood heterogeneity\)\. These IF scores are used to assign adaptive weights to training samples, enabling effective discrimination among clean, noisy, and outlier data\.
- •Robust deep architecture:Unlike conventional deep models where impure features propagate through hidden layers, the proposed IF\-dRVFL framework consists of stacked robust hidden layers, each trained using IF\-weighted samples, thereby mitigating the adverse impact of noise propagation\.
- •Efficient ensemble learning:The proposed IF\-edRVFL model achieves ensemble learning implicitly by training a single robust deep RVFL network, avoiding the computational overhead of training multiple independent models while simultaneously benefiting from deep and ensemble learning principles\.
Note:The Figures in[1](https://arxiv.org/html/2608.10007#S2.F1)represent the architectures of the dRVFL and edRVFL models, and the supplementary Section S\.I briefly goes through the mathematical formulation of dRVFL and edRVFL\.
## 3Proposed Models
This section begins with defining notations and then presents the detailed mathematical formulation of the proposed IF\-\(e\)dRVFL models, followed by the description of the IF weighting scheme\. Letsus\_\{u\}denote the IF score assigned to the training samplexux\_\{u\}, and letS=diag\(s1,s2,…,sN\)S=\\mathrm\{diag\}\(s\_\{1\},s\_\{2\},\\ldots,s\_\{N\}\)represent the corresponding diagonal IF weight matrix for the training set𝒳\\mathcal\{X\}\(see Section[3\.4](https://arxiv.org/html/2608.10007#S3.SS4)\)\.
### 3\.1Notations:
Let the training dataset be𝒳=\{\(xu,yu\)\|u∈\{1,2,…,N\}\}\\mathcal\{X\}=\\\{\(x\_\{u\},y\_\{u\}\)\|u\\in\\\{1,2,\\ldots,N\\\}\\\}, whereyu∈ℝ1×cy\_\{u\}\\in\\mathbb\{R\}^\{1\\times c\}represents the target vector ofxu∈ℝ1×mx\_\{u\}\\in\\mathbb\{R\}^\{1\\times m\}, withNNnumber of total training samples\.mmis the number of attributes, and the number of classes is denoted bycc\.\(⋅\)T\(\\cdot\)^\{T\}represent the transpose operator\.X=\[x1T,x2T,…,xNT\]TX=\[x\_\{1\}^\{T\},x\_\{2\}^\{T\},\\ldots,x\_\{N\}^\{T\}\]^\{T\}andY=\[y1T,y2T,…,yNT\]TY=\[y\_\{1\}^\{T\},y\_\{2\}^\{T\},\\ldots,y\_\{N\}^\{T\}\]^\{T\}are matrices of input and output samples, respectively\.
### 3\.2Proposed IF\-dRVFL Network
In the standard dRVFL framework, all training samples are treated uniformly, irrespective of their quality or reliability\. However, real\-world datasets often contain noise and outliers, which can adversely affect the learning capability and generalization performance of dRVFL models\. To mitigate the influence of such contaminated samples, we propose the IF\-dRVFL network\. In the proposed IF\-dRVFL model, the fuzzy membership value of a sample is determined based on its proximity to the centroid of its corresponding class, reflecting the degree of belongingness\. Conversely, the non\-membership value is computed by incorporating neighborhood information, capturing the degree of non\-belongingness of the sample\. By jointly considering membership and non\-membership information, the IF\-dRVFL framework assigns adaptive weights to training samples, thereby enhancing robustness against noise and outliers\.
LetE\(1\)E^\{\(1\)\}represent the first hidden layer matrix, acquired through the projection of the input matrix using randomly initialized weights, followed by the activation functionψ\\psias:
E\(1\)=ψ\(Xω\(1\)\),\\displaystyle E^\{\(1\)\}=\\psi\(X\\omega^\{\(1\)\}\),\(1\)here,ω\(1\)∈ℝm×h\\omega^\{\(1\)\}\\in\\mathbb\{R\}^\{m\\times h\}represents the weights for the first hidden layer, initialized randomly from a uniform distribution of\[−1,1\]\[\-1,1\]andhhrepresents the number of hidden nodes\. The deeper hidden layers \(g\>1g\>1\) are defined as:
E\(g\)=ψ\(E\(g−1\)ω\(g\)\),\\displaystyle E^\{\(g\)\}=\\psi\(E^\{\(g\-1\)\}\\omega^\{\(g\)\}\),\(2\)whereω\(g\)\\omega^\{\(g\)\}represents the randomly generated weights for thegthg^\{th\}hidden layer\. The enhanced feature set is defined by concatenating all the original and hidden layer features:
E∗=\[E\(k\),E\(k−1\),…,E\(1\),X\]\.\\displaystyle E^\{\*\}=\[E^\{\(k\)\},E^\{\(k\-1\)\},\\dots,E^\{\(1\)\},X\]\.\(3\)Now, we propose the optimization problem of IF\-dRVFL as:
min𝜉𝒞2‖Sη‖2\+12‖ξ‖2\\displaystyle\\underset\{\\xi\}\{min\}\\hskip 5\.69046pt\\frac\{\\mathcal\{C\}\}\{2\}\\\|S\\eta\\\|^\{2\}\+\\frac\{1\}\{2\}\\\|\\xi\\\|^\{2\}s\.t\.E∗ξ−Y=η,\\displaystyle s\.t\.\\hskip 5\.69046ptE^\{\*\}\\xi\-Y=\\eta,\(4\)where𝒞\\mathcal\{C\}is a regularization parameter andξ\\xiis the output layer weights \(unknown\) and needs to be calculated\. The Lagrangian corresponding to the problem \([3\.2](https://arxiv.org/html/2608.10007#S3.Ex1)\) is formulated as:
L=𝒞2‖S\(E∗ξ−Y\)‖2\+12‖ξ‖2\.\\displaystyle L=\\frac\{\\mathcal\{C\}\}\{2\}\\\|S\(E^\{\*\}\\xi\-Y\)\\\|^\{2\}\+\\frac\{1\}\{2\}\\\|\\xi\\\|^\{2\}\.\(5\)Now, we differentiateLLwith respect toξ\\xiand then equate it to zero, we obtain:
∂L∂ξ=ξ\+𝒞\(SE∗\)T\(S\(E∗ξ−Y\)\)=0\.\\displaystyle\\frac\{\\partial\{L\}\}\{\\partial\{\\xi\}\}=\\xi\+\\mathcal\{C\}\(SE^\{\*\}\)^\{T\}\(S\(E^\{\*\}\\xi\-Y\)\)=0\.\(6\)Solving \([6](https://arxiv.org/html/2608.10007#S3.E6)\), we get
ξ\\displaystyle\\xi=\(\(SE∗\)T\(SE∗\)\+1𝒞I\)−1\(SE∗\)TSY\\displaystyle=\\left\(\(SE^\{\*\}\)^\{T\}\(SE^\{\*\}\)\+\\frac\{1\}\{\\mathcal\{C\}\}I\\right\)^\{\-1\}\(SE^\{\*\}\)^\{T\}SY=\(ES2∗TE∗\+1𝒞I\)−1ES2∗TY\.\\displaystyle=\\left\(E\{\{\}^\{\*\}\}^\{T\}S^\{2\}E^\{\*\}\+\\frac\{1\}\{\\mathcal\{C\}\}I\\right\)^\{\-1\}E\{\{\}^\{\*\}\}^\{T\}S^\{2\}Y\.\(7\)whereIIis the identity matrix of the appropriate dimension\. Substituting the valueξ=\(SE∗\)Tη\\xi=\(SE^\{\*\}\)^\{T\}\\eta\[[10](https://arxiv.org/html/2608.10007#bib.bib10)\], we get
\(SE∗\)η\+𝒞\(SE∗\)T\(S\(E∗\(SE∗\)Tη−Y\)\)=0\.\\displaystyle\(SE^\{\*\}\)\\eta\+\\mathcal\{C\}\(SE^\{\*\}\)^\{T\}\(S\(E^\{\*\}\(SE^\{\*\}\)^\{T\}\\eta\-Y\)\)=0\.\(8\)After simplifying \([8](https://arxiv.org/html/2608.10007#S3.E8)\), we get:
η=\(SE∗E∗TS\+1𝒞I\)−1SY=S−1\(S2E∗E∗T\+1𝒞I\)−1S2Y\.\\displaystyle\\eta=\\left\(SE^\{\*\}E^\{\*T\}S\+\\frac\{1\}\{\\mathcal\{C\}\}I\\right\)^\{\-1\}SY=S^\{\-1\}\\left\(S^\{2\}E^\{\*\}E^\{\*T\}\+\\frac\{1\}\{\\mathcal\{C\}\}I\\right\)^\{\-1\}S^\{2\}Y\.Finally,
ξ=\(SE∗\)Tη=E∗T\(S2E∗E∗T\+1𝒞I\)−1S2Y\.\\displaystyle\\xi=\(SE^\{\*\}\)^\{T\}\\eta=E^\{\*T\}\\left\(S^\{2\}E^\{\*\}E^\{\*T\}\+\\frac\{1\}\{\\mathcal\{C\}\}I\\right\)^\{\-1\}S^\{2\}Y\.\(9\)Thus, we can provide the optimal solution of \([3\.2](https://arxiv.org/html/2608.10007#S3.Ex1)\) as follows:
ξ=\{\(ES2∗TE∗\+1𝒞I\)−1ES2∗TY,\(m\+kh\)≤N,E∗T\(S2E∗E∗T\+1𝒞I\)−1S2Y,N<\(m\+kh\)\.\\xi=\\left\\\{\\begin\{array\}\[\]\{ll\}\\left\(E\{\{\}^\{\*\}\}^\{T\}S^\{2\}E^\{\*\}\+\\frac\{1\}\{\\mathcal\{C\}\}I\\right\)^\{\-1\}E\{\{\}^\{\*\}\}^\{T\}S^\{2\}Y,&\(m\+kh\)\\leq N,\\vskip 8\.53581pt\\\\ E^\{\*T\}\\left\(S^\{2\}E^\{\*\}E^\{\*T\}\+\\frac\{1\}\{\\mathcal\{C\}\}I\\right\)^\{\-1\}S^\{2\}Y,&N<\(m\+kh\)\.\\end\{array\}\\right\.\(10\)The flowchart of the proposed IF\-dRVFL is given in Fig\.[2](https://arxiv.org/html/2608.10007#S3.F2)\(a\)\.
### 3\.3Proposed IF\-edRVFL Network
In the proposed IF\-edRVFL, each layer is treated as a base model, thus unifying the ensemble learning principle and intuitionistic fuzzy scheme into deep RVFL\. This facilitates the creation of multiple diverse and robust base models \(RVFLs\) within a single deep framework\. The final outcome of IF\-edRVFL is determined through either averaging or a majority voting scheme\. Within IF\-edRVFL, every base model \(hidden layer\) receives inputs comprising the original features and the randomized features computed by the preceding layer\. Furthermore, the optimization problem of each base model possesses the IF score weights\. Thus, each base models behave as a robust base model and enriches the learning process\.
The first hidden layer matrixE\(1\)E^\{\(1\)\}is defined as in \([1](https://arxiv.org/html/2608.10007#S3.E1)\) and the deeper hidden layers’ \(g\>1g\>1\) output is defined as:
E\(g\)=ψ\(\[E\(g−1\),X\]ω\(g\)\),g=1,2,…,k\.\\displaystyle E^\{\(g\)\}=\\psi\(\[E^\{\(g\-1\)\},X\]\\omega^\{\(g\)\}\),\\penalty 10000\\ \\penalty 10000\\ g=1,2,\\ldots,k\.\(11\)whereω\(1\)\\omega^\{\(1\)\}andω\(g\)\\omega^\{\(g\)\}\(g\>1g\>1\) represent the randomly generated weights for the first andgthg^\{th\}\(g\>1g\>1\) hidden layers, respectively\. The feature set corresponding to the first base model and thegthg^\{th\}base model is defined as follows:F\(1\)=\[E\(1\),X\]F^\{\(1\)\}=\[E^\{\(1\)\},X\]andF\(g\)=\[E\(g\),E\(g−1\),X\]F^\{\(g\)\}=\[E^\{\(g\)\},E^\{\(g\-1\)\},X\], respectively\.
The proposed optimization problem corresponding to thegthg^\{th\}base model is given as follows:
minξg𝒞2‖Sηg‖2\+12‖ξg‖2\\displaystyle\\underset\{\\xi^\{g\}\}\{min\}\\hskip 5\.69046pt\\frac\{\\mathcal\{C\}\}\{2\}\\\|S\\eta^\{g\}\\\|^\{2\}\+\\frac\{1\}\{2\}\\\|\\xi^\{g\}\\\|^\{2\}s\.t\.F\(g\)ξg−Y=ηg,\\displaystyle s\.t\.\\hskip 5\.69046ptF^\{\(g\)\}\\xi^\{g\}\-Y=\\eta^\{g\},\(12\)whereξg\\xi^\{g\}is the output layer weight of thegthg^\{th\}base model\. The solution of \([3\.3](https://arxiv.org/html/2608.10007#S3.Ex4)\) follows the same procedure as solved \([3\.2](https://arxiv.org/html/2608.10007#S3.Ex1)\) of the proposed IF\-dRVFL model\. The output of all the base models is combined using majority voting to make the final decision of the proposed IF\-edRVFL model\. The flowchart of the proposed IF\-edRVFL is given in Fig\.[2](https://arxiv.org/html/2608.10007#S3.F2)\(b\)\.
\(a\)
\(b\)
Figure 2:Flowchart of the proposed models\.
### 3\.4Intuitionistic Fuzzy Scheme
The intuitionistic fuzzy approach\[[8](https://arxiv.org/html/2608.10007#bib.bib8)\]assigns IF score to each sample based on three parameters: the membership degreeν\(0≤ν≤1\)\\nu\(0\\leq\\nu\\leq 1\), the non\-membership degreeμ\(0≤μ≤1\)\\mu\(0\\leq\\mu\\leq 1\), and the degree of hesitationπ=1−ν−μ\\pi=1\-\\nu\-\\mu\. These parameters are then combined using a score function to assign an IF score value to each sample, aiding in the assessment of noise and outlier presence within the dataset\.
\(i\) Membership function:The membership function is a way to quantify how much a specific sample belongs to its corresponding class\. It assigns a numerical value or degree of belongingness that indicates the sample’s level of similarity or fit with the characteristics of that class\. This is calculated as the distance between the training sample and the class centroid in the high\-dimensional feature space\. This is helpful in identifying outliers or instances that do not conform to the typical traits of a specific class\. Mathematically, we define the degree of membership for each training sample as follows:
μ\(xu\)=\{1−‖ϕ\(xu\)−C\+‖r\+\+γ,yu=\+1\(positive class\),1−‖ϕ\(xu\)−C−‖r−\+γ,yu=−1\(negative class\),\\mu\(x\_\{u\}\)=\\begin\{cases\}1\-\\frac\{\\\|\\phi\(x\_\{u\}\)\-C^\{\+\}\\\|\}\{r^\{\+\}\+\\hskip 5\.69046pt\\gamma\},&y\_\{u\}=\+1\\penalty 10000\\ \(\\text\{positive class\}\),\\\\ 1\-\\frac\{\\\|\\phi\(x\_\{u\}\)\-C^\{\-\}\\\|\}\{r^\{\-\}\+\\hskip 5\.69046pt\\gamma\},&y\_\{u\}=\-1\\penalty 10000\\ \(\\text\{negative class\}\),\\end\{cases\}\(13\)whereϕ\\phirepresents the projection mapping function,γ\\gammais a non\-negative parameter, andr\+\(r−\)r^\{\+\}\(r^\{\-\}\)denotes the radius of\+1\+1\(−1\)\(\-1\)class given by:
r\+=maxyu=\+1‖ϕ\(xu\)−C\+‖,andr−=maxyu=−1‖ϕ\(xu\)−C−‖,\\displaystyle r^\{\+\}=\\underset\{y\_\{u\}=\+1\}\{\\max\}\\\|\\ \\phi\(x\_\{u\}\)\-C^\{\+\}\\\|,\\hskip 5\.69046pt\\text\{and\}\\hskip 5\.69046ptr^\{\-\}=\\underset\{y\_\{u\}=\-1\}\{\\max\}\\\|\\ \\phi\(x\_\{u\}\)\-C^\{\-\}\\\|,\(14\)whereC\+\(C−\)C^\{\+\}\(C^\{\-\}\)denote the centers of the\+1\(−1\)\+1\(\-1\)classes, respectively and are defined as:
C\+=1m1∑yu=\+1ϕ\(xu\),andC−=1m2∑yu=−1ϕ\(xu\),\\displaystyle C^\{\+\}=\\frac\{1\}\{m\_\{1\}\}\\sum\_\{y\_\{u\}=\+1\}\\phi\(x\_\{u\}\),\\hskip 5\.69046pt\\text\{and\}\\hskip 5\.69046ptC^\{\-\}=\\frac\{1\}\{m\_\{2\}\}\\sum\_\{y\_\{u\}=\-1\}\\phi\(x\_\{u\}\),\(15\)herem1\(m2\)m\_\{1\}\(m\_\{2\}\)represent the number of samples in the\+1\(−1\)\+1\(\-1\)class, respectively\. \(ii\) Non\-membership function:The non\-membership function provides a measure of dissimilarity or mismatch between the sample and the characteristics of the class it is a part of\. The non\-membership function for each training sample quantifies the ratio of dissimilar samples to the total number of samples in its neighborhood\. The non\-membership value aids in identifying noisy samples\. The non\-membership function is defined as follows:
ν\(xu\)=\(1−μ\(xu\)\)α\(xu\),\\nu\(x\_\{u\}\)=\(1\-\\mu\(x\_\{u\}\)\)\\alpha\(x\_\{u\}\),\(16\)where the valueα\(xu\)\\alpha\(x\_\{u\}\)is calculated as:
α\(xu\)=\|\{xj\|‖ϕ\(xu\)−ϕ\(xj\)‖≤β,yj≠yu\}\|\|\{xj\|‖ϕ\(xu\)−ϕ\(xj\)‖≤β\}\|\.\\alpha\(x\_\{u\}\)=\\frac\{\|\\\{x\_\{j\}\|\\\|\\phi\(x\_\{u\}\)\-\\phi\(x\_\{j\}\)\\\|\\leq\\beta,\\,y\_\{j\}\\neq y\_\{u\}\\\}\|\}\{\|\\\{x\_\{j\}\|\\\|\\phi\(x\_\{u\}\)\-\\phi\(x\_\{j\}\)\\\|\\leq\\beta\\\}\|\}\.\(17\)Here,β\\betais a non\-negative parameter that can be adjusted\. \(iii\) The score mapping:Now, we define the IF score mapping by combining each sample’s membership and non\-membership values\. This resulting IF score acts as a unified measure to determine if a sample is pure, noisy, or an outlier\. The IF score values for thexux\_\{u\}is assigned as follows:
su=\{μ\(xu\),ν\(xu\)=0,0,μ\(xu\)≤ν\(xu\),1−ν\(xu\)2−μ\(xu\)−ν\(xu\),others\.s\_\{u\}=\\left\\\{\\begin\{array\}\[\]\{lr\}\\mu\(x\_\{u\}\),&\\nu\(x\_\{u\}\)=0,\\\\ 0,&\\mu\(x\_\{u\}\)\\leq\\nu\(x\_\{u\}\),\\\\ \\frac\{1\-\\nu\(x\_\{u\}\)\}\{2\-\\mu\(x\_\{u\}\)\-\\nu\(x\_\{u\}\)\},&\\text\{others\}\.\\end\{array\}\\right\.\(18\)Finally, the score matrixSSfor the dataset𝒳\\mathcal\{X\}is defined as:S=diag\{su\|u=1,2,…,N\}S=diag\\\{s\_\{u\}\\hskip 2\.84544pt\|\\hskip 2\.84544ptu=1,2,\\ldots,N\\\}\. The kernel technique is explored in supplementary Section S\.II\.
Table 1:Average accuracy and standard deviation with SOTA non\-fuzzy RdNNs on 13 KEEL datasets\.Metric↓\\downarrow∣\\midModel→\\rightarrowRVFL\[[12](https://arxiv.org/html/2608.10007#bib.bib12)\]RVFLwoDL\[[9](https://arxiv.org/html/2608.10007#bib.bib9)\]BLS\[[1](https://arxiv.org/html/2608.10007#bib.bib1)\]H\-ELM\[[20](https://arxiv.org/html/2608.10007#bib.bib20)\]dRVFL\[[19](https://arxiv.org/html/2608.10007#bib.bib19)\]edRVFL\[[19](https://arxiv.org/html/2608.10007#bib.bib19)\]edEGEFRVFL\[[11](https://arxiv.org/html/2608.10007#bib.bib11)\]IF\-dRVFL \(ours\)IF\-edRVFL \(ours\)Average Accuracy81\.8781\.5182\.5581\.6583\.2983\.0483\.0784\.3284\.39Average Standard Deviation5\.15\.134\.465\.074\.995\.195\.146\.225\.64
## 4Experimental Results
To assess the effectiveness of the proposed IF\-dRVFL and IF\-edRVFL models, we perform a comparative analysis with baseline models using benchmark datasets from the UCI\[[4](https://arxiv.org/html/2608.10007#bib.bib4)\]and KEEL\[[3](https://arxiv.org/html/2608.10007#bib.bib3)\]repository\.
### 4\.1Hyperparameter Selection and Experimental Setup
In the proposed IF\-dRVFL and IF\-edRVFL models, intuitionistic fuzzy weights are generated by transforming the samples into a higher\-dimensional space through the use of a kernel function\. We used the Gaussian kernel and is given byK\(xi,xj\)=e−12σ2‖xi−xj‖2\.K\(x\_\{i\},x\_\{j\}\)=e^\{\\frac\{\-1\}\{2\\sigma^\{2\}\}\\\|x\_\{i\}\-x\_\{j\}\\\|^\{2\}\}\.Gaussian kernel parameterσ\\sigmais selected from the range\{2−5,2−4…,25\}\\\{2^\{\-5\},2^\{\-4\}\\ldots,2^\{5\}\\\}\. The regularization parameters for each model are selected from the set𝒞=\{10−5,10−4,…,10−5\}\\mathcal\{C\}=\\\{10^\{\-5\},10^\{\-4\},\\ldots,10^\{\-5\}\\\}\. Following the methodology outlined in\[[20](https://arxiv.org/html/2608.10007#bib.bib20)\], the selection of the number of hidden layer nodes “hh” in the RVFLwoDL, RVFL, and H\-ELM follows the rangeh=100:100:2000h=100:100:2000\. Following\[[11](https://arxiv.org/html/2608.10007#bib.bib11)\], the graph regularization parameter for the edEGERVFL model is set equal to𝒞\\mathcal\{C\}\. Following\[[19](https://arxiv.org/html/2608.10007#bib.bib19)\], a two\-stage tuning approach was employed for the dRVFL, edRVFL, edEGERVFL, edRVFL\-FIS\-C, IF\-dRVFL, and IF\-edRVFL models\. In the first stage, the parameters are fine\-tuned to obtain the optimal hidden nodesh∗h^\{\*\}within the range of\[256,512,1024\]\[256,512,1024\], and the regularization parameter𝒞∗\\mathcal\{C\}^\{\*\}is determined while keeping the number of hidden layers fixed at two\. For IF\-dRVFL and IF\-edRVFL,σ=1\\sigma=1is fixed, andσ\\sigmais fine\-tuned in the second stage\. During the second stage, hidden layers within the range of1:1:101:1:10are tuned, along with other parameters, in the vicinity ofg∗g^\{\*\}and𝒞∗\\mathcal\{C\}^\{\*\}\. Furthermore, for the proposed edRVFL\-FIS models, the best number of fuzzy nodesK∗K^\{\*\}in the first stage is tuned within the range of5:10:455:10:45, and in the subsequent stage, they are fine\-tuned in the vicinity ofK∗K^\{\*\}, specifically within the range ofK∗−4:1:K∗\+5K^\{\*\}\-4:1:K^\{\*\}\+5\. Feature groups for BLS and F\-BLS are selected from the rangeN2=1:2:21N\_\{2\}=1:2:21, while the selection of feature nodes within each feature group is made from the rangeN1=5:5:50N\_\{1\}=5:5:50\. The NF\-BLS model selects the number of fuzzy groups from the rangeNfg=1:2:21N\_\{fg\}=1:2:21and the number of fuzzy nodes in each fuzzy group from the rangeNfn=5:5:50N\_\{fn\}=5:5:50\. The number of enhancement nodes for BLS, F\-BLS and F\-BLS is chosen from the rangeN3=5:5:50N\_\{3\}=5:5:50\. Setup:The experimental setup is discussed in the Supplementary Section S\.III\.
### 4\.2Models in Comparison
The performance of the proposed IF\-dRVFL and IF\-edRVFL models is compared against 11 baselines with two kinds of models: Firstly, 7 SOTA non\-fuzzy RdNNs, including RVFL\[[12](https://arxiv.org/html/2608.10007#bib.bib12)\], RVFL without direct link \(RVFLwoDL\) \-also known as extreme learning machine \(ELM\)\[[9](https://arxiv.org/html/2608.10007#bib.bib9)\], broad learning system \(BLS\)\[[1](https://arxiv.org/html/2608.10007#bib.bib1)\], hierarchical ELM \(H\-ELM\)\[[20](https://arxiv.org/html/2608.10007#bib.bib20)\], dRVFL\[[19](https://arxiv.org/html/2608.10007#bib.bib19)\], edRVFL\[[19](https://arxiv.org/html/2608.10007#bib.bib19)\], ensemble deep extended graph embedded RVFL \(edEGERVFL\)\[[11](https://arxiv.org/html/2608.10007#bib.bib11)\]\. Secondly, 4 SOTA fuzzy\-based baselines such as neuro\-fuzzy BLS \(NF\-BLS\)\[[5](https://arxiv.org/html/2608.10007#bib.bib5)\], Fuzzy BLS\[[15](https://arxiv.org/html/2608.10007#bib.bib15)\], IF twin support vector machine \(IF\-TSVM\)\[[14](https://arxiv.org/html/2608.10007#bib.bib14)\]and edRVFL based on fuzzy inference system \(edRVFL\-FIS\-C\)\[[17](https://arxiv.org/html/2608.10007#bib.bib17)\]\.
### 4\.3Experimental Results and Statistical Analysis on Real\-World Datasets Against SOTA Non\-Fuzzy RdNNs
In this subsection, we evaluate the proposed IF\-dRVFL and IF\-edRVFL models against state\-of\-the\-art \(SOTA\) non\-fuzzy randomized deep neural network \(RdNN\) baselines on1313KEEL benchmark datasets spanning diverse domains and sample sizes\.
Accuracy \(ACC\):The average classification accuracy \(ACC\), standard deviation \(Std\.\), and corresponding ranks are summarized in Table[1](https://arxiv.org/html/2608.10007#S3.T1), while the detailed dataset\-wise results are reported in Supplementary Tables S\.1–S\.3\. It is evident that the proposed IF\-edRVFL and IF\-dRVFL models achieve the highest and second\-highest average ACC values of84\.39%84\.39\\%and84\.32%84\.32\\%, respectively\. In comparison, the baseline RVFL, RVFLwoDL, BLS, H\-ELM, dRVFL, edRVFL, NF\-BLS, and edEGEFRVFL models attain average ACC values of81\.87%81\.87\\%,80\.51%80\.51\\%,82\.55%82\.55\\%,81\.65%81\.65\\%,8329%8329\\%,83\.04%83\.04\\%, and81\.07%81\.07\\%, respectively\. These results clearly demonstrate the superior and more robust performance of the proposed intuitionistic fuzzy models across most datasets\.
Statistical rank:Sometimes, the average accuracy metric of a model can be influenced by outstanding performance in a single dataset, which could compensate for weaker results across various datasets, potentially resulting in a biased measure\. Therefore, we employ a ranking method to assess the effectiveness of the compared models\. In this approach, each classifier is assigned a rank, with the model demonstrating superior performance receiving a lower rank and the model exhibiting inferior performance receiving a higher rank\. To evaluateqqmodels acrossPPdatasets, letrjir\_\{j\}^\{i\}represent the rank of thejthj^\{th\}model on theithi^\{th\}dataset\.ℛj=1P∑i=1Prji\\mathscr\{R\}\_\{j\}=\\frac\{1\}\{P\}\\sum\_\{i=1\}^\{P\}r\_\{j\}^\{i\}is the average rank of thejthj^\{th\}model\. Supplementary Table S\.3, we note that the average rank of proposed IF\-dRVFL and IF\-edRVFL models along with the RVFL, RVFLwoDL, BLS, H\-ELM, dRVFL, edRVFL, and edEGEFRVFL models is3\.123\.12,3\.233\.23,5\.815\.81,6\.886\.88,3\.963\.96,6\.626\.62,4\.814\.81,5\.355\.35, and5\.235\.23, respectively\. The proposed IF\-dRVFL and IF\-edRVFL achieve the lowest and second lowest average rank \(best performance\) among all compared models, showcasing superior generalization ability\. Friedman test:Now, we perform the Friedman test\[[2](https://arxiv.org/html/2608.10007#bib.bib2)\]to determine if there are statistically significant differences among the models\. Under the null hypothesis, it is assumed that all models have equal average ranks, indicating equivalent levels of performance\. The Friedman statistic follows the chi\-squared distribution\(χF2\)\(\\chi\_\{F\}^\{2\}\)with\(q−1\)\(q\-1\)degrees of freedom \(d\.o\.f\), and its computation involves:χF2=12Pq\(q\+1\)\[∑jℛj2−q\(q\+1\)24\]\\chi\_\{F\}^\{2\}=\\frac\{12P\}\{q\(q\+1\)\}\\left\[\\sum\_\{j\}\\mathscr\{R\}\_\{j\}^\{2\}\-\\frac\{q\(q\+1\)^\{2\}\}\{4\}\\right\]\. TheFFF\_\{F\}statistic is computed as:FF=\(P−1\)χF2P\(q−1\)−χF2F\_\{F\}=\\frac\{\(P\-1\)\\chi\_\{F\}^\{2\}\}\{P\(q\-1\)\-\\chi\_\{F\}^\{2\}\}, where theFF\-distribution possesses degrees of freedom\(q−1\)\(q\-1\)and\(P−1\)×\(q−1\)\(P\-1\)\\times\(q\-1\)\. In our case, we haveq=9q=9andP=13P=13, thus the obtained values areχF2=25\.78\\chi\_\{F\}^\{2\}=25\.78andFF=3\.96F\_\{F\}=3\.96\. The critical valueFF\(8,96\)=2\.04F\_\{F\}\(8,96\)=2\.04at a5%5\\%level of significance\. The null hypothesis is rejected as3\.96\>2\.043\.96\>2\.04\. Thus, there exists a statistically significant difference among the models being compared\. Nemenyi post hoc test:Next, we utilize the Nemenyi post hoc test to examine the pairwise differences between the models\. The critical difference\(C\.D\.\)\(C\.D\.\)value is calculated asC\.D\.=qαq\(q\+1\)6PC\.D\.=q\_\{\\alpha\}\\sqrt\{\\frac\{q\(q\+1\)\}\{6P\}\}\. Forqα=3\.10q\_\{\\alpha\}=3\.10for99models at a significance level of5%5\\%, we getC\.D\.=3\.33C\.D\.=3\.33\. The average rank differences between the proposed IF\-dRVFL and IF\-edRVFL models and the baselines RVFLwoDL and H\-ELM confirm their statistical superiority\. Furthermore, given the lowest average ranks achieved by the IF\-dRVFL and IF\-edRVFL models, we assert that these proposed models surpass the baseline models in overall performance\.
### 4\.4Experimental Results and Statistical Analysis on Real\-World Datasets Against SOTA Fuzzy Baselines
The results in Table[2](https://arxiv.org/html/2608.10007#S4.T2)clearly demonstrate the superior performance of the proposed IF\-dRVFL and IF\-edRVFL models over SOTA fuzzy baselines on 12 UCI datasets\. IF\-edRVFL achieves the highest average accuracy of83\.18%83\.18\\%, followed by IF\-dRVFL with82\.48%82\.48\\%, consistently outperforming NF\-BLS, F\-BLS, IF\-TSVM, and edRVFL\-FIS\-C\. This improvement highlights the effectiveness of incorporating intuitionistic fuzzy modeling within deep randomized neural networks for handling uncertainty and data ambiguity\.
From the statistical analysis \(refer Supplementary Section S\.IV\), IF\-edRVFL and IF\-dRVFL obtain the lowest average ranks of2\.462\.46and2\.752\.75, respectively, indicating superior generalization and stability across datasets\. The Friedman test \(χF2=18\.14\\chi\_\{F\}^\{2\}=18\.14,FF=4\.77F\_\{F\}=4\.77\) rejects the null hypothesis at the5%5\\%significance level, confirming statistically significant differences among the models\. Furthermore, the Nemenyi post hoc test \(C\.D\.=2\.17C\.D\.=2\.17\) verifies that the proposed models significantly outperform IF\-TSVM\. Overall, the proposed intuitionistic fuzzy deep RVFL frameworks deliver higher accuracy, improved robustness, and statistically superior performance compared to existing fuzzy baselines\.
### 4\.5Robustness Evaluation of Proposed Models on Datasets with Gaussian Noise
Table 2:Average accuracy, standard deviation and rank comparison with SOTA fuzzy baselines on 12 UCI datasets\.Metric↓\\downarrow∣\\midModel→\\rightarrowNF\-BLS\[[5](https://arxiv.org/html/2608.10007#bib.bib5)\]F\-BLS\[[15](https://arxiv.org/html/2608.10007#bib.bib15)\]IF\-TSVM\[[14](https://arxiv.org/html/2608.10007#bib.bib14)\]edRVFL\-FIS\-C\[[17](https://arxiv.org/html/2608.10007#bib.bib17)\]IF\-dRVFLIF\-edRVFLAverage Accuracy78\.588273\.1980\.1982\.4883\.18Average Standard Dev\.12\.618\.9825\.4712\.1611\.7612\.09Average Rank3\.423\.425\.463\.462\.752\.46
Figure 3:Robustness: Effect of different noise levels on the performance of dRVFL, edRVFL, IF\-dRVFL \(proposed\) and IF\-edRVFL \(proposed\) models\.To further assess the robustness of the proposed IF\-dRVFL and IF\-edRVFL models, we compare them against the baseline dRVFL and edRVFL under different levels of Gaussian noise\. For a balanced evaluation, four representative datasets are considered: Haberman and CMC, where the proposed models are initially outperformed by the baseline methods; Crossplane130, where the proposed models achieve superior performance; and Glass5, where the best baseline and proposed models exhibit comparable accuracies \(see Supplementary Table S\.1\)\. Gaussian noise levels of 5%, 10%, 15%, and 20% are introduced, and the results are presented in Fig\.[3](https://arxiv.org/html/2608.10007#S4.F3)\.
For the Haberman and CMC datasets, the baseline models continue to achieve slightly higher accuracies than the proposed methods across all noise levels\. However, a closer examination reveals that IF\-dRVFL and IF\-edRVFL experience considerably smaller performance degradation as the noise level increases\. In contrast, dRVFL and edRVFL exhibit a much sharper decline in accuracy, particularly beyond 10% noise\. This indicates that the intuitionistic fuzzy framework provides greater resilience to data corruption and preserves predictive performance more effectively under noisy conditions\.
A similar robustness advantage is observed on the Crossplane130 dataset, where the proposed models already outperform the baselines in the noise\-free setting\. As the noise level increases, IF\-dRVFL and IF\-edRVFL maintain substantially higher accuracies, causing the performance gap over the baseline methods to widen further\. For the Glass5 dataset, where the best baseline and proposed models achieve comparable performance at 0% noise, the intuitionistic fuzzy variants exhibit a noticeably slower degradation rate and consistently retain higher accuracies under increasing noise levels\.
Overall, the results demonstrate that incorporating intuitionistic fuzzy modeling into deep RVFL architectures significantly improves robustness to noise\. Whether the proposed models initially outperform, match, or underperform the baseline methods, they consistently exhibit greater stability and a slower loss of predictive performance as the noise level increases\.
### 4\.6Sensitivity Analyses
We conduct the sensitivity analyses to delve deeper into the behaviour of the models: \(i\) by investigating the impact of intuitionistic fuzzy Gaussian kernel parameterσ\\sigma, \(ii\) and by exploring the impact of the number of hidden layersLL\.
\(a\)
\(b\)
\(c\)
\(d\)
Figure 4:Effect of parameterσ\\sigmaon the performance of the proposed IF\-dRVFL and IF\-edRVFL models\.\(a\)
\(b\)
\(c\)
\(d\)
Figure 5:Effect of parameterLLon the proposed IF\-\(e\)dRVFL models\.\(1\) Influence of intuitionistic fuzzy Gaussian kernel parameterσ\\sigma:The impact ofσ\\sigmaon the performance of the proposed models is shown in Fig\.[4](https://arxiv.org/html/2608.10007#S4.F4)\. Specifically, Fig\.[4](https://arxiv.org/html/2608.10007#S4.F4)\(a\) and \(b\) pertain to the IF\-dRVFL models on the haberman and titanic datasets, respectively, while Fig\.[4](https://arxiv.org/html/2608.10007#S4.F4)\(c\) and \(d\) focus on the IF\-edRVFL models on the same datasets\. We note that the performance of all proposed models improves asσ\\sigmaincreases from2−52^\{\-5\}\. Optimal performance is often achieved whenσ\\sigmais set to20=12^\{0\}=1or21=22^\{1\}=2\. Subsequently, asσ\\sigmafurther increases, performance begins to diminish\. Therefore, we recommend usingσ=1\\sigma=1or22for optimal results, although fine\-tuning may be necessary depending on the dataset’s characteristics\.
\(2\) Influence of the number of hidden layersLL:The impact of the hyperparameterLLis shown in Fig\.[5](https://arxiv.org/html/2608.10007#S4.F5)\. Our analysis reveals the following: \(a\) For the proposed IF\-dRVFL model, performance consistently improves with an increase in the number of hidden layers until reaching a plateau\. Optimal performance is typically achieved with higher values ofLL, such as88or larger\. \(b\) In the case of the proposed IF\-edRVFL model, we observe that performance peaks atL=3L=3and then gradually declines asLLincreases further\. Therefore, to achieve the best performance from the IF\-edRVFL model, we recommend usingL=3L=3\. However, we recommend fine\-tuning the hyperparameters to achieve the best performance for the proposed models for specific tasks\.
## 5Conclusion
In this paper, we proposed the IF\-dRVFL and IF\-edRVFL models to address the sensitivity issues observed in the baseline dRVFL and edRVFL models\. By integrating fuzzy concepts into the deep and ensemble frameworks of these models, we enhance their robustness against noise and outliers present in the dataset\. Our experimentation involved testing the proposed IF\-dRVFL and IF\-edRVFL models on benchmark datasets from UCI and KEEL repository, comparing them against1111state\-of\-the\-art models within the SOTA RdNNs and fuzzy domains\. We evaluated the robustness of our models under different conditions, including scenarios with and without contaminated Gaussian noise in the dataset’s features\. Our experimental results and statistical analyses highlight the superior performance of the proposed IF\-dRVFL and IF\-edRVFL models, ranking them as the top\-performing and second\-best models, respectively\.
\{credits\}
#### 5\.0\.1Acknowledgements
M\. Sajid acknowledges the Council of Scientific and Industrial Research \(CSIR\), New Delhi, for providing fellowship under grants 09/1022\(13847\)/2022\-EMR\-I\.
#### 5\.0\.2\\discintname
The authors have no competing interests to declare that are relevant to the content of this article\.
## References
- \[1\]Chen, C\.P\., Liu, Z\.: Broad learning system: An effective and efficient incremental learning system without the need for deep architecture\. IEEE Transactions on Neural Networks and Learning Systems29\(1\), 10–24 \(2017\)
- \[2\]Demšar, J\.: Statistical comparisons of classifiers over multiple data sets\. The Journal of Machine Learning Research7, 1–30 \(2006\)
- \[3\]Derrac, J\., Garcia, S\., Sanchez, L\., Herrera, F\.: KEEL data\-mining software tool: Data set repository, integration of algorithms and experimental analysis framework\. J\. Mult\. Valued Logic Soft Comput17\(2015\)
- \[4\]Dua, D\., Graff, C\.: UCI machine learning repository \(2017\),[http://archive\.ics\.uci\.edu/ml](http://archive.ics.uci.edu/ml)
- \[5\]Feng, S\., Chen, C\.P\.: Fuzzy broad learning system: A novel neuro\-fuzzy model for regression and classification\. IEEE Transactions on Cybernetics50\(2\), 414–424 \(2018\)
- \[6\]Ganaie, M\.A\., Sajid, M\., Malik, A\.K\., Tanveer, M\.: Graph embedded intuitionistic fuzzy random vector functional link neural network for class imbalance learning\. IEEE Transactions on Neural Networks and Learning Systems35\(9\), 11671–11680 \(2024\)
- \[7\]Gao, R\., Hu, M\., Li, R\., Luo, X\., Suganthan, P\.N\., Tanveer, M\.: Stacked ensemble deep random vector functional link network with residual learning for medium\-scale time\-series forecasting\. IEEE Transactions on Neural Networks and Learning Systems36\(6\), 10833–10843 \(2025\)
- \[8\]Ha, M\., Wang, C\., Chen, J\.: The support vector machine based on intuitionistic fuzzy number and kernel function\. Soft Computing17, 635–641 \(2013\)
- \[9\]Huang, G\.B\., Zhu, Q\.Y\., Siew, C\.K\.: Extreme learning machine: theory and applications\. Neurocomputing70\(1\-3\), 489–501 \(2006\)
- \[10\]Malik, A\.K\., Gao, R\., Ganaie, M\.A\., Tanveer, M\., Suganthan, P\.N\.: Random vector functional link network: Recent developments, applications, and future directions\. Applied Soft Computing143, 110377 \(2023\)
- \[11\]Malik, A\.K\., Tanveer, M\.: Graph embedded ensemble deep randomized network for diagnosis of alzheimer’s disease\. IEEE/ACM Transactions on Computational Biology and Bioinformatics21\(4\), 546–558 \(2024\)
- \[12\]Pao, Y\.H\., Park, G\.H\., Sobajic, D\.J\.: Learning and generalization characteristics of the random vector functional\-link net\. Neurocomputing6\(2\), 163–180 \(1994\)
- \[13\]Qiu, X\., Suganthan, P\.N\., Amaratunga, G\.A\.: Ensemble incremental learning random vector functional link network for short\-term electric load forecasting\. Knowledge\-Based Systems145, 182–196 \(2018\)
- \[14\]Rezvani, S\., Wang, X\., Pourpanah, F\.: Intuitionistic fuzzy twin support vector machines\. IEEE Transactions on Fuzzy Systems27\(11\), 2140–2151 \(2019\)
- \[15\]Sajid, M\., Malik, A\.K\., Tanveer, M\.: Intuitionistic fuzzy broad learning system: Enhancing robustness against noise and outliers\. IEEE Transactions on Fuzzy Systems32\(8\), 4460–4469 \(2024\)
- \[16\]Sajid, M\., Malik, A\.K\., Tanveer, M\., Suganthan, P\.N\.: Neuro\-fuzzy random vector functional link neural network for classification and regression problems\. IEEE Transactions on Fuzzy Systems32\(5\), 2738–2749 \(2024\)
- \[17\]Sajid, M\., Tanveer, M\., Suganthan, P\.N\.: Ensemble deep random vector functional link neural network based on fuzzy inference system\. IEEE Transactions on Fuzzy Systems33\(1\), 479–490 \(2025\)
- \[18\]Sharma, R\., Goel, T\., Tanveer, M\., Al\-Dhaifallah, M\.: Alzheimer’s disease diagnosis using ensemble of random weighted features and fuzzy least square twin support vector machine\. IEEE Transactions on Emerging Topics in Computational Intelligence9\(2\), 1281–1291 \(2025\)
- \[19\]Shi, Q\., Katuwal, R\., Suganthan, P\.N\., Tanveer, M\.: Random vector functional link neural network based ensemble deep learning\. Pattern Recognition117, 107978 \(2021\)
- \[20\]Tang, J\., Deng, C\., Huang, G\.B\.: Extreme learning machine for multilayer perceptron\. IEEE Transactions on Neural Networks and Learning Systems27\(4\), 809–821 \(2015\)
- \[21\]Zhang, L\., Suganthan, P\.N\.: A comprehensive evaluation of random vector functional link networks\. Information Sciences367, 1094–1105 \(2016\)
- \[22\]Zhao, P\., Wang, S\., Hao, X\., Wang, Z\., Zou, J\., Ren, J\., Dai, Y\.: An ensemble multi\-dimensional randomization network for intelligent recognition of tobacco baking stage\. Scientific Reports15\(1\), 1346 \(2025\)Similar Articles
Intuitionistic Fuzzy Graph Embedded Random Vector Functional Link with Multiview Learning
This paper proposes the Intuitionistic Fuzzy Graph Embedded Random Vector Functional Link with Multiview Learning (IFGRVFL-MV) model, which integrates intuitionistic fuzzy sets, graph embedding, and multiview learning to improve classification accuracy and robustness to outliers. Experiments on benchmark datasets show that IFGRVFL-MV outperforms existing models.
Lost in the Folds: When Cross-Validation Is Not a Deep Ensemble for Uncertainty Estimation
This paper compares cross-validation ensembles to deep ensembles for uncertainty estimation in medical image segmentation. Deep ensembles outperform cross-validation ensembles in calibration and failure detection, while cross-validation ensembles better approximate inter-rater variability.
Efficient Bayesian Deep Ensembles via Analytic Predictive Inference
Introduces an efficient Bayesian deep ensemble method for predictive regression that combines low-dimensional ensemble representation, closed-form Bayesian aggregation, and independent ensemble training to achieve calibrated uncertainty estimates with computational efficiency.
UASPL: Uncertainty-Aware Self-Paced Learning with Evidential Neural Networks
The paper proposes UASPL, a method that integrates predictive reliability into sample selection for self-paced learning using evidential neural networks, improving classification performance and interpretability.
Error Aware Distribution Prediction for Lightweight Implicit Neural Representations
The paper proposes a lightweight method that reformulates regression-based INR training as a classification task by discretizing continuous targets into bins, enabling flexible distribution modeling for error-aware uncertainty estimation in scientific data compression.