Skip to content

Author

Cheng-Hua Liu

17 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Quantum Channel Stein's Lemma with an Exponential Strong Converse

We establish the quantum channel Stein lemma at every fixed type-I error tolerance in $(0,1)$ and prove an exponential strong converse under arbitrary adaptive strategies. For any finite-dimensional channel pair, the optimal type-II exponent equals the regularized channel relative entropy and is attained by parallel st...

Minbo Gao, Zheng-Feng Ji, Cheng-Hua Liu · 4 citations
Preprint Sep 2026

A Full Complexity Dichotomy for Complex-Valued Boolean Holant Problems

We prove a complexity dichotomy for Boolean Holant problems defined by arbitrary finite sets of algebraic complex-valued signatures. The tractable cases are characterized by an explicit, decidable criterion.

Cheng-Hua Liu, Bo-Ning Meng, Ju-Qiu Wang · 0 citations
Preprint Sep 2026

Cardinality-Constrained Randomized Assortments with Balanced Market Share

Assortment optimization asks a seller which of $n$ products to display to each customer. Under the multinomial-logit (MNL) model, a revenue-maximizing policy may concentrate most purchases on only a few products. Balanced market share (BMS) limits this disparity by requiring every product to receive either zero aggrega...

Xiaotie Deng, Han-Yu Li, Cheng-Hua Liu · 0 citations
Preprint Sep 2026

Flow-Matched Motion Priors: Online Optimal-Transport Rewards for Imitation Learning

Learning a motion prior requires a reward that guides a policy from its current behavior toward demonstrated motion. Adversarial Motion Priors (AMP) provide such a reward with a discriminator. However, adversarial objectives can become uninformative when policy and expert supports are far apart. A naive use of optimal...

Yi-Lin Zou, Cheng-Hua Liu, Cheng-Long Wu et al. · 0 citations
Preprint Sep 2026

Simultaneously Query-Optimal Quantum Linear-System Algorithm

Quantum linear-system algorithms access the coefficient matrix through a block-encoding oracle $U_A$ and the right-hand side through a state-preparation oracle $U_b$. The optimal query complexities of these two oracles are known separately: $O(\kappa\log(1/\varepsilon))$ queries to $U_A$ and $O(\kappa/s)$ queries to $U...

Minbo Gao, Zheng-Feng Ji, Cheng-Hua Liu · 0 citations
#natural language process... Preprint Oct 2026

MiMo-V2.6: Scaling Reinforcement Learning Towards Self-Improvement

The MiMo-V2.6 series is introduced, an omni-modal family that pushes the frontier of model intelligence by scaling RL compute by building infrastructure for mixed-task agentic RL, including a unified trajectory representation, high-concurrency multi-framework rollout, decoupled control and data planes, and training-inf...

Xiao-Zhen Qiao, Zi-Yue Hua, Zi-Rui Ou et al. · 10 citations
Preprint Sep 2026

Optimal Covariance Inflation under Gaussian Tilts

Covariance-sensitive analyses of Gaussian annealing for sampling from a convex body require controlling how much covariance can grow under a radial Gaussian tilt. For an isotropic convex body $K\subseteq\mathbb{R}^n$, let $\mu_{K,t} (\mathrm{d} x) \propto e^{-t\| x \| ^2} \mathbb{1}_K(x)\,\mathrm{d} x$, and let $Q_n$ b...

Minbo Gao, Zheng-Feng Ji, Cheng-Hua Liu · 0 citations
Preprint Sep 2026

Approximating Combinatorial Contracts with Arbitrary Costs

We study single-agent combinatorial contracts under linear payments. Under a reward share $\alpha\in[0,1]$, an agent chooses a subset $S$ of $n$ hidden actions, generating reward $f(S)$ at cost $c(S)$, to maximize $\alpha f(S)-c(S)$, while the principal receives $(1-\alpha)f(S)$. For nonnegative additive rewards and mo...

Xiaotie Deng, Han-Yu Li, Cheng-Hua Liu · 0 citations
Preprint Aug 2026

Lower Bounds for Domination-Type Problems Parameterized by Rank-Width

For graphs of rank-width \(w\), the algorithms of Bui-Xuan, Telle, and Vatshelle (\emph{Theor. Comput. Sci.}, 2013) for fixed finite/cofinite \((\sigma,\rho)\)-problems and of Bergougnoux and Kant\'e (\emph{SIAM J. Discrete Math.}, 2021) for Connected Dominating Set run in \(2^{O(w^2)}n^{O(1)}\) time. Bergougnoux, Korh...

Cheng-Hua Liu, Bo-Ning Meng · 0 citations
Preprint Sep 2026

A Generalized Stein Lemma for Quantum Channels

We prove a generalized quantum Stein lemma for parallel discrimination of an arbitrary finite-dimensional channel against families of alternative channels. The alternatives are compact and convex, closed under tensor products, and contain a faithful replacer. At every fixed type-I error tolerance, the optimal type-II e...

Minbo Gao, Zheng-Feng Ji, Cheng-Hua Liu · 1 citation
Preprint Sep 2026

Exact Hill Shares Are Simultaneous Guarantees

Fair division of indivisible bads seeks allocations that guarantee every agent a bundle whose cost is no larger than a meaningful fairness benchmark. The canonical minimax share has widely been used; unfortunately, it is not a simultaneous guarantee. Hill (Ann. Probab., 1987) initiated a complementary approach in which...

Bo Li, Han-Yu Li, Cheng-Hua Liu · 0 citations
Preprint Aug 2026

Bounded Relative Boundary Implies Narrow DNF Approximation

Friedgut conjectured that an increasing family in the $p$-biased discrete cube with bounded relative boundary can be approximated arbitrarily well by one whose minimal elements have bounded size, with a bound independent of the dimension and the bias (J. Amer. Math. Soc. 12 (1999)). We prove this conjecture by showing...

Cheng-Hua Liu, Bo-Ning Meng · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.