Table of Contents
Fetching ...

Randomized based restricted kernel machine for hyperspectral image classification

A. Quadir, M. Tanveer

TL;DR

This work introduces a novel randomized based restricted kernel machine ($R^2KM$) that blends the efficiency of RVFL networks with the nonlinear expressiveness of restricted kernel machines, facilitated by a layered, RBM-like energy formulation and Fenchel–Young conjugate duality. The model derives a closed-form-like update for hidden representations and a dual-bound objective, enabling scalable classification and regression in high-dimensional spaces. Generalization is theoretically grounded via empirical Rademacher complexity, and extensive experiments on hyperspectral imagery and UCI/KEEL benchmarks demonstrate consistent improvements over strong baselines, with statistical tests confirming significance. The approach offers a robust, scalable framework for complex data—especially HSIs—by effectively capturing spectral-spatial interactions while maintaining computational efficiency.

Abstract

In recent years, the random vector functional link (RVFL) network has gained significant popularity in hyperspectral image (HSI) classification due to its simplicity, speed, and strong generalization performance. However, despite these advantages, RVFL models face several limitations, particularly in handling non-linear relationships and complex data structures. The random initialization of input-to-hidden weights can lead to instability, and the model struggles with determining the optimal number of hidden nodes, affecting its performance on more challenging datasets. To address these issues, we propose a novel randomized based restricted kernel machine ($R^2KM$) model that combines the strehyperngths of RVFL and restricted kernel machines (RKM). $R^2KM$ introduces a layered structure that represents kernel methods using both visible and hidden variables, analogous to the energy function in restricted Boltzmann machines (RBM). This structure enables $R^2KM$ to capture complex data interactions and non-linear relationships more effectively, improving both interpretability and model robustness. A key contribution of $R^2KM$ is the introduction of a novel conjugate feature duality based on the Fenchel-Young inequality, which expresses the problem in terms of conjugate dual variables and provides an upper bound on the objective function. This duality enhances the model's flexibility and scalability, offering a more efficient and flexible solution for complex data analysis tasks. Extensive experiments on hyperspectral image datasets and real-world data from the UCI and KEEL repositories show that $R^2KM$ outperforms baseline models, demonstrating its effectiveness in classification and regression tasks.

Randomized based restricted kernel machine for hyperspectral image classification

TL;DR

This work introduces a novel randomized based restricted kernel machine () that blends the efficiency of RVFL networks with the nonlinear expressiveness of restricted kernel machines, facilitated by a layered, RBM-like energy formulation and Fenchel–Young conjugate duality. The model derives a closed-form-like update for hidden representations and a dual-bound objective, enabling scalable classification and regression in high-dimensional spaces. Generalization is theoretically grounded via empirical Rademacher complexity, and extensive experiments on hyperspectral imagery and UCI/KEEL benchmarks demonstrate consistent improvements over strong baselines, with statistical tests confirming significance. The approach offers a robust, scalable framework for complex data—especially HSIs—by effectively capturing spectral-spatial interactions while maintaining computational efficiency.

Abstract

In recent years, the random vector functional link (RVFL) network has gained significant popularity in hyperspectral image (HSI) classification due to its simplicity, speed, and strong generalization performance. However, despite these advantages, RVFL models face several limitations, particularly in handling non-linear relationships and complex data structures. The random initialization of input-to-hidden weights can lead to instability, and the model struggles with determining the optimal number of hidden nodes, affecting its performance on more challenging datasets. To address these issues, we propose a novel randomized based restricted kernel machine () model that combines the strehyperngths of RVFL and restricted kernel machines (RKM). introduces a layered structure that represents kernel methods using both visible and hidden variables, analogous to the energy function in restricted Boltzmann machines (RBM). This structure enables to capture complex data interactions and non-linear relationships more effectively, improving both interpretability and model robustness. A key contribution of is the introduction of a novel conjugate feature duality based on the Fenchel-Young inequality, which expresses the problem in terms of conjugate dual variables and provides an upper bound on the objective function. This duality enhances the model's flexibility and scalability, offering a more efficient and flexible solution for complex data analysis tasks. Extensive experiments on hyperspectral image datasets and real-world data from the UCI and KEEL repositories show that outperforms baseline models, demonstrating its effectiveness in classification and regression tasks.

Paper Structure

This paper contains 12 sections, 1 theorem, 30 equations, 9 figures, 10 tables, 1 algorithm.

Key Result

Theorem 4.1

Let $\kappa \in (0, 1)$, $N \in \mathbb{R}^+$, and assume we have dataset $U = \{(x_i, y_i)\}_{i=1}^n$, where each sample is drawn independently and identically according to a specific probability distribution $\mathcal{D}$, with $y_i \in \{-1, +1\}$ representing binary class labels. Define the clas

Figures (9)

  • Figure 1: Geometrical structure of RVFL model
  • Figure 2: Indian Pines
  • Figure 3: Pavia of University
  • Figure 4: Salinas
  • Figure 5: KSC
  • ...and 4 more figures

Theorems & Definitions (3)

  • Definition 4.1
  • Theorem 4.1
  • proof