arXiv subjects

Zhengqing Zhou

Publications and source records attributed to Zhengqing Zhou.

8 recordsLinked to original sources

arXiv2026

Sequential Batch Learning in Finite-Action Linear Contextual Bandits

We study the sequential batch learning problem in linear contextual bandits with finite action sets, where the decision maker is constrained to split incoming individuals into (at most) a fixed number of batches and can only observe outcomes for the individuals within a batch at the batch's end. Compared with both standard online contextual-bandit learning and offline policy learning in contextual bandits, this sequential batch learning problem provides a finer-grained formulation of many personalized sequential decision making problems in practical applications, including medical treatment in clinical trials, product recommendation in e-commerce and adaptive experiment design in crowdsourcing. We study two settings of the problem: one where the contexts are arbitrarily generated and the other where the context vectors are mutually independent across actions and time and follow a common Gaussian distribution. In each setting, we establish a regret lower bound and provide an algorithm, whose regret upper bound nearly matches the lower bound. As an important insight revealed therefrom, in the former setting, we show that the number of batches required to achieve the fully online performance is polynomial in the time horizon, while for the latter setting, a pure-exploitation algorithm with a judicious batch partition scheme achieves the fully online performance even when the number of batches is less than logarithmic in the time horizon. In the stochastic context setting, we additionally provide tight margin-based (i.e. instance-dependent) upper and lower regret bounds that delineate performance in terms of how difficult the problem instance is. Together, our results provide a near-complete characterization of sequential decision making in linear contextual bandits when batch constraints are present.

cs.LG↗

arXiv2026

Sharp small-deviation inequalities for sums of independent nonnegative random variables

Let $(X_1,\ldots,X_n)$ be independent nonnegative random variables with $\mathbb{E} X_i\le1$, and write $S=\sum_iX_i$. For $δ>0$, we prove that \[ \mathbb{P}\left(S<\mathbb{E} S+δ\right)\ge b_{n,δ}, \] where $b_{n,δ}=δ(n/(n+δ))^n$ for $0<δ<1$ and $b_{n,δ}=(1-1/(n+δ))^n$ for $δ\ge1$. The bound is sharp for every $n$ and $δ\ge 1$. In particular, since $b_{n,δ} \ge e^{-1}$ for $δ\ge 1$, our result proves Feige's conjecture [Feige, 2004] in the affirmative for $δ\ge 1$. The proof is found by ChatGPT 5.6 Pro. It combines the exact Dirichlet calibration theorem of Vlassis and Thomas [Vlassis and Thomas, 2026], which resolves Gaffke's conjecture in statistics, with results in convex geometry including Grünbaum's centroid theorem [Grünbaum, 1960] and its generalization by Letwin and Yaskin [Letwin and Yaskin, 2024].

math.PR↗

arXiv2022

Unbiased Optimal Stopping via the MUSE

We propose a new unbiased estimator for estimating the utility of the optimal stopping problem. The MUSE, short for Multilevel Unbiased Stopping Estimator, constructs the unbiased Multilevel Monte Carlo (MLMC) estimator at every stage of the optimal stopping problem in a backward recursive way. In contrast to traditional sequential methods, the MUSE can be implemented in parallel. We prove the MUSE has finite variance, finite computational complexity, and achieves $ε$-accuracy with $O(1/ε^2)$ computational cost under mild conditions. We demonstrate MUSE empirically in an option pricing problem involving a high-dimensional input and the use of many parallel processors.

stat.CO↗

arXiv2021

Distributionally Robust Martingale Optimal Transport

We study the problem of bounding path-dependent expectations (within any finite time horizon $d$) over the class of discrete-time martingales whose marginal distributions lie within a prescribed tolerance of a given collection of benchmark marginal distributions. This problem is a relaxation of the martingale optimal transport (MOT) problem and is motivated by applications to super-hedging in financial markets. We show that the empirical version of our relaxed MOT problem can be approximated within $O\left( n^{-1/2}\right)$ error where $n$ is the number of samples of each of the individual marginal distributions (generated independently) and using a suitably constructed finite-dimensional linear programming problem.

math.PR↗

arXiv2021

Optimal Communication Rates and Combinatorial Properties for Common Randomness Generation

We study common randomness generation problems where $n$ players aim to generate same sequences of random coin flips where some subsets of the players share an independent common coin which can be tossed multiple times, and there is a publicly seen blackboard through which the players communicate with each other. We provide a tight representation of the optimal communication rates via linear programming, and more importantly, propose explicit algorithms for the optimal distributed simulation for a wide class of hypergraphs. In particular, the optimal communication rate in complete hypergraphs is still achievable in sparser hypergraphs containing a path-connected cycle-free cluster of topologically connected components. Some key steps in analyzing the upper bounds rely on two different definitions of connectivity in hypergraphs, which may be of independent interest.

cs.IT↗

arXiv2021

Model-based cellular kinetic analysis of SARS-CoV-2 infection: different immune response modes and treatment strategies

Increasing number in global COVID-19 cases demands for mathematical model to analyze the interaction between the virus dynamics and the response of innate and adaptive immunity. Here, based on the assumption of a weak and delayed response of the innate and adaptive immunity in SARS-CoV-2 infection, we constructed a mathematical model to describe the dynamic processes of immune system. Integrating theoretical results with clinical COVID-19 patients' data, we classified the COVID-19 development processes into three typical modes of immune responses, correlated with the clinical classification of mild & moderate, severe and critical patients. We found that the immune efficacy (the ability of host to clear virus and kill infected cells) and the lymphocyte supply (the abundance and pool of naïve T and B cell) play important roles in the dynamic process and determine the clinical outcome, especially for the severe and critical patients. Furthermore, we put forward possible treatment strategies for the three typical modes of immune response. We hope our results can help to understand the dynamical mechanism of the immune response against SARS-CoV-2 infection, and to be useful for the treatment strategies and vaccine design.

q-bio.PE↗

arXiv2020

Multivariate Distributionally Robust Convex Regression under Absolute Error Loss

This paper proposes a novel non-parametric multidimensional convex regression estimator which is designed to be robust to adversarial perturbations in the empirical measure. We minimize over convex functions the maximum (over Wasserstein perturbations of the empirical measure) of the absolute regression errors. The inner maximization is solved in closed form resulting in a regularization penalty involves the norm of the gradient. We show consistency of our estimator and a rate of convergence of order $ \widetilde{O}\left( n^{-1/d}\right) $, matching the bounds of alternative estimators based on square-loss minimization. Contrary to all of the existing results, our convergence rates hold without imposing compactness on the underlying domain and with no a priori bounds on the underlying convex function or its gradient norm.

math.ST↗

arXiv2019

Batched Multi-armed Bandits Problem

In this paper, we study the multi-armed bandit problem in the batched setting where the employed policy must split data into a small number of batches. While the minimax regret for the two-armed stochastic bandits has been completely characterized in \cite{perchet2016batched}, the effect of the number of arms on the regret for the multi-armed case is still open. Moreover, the question whether adaptively chosen batch sizes will help to reduce the regret also remains underexplored. In this paper, we propose the BaSE (batched successive elimination) policy to achieve the rate-optimal regrets (within logarithmic factors) for batched multi-armed bandits, with matching lower bounds even if the batch sizes are determined in an adaptive manner.

stat.ML↗