Searcharxiv⌕ Search

arXiv subjects

John Yuehan Zhang

Publications and source records attributed to John Yuehan Zhang.

2 recordsLinked to original sources

What Should We Ask Next? Retrieval-Aware Question Learning for Interactive ReID

Interactive retrieval with partial evidence constitutes a sequential information-acquisition problem: an agent must choose questions that acquire useful evidence for the next retrieval update. Existing systems train this decision by imitating an offline ordering of candidate QA pairs. However, a question's value depends on the response it elicits and its downstream effect on retrieval. We establish that candidate discriminativeness and perceived usefulness provide weak supervision for this objective, then introduce RAVEL, a retrieval-aware online reinforcement learning framework for interactive person re-identification. RAVEL initializes from supervised question generation, observes the current Top-4 candidates directly, and optimizes the question policy with rank feedback from the full question-answer-retrieval loop. Experiments on Interactive-PEDES show that RAVEL delivers progressively stronger retrieval performance across five interaction rounds. Further analysis shows that RAVEL allocates more of its interaction budget to localized open-ended prompts targeting specific attributes.

cs.AI↗

CircLS: Compiling Lattice Surgery to Physical Circuits with Dynamic Allocation

In fault-tolerant quantum computing, lattice surgery (LS) is one of the leading ways to realize logical operations, and the Pauli product measurement (PPM) is the basic instruction of LS-based computing. Compilers that work on the PPM sequence, however, stay at the logical level rather than the physical circuit level. This is because lowering PPMs from the logical level to physical circuits is complicated. CircLS is a full-stack lattice surgery compiler: it compiles a quantum program through its PPM sequence to a Stim circuit, lowering every PPM through linear-time stabilizer construction rules. On this basis, we develop a compiler that allocates data patches dynamically: each patch is allocated at its first use and freed at its last use, and the freed tiles can be reused as ancilla paths. Against the two baselines, CircLS reduces the allocated spacetime volume by 34% and 27% and the logical error rate (LER) by 40% and 48%, and it compiles programs that they cannot. CircLS is open source at https://github.com/John-YuehanZhang/CircLS

quant-ph↗