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

Xiaoqing Tan

dblp:60/10263 · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
5since 2021 · last 2023
0000-0002-3303-2493ORCID · corroborated

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

Artificial intelligence and machine learning · 5 · 2 first-author · 5 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 1 · 1 first-author

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.

Artificial intelligence
1 paper
Trustworthy machine learning · 44% Reinforcement learning · 44% Optimization for machine learning · 13%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
fairness
0.612022
RISE: Robust Individualized Decision Learning with Sensitive Variables · NeurIPS 2022
Medical and health informatics › precision medicine
individual treatment effect estimation
0.612022
A Tree-based Model Averaging Approach for Personalized Treatment Effect Estimation from Heterogeneous Data Sources · ICML 2022
Machine learning › Optimization for machine learning
robust optimization
0.212022
RISE: Robust Individualized Decision Learning with Sensitive Variables · NeurIPS 2022
Distributed systems
distributed data processing
0.212022
A Tree-based Model Averaging Approach for Personalized Treatment Effect Estimation from Heterogeneous Data Sources · ICML 2022
Distributed systems › distributed machine learning
privacy-preserving distributed learning
0.212022
A Tree-based Model Averaging Approach for Personalized Treatment Effect Estimation from Heterogeneous Data Sources · ICML 2022

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

causal inference · 1.7tree-based model averaging · 1.1ensemble learning · 1.1quantile-optimal decision rule · 0.6
YearPublicationVenuePosition
2023 Learning to Learn Variational Quantum Algorithm
abstract
Variational quantum algorithms (VQAs) use classical computers as the quantum outer loop optimizer and update the circuit parameters to obtain an approximate ground state. In this article, we present a meta-learning variational quantum algorithm (meta-VQA) by recurrent unit, which uses a technique called "meta-learner." Motivated by the hybrid quantum-classical algorithms, we train classical recurrent units to assist quantum computing, learning to find approximate optima in the parameter landscape. Here, aiming to reduce the sampling number more efficiently, we use the quantum stochastic gradient descent method and introduce the adaptive learning rate. Finally, we deploy on the TensorFlow Quantum processor within approximate quantum optimization for the Ising model and variational quantum eigensolver for molecular hydrogen (H2), lithium hydride (LiH), and helium hydride cation (HeH+). Our algorithm can be expanded to larger system sizes and problem instances, which have higher performance on near-term processors.
Rui Huang 0010, Xiaoqing Tan, Qingshan Xu 0003
IEEE Trans. Neural Networks Learn. Syst.2
2022 A Tree-based Model Averaging Approach for Personalized Treatment Effect Estimation from Heterogeneous Data Sources
abstract
Accurately estimating personalized treatment effects within a study site (e.g., a hospital) has been challenging due to limited sample size. Furthermore, privacy considerations and lack of resources prevent a site from leveraging subject-level data from other sites. We propose a tree-based model averaging approach to improve the estimation accuracy of conditional average treatment effects (CATE) at a target site by leveraging models derived from other potentially heterogeneous sites, without them sharing subject-level data. To our best knowledge, there is no established model averaging approach for distributed data with a focus on improving the estimation of treatment effects. Specifically, under distributed data networks, our framework provides an interpretable tree-based ensemble of CATE estimators that joins models across study sites, while actively modeling the heterogeneity in data sources through site partitioning. The performance of this approach is demonstrated by a real-world study of the causal effects of oxygen therapy on hospital survival rate and backed up by comprehensive simulation results.
Xiaoqing Tan, Chung-Chou H. Chang, Lu Tang 0003
ICML1
2022 RISE: Robust Individualized Decision Learning with Sensitive Variables
abstract
This paper introduces RISE, a robust individualized decision learning framework with sensitive variables, where sensitive variables are collectible data and important to the intervention decision, but their inclusion in decision making is prohibited due to reasons such as delayed availability or fairness concerns. A naive baseline is to ignore these sensitive variables in learning decision rules, leading to significant uncertainty and bias. To address this, we propose a decision learning framework to incorporate sensitive variables during offline training but not include them in the input of the learned decision rule during model deployment. Specifically, from a causal perspective, the proposed framework intends to improve the worst-case outcomes of individuals caused by sensitive variables that are unavailable at the time of decision. Unlike most existing literature that uses mean-optimal objectives, we propose a robust learning framework by finding a newly defined quantile- or infimum-optimal decision rule. The reliable performance of the proposed method is demonstrated through synthetic experiments and three real-world applications.
Xiaoqing Tan, Zhengling Qi, Christopher W. Seymour, Lu Tang 0003
NeurIPS1
2021 Point3D: tracking actions as moving points with 3D CNNs
Shentong Mo, Jingfei Xia, Xiaoqing Tan, Bhiksha Raj
BMVC3
2021 Variational quantum tensor networks classifiers
Rui Huang 0010, Xiaoqing Tan, Qingshan Xu 0003
Neurocomputing2
2019 A hybrid universal blind quantum computation
Weiqi Luo 0002, Jian Weng 0001, Yaxi Yang, Min-Rong Chen, Xiaoqing Tan
Inf. Sci.7
2016 Quantum private comparison protocol with cloud quantum computing
abstract
Summary Because privacy problems with big data impede progress at all phases of the pipeline that can create value from data, Alice and Bob have to perform private queries in order to obtain the private comparison results of big data. Suppose that the cloud devices are with the capacity of conventional and quantum computation, an efficient quantum private comparison protocol with ring‐trip transmission by safe cloud quantum computing in the quantum Internet is proposed. Two participant parties Alice and Bob, with the help of a semi‐trusted third party and cloud device by simple quantum measurements and mathematical operation, can compare the equality of their secret information without revealing the content of secret information. We show that our protocol can resist the eavesdropper Eve's intercept–resend attack, entangle–measure attack, and Trojan horse attack to cloud device, participant's intercept–measure–resend attack, and third party's attack. The qubit efficiency of our protocol approaches to 100%. We also analyze the connection between Eve's obtained information and the fidelity of secret information in detail. Copyright © 2015 John Wiley & Sons, Ltd.
Xiaoqing Tan
Concurr. Comput. Pract. Exp.1
2016 Perfect quantum teleportation by four-particle cluster state
Xiaoqing Tan
Inf. Process. Lett.1