VLDB 2026 Research / reviewers in the wild / expert
Liuquan Sun
dblp:78/8506
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 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 |
Mathematical optimization · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Computational finance and economics · 60% Bioinformatics and computational biology · 40% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Mathematical optimization › statistical learning theory
high-dimensional regression |
1.3 | 2 | 2024 | Inference on High-dimensional Single-index Models with Streaming Data · J. Mach. Learn. Res. 2024 Optimal Minimax Variable Selection for Large-Scale Matrix Linear Regression Model · J. Mach. Learn. Res. 2021 |
Mathematical optimization
statistical learning theory |
1.3 | 2 | 2024 | Inference on High-dimensional Single-index Models with Streaming Data · J. Mach. Learn. Res. 2024 Optimal Minimax Variable Selection for Large-Scale Matrix Linear Regression Model · J. Mach. Learn. Res. 2021 |
Mathematical optimization › sparse learning
feature selection |
0.5 | 1 | 2021 | Optimal Minimax Variable Selection for Large-Scale Matrix Linear Regression Model · J. Mach. Learn. Res. 2021 |
Computational finance and economics
financial data analysis |
0.2 | 1 | 2024 | Inference on High-dimensional Single-index Models with Streaming Data · J. Mach. Learn. Res. 2024 |
Bioinformatics and computational biology
biomedical data analysis |
0.1 | 1 | 2021 | Optimal Minimax Variable Selection for Large-Scale Matrix Linear Regression Model · J. Mach. Learn. Res. 2021 |
Methods — techniques the papers use, named apart from their topics
online learning · 1.5huber loss · 1.5debiased lasso · 1.5asymptotic normality · 1.5minimax theory · 1.0iterative hard-thresholding · 0.5iterative hard thresholding · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Inference on High-dimensional Single-index Models with Streaming DataabstractTraditional statistical methods are faced with new challenges due to streaming data. The major challenge is the rapidly growing volume and velocity of data, which makes storing such huge data sets in memory impossible. The paper presents an online inference framework for regression parameters in high-dimensional semiparametric single-index models with unknown link functions. The proposed online procedure updates only the current data batch and summary statistics of historical data instead of re-accessing the entire raw data set. At the same time, we do not need to estimate the unknown link function, which is a highly challenging task. In addition, a generalized convex loss function is used in the proposed inference procedure. To illustrate the proposed method, we use the Huber loss function and the negative log-likelihood of the logistic regression model. In this study, the asymptotic normality of the proposed online debiased Lasso estimators and the bounds of the proposed online Lasso estimators are investigated. To evaluate the performance of the proposed method, extensive simulation studies have been conducted. We provide applications to Nasdaq stock prices and financial distress data sets. Dongxiao Han, Jinhan Xie, Liuquan Sun, Bei Jiang, Linglong Kong |
J. Mach. Learn. Res. | 4 |
| 2021 | Optimal Minimax Variable Selection for Large-Scale Matrix Linear Regression ModelabstractLarge-scale matrix linear regression models with high-dimensional responses and high-dimensional variables have been widely employed in various large-scale biomedical studies. In this article, we propose an optimal minimax variable selection approach for the matrix linear regression model when the dimensions of both the response matrix and predictors diverge at the exponential rate of the sample size. We develop an iterative hard-thresholding algorithm for fast computation and establish an optimal minimax theory for the parameter estimates. The finite sample performance of the method is examined via extensive simulation studies and a real data application from the Alzheimer's Disease Neuroimaging Initiative study is provided. Meiling Hao, Lianqiang Qu, Dehan Kong, Liuquan Sun, Hongtu Zhu |
J. Mach. Learn. Res. | 4 |