Researcher profile

Zhiming Huang

Zhiming Huang contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Machine Learning quant-ph

Trust snapshot

Quick read

Trust 17 - UnverifiedVerification L1Unclaimed author

4works

0followers

2topics

4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

preprint2026arXiv

Instance-Adaptive Online Multicalibration

We study online multicalibration beyond the worst-case. We give a single, efficient algorithm which dynamically interpolates between benign and worst-case sequences by adaptively refining a dyadic grid of prediction values. Its error is controlled by the number of leaves in the refinement tree. Our analysis recovers the known $\widetilde O(T^{2/3})$ worst-case-optimal rate for online multicalibration, while simultaneously automatically adapting to easier instances: in the marginal stochastic setting it obtains a rate of $\widetilde O(\sqrt T)$, and for piecewise-stationary means with $J$ segments its rate is $\widetilde O(\sqrt{JT})$. More generally, the rate depends on a threshold-complexity measure of the predictable mean process relative to the group family. We show that this dependence is tight up to logarithmic factors.

preprint2026arXiv

Worst-Case Regret Bounds for Combinatorial Thompson Sampling in Sleeping Semi-Bandits

We revisit combinatorial Thompson sampling (CTS) for semi-bandits with sleeping arms, where arm availability varies over time and actions must satisfy combinatorial constraints, as in wireless mesh routing with fluctuating link availability. Despite its practical relevance, CTS has been hindered by several long-standing problems: (i) the absence of worst-case regret guarantees in the semi-bandit setting even without sleeping arms, (ii) the lack of theory under adversarially varying availability, and (iii) the consistently weak empirical performance of CTS with Gaussian priors (CTS-G). This paper resolves these long-standing issues by providing the first worst-case regret analysis of CTS-G, proving an upper bound of $\tilde{O}(m\sqrt{NT})$ and a matching lower bound of $\tildeΩ(m\sqrt{NT})$. To bridge the gap between theory and practice, we further propose CL-SG, a simple CTS-G variant that samples a single shared Gaussian seed each round to coordinate exploration across arms. We show that CL-SG achieves an improved regret bound of $\tilde{O}(\sqrt{mNT})$, together with a matching lower bound $Ω(\sqrt{mNT})$. Experiments on real-world datasets demonstrate that CL-SG consistently outperforms strong baselines including CTS-G and CTS-B, and we open-source our implementation for reproducibility.

preprint2020arXiv

Quantum entanglement for atoms coupling to fluctuating electromagnetic field in the cosmic string spacetime

We investigate entanglement dynamics for two atoms coupling with fluctuating electromagnetic field in the cosmic string spacetime. We calculate the entanglement for different conditions. It is found that the entanglement behaviors are dependent on vacuum fluctuation, spacetime topology, two-atom separation and atomic polarization orientation. After a long time of evolution, entanglement would vanish, which means entanglement affected by electromagnetic fluctuation can not maintain for a long time. For different spacetime topologies, entanglement presents different behaviors dependent on various parameters. When deficit angle parameter $ν=1$ and atom-string distance is towards infinity, the results in flat spacetime are recovered. When atoms keep close to the string, entanglement can be improved; specially, when two atoms locate on the string and have no polarization of axial direction, atoms are not affected by the electromagnetic fluctuation and entanglement can remain unchanged. When two-atom separation is relatively large, entanglement exhibits oscillation behavior as atom-string distance varies. This indicates that the existence of string profoundly modifies on the vacuum fluctuation and atom-field interaction. In addition, when two-atom separation is small, entanglement gains better improvement. Many parameters and conditions provide us with greater freedom to control the entanglement behaviors. In principle, this is useful to sense the cosmic string spacetime topology structure and property, and discriminate different kinds of spacetime.

preprint2020arXiv

Thompson Sampling for Combinatorial Semi-bandits with Sleeping Arms and Long-Term Fairness Constraints

We study the combinatorial sleeping multi-armed semi-bandit problem with long-term fairness constraints~(CSMAB-F). To address the problem, we adopt Thompson Sampling~(TS) to maximize the total rewards and use virtual queue techniques to handle the fairness constraints, and design an algorithm called \emph{TS with beta priors and Bernoulli likelihoods for CSMAB-F~(TSCSF-B)}. Further, we prove TSCSF-B can satisfy the fairness constraints, and the time-averaged regret is upper bounded by $\frac{N}{2η} + O\left(\frac{\sqrt{mNT\ln T}}{T}\right)$, where $N$ is the total number of arms, $m$ is the maximum number of arms that can be pulled simultaneously in each round~(the cardinality constraint) and $η$ is the parameter trading off fairness for rewards. By relaxing the fairness constraints (i.e., let $η\rightarrow \infty$), the bound boils down to the first problem-independent bound of TS algorithms for combinatorial sleeping multi-armed semi-bandit problems. Finally, we perform numerical experiments and use a high-rating movie recommendation application to show the effectiveness and efficiency of the proposed algorithm.

Institution

Affiliation not imported yet

This author record came from a source that does not expose affiliation metadata. Once the author claims the profile or we enrich the record from another provider, this section will link to the concrete institution.

Topic footprint