SearcharxivSearch

arXiv subjects

Hongyi Zhang

Publications and source records attributed to Hongyi Zhang.

At least 19 recordsLinked to original sources

Search-G1: Grounded Search Agents via Representation-Based Intrinsic Rewards

Search-augmented language agents should retrieve external information only when necessary and ground their answers in retrieved evidence. Existing external rewards provide either sparse outcome supervision or richer feedback from process annotations and LLM judges. Outcome rewards scale readily but cannot distinguish grounded retrieval from redundant search, whereas richer signals require costly annotation or inference during training. Internal rewards based on policy-side signals such as entropy, likelihood, or information gain are graded and inexpensive to evaluate, yet mainly reflect model confidence rather than evidence grounding. We propose Search-G1, a representation-based intrinsic reward framework that measures the operational grounding of an agent's answers through two intervention-calibrated readouts. A prompt-state readout predicts closed-book sufficiency, whose complement defines policy-relative retrieval necessity; an answer-commit readout estimates evidence reliance from answer-stage sensitivity to evidence deletion. Together, they provide additional credit to correct searched trajectories when retrieval is estimated necessary and the answer is evidence-sensitive, favor correct direct answers when closed-book knowledge suffices, and penalize repeated search. After calibration, reward scoring requires neither process annotations nor LLM-as-judge inference during policy optimization. Because reinforcement learning changes policy representations, Search-G1 periodically refits both readouts on trajectories from the latest checkpoint, allowing the reward to co-evolve with the policy. Experiments across multiple search-based question-answering benchmarks and two model scales show that Search-G1 improves the grounding--search-cost trade-off, producing shorter response-side trajectories at competitive task accuracy. Code is available at https://github.com/Rosy0912/Search-G1.

cs.CL

What are symmetric monoidal categories?

Symmetric monoidal categories have been understood since the 1960's and are central to many branches of mathematics. In particular, the construction of spectra from symmetric monoidal categories is at the heart of algebraic $K$-theory. This construction starts from either categories with an action by a suitable operad $\sP$ or with suitable functors from the category $\sF$ of finite sets to the category $\mathbf{Cat}$ of categories. Infinite loop space theory, which codifies these constructions, led to the invention of $\infty$-categories. So why the title? We shall prove that the $2$-category of symmetric monoidal categories is equivalent (in fact very nearly isomorphic) both to a $2$-category of $\sP$-pseudoalgebras and to an isomorphic $2$-category of strictly special $\sF$-pseudoalgebras. This equivalence underlies a streamlined equivariant and multiplicative enhancement of infinite loop space theory, but it should be of independent interest.

math.CT

Convex Relaxations for the Optimization of Markov Processes

In this paper, we study the problem of optimizing Markov processes that interpolate between two prescribed probability distributions while minimizing a given cost. The main computational challenge is the curse of dimensionality: in high-dimensional state spaces, representing the full distribution is intractable. To address this, we reformulate the problem in terms of sequential couplings and develop convex relaxations based on local marginals and cluster moments. These relaxations exploit locality and sparse interaction structure, provide computable lower bounds, and recover low-order statistics of the intermediate laws. We identify dynamic optimal transport as a special case of our Markov process optimization problem and develop a procedure for recovering the underlying Benamou--Brenier dynamics from the relaxed solution. We also show that the procedure extends to more general Markov processes and illustrate it with a constrained process between Ising models.

math.OC

Membership Inference for Contrastive Pre-training Models with Text-only PII Queries

Contrastive pretraining models such as CLIP and CLAP, serve as the ubiquitous perceptual backbones for modern multimodal large models, yet their reliance on web-scale data raises growing concerns about memorizing Personally Identifiable Information (PII). Auditing such models via membership inference is challenging in practice: shadow-model MIAs are computationally prohibitive for large multimodal backbones, and existing multimodal auditing methods typically require querying the target with paired biometric inputs, thereby directly exposing sensitive biometric information to the target model. To bypass this critical limitation, we demonstrate a highly desirable capability for privacy auditing: multimodal memorization within these foundational encoders can be accurately inferred using exclusively the text modality. We propose Unimodal Membership Inference Detector (UMID), a text-only auditing framework that performs text-guided cross-modal latent inversion and extracts two complementary signals, similarity (alignment to the queried text) and variability (consistency across randomized inversions). UMID compares these statistics to a lightweight non-member reference constructed from synthetic gibberish and makes decisions via an ensemble of unsupervised anomaly detectors. Comprehensive experiments across diverse CLIP and CLAP architectures demonstrate that UMID significantly improves the effectiveness and efficiency over prior MIAs, delivering strong detection performance with sub-second auditing cost using solely text queries, completely circumventing the need for biometric inputs and complying with strict privacy constraints.

