Skip to content

XGRVFL-MV: Residual-Coupled Graph-Embedded Multi-View Random Vector Functional Link Network with FleXi Guardian Loss

Jul 2026 · arXiv.org · Vol abs/2607.23149 · 0 citations · 45 references
Computer Science

TL;DR

A Residual-Coupled Graph-Embedded Multi-View RVFL model with fleXi guardian loss (XGRVFL-MV) for multi-view classification that achieves competitive classification performance compared with the baseline methods across the evaluated benchmark datasets.

Abstract

Random Vector Functional Link (RVFL) networks provide an efficient randomized learning framework for classification. Existing multi-view RVFL methods utilize complementary information from multiple views. However, preserving view-specific geometric structure, limiting the influence of large prediction residuals, and modeling relationships between multiple views remain challenging. This paper proposes a Residual-Coupled Graph-Embedded Multi-View RVFL model with fleXi guardian loss (XGRVFL-MV) for multi-view classification. The proposed model constructs RVFL representation for each view, incorporates graph embedding with intrinsic and penalty graphs constructed using the Local Fisher Discriminant Analysis weighting scheme. It also uses the bounded and asymmetric FleXi Guardian (XG) loss for residual learning. A residual-coupling term is introduced to encourage consistency among view-specific prediction residuals while preserving view-specific representations. The resulting optimization problem is solved using an inversion-free first-order optimization procedure based on Nesterov accelerated gradient descent. We evaluate the proposed model on UCI, KEEL, AwA, and Corel5k benchmark datasets. Experimental results, together with statistical analyses and hyperparameter sensitivity analyses, show that XGRVFL-MV achieves competitive classification performance compared with the baseline methods across the evaluated benchmark datasets.

View source

Similar papers

#machine learning Preprint Aug 2026

Enhancing Distance-Based Graph Autoencoders with Structural Penalties for Dynamic Graph Embedding

Experiments show that incorporating NC-LID-based regularization consistently improves reconstruction performance over the baseline without structural regularization and the method using hub-aware regularization, which highlights NC-LID as a useful structural signal for enhancing distance-based graph autoencoders in dyn...

Aleksandar Tomčić, Milos Savic, Milos Radovanovic · 0 citations
Open access Aug 2026

Feature-Graph-Guided Adaptive Sparse NMF with Anchor Dual Graphs Under the Logarithmic Framework for Data Clustering

This paper proposes a feature-graph-guided adaptive Log-L2,1 sparse NMF with anchor dual graphs under a logarithmic framework that jointly integrate sample structure preservation, feature structure preservation, and feature-aware sparse learning within a unified graph-NMF model.

Quanrun Li, Tao Ma, Fangchen Xu et al. · 0 citations
Open access 2026

D2GSL: Self-Supervised Dual-Layer Structure-Driven Graph Structure Learning

D2GSL constructs a semantic similarity channel and a spectral feature channel to model node relationships from both local semantic and global spectral views and introduces a hyperadjacency matrix that explicitly models inter-layer node correspondences and enables joint structural reconstruction across channels.

Jun-Chen Zhang, Xuhao Wei, Xiaolei Gu et al. · 0 citations
Conference Sep 2026

BAG-Net: Bidirectional Receptive-Field Graph Network for Two-View Correspondence Pruning

Learning reliable two-view correspondences is essential for geometric computer vision applications. Existing graph-based pruning methods typically aggregate information unidirectionally, capturing only whether a correspondence receives neighborhood support while ignoring its structural contribution during aggregation....

Le-Yi Wang, Hao Chen, Chang-Cai Yang · 0 citations
Open access Sep 2026

Unsupervised Representation Learning with Adaptive Multi-Order Structural Graph Fusion

High-dimensional unlabeled data often contain complex latent structures that are easily obscured by redundant features, noise, and unreliable neighborhood relationships. Although graph-based learning provides an effective means of preserving sample relationships, most existing methods mainly rely on first-order neighbo...

Can-Yu Zhang, Yun-Jing Zhang, Jia-Wen Sun et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.