arXiv AI

Quantile-Free Uncertainty Quantification in Graph Neural Networks

arXiv:2605. 04847v2 Announce Type: replace-cross Abstract: Uncertainty quantification (UQ) in graph neural networks (GNNs) is crucial in high-stakes domains but remains a significant challenge.

arXiv Machine Learning
Sep 18

Quantum Graph Convolutional Networks: Implementation and Trainability Analysis

The paper implements two quantum graph neural network architectures—Simplified Graph Convolution (SGC) and Linear Graph Convolution (LGC)—and evaluates them on benchmark graph datasets for semi‑supervised learning using quantum simulation. It compares their predictive performance and optimization behavior to classical baselines, finding that the quantum models achieve competitive results with fewer parameters. Additionally, the study provides a cost‑gradient analysis to identify trainable tasks and a classical simulability investigation to determine regimes where the circuits remain robust during training.

By Paul San Sebastian Sein, Theodor Iosif, Tilen G. Limb\"ack-Stokin, Kin Ian Lo, Yidong Liao
arXiv AI
Sep 2

Towards Provable and Scalable Training of Quantized Neural Networks with Ising Optimization

The paper presents a Quadratic Constrained Binary Optimization (QCBO) framework that provides provable guarantees for training quantized neural networks. It characterizes the topology of zero‑loss level sets, compiles finite‑depth architectures into bounded QCBOs, and introduces a sample‑wise Decomposed Lower‑Bound Optimization (DLBO) to scale Ising‑based optimization. Experiments on a coherent Ising machine show high accuracy on binary Fashion‑MNIST at 1.1‑bit precision and validate the approach on multi‑class datasets.

By Wenxin Li, Chuan Wang, Hongdong Zhu, Qi Gao, Yin Ma, Hai Wei, Kai Wen