cs.CR

Hecke curves in Frobenius strata of moduli space of rank 2 vector bundles

Let $k$ be an algebraically closed field with characteristic $2$, and let $X$ be a smooth projective algebraic curve of genus $g \geqslant 2$ over $k$. Let $\mathcal{M}^s_X(2,\mathcal{L})$ be the moduli space of rank $2$ stable vector bundles with determinant $\mathcal{L}$ on $X$. The Frobenius stratification measures the instability of bundles in $\mathcal{M}^s_X(r,\mathcal{L})$ under pullback by the Frobenius map. We show that there exists a Frobenius stratum in $\mathcal{M}^s_X(2,\mathcal{L})$ which is covered by Hecke curves.

math.AG

Global Parametric Gates for Multi-qubit Entanglement

We propose and experimentally demonstrate a global parametric gate that generates multi-qubit entangled states in a single step. By applying a parametric drive to a common qubit at precise detunings relative to computational qubits, we directly produce two-, three-, and four-qubit entanglement with state fidelities of 99.4\%\pm0.2\%, 93.4\%\pm0.3\%, and 91.4\%\pm0.3\%, respectively. This scheme enables efficient, reconfigurable control using only microwave drives and is compatible with fixed-frequency qubits. Error analyses indicate that infidelity stems primarily from decoherence and coherent control errors, with negligible contributions from static ZZ coupling and flux noise. Furthermore, simulations with state-of-the-art parameters predict this global gate can generate high-fidelity (99.70\%) entanglement in systems of up to six qubits.

quant-ph

EcoAlign: An Economically Rational Framework for Efficient LVLM Alignment

Large Vision-Language Models (LVLMs) exhibit powerful reasoning capabilities but suffer sophisticated jailbreak vulnerabilities. Fundamentally, aligning LVLMs is not just a safety challenge but a problem of economic efficiency. Current alignment methods struggle with the trade-off between safety, utility, and operational costs. Critically, a focus solely on final outputs (process-blindness) wastes significant computational budget on unsafe deliberation. This flaw allows harmful reasoning to be disguised with benign justifications, thereby circumventing simple additive safety scores. To address this, we propose EcoAlign, an inference-time framework that reframes alignment as an economically rational search by treating the LVLM as a boundedly rational agent. EcoAlign incrementally expands a thought graph and scores actions using a forward-looking function (analogous to net present value) that dynamically weighs expected safety, utility, and cost against the remaining budget. To prevent deception, path safety is enforced via the weakest-link principle. Extensive experiments across 3 closed-source and 2 open-source models on 6 datasets show that EcoAlign matches or surpasses state-of-the-art safety and utility at a lower computational cost, thereby offering a principled, economical pathway to robust LVLM alignment.

cs.AI

Superconducting Dome in $\mathrm{La}_{3-x}\mathrm{Sr}_{x}\mathrm{Ni}_{2}\mathrm{O}_{7-\delta}$ Thin Films

The ambient-pressure superconductivity in $\mathrm{La}_{3}\mathrm{Ni}_{2}\mathrm{O}_{7}$ thin films via compressive epitaxial strain provides a highly accessible platform for diverse characterization techniques, facilitating the studies of high-temperature superconductivity. Here, we systematically map the phase diagram and reveal the superconducting dome with an electron-hole crossover in compressively strained $\mathrm{La}_{3-x}\mathrm{Sr}_{x}\mathrm{Ni}_{2}\mathrm{O}_{7-\delta}$ thin films by simultaneously tuning Sr doping and oxygen content. The maximum transition temperature (${T}_{c}$) coincides with an anomalous sign change in the Hall coefficient (${R}_{H}$), reminiscent of electron-doped cuprates, which may signal a Fermi surface reconstruction. Beyond the superconducting dome, a $\ln1/T$ insulating regime and a $T$-linear resistivity regime are also resolved, resembling behaviors observed in cuprates and infinite-layer nickelates. This work reveals a dome-shaped relationship between ${T}_{c}$ and ${R}_{H}$ and establishes a key framework for understanding unconventional superconductivity in nickelate systems.

