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.

Yuxing Qi

dblp:228/4291 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
3since 2021 · last 2026
—ORCID · none

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

Databases, data management, data science and information retrieval · 2 · 2 since 2021Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1

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.

Databases, data mining, and information retrieval
2 papers
Information retrieval · 100%
Artificial intelligence
2 papers
Efficient and distributed learning · 71% Question answering and dialogue systems · 11% Probabilistic and Bayesian machine learning · 9%

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

TopicWeightPapersLastEvidence papers
Information retrieval › question answering
answer selection
1.222023
Deep Bayesian Active Learning for Learning to Rank: A Case Study in Answer Selection (Extended Abstract) · ICDE 2023
Deep Bayesian Active Learning for Learning to Rank: A Case Study in Answer Selection · IEEE Trans. Knowl. Data Eng. 2022
Information retrieval › ranking
learning to rank
1.222023
Deep Bayesian Active Learning for Learning to Rank: A Case Study in Answer Selection (Extended Abstract) · ICDE 2023
Deep Bayesian Active Learning for Learning to Rank: A Case Study in Answer Selection · IEEE Trans. Knowl. Data Eng. 2022
Machine learning › Efficient and distributed learning
active learning
0.712023
Deep Bayesian Active Learning for Learning to Rank: A Case Study in Answer Selection (Extended Abstract) · ICDE 2023
Machine learning › Efficient and distributed learning › active learning
deep active learning
0.712023
Deep Bayesian Active Learning for Learning to Rank: A Case Study in Answer Selection (Extended Abstract) · ICDE 2023
Natural language and speech › Question answering and dialogue systems › community question answering
answer selection
0.212023
Deep Bayesian Active Learning for Learning to Rank: A Case Study in Answer Selection (Extended Abstract) · ICDE 2023
Machine learning › Probabilistic and Bayesian machine learning › deep probabilistic models
bayesian deep learning
0.212022
Deep Bayesian Active Learning for Learning to Rank: A Case Study in Answer Selection · IEEE Trans. Knowl. Data Eng. 2022
Machine learning › Trustworthy machine learning
uncertainty estimation
0.212022
Deep Bayesian Active Learning for Learning to Rank: A Case Study in Answer Selection · IEEE Trans. Knowl. Data Eng. 2022

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

deep expected loss optimization · 1.3bayesian active learning · 1.3expected loss optimization · 1.1bayesian deep learning · 1.1batch mode active learning · 1.1
YearPublicationVenuePosition
2026 A 0.07-mm2 32.7-kHz Frequency Reference with Aging Calibration Embedded 1-second Timer Scoring 22% Residual Error After 500-Hour Aging at 150°C in 28-nm CMOS
Zhicheng Dong 0002, Huajin Sun, Xiaoteng Zhao, Yuxing Qi, Zekai Yang, Xianting Su, Bowen Wang 0001, Ruixue Ding, Shubin Liu 0001, Zhangming Zhu
ISCAS4
2023 Deep Bayesian Active Learning for Learning to Rank: A Case Study in Answer Selection (Extended Abstract)
abstract
Active learning can select informative data for model training to reduce the amount of labelling efforts required. Because traditional active learning methods cannot be directly used for deep learning, researchers have proposed multiple deep active learning methods. However, none of the previous research efforts on deep active learning algorithms presents a specific framework for learning-to-rank tasks. In this work, we introduce a novel deep active learning framework based on Deep Expected Loss Optimization (DELO) for the answer selection task.
Qunbo Wang, Wenjun Wu 0001, Yuxing Qi, Yongchi Zhao
ICDE3
2022 Deep Bayesian Active Learning for Learning to Rank: A Case Study in Answer Selection
abstract
Given a question and a set of candidate answers, answer selection is the task of identifying the best answer, which can be viewed as a kind of learning-to-rank tasks. Learning to rank arises in many information retrieval applications, where deep learning models can achieve inspiring results. Training a deep learning model often requires large scale annotated data that are expensive and time-consuming to obtain. Active learning presents a promising approach to this problem by selecting more informative training data to reduce the amount of labelling efforts required. Because traditional active learning methods cannot be directly used for deep learning, researchers have proposed multiple deep active learning methods. However, none of the previous research efforts on deep active learning algorithms presents a specific framework for learning-to-rank tasks. In this work, we introduce a novel deep active learning framework based onDeepExpectedLossOptimization (DELO) for the answer selection task. It adopts a data acquisition function based on model uncertainty with Bayesian deep learning and the expected loss optimization. Moreover, a two-step batch-mode procedure, combining DELO and other data acquisition strategies is proposed to further improve the performance of active learning. Experimental results verify the effectiveness of the proposed framework.
Qunbo Wang, Wenjun Wu 0001, Yuxing Qi, Yongchi Zhao
IEEE Trans. Knowl. Data Eng.3
2020 Combination of Active Learning and Self-Paced Learning for Deep Answer Selection with Bayesian Neural Network
abstract
Answer Selection is an important subtask of Question Answering tasks. For this learning-to-rank problem, deep learning methods have outperformed traditional methods. To train a high-quality deep answer selection model, it often requires large amounts of labeled data, which is a costly and noise-prone process. Active learning and semi-supervised learning are usually applied in the modelling training procedure to achieve optimal accuracy with fewer labeled training samples. However, traditional active learning methods rely on good uncertainty estimates that are hard to obtain with standard neural networks. And the performance of semi-supervised learning methods are always affected adversely by the quality of the pseudo-labeled data. In this work, we propose a new framework integrating active learning and self-paced learning in training deep answer selection models. This framework proposes an uncertainty quantification method based on Bayesian neural network, which can guide active learning and self-paced learning in the same iterative process of model training. Experiments were conducted on two kinds of deep answer selection models with real-world datasets including YahooCQA and SemiEvalCQA. The results reveal that the proposed method can significantly reduce the labeled samples for model training.
Qunbo Wang, Wenjun Wu 0001, Yuxing Qi, Zhimin Xin
ECAI3