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

Likai Chen

dblp:18/11213 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
4since 2021 · last 2026
0000-0002-4603-1676ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 2 first-author · 1 since 2021Theory of computation · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 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.

Theoretical computer science
4 papers
Mathematical optimization · 44% Information theory · 37% Algorithms and data structures · 19%
Artificial intelligence
2 papers
Reinforcement learning · 69% Probabilistic and Bayesian machine learning · 16% Optimization for machine learning · 16%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › data streams
quantile estimation
1.722026
Central Limit Theorems for Stochastic Gradient Descent Quantile Estimators · IEEE Trans. Inf. Theory 2026
Recursive Quantile Estimation: Non-Asymptotic Confidence Bounds · J. Mach. Learn. Res. 2023
Mathematical optimization › stochastic optimization › stochastic gradient methods
stochastic gradient descent
1.722026
Central Limit Theorems for Stochastic Gradient Descent Quantile Estimators · IEEE Trans. Inf. Theory 2026
Recursive Quantile Estimation: Non-Asymptotic Confidence Bounds · J. Mach. Learn. Res. 2023
Information theory › statistical inference
asymptotic theory
1.012026
Central Limit Theorems for Stochastic Gradient Descent Quantile Estimators · IEEE Trans. Inf. Theory 2026
Information theory › probability theory › limit theorems
central limit theorem
1.012026
Central Limit Theorems for Stochastic Gradient Descent Quantile Estimators · IEEE Trans. Inf. Theory 2026
Mathematical optimization
high-dimensional statistics
1.012026
Estimation of High-Dimensional Nonlinear Vector Autoregressive Models · IEEE Trans. Inf. Theory 2026
Information theory › estimation theory
nonparametric estimation
1.012026
Estimation of High-Dimensional Nonlinear Vector Autoregressive Models · IEEE Trans. Inf. Theory 2026
Mathematical optimization › statistical estimation › regression › sparse regression
sparse additive models
1.012026
Estimation of High-Dimensional Nonlinear Vector Autoregressive Models · IEEE Trans. Inf. Theory 2026
Machine learning › Reinforcement learning › multi-armed bandit › pure exploration
best arm identification
0.712023
Recursive Quantile Estimation: Non-Asymptotic Confidence Bounds · J. Mach. Learn. Res. 2023
Machine learning › Reinforcement learning
multi-armed bandit
0.712023
Recursive Quantile Estimation: Non-Asymptotic Confidence Bounds · J. Mach. Learn. Res. 2023
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
markov chain
0.312026
Central Limit Theorems for Stochastic Gradient Descent Quantile Estimators · IEEE Trans. Inf. Theory 2026
Machine learning › Optimization for machine learning
stationary distribution
0.312026
Central Limit Theorems for Stochastic Gradient Descent Quantile Estimators · IEEE Trans. Inf. Theory 2026
Information theory › probability theory › measure concentration
concentration inequalities
0.312017
Concentration inequalities for empirical processes of linear time series · J. Mach. Learn. Res. 2017
Mathematical optimization › convergence analysis
non-asymptotic analysis
0.212023
Recursive Quantile Estimation: Non-Asymptotic Confidence Bounds · J. Mach. Learn. Res. 2023

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

moment generating function · 2.0markov chain analysis · 2.0characteristic function · 2.0stochastic gradient descent · 1.3polyak-ruppert averaging · 1.3least-squares estimation · 1.0bernstein-type inequality · 1.0basis expansion · 1.0time series analysis · 0.3concentration inequalities · 0.3
YearPublicationVenuePosition
2026 Estimation of High-Dimensional Nonlinear Vector Autoregressive Models
abstract
High-dimensional vector autoregressive (VAR) models have numerous applications in fields such as econometrics, biology, climatology, among others. While prior research has mainly focused on linear VAR models, these approaches can be restrictive in practice. To address this, we introduce a high-dimensional non-parametric sparse additive model, providing a more flexible framework. Our method employs basis expansions to construct high-dimensional nonlinear VAR models. We derive convergence rates and model selection consistency for least squared estimators, considering dependence measures of the processes, error moment conditions, sparsity, and basis expansions. Our theory significantly extends prior linear VAR models by incorporating both non-Gaussianity and non-linearity. As a key contribution, we derive sharp Bernstein-type inequalities for tail probabilities in both non-sub-Gaussian linear and nonlinear VAR processes, which match the classical Bernstein inequality for independent random variables. Additionally, we present numerical experiments that support our theoretical findings and demonstrate the advantages of the nonlinear VAR model for a gene expression time series dataset.
Yuefeng Han, Likai Chen, Wei Biao Wu
IEEE Trans. Inf. Theory2
2026 Central Limit Theorems for Stochastic Gradient Descent Quantile Estimators
abstract
This paper develops asymptotic theory for quantile estimation via stochastic gradient descent (SGD) with a constant learning rate. The quantile loss function is neither smooth nor strongly convex. Beyond conventional perspectives and techniques, we view quantile SGD iteration as an irreducible, periodic, and positive recurrent Markov chain, which cyclically converges to its unique stationary distribution regardless of the arbitrarily fixed initialization. To derive the exact form of the stationary distribution, we analyze the structure of its characteristic function by exploiting the stationary equation.We also derive tight bounds for its moment generating function (MGF) and tail probabilities. Synthesizing the aforementioned approaches, we prove that the centered and standardized stationary distribution converges to a Gaussian distribution as the learning rate η → 0. This finding provides the first central limit theorem (CLT)-type theoretical guarantees for the quantile SGD estimator with constant learning rates. We further propose a recursive algorithm to construct confidence intervals of the estimators with statistical guarantees. Numerical studies demonstrate the effective finite-sample performance of the online estimator and inference procedure. The theoretical tools developed in this study are of independent interest for investigating general SGD algorithms formulated as Markov chains, particularly in non-strongly convex and non-smooth settings.
Ziyang Wei, Jiaqi Li 0032, Likai Chen, Wei Biao Wu
IEEE Trans. Inf. Theory3
2023 Recursive Quantile Estimation: Non-Asymptotic Confidence Bounds
abstract
This paper considers the recursive estimation of quantiles using the stochastic gradient descent (SGD) algorithm with Polyak-Ruppert averaging. The algorithm offers a computationally and memory efficient alternative to the usual empirical estimator. Our focus is on studying the non-asymptotic behavior by providing exponentially decreasing tail probability bounds under mild assumptions on the smoothness of the density functions. This novel non-asymptotic result is based on a bound of the moment generating function of the SGD estimate. We apply our result to the problem of best arm identification in a multi-armed stochastic bandit setting under quantile preferences.
Likai Chen, Georg Keilbar, Wei Biao Wu
J. Mach. Learn. Res.1
2022 MicrobiomeCensus estimates human population sizes from wastewater samples based on inter-individual variability in gut microbiomes
abstract
The metagenome embedded in urban sewage is an attractive new data source to understand urban ecology and assess human health status at scales beyond a single host. Analyzing the viral fraction of wastewater in the ongoing COVID-19 pandemic has shown the potential of wastewater as aggregated samples for early detection, prevalence monitoring, and variant identification of human diseases in large populations. However, using census-based population size instead of real-time population estimates can mislead the interpretation of data acquired from sewage, hindering assessment of representativeness, inference of prevalence, or comparisons of taxa across sites. Here, we show that taxon abundance and sub-species diversisty in gut-associated microbiomes are new feature space to utilize for human population estimation. Using a population-scale human gut microbiome sample of over 1,100 people, we found that taxon-abundance distributions of gut-associated multi-person microbiomes exhibited generalizable relationships with respect to human population size. Here and throughout this paper, the human population size is essentially the sample size from the wastewater sample. We present a new algorithm, MicrobiomeCensus, for estimating human population size from sewage samples. MicrobiomeCensus harnesses the inter-individual variability in human gut microbiomes and performs maximum likelihood estimation based on simultaneous deviation of multiple taxa's relative abundances from their population means. MicrobiomeCensus outperformed generic algorithms in data-driven simulation benchmarks and detected population size differences in field data. New theorems are provided to justify our approach. This research provides a mathematical framework for inferring population sizes in real time from sewage samples, paving the way for more accurate ecological and public health studies utilizing the sewage metagenome.
Likai Chen, Xiaoqian (annie) Yu, Claire Duvallet, Siavash Isazadeh, Chengzhen Dai, Shinkyu Park, Katya Frois-Moniz, Fabio Duarte, Carlo Ratti, Eric J. Alm, Fangqiong Ling
PLoS Comput. Biol.2
2017 Concentration inequalities for empirical processes of linear time series
Likai Chen, Wei Biao Wu
J. Mach. Learn. Res.1
2013 Region duplication detection based on Harris corner points and step sector statistics
Likai Chen, Wei Lu 0001, Jiangqun Ni, Wei Sun 0007, Jiwu Huang
J. Vis. Commun. Image Represent.1