cond-mat.supr-con

Observation of superconductivity-induced leading-edge gap in Sr-doped $\mathrm{La}_{3}\mathrm{Ni}_{2}\mathrm{O}_{7}$ thin films

The discovery of high-temperature superconductivity in pressurized bulk $\mathrm{La}_{3}\mathrm{Ni}_{2}\mathrm{O}_{7}$ has ignited significant interest in nickelate superconductors. Unlike cuprates, where superconductivity predominantly originates from the $\mathrm{3}d_{x^2-y^2}$ orbital, nickelates exhibit additional complexities involving contributions from the $\mathrm{3}d_{z^2}$ orbital, prompting fundamental questions about their pairing mechanisms. Despite recent progress in stabilizing superconductivity in $\mathrm{La}_{3}\mathrm{Ni}_{2}\mathrm{O}_{7}$ thin films at ambient pressure, direct spectroscopic evidence of the superconducting gap opening remains elusive. Here, we present an in-situ angle-resolved photoemission spectroscopy study of Sr-doped superconducting $\mathrm{La}_{3}\mathrm{Ni}_{2}\mathrm{O}_{7}$ thin films. Fermi surface mapping reveals Ni-$\mathrm{3}d_{x^2-y^2}$-derived $\alpha$ and $\beta$ pockets, with orbital fillings of 0.11$\pm$0.02 electrons and 0.66$\pm$0.03 holes per Ni, respectively, resulting in a total of 0.45$\pm$0.04 electrons for each Ni. These bands exhibit moderate electron correlations, characterized by a band renormalization factor of 3-4. Notably, both $\alpha$ and $\beta$ bands exhibit leading-edge shifts across the superconducting transition, with gap magnitude of ~1-2 meV at Fermi momenta along the Brillouin zone diagonal and slightly away from the zone diagonal, deviating from the conventional $d_{x^2-y^2}$-wave gap structure. Additionally, the Ni-$\mathrm{3}d_{z^2}$-derived $\gamma$ band lies ~75 meV below the Fermi level, indicating a $\mathrm{3}d_{x^2-y^2}$-dominated fermiology in this compound.

cond-mat.supr-con

Superconductivity and phase diagram in Sr-doped La$_{3-x}$Sr$_{x}$Ni$_2$O$_7$ thin films

Recent studies have demonstrated ambient pressure superconductivity in compressively strained La$_{3}$Ni$_{2}$O$_{7}$ thin films, yet the phase diagram of heterovalent doping$-$critical for advancing the field$-$remains unexplored. Here, we report superconductivity in Sr$^{2+}$-doped La$_{3-x}$Sr$_{x}$Ni$_2$O$_7$ films synthesized via molecular beam epitaxy with ozone-assisted post-annealing. The superconducting transition temperature ($T_{\mathrm{c}}$) follows an asymmetric dome-like profile, persisting across a wide doping range ($0 \leq x \leq 0.21$) before diminishing at $x \approx 0.38$. Optimally doped films ($x = 0.09$) achieve $T_{\mathrm{c}}$ of $\sim$ 42 K, with high critical current ($J_{\mathrm{c}} > 1.4$ $\mathrm{kA/cm^{2}}$ at 2 K) and upper critical fields ($\mu_{0}H_{\mathrm{c,\parallel}}(0)= 83.7$ $\mathrm{T}$, $\mu_{0}H_{\mathrm{c,\perp}}(0)= 110.3$ $\mathrm{T}$), comparable to reported La$_{3-x}$Pr$_{x}$Ni$_2$O$_7$ films. Scanning transmission electron microscopy reveals oxygen vacancies predominantly occupy at planar NiO$_{2}$ sites$-$unlike apical-site vacancies in bulk samples$-$due to Coulomb repulsion destabilizing planar oxygen under compressive strain. Additionally, the elongated out-of-plane Ni-O bonds, exceeding those in pressurized bulk samples by $4\%$, likely weaken the interlayer $d_{z^2}$ coupling, thus contributing to the reduced $T_{\mathrm{c}}$ in strained films. This work establishes heterovalent Sr$^{2+}$ doping as a robust tuning parameter for nickelate superconductivity, unveiling a unique phase diagram topology.

