Junhao Yu

dblp:257/9075 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
7since 2021 · last 2026
—ORCID · unresolved

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

Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 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.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Computing education · 100%
Artificial intelligence
2 papers
3D vision · 64% Knowledge representation and reasoning · 36%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning › uncertainty reasoning
belief functions
1.012026
A CDGFN-Based Quantum Multisource Information Fusion With Its Application in Time Series Classification · IEEE Trans. Knowl. Data Eng. 2026
Computing education › educational assessment
computerized adaptive testing
1.012026
Survey of Computerized Adaptive Testing: A Machine Learning Perspective · IEEE Trans. Pattern Anal. Mach. Intell. 2026
Computing education › educational assessment › computerized adaptive testing
question selection
1.012026
Survey of Computerized Adaptive Testing: A Machine Learning Perspective · IEEE Trans. Pattern Anal. Mach. Intell. 2026
Data mining
time series analysis
1.012026
A CDGFN-Based Quantum Multisource Information Fusion With Its Application in Time Series Classification · IEEE Trans. Knowl. Data Eng. 2026
Data mining › time series analysis
time series classification
1.012026
A CDGFN-Based Quantum Multisource Information Fusion With Its Application in Time Series Classification · IEEE Trans. Knowl. Data Eng. 2026
Computer vision › 3D vision › object pose estimation › 6d object pose estimation
category-level object pose estimation
0.912025
BoxDreamer: Dreaming Box Corners for Generalizable Object Pose Estimation · ICCV 2025
Computer vision › 3D vision
object pose estimation
0.912025
BoxDreamer: Dreaming Box Corners for Generalizable Object Pose Estimation · ICCV 2025
Performance modeling and evaluation
benchmarking
0.912025
Efficient Benchmarking via Bias-Bounded Subset Selection · IEEE Trans. Pattern Anal. Mach. Intell. 2025

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

