Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Chenghua Liu

dblp:282/8540 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
5since 2021 · last 2025
0009-0008-6158-2944ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Systems, architecture and hardware · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Quantum computing and quantum information · 48% Graph algorithms and graph theory · 36% Combinatorics and discrete mathematics · 16%
Artificial intelligence
1 paper
Graph learning · 56% Representation and self-supervised learning · 44%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information
quantum algorithms
1.722025
Quantum Speedup for Hypergraph Sparsification · ICML 2025
Quantum Speedup for Sampling Random Spanning Trees · ICALP 2025
Graph algorithms and graph theory
graph sparsification
0.912025
Quantum Speedup for Hypergraph Sparsification · ICML 2025
Combinatorics and discrete mathematics › hypergraph
hypergraph sparsification
0.912025
Quantum Speedup for Hypergraph Sparsification · ICML 2025
Quantum computing and quantum information › quantum algorithms
quantum speedup
0.912025
Quantum Speedup for Sampling Random Spanning Trees · ICALP 2025
Graph algorithms and graph theory
spanning tree
0.912025
Quantum Speedup for Sampling Random Spanning Trees · ICALP 2025
Machine learning › Graph learning
graph clustering
0.612022
Stationary Diffusion State Neural Estimation for Multiview Clustering · AAAI 2022
Machine learning › Representation and self-supervised learning › multi-view learning
multi-view clustering
0.612022
Stationary Diffusion State Neural Estimation for Multiview Clustering · AAAI 2022
Graph algorithms and graph theory › graph sparsification
spectral sparsification
0.312025
Quantum Speedup for Hypergraph Sparsification · ICML 2025
Machine learning › Graph learning
graph self-supervised learning
0.212022
Stationary Diffusion State Neural Estimation for Multiview Clustering · AAAI 2022

Methods — techniques the papers use, named apart from their topics

spectral sparsification · 0.9quantum algorithm · 0.9self-attention · 0.6graph neural network · 0.6contrastive co-supervision · 0.6
YearPublicationVenuePosition
2025 Quantum Speedup for Sampling Random Spanning Trees
abstract
International audience
Simon Apers, Minbo Gao, Zheng-Feng Ji, Chenghua Liu
ICALP4
2025 Quantum Speedup for Hypergraph Sparsification
abstract
Graph sparsification serves as a foundation for many algorithms, such as approximation algorithms for graph cuts and Laplacian system solvers. As its natural generalization, hypergraph sparsification has recently gained increasing attention, with broad applications in graph machine learning and other areas. In this work, we propose the first quantum algorithm for hypergraph sparsification, addressing an open problem proposed by Apers and de Wolf (FOCS’20). For a weighted hypergraph with $n$ vertices, $m$ hyperedges, and rank $r$, our algorithm outputs a near-linear size $\varepsilon$-spectral sparsifier in time $\widetilde O(r\sqrt{mn}/\varepsilon)$. This algorithm matches the quantum lower bound for constant $r$ and demonstrates quantum speedup when compared with the state-of-the-art $\widetilde O(mr)$-time classical algorithm. As applications, our algorithm implies quantum speedups for computing hypergraph cut sparsifiers, approximating hypergraph mincuts and hypergraph $s$-$t$ mincuts.
Chenghua Liu, Minbo Gao, Zheng-Feng Ji, Mingsheng Ying
ICML1
2023 Framework for Quality Evaluation of Smart Roadside Infrastructure Sensors for Automated Driving Applications
abstract
The use of smart roadside infrastructure sensors is highly relevant for future applications of connected and automated vehicles. External sensor technology in the form of intelligent transportation system stations (ITS-Ss) can provide safety-critical real-time information about road users in the form of a digital twin. The choice of sensor setups has a major influence on the downstream function as well as the data quality. To date, there is insufficient research on which sensor setups result in which levels of ITS-S data quality. We present a novel approach to perform detailed quality assessment for smart roadside infrastructure sensors. Our framework is multimodal across different sensor types and is evaluated on the DAIR-V2X dataset. We analyze the composition of different lidar and camera sensors and assess them in terms of accuracy, latency, and reliability. The evaluations show that the framework can be used reliably for several future ITS-S applications.
Laurent Kloeker, Chenghua Liu, Lutz Eckstein
IV2
2022 Stationary Diffusion State Neural Estimation for Multiview Clustering
abstract
Although many graph-based clustering methods attempt to model the stationary diffusion state in their objectives, their performance limits to using a predefined graph. We argue that the estimation of the stationary diffusion state can be achieved by gradient descent over neural networks. We specifically design the Stationary Diffusion State Neural Estimation (SDSNE) to exploit multiview structural graph information for co-supervised learning. We explore how to design a graph neural network specially for unsupervised multiview learning and integrate multiple graphs into a unified consensus graph by a shared self-attentional module. The view-shared self-attentional module utilizes the graph structure to learn a view-consistent global graph. Meanwhile, instead of using auto-encoder in most unsupervised learning graph neural networks, SDSNE uses a co-supervised strategy with structure information to supervise the model learning. The co-supervised strategy as the loss function guides SDSNE in achieving the stationary state. With the help of the loss and the self-attentional module, we learn to obtain a graph in which nodes in each connected component fully connect by the same weight. Experiments on several multiview datasets demonstrate effectiveness of SDSNE in terms of six clustering evaluation metrics.
Chenghua Liu, Zhuolin Liao, Yixuan Ma, Kun Zhan
AAAI1
2021 Design and Experimental Validation of a Robotic System for Reactor Core Detector Removal
abstract
The reactor power and the coolant level in the nuclear plant are monitored via the reactor core detectors. Every 4 to 5 years, the detectors with high-level radiation need to be removed, which is time-consuming and hazardous for workers. To address this issue, this paper introduces a novel robotic system and its strategy for the removal of the detectors. The modular mechanisms are designed to achieve diverse actions such as positioning, extracting, transporting, cutting, and coiling. The detector with different radiation doses is physically classified and minimized in volume. The experiments to simulate the removal process are conducted. The results demonstrate that the time for the robotic removal of one detector is reduced from more than 1 hour to 31.2±5.3 min compared with the manual mode. The radiation exposure time for workers is reduced to 0 under normal working conditions, which significantly reduces the radiation dose compared with the traditional methods.
Huanyu Tian, Fansheng Meng, Hao Wen 0003, Xingguang Duan, Chenghua Liu
ICRA8