Arrow Research search

Author name cluster

Zhao Li 0007

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
1 author row

Possible papers

2

ECAI Conference 2020 Conference Paper

Strong Statistical Correlation Revealed by Quantum Entanglement for Supervised Learning

  • Junwei Zhang 0009
  • Yuexian Hou
  • Zhao Li 0007
  • Long Zhang
  • Xia Chen 0004

In supervised learning, the generative approach is an important one, which obtains the generative model by learning the joint probability between features and categories. In quantum mechanics, Quantum Entanglement (QE) can provide a statistical correlation between subsystems (or attributes) that is stronger than what classical systems are able to produce. It inspires us to use entangled systems (states) to characterize this strong statistical correlation between features and categories, that is, to use the joint probability derived from QE to model the correlation. Based on the separability of the density matrix of entangled systems, this paper formally clarifies the manifestation of the strong statistical correlation revealed by QE, and implements a classification algorithm (called ECA) to verify the feasibility and superiority of the correlation in specific tasks. Since QE arises from the measurement process of entangled systems, the core of ECA is quantum measurement operations. In this paper, we use the GHZ [25] and W [22] states to prepare the entangled system and use a fully connected network layer to learn the measurement operator. It can also be understood as replacing the output layer of the Multi-Layer Perceptron (MLP) with a quantum measurement operation. The experimental results show that ECA is superior to most representative classification algorithms in multiple evaluation metrics.

UAI Conference 2018 Conference Paper

Unsupervised Multi-view Nonlinear Graph Embedding

  • Jiaming Huang
  • Zhao Li 0007
  • Vincent W. Zheng
  • Wen Wen
  • Yifan Yang 0001
  • Yuanmi Chen

ei, 1 xi, 1 In this paper, we study the unsupervised multi-view graph embedding (UMGE) problem, which aims to learn graph embedding from multiple perspectives in an unsupervised manner. However, the vast majority of multiview learning work focuses on non-graph data, and surprisingly there are limited work on UMGE. By systematically analyzing different existing methods for UMGE, we discover that cross-view and nonlinearity play a vital role in efficiently improving graph embedding quality. Motivated by this concept, we develop an unsupervised Multi-viEw nonlineaR Graph Embedding (MERGE) approach to model relational multi-view consistency. Experimental results on five benchmark datasets demonstrate that MERGE significantly outperforms the state-of-the-art baselines in terms of accuracy in node classification tasks without sacrificing the computational efficiency.

v2026.09.13