Yixuan Qiu

Yixuan Qiu

Auto-generated profile, based on publicly available information

Yixuan Qiu

School of Information Science and Engineering, Harbin Institute of Technology, Weihai, China

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 April 2021 in Bioinformatics
Verified
Journal Article
Open access
PDF file
YQYixuan Qiu
Yixuan Qiu
JWJiebiao Wang
Jiebiao Wang
JLJing Lei
Jing Lei
KRKathryn Roeder
Kathryn Roeder
Marker genes, defined as genes that are expressed primarily in a single-cell type, can be identified from the single-cell transcriptome; however, such data are not always available for the many uses of marker genes, such as deconvolution of bulk tissue. Marker genes for a cell type, however, are highly correlated in bulk data, because their expression levels depend primarily on the proportion of that cell type in the samples. Therefore, when many tissue samples are analyzed, it is possible to identify these marker genes from the correlation pattern. To capitalize on this pattern, we develop a new algorithm to detect marker genes by combining published information about likely marker genes with bulk transcriptome data in the form of a semi-supervised algorithm. The algorithm then exploits the correlation structure of the bulk data to refine the published marker genes by adding or removing genes from the list. We implement this method as an R package markerpen, hosted on CRAN (https://CRAN.R-project.org/package=markerpen). Supplementary data are available at Bioinformatics online.

8 August 2024 in Expert Systems with Applications
Verified
Journal Article
Closed access
LDLibao Deng
Libao Deng
YQYixuan Qiu
Yixuan Qiu
WGWenYin Gong
WenYin Gong
YDYuanzhu Di
Yuanzhu Di
CLChunlei Li
Chunlei Li

3 January 2020 in Journal of the American Statistical Association
Verified
Journal Article
Open access
YQYixuan Qiu
Yixuan Qiu
XWXiao Wang
Xiao Wang
Latent variable models cover a broad range of statistical and machine learning models, such as Bayesian models, linear mixed models, and Gaussian mixture models. Existing methods often suffer from two major challenges in practice: (a) A proper latent variable distribution is difficult to be specified; (b) Making an exact likelihood inference is formidable due to the intractable computation. We propose a novel framework for the inference of latent variable models that overcomes these two limitations. This new framework allows for a fully data-driven latent variable distribution via deep neural networks, and the proposed stochastic gradient method, combined with the Langevin algorithm, is efficient and suitable for complex models and big data. We provide theoretical results for the Langevin algorithm, and establish the convergence analysis of the optimization method. This framework has demonstrated superior practical performance through simulation studies and a real data analysis.

12 July 2022 in Biometrika
Verified
Journal Article
Closed access
YQYixuan Qiu
Yixuan Qiu
JLJing Lei
Jing Lei
KRKathryn Roeder
Kathryn Roeder
Summary: Sparse principal component analysis is an important technique for simultaneous dimensionality reduction and variable selection with high-dimensional data. In this work we combine the unique geometric structure of the sparse principal component analysis problem with recent advances in convex optimization to develop novel gradient-based sparse principal component analysis algorithms. These algorithms enjoy the same global convergence guarantee as the original alternating direction method of multipliers, and can be more efficiently implemented with the rich toolbox developed for gradient methods from the deep learning literature. Most notably, these gradient-based algorithms can be combined with stochastic gradient descent methods to produce efficient online sparse principal component analysis algorithms with provable numerical and statistical performance guarantees. The practical performance and usefulness of the new algorithms are demonstrated in various simulation studies. As an application, we show how the scalability and statistical accuracy of our method enable us to find interesting functional gene groups in high-dimensional RNA sequencing data.

25 June 2011
Verified
Dataset
Closed access
DBDoug Bates
Doug Bates
DEDirk Eddelbuettel
Dirk Eddelbuettel
RFRomain Francois
Romain Francois
YQYixuan Qiu
Yixuan Qiu

19 November 2019 in arXiv
Verified
Preprint
Open access
PDF file
YQYixuan Qiu
Yixuan Qiu
JLJing Lei
Jing Lei
KRKathryn Roeder
Kathryn Roeder
Sparse principal component analysis (PCA) is an important technique for dimensionality reduction of high-dimensional data. However, most existing sparse PCA algorithms are based on non-convex optimization, which provide little guarantee on the global convergence. Sparse PCA algorithms based on a convex formulation, for example the Fantope projection and selection (FPS), overcome this difficulty, but are computationally expensive. In this work we study sparse PCA based on the convex FPS formulation, and propose a new algorithm that is computationally efficient and applicable to large and high-dimensional data sets. Nonasymptotic and explicit bounds are derived for both the optimization error and the statistical accuracy, which can be used for testing and inference problems. We also extend our algorithm to online learning problems, where data are obtained in a streaming fashion. The proposed algorithm is applied to high-dimensional gene expression data for the detection of functional gene groups.