paper-with-me

홈 › Papers

A Laplacian-based Quantum Graph Neural Network for Semi-Supervised Learning

2024-08-10 · Hamed Gholipour, Farid Bozorgnia, Kailash Hambarde, Hamzeh Mohammadigheymasi, Javier Mancilla, Andre Sequeira, Joao Neves, Hugo Proença

Laplacian learning method is a well-established technique in classical graph-based semi-supervised learning, but its potential in the quantum domain remains largely unexplored. This study investigates the performance of the Laplacian-based Quantum Semi-Supervised Learning (QSSL) method across four benchmark datasets -- Iris, Wine, Breast Cancer Wisconsin, and Heart Disease. Further analysis explores the impact of increasing Qubit counts, revealing that adding more Qubits to a quantum system doesn't always improve performance. The effectiveness of additional Qubits depends on the quantum algorithm and how well it matches the dataset. Additionally, we examine the effects of varying entangling layers on entanglement entropy and test accuracy. The performance of Laplacian learning is highly dependent on the number of entangling layers, with optimal configurations varying across different datasets. Typically, moderate levels of entanglement offer the best balance between model complexity and generalization capabilities. These observations highlight the crucial need for precise hyperparameter tuning tailored to each dataset to achieve optimal performance in Laplacian learning methods.

📄 PDF Abstract BibTeX arXiv:2408.05498

Code (0)

등록된 구현이 없습니다.

Tasks

Graph Neural Network

Similar Papers 제목 키워드 기반

Enhancement of Quantum Semi-Supervised Learning via Improved Laplacian and Poisson Methods

2025-08-04 · Hamed Gholipour, Farid Bozorgnia, Hamzeh Mohammadigheymasi, Kailash Hambarde 외 arxiv

This paper develops a hybrid quantum approach for graph-based semi-supervised learning to enhance performance in scenarios where labeled data is scarce. We introduce two enhanced quantum models, the Improved Laplacian Qu…

Quantum Machine Learning

Graph Laplacian for Semi-Supervised Learning

2023-01-12 · Or Streicher, Guy Gilboa

Semi-supervised learning is highly useful in common scenarios where labeled data is scarce but unlabeled data is abundant. The graph (or nonlocal) Laplacian is a fundamental smoothing operator for solving various learnin…

Clustering

Un-normalized hypergraph p-Laplacian based semi-supervised learning methods

2018-11-06 · Loc Hoang Tran, Linh Hoang Tran

Most network-based machine learning methods assume that the labels of two adjacent samples in the network are likely to be the same. However, assuming the pairwise relationship between samples is not complete. The inform…

The game theoretic p-Laplacian and semi-supervised learning with few labels

2017-11-28 · Jeff Calder

We study the game theoretic p-Laplacian for semi-supervised learning on graphs, and show that it is well-posed in the limit of finite labeled data and infinite unlabeled data. In particular, we show that the continuum li…

Consistency of semi-supervised learning, stochastic tug-of-war games, and the p-Laplacian

2024-01-15 · Jeff Calder, Nadejda Drenska

In this paper we give a broad overview of the intersection of partial differential equations (PDEs) and graph-based semi-supervised learning. The overview is focused on a large body of recent work on PDE continuum limits…