cond-mat.supr-con

Scalable Low-overhead Superconducting Non-local Coupler with Exponentially Enhanced Connectivity

Quantum error correction codes with non-local connections such as quantum low-density parity-check (qLDPC) incur lower overhead and outperform surface codes on large-scale devices. These codes are not applicable on current superconducting devices with nearest-neighbor connections. To rectify the deficiency in connectivity of superconducting circuit system, we experimentally demonstrate a convenient on-chip coupler of centimeters long and propose an extra coupler layer to map the qubit array to a binary-tree connecting graph. This mapping layout reduces the average qubit entangling distance from O(N) to O(logN), demonstrating an exponentially enhanced connectivity with eliminated crosstalk. The entangling gate with the coupler is performed between two fluxonium qubits, reaching a fidelity of 99.37 % while the system static ZZ rate remains as low as 144 Hz without active cancellation or circuit parameter targeting. With the scalable binary tree structure and high-fidelity non-local entanglement, novel quantum algorithms can be implemented on the superconducting qubit system, positioning it as a strong competitor to other physics systems regarding circuit connectivity.

quant-ph

A New Class of Geometrically Defined Hypergraphs Arising from the Hadwiger Nelson Problem

There is a famous problem in geometric graph theory to find the chromatic number of the unit distance graph on Euclidean space; it remains unsolved. A theorem of Erdos and De-Bruijn simplifies this problem to finding the maximum chromatic number of a finite unit distance graph. Via a construction built on sequential finite graphs obtained from a generalization of this theorem, we have found a class of geometrically defined hypergraphs of arbitrarily large edge cardinality, whose proper colorings exactly coincide with the proper colorings of the unit distance graph on $\mathbb R^d$. We also provide partial generalizations of this result to arbitrary real normed vector spaces.

math.CO

Quantum state transfer between superconducting cavities via exchange-free interactions

We propose and experimentally demonstrate a novel protocol for transferring quantum states between superconducting cavities using only continuous two-mode squeezing interactions, without exchange of photonic excitations between cavities. This approach conceptually resembles quantum teleportation, where quantum information is transferred between different nodes without directly transmitting carrier photons. In contrast to the discrete operations of entanglement and Bell-state measurement in teleportation, our scheme is symmetric and continuous. We experimentally realize coherent and bidirectional transfer of arbitrary quantum states, including bosonic quantum error correction codes. Our results offer new insights into the quantum state transfer and quantum teleportation. In particular, our demonstration validates a new approach to realize quantum transducers, and might find applications in a wide range of physical platforms.

quant-ph

Skin effect in Non-Hermitian systems with spin

The skin effect, where bulk modes collapse into boundary modes, is a key phenomenon in topological non-Hermitian systems, has been predominantly studied in spinless systems. Recent studies illustrate the magnetic suppression of the first-order skin effect while ignoring spin. However, the physical significance of a magnetic field in non-Hermitian skin effect with spin remains elusive. Here, we systematically explore non-Hermitian spinful systems based on generalized Hatano-Nelson models with SU(2) gauge potential fields. In an open one-dimensional lattice, the spin-up and spin-down states can be uniquely separated and localized at the two boundaries without magnetic field. When an external magnetic field is applied, the skin effect exhibits a smooth transition from bidirectional to unidirectional. Remarkably, we demonstrate that the first-order skin effect can be anomalously induced by a magnetic field in a topologically trivial non-Hermitian spinful system without any skin effect at zero field. The direction of such magnetically induced skin modes can be controlled by simply changing the amplitude and polarity of the magnetic field. In addition, we demonstrate a transition between non-Bloch PT and anti-PT symmetries in the system, and uncover the spindependent mechanism of non-Bloch PT symmetry. Our results pave the way for the investigation of non-Hermitian skin effect with spin degrees of freedom.

