Zhaoqi Li

Zhaoqi Li

Auto-generated profile, based on publicly available information

Zhaoqi Li

Department of Statistics University of Washington

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
5 April 2019 in The Electronic Journal of Combinatorics
Verified
Journal Article
Open access
PDF file
YGYibo Gao
Yibo Gao
ZLZhaoqi Li
Zhaoqi Li
TVThuy-Duong Vuong
Thuy-Duong Vuong
LYLisa Yang
Lisa Yang
Brane tilings are infinite, bipartite, periodic, planar graphs that are dual to quivers. In this paper, we study the del Pezzo 2 (dP$_2$) quiver and its associated brane tiling which arise in theoretical physics. Specifically, we prove explicit formulas for all cluster variables generated by toric mutation sequences of the dP$_2$ quiver. Moreover, we associate a subgraph of the dP$_2$ brane tiling to each toric cluster variable such that the sum of weighted perfect matchings of the subgraph equals the Laurent polynomial of the cluster variable.

21 August 2020 in medRxiv
Verified
Preprint
Open access
PDF file
JRJennifer A. Rathe
Jennifer A. Rathe
EHEmily A. Hemann
Emily A. Hemann
JEJulie Eggenberger
Julie Eggenberger
ZLZhaoqi Li
Zhaoqi Li
MKMegan L. Knoll
Megan L. Knoll
MGMichael Gale
Michael Gale
Background: To determine how serologic antibody testing outcome links with virus neutralization of SARS-CoV-2 to ascertain immune protection status, we evaluated a unique set of individuals for SARS-CoV-2 antibody detection and viral neutralization. Methods: Herein, we compare several analytic platforms with 15 positive and 30 negative SARS-CoV-2 infected controls followed by viral neutralization assessment. We then applied these platforms in a clinically relevant population: 114 individuals with unknown histories of SARS-CoV-2 infection. Results: In control populations, the best performing antibody detection assays were SARS-CoV-2 receptor binding domain (RBD) IgG (specificity 87%, sensitivity 100%, PPV 100%, NPV 93%), spike IgG3 (specificity 93%, sensitivity 97%, PPV 93%, NPV 97%), and nucleocapsid (NP) protein IgG (specificity 93%, sensitivity 97%, PPV 93%, NPV 97%). Neutralization of positive and negative control sera showed 100% agreement. 20 unknown individuals had detectable SARS-CoV-2 antibodies with 16 demonstrating virus neutralization. The antibody assays that best predicted virus neutralization were RBD IgG (misidentified 2), spike IgG3 (misidentified 1), and NP IgG (misidentified 2). Conclusion: These data suggest that meaningful evaluation of antibody assay performance requires testing in an unknown population. Further, these results indicate coupling of virus neutralization analysis to a positive antibody test is required to categorize patients based on SARS-CoV-2 immune protection status following virus exposure or vaccine administration. One of the antibody detection platforms identified in this study followed by the pseudoneutralization or focus reduction assay would provide a practical testing strategy to assess for SARS-CoV-2 antibodies with optimal prediction of correlates to neutralizing immunity. Funding: Supported by NIH grants AI148684, AI151698, AI145296, and UW funds to the Center for Innate Immunity and Immune Disease.

24 October 2023 in arXiv
Verified
Preprint
Open access
PDF file
ZLZhaoqi Li
Zhaoqi Li
KJKevin Jamieson
Kevin Jamieson
LJLalit Jain
Lalit Jain
Given a set of arms $\mathcal{Z}\subset \mathbb{R}^d$ and an unknown parameter vector $θ_\ast\in\mathbb{R}^d$, the pure exploration linear bandit problem aims to return $\arg\max_{z\in \mathcal{Z}} z^{\top}θ_{\ast}$, with high probability through noisy measurements of $x^{\top}θ_{\ast}$ with $x\in \mathcal{X}\subset \mathbb{R}^d$. Existing (asymptotically) optimal methods require either a) potentially costly projections for each arm $z\in \mathcal{Z}$ or b) explicitly maintaining a subset of $\mathcal{Z}$ under consideration at each time. This complexity is at odds with the popular and simple Thompson Sampling algorithm for regret minimization, which just requires access to a posterior sampling and argmax oracle, and does not need to enumerate $\mathcal{Z}$ at any point. Unfortunately, Thompson sampling is known to be sub-optimal for pure exploration. In this work, we pose a natural question: is there an algorithm that can explore optimally and only needs the same computational primitives as Thompson Sampling? We answer the question in the affirmative. We provide an algorithm that leverages only sampling and argmax oracles and achieves an exponential convergence rate, with the exponent being the optimal among all possible allocations asymptotically. In addition, we show that our algorithm can be easily implemented and performs as well empirically as existing asymptotically optimal methods.

8 January 2024 in arXiv
Verified
Preprint
Open access
PDF file
ZLZhaoqi Li
Zhaoqi Li
HNHoussam Nassif
Houssam Nassif
ALAlex Luedtke
Alex Luedtke
In policy learning, the goal is typically to optimize a primary performance metric, but other subsidiary metrics often also warrant attention. This paper presents two strategies for evaluating these subsidiary metrics under a policy that is optimal for the primary one. The first relies on a novel margin condition that facilitates Wald-type inference. Under this and other regularity conditions, we show that the one-step corrected estimator is efficient. Despite the utility of this margin condition, it places strong restrictions on how the subsidiary metric behaves for nearly optimal policies, which may not hold in practice. We therefore introduce alternative, two-stage strategies that do not require a margin condition. The first stage constructs a set of candidate policies and the second builds a uniform confidence interval over this set. We provide numerical simulations to evaluate the performance of these methods in different scenarios.