multi-source information fusion · 2.0discrete fourier transform · 2.0complex dual gaussian fuzzy number · 2.0psychometrics · 1.0machine learning · 1.0item response theory · 1.0submodular optimization · 0.9greedy algorithm · 0.9diffusion model · 0.9box corner prediction · 0.9hierarchical search · 0.8data-driven framework · 0.8
YearPublicationVenuePosition
2026 Survey of Computerized Adaptive Testing: A Machine Learning Perspective
abstract
Computerized Adaptive Testing (CAT) offers an efficient and personalized method for assessing examinee proficiency by dynamically adjusting test questions based on individual performance. Compared to traditional, non-personalized testing methods, CAT requires fewer questions and provides more accurate assessments. As a result, CAT has been widely adopted across various fields, including education, healthcare, sports, sociology, and the evaluation of AI models. While traditional methods rely on psychometrics and statistics, the increasing complexity of large-scale testing has spurred the integration of machine learning techniques. This paper aims to provide a machine learning-focused survey on CAT, presenting a fresh perspective on this adaptive testing paradigm. We delve into measurement models, question selection algorithm, bank construction, and test control within CAT, exploring how machine learning can optimize these components. Through an analysis of current methods, strengths, limitations, and challenges, we strive to develop robust, fair, and efficient CAT systems. By bridging psychometric-driven CAT research with machine learning, this survey advocates for a more inclusive and interdisciplinary approach to the future of adaptive testing.
Yan Zhuang 0001, Qi Liu 0003, Haoyang Bi, Zhenya Huang, Weizhe Huang, Jiatong Li 0002, Junhao Yu, Zirui Liu 0010, Zirui Hu, Yuting Hong, Zachary A. Pardos, Haiping Ma, Mengxiao Zhu 0001, Shijin Wang 0001, Enhong Chen
IEEE Trans. Pattern Anal. Mach. Intell.7
2026 A CDGFN-Based Quantum Multisource Information Fusion With Its Application in Time Series Classification
abstract
Time series classification (TSC) is a critical area with broad applications. In the field of evidence theory, quantum evidence theory (QET) offers a promising framework for onedimensional TSC tasks, leveraging the capabilities of quantum basic probability amplitude (QBPA) to capture two-dimensional uncertainty. However, as the first step for the application of QET to TSC, how to construct QBPA still remains an open issue. In this paper, a novel approach to generate QBPA is devised. Specifically, we first apply the discrete Fourier transform (DFT) to the original data, extracting two-dimensional features embedded in the magnitude and phase from the frequency domain based on the front-few multi-frequency components, achieved by setting a threshold frequency index (TFI) to limit the frequencies considered. Next, we introduce the complex dual gaussian fuzzy number (CDGFN) as a carrier for QBPA, effectively representing two-dimensional uncertainty in the data. A CDGFN-based multisource information fusion (CDGFN-MSIF) algorithm for decision-making is proposed to combine information from different frequency components. Finally, the decisionmaking algorithm is validated on multiple time series datasets. Experimental results highlight the superior performance of the proposed approach over other state-of-the-art models, demonstrating its effectiveness and enhanced classification accuracy.
Junhao Yu, Fuyuan Xiao 0001, Zehong Cao, Chin-Teng Lin
IEEE Trans. Knowl. Data Eng.1
2025 BoxDreamer: Dreaming Box Corners for Generalizable Object Pose Estimation
Yuanhong Yu 0003, Chen Zhao 0025, Junhao Yu, Jiaqi Yang 0002, Ruizhen Hu, Yujun Shen, Xiaowei Zhou 0001, Sida Peng
ICCV4
2025 Efficient Benchmarking via Bias-Bounded Subset Selection
abstract
Evaluating AI systems, particularly large models, is an essential yet computationally expensive task. The use of extensive benchmarks often leads to substantial computational/human costs that may even exceed those of pretraining. The efficiency of AI model evaluation focuses on estimating the model's score on the full benchmark based on its responses to a smaller subset. Various empirical selection methods have been proposed to identify valuable subsets within these benchmarks. In this paper, we formally define and approximate the subset selection problem inherent in efficient evaluation. We prove that this problem actually optimizes a submodular function and that a unified subset can be identified using a simple greedy algorithm. Importantly, this approach is the first to provide theoretical guarantees of bias control and generalizability in score estimation. Using language models as a case study, experimental results across 11 different benchmarks validate its superiority in estimating model scores and maintaining ranking consistency. It can achieve accurate score estimation using no more than 30% of the full benchmark, thus facilitating efficient and sparse benchmark design.
Yan Zhuang 0001, Junhao Yu, Qi Liu 0003, Jiatong Li 0002, Zhenya Huang, Enhong Chen
IEEE Trans. Pattern Anal. Mach. Intell.2
2024 A Unified Adaptive Testing System Enabled by Hierarchical Structure Search
abstract
Adaptive Testing System (ATS) is a promising testing mode, extensively utilized in standardized tests like the GRE. It offers personalized ability assessment by dynamically adjusting questions based on individual ability levels. Compared to traditional exams, ATS can improve the accuracy of ability estimates while simultaneously reducing the number of questions required. Despite the diverse testing formats of ATS, tailored to different adaptability requirements in various testing scenarios, there is a notable absence of a unified framework for modeling them. In this paper, we introduce a unified data-driven ATS framework that conceptualizes the various testing formats as a hierarchical test structure search problem. It can learn directly from data to solve for the optimal questions for each student, eliminating the need for manual test design. The proposed solution algorithm comes with theoretical guarantees for estimation error and convergence. Empirical results show that our framework maintains assessment accuracy while reducing question count by 20% on average and improving training stability.
Junhao Yu, Yan Zhuang 0001, Zhenya Huang, Qi Liu 0003, Xin Li 0064, Rui Li 0093, Enhong Chen
ICML1
2024 Sampling theory of jointly bandlimited time-vertex graph signals
Hang Sheng, Hui Feng 0001, Junhao Yu, Bo Hu 0002
Signal Process.3
2022 EFC/H∞ Based Dual-mode Switching Global Control of the First-order Parallel Rotating Double Inverted Pendulum System
abstract
The first-order parallel rotating double inverted pendulum (PRDIP) is a novel underdrive benchmark system. In this paper, a mathematical model of PRDIP system based on Lagrange equation is established, which is compared with the visual model (3D mechanical model) of PRDIP system based on the MATLAB/SIMSCAPE Multibody module. Through analyzing the established mathematical model of PRDIP, it can be concluded that the PRDIP system is controllable only when the length of the two pendulums is not equal and the coefficient of friction is small. The global control of the pendulum can be divided into two parts, including swing up control and stable control, according to the movement of the pendulum within the four quadrants of its motion plane. An energy feedback based control strategy and a state feedback H∞ based control strategy are designed for the swing up control and stable control of the pendulum, respectively. In addition, a dual-mode switching global control scheme based on EFC/H∞ is proposed. The simulations using MATLAB/SIMSCAPE are demonstrated to validate the effectiveness of the proposed dual-mode switching global control scheme.
Zhenbao Yu, Lipeng Liu, Junhao Yu
IECON3