Huiming Zhang

Dr. Huiming Zhang

1. Faculty of Science and Technology, University of Macau, Avenida da Universidade, Taipa, Macau, China
+1

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
27 June 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
HZHuiming Zhang
Huiming Zhang
HWHaoyu Wei
Haoyu Wei
Constant-specified and exponential concentration inequalities play an essential role in the finite-sample theory of machine learning and high-dimensional statistics area. We obtain sharper and constants-specified concentration inequalities for the sum of independent sub-Weibull random variables, which leads to a mixture of two tails: sub-Gaussian for small deviations and sub-Weibull for large deviations from the mean. These bounds are new and improve existing bounds with sharper constants. In addition, a new sub-Weibull parameter is also proposed, which enables recovering the tight concentration inequality for a random variable (vector). For statistical applications, we give an ℓ2-error of estimated coefficients in negative binomial regressions when the heavy-tailed covariates are sub-Weibull distributed with sparse structures, which is a new result for negative binomial regressions. In applying random matrices, we derive non-asymptotic versions of Bai-Yin’s theorem for sub-Weibull entries with exponential tail bounds. Finally, by demonstrating a sub-Weibull confidence region for a log-truncated Z-estimator without the second-moment condition, we discuss and define the sub-Weibull type robust estimator for independent observations {Xi}i=1n without exponential-moment conditions.

1 January 2020 in Statistics and Its Interface
Verified
Journal Article
Open access
PDF file
YFYifan Fan
Yifan Fan
HZHuiming Zhang
Huiming Zhang
QWQiuping Wang
Qiuping Wang
International Press of Boston - publishers of scholarly mathematical and scientific journals and books

24 December 2020 in Acta Mathematica Scientia
Verified
Journal Article
Closed access
PDF file
HHHuamei Huang
Huamei Huang
YGYujing Gao
Yujing Gao
HZHuiming Zhang
Huiming Zhang
BLBo Li
Bo Li

10 February 2019 in Communications in Statistics - Theory and Methods
Verified
Journal Article
Closed access
BLBo Li
Bo Li
HZHuiming Zhang
Huiming Zhang
JHJiao He
Jiao He
Starting with a literature review for theoretical properties of COM-Poisson distributions, this paper proposes some new characterizations of COM-Poisson random variables. First, we extend the Moran-Chatterji characterization and generalize the Rao-Rubin characterization of Poisson distribution to COM-Poisson distribution. Then, we define the COM-type discrete r.v. Xν of the discrete random variable X. The probability mass function of Xν has a link to the Rényi entropy and Tsallis entropy of order ν of X. And then we can get the characterization of Stam inequality for COM-type discrete version Fisher information. By using the recurrence formula, the property that COM-Poisson random variables ( ν≠1) is not closed under addition is obtained. Finally, under the property of “not closed under addition” of COM-Poisson random variables, a new characterization of Poisson distribution is found.

1 August 2018 in Frontiers of Mathematics in China
Verified
Journal Article
Closed access
PDF file
HZHuiming Zhang
Huiming Zhang
KTKai Tan
Kai Tan
BLBo Li
Bo Li

18 February 2025 in Mathematics
Verified
Journal Article
Open access
PDF file
PZPengjie Zhou
Pengjie Zhou
HWHaoyu Wei
Haoyu Wei
HZHuiming Zhang
Huiming Zhang
Reinforcement Learning (RL) is a widely researched area in artificial intelligence that focuses on teaching agents decision-making through interactions with their environment. A key subset includes multi-armed bandit (MAB) and stochastic continuum-armed bandit (SCAB) problems, which model sequential decision-making under uncertainty. This review outlines the foundational models and assumptions of bandit problems, explores non-asymptotic theoretical tools like concentration inequalities and minimax regret bounds, and compares frequentist and Bayesian algorithms for managing exploration–exploitation trade-offs. Additionally, we explore K-armed contextual bandits and SCAB, focusing on their methodologies and regret analyses. We also examine the connections between SCAB problems and functional data analysis. Finally, we highlight recent advances and ongoing challenges in the field.