cond-mat.mes-hall

Re-localization acceleration with Medoid Silhouette Clustering

Two crucial performance criteria for the deployment of visual localization are speed and accuracy. Current research on visual localization with neural networks is limited to examining methods for enhancing the accuracy of networks across various datasets. How to expedite the re-localization process within deep neural network architectures still needs further investigation. In this paper, we present a novel approach for accelerating visual re-localization in practice. A tree-like search strategy, built on the keyframes extracted by a visual clustering algorithm, is designed for matching acceleration. Our method has been validated on two tasks across three public datasets, allowing for 50 up to 90 percent time saving over the baseline while not reducing location accuracy.

cs.CV

Keep the Cost Down: A Review on Methods to Optimize LLM' s KV-Cache Consumption

Large Language Models (LLMs), epitomized by ChatGPT's release in late 2022, have revolutionized various industries with their advanced language comprehension. However, their efficiency is challenged by the Transformer architecture's struggle with handling long texts. KV Cache has emerged as a pivotal solution to this issue, converting the time complexity of token generation from quadratic to linear, albeit with increased GPU memory overhead proportional to conversation length. With the development of the LLM community and academia, various KV Cache compression methods have been proposed. In this review, we dissect the various properties of KV Cache and elaborate on various methods currently used to optimize the KV Cache space usage of LLMs. These methods span the pre-training phase, deployment phase, and inference phase, and we summarize the commonalities and differences among these methods. Additionally, we list some metrics for evaluating the long-text capabilities of large language models, from both efficiency and capability perspectives. Our review thus sheds light on the evolving landscape of LLM optimization, offering insights into future advancements in this dynamic field. Links to the papers mentioned in this review can be found in our Github Repo https://github.com/zcli-charlie/Awesome-KV-Cache.

cs.CL

A cryogenic on-chip microwave pulse generator for large-scale superconducting quantum computing

For superconducting quantum processors, microwave signals are delivered to each qubit from room-temperature electronics to the cryogenic environment through coaxial cables. Limited by the heat load of cabling and the massive cost of electronics, such an architecture is not viable for millions of qubits required for fault-tolerant quantum computing. Monolithic integration of the control electronics and the qubits provides a promising solution, which, however, requires a coherent cryogenic microwave pulse generator that is compatible with superconducting quantum circuits. Here, we report such a signal source driven by digital-like signals, generating pulsed microwave emission with well-controlled phase, intensity, and frequency directly at millikelvin temperatures. We showcase high-fidelity readout of superconducting qubits with the microwave pulse generator. The device demonstrated here has a small footprint, negligible heat load, great flexibility to operate, and is fully compatible with today's superconducting quantum circuits, thus providing an enabling technology for large-scale superconducting quantum computers.

quant-ph

RAG-Enhanced Commit Message Generation

Commit message is one of the most important textual information in software development and maintenance. However, it is time-consuming to write commit messages manually. Commit Message Generation (CMG) has become a research hotspot. Recently, several pre-trained language models (PLMs) and large language models (LLMs) with code capabilities have been introduced, demonstrating impressive performance on code-related tasks. Meanwhile, prior studies have explored the utilization of retrieval techniques for CMG, but it is still unclear what effects would emerge from combining advanced retrieval techniques with various generation models. This paper proposed REACT, a REtrieval-Augmented framework for CommiT message generation. It integrates advanced retrieval techniques with different PLMs and LLMs, to enhance the performance of these models on the CMG task. Specifically, a hybrid retriever is designed and used to retrieve the most relevant code diff and commit message pair as an exemplar. Then, the retrieved pair is utilized to guide and enhance the CMG task by PLMs and LLMs through fine-tuning and in-context learning. The experimental results show that REACT significantly enhances these models' performance on the CMG task, improving the BLEU score of CodeT5 by up to 55%, boosting Llama 3's BLEU score by 102%, and substantially surpassing all baselines.

cs.SE