SearcharxivSearch

arXiv subjects

Wei Zheng

Publications and source records attributed to Wei Zheng.

At least 19 recordsLinked to original sources

Knowledge-Data-Dual-Driven Reinforcement Learning for Autonomous Vehicle Control in Mixed Traffic

In mixed traffic, decision-making for autonomous vehicles (AVs) confronts three interrelated challenges. First, physics-based priors incorporated into reinforcement learning (RL) models fail to capture latent interactive vehicle intentions and diverse driver behaviors, limiting the proactive reasoning capabilities. Second, abrupt maneuvers by surrounding vehicles cause non-stationarity, leaving long-tail safety events under-explored. Third, hybrid action spaces destabilize unified RL training due to the different temporal scales of continuous car-following and discrete lane-changing maneuvers. To address these issues, we propose Knowledge-Data Dual-driven Reinforcement Learning (KDDRL). First, a conditional deep generative model synthesizes intention-aware future trajectories, converting passive perception into proactive predictive states. Second, a knowledge-data dual-driven paradigm operates on these predictive states, fusing probabilistic data-driven insights with physical constraints to guide safe exploration through safety-critical scenarios. Third, a coupling module compresses both intention-aware trajectories and physical constraints into compact shared embeddings. This unified representation enables asynchronous multi-timescale optimization of continuous car-following and discrete lane-changing while preserving mutual information. Evaluations on dataset-calibrated simulations demonstrate that KDDRL effectively handles intention uncertainty, accelerates training convergence, and outperforms conventional baseline methods in terms of safety, efficiency, and comfort.

cs.RO

Visual Geometry Foundation-Aware Gaussians for Single-Frame Surround-View Driving Reconstruction

Single-frame surround-view reconstruction faces severe geometric instability and rendering artifacts due to minimal inter-camera overlap. While existing methods rely on complex decoders or auxiliary cues, they remain bottlenecked by the weak geometric capacity of upstream features. We argue that leveraging pretrained visual geometry priors strengthens upstream representations and alleviates the geometric ambiguity in sparse surround views. To this end, we propose VGGD, a visual geometry foundation-aware 3D Gaussian Splatting framework for feed-forward surround-view driving reconstruction, which shifts geometric modeling to the frontend and adapts foundation priors to the driving camera setting. First, VGGD leverages VGGT to provide transferable multi-view geometric prior tokens. Next, we introduce a Dual-Path Neck to decouple geometry-consistent and appearance-aware representations, improving appearance completion in weakly observed regions. We further apply Scale Warmup to stabilize early geometry learning and suppress scale drift under ego-pose changes. Finally, we use a hybrid pixel--volume Gaussian decoder to produce a renderable 3D Gaussian scene for novel-view synthesis. Experiments on the nuScenes single-frame benchmark show that VGGD achieves the best overall rendering quality among the compared methods and improves relative geometric consistency.

cs.CV

On minimally 1-tough $(K_1\cup P_4)$-free graphs

Agraph G is minimally t-tough if the toughness of G is t and the deletion of any edge from G decreases its toughness, where t is a positive real number. It is conjectured that every $(K_1\cup P_4)$-free 1-tough graph is hamiltonian. In this paper, we characterize the structure of minimally 1-tough $(K_1\cup P_4)$-free graphs, and thus show that the above conjecture is true for minimally 1-tough graphs. Furthermore, it is also proved that the Kriesell's conjecture which states that each minimally 1-tough graph has a vertex of degree 2 holds for minimally 1-tough $(K_1\cup P_4)$-free graphs.

math.CO

Hierarchical Variational Kalman Filtering

Traditional variational Kalman filtering with unknown noise statistics suffers from inconsistent process covariance estimation and slow convergence speed, limiting its practical utility. To address these issues, we introduce a surrogate variable representing the process-noise-free state, which enables explicit modeling and inference of process noise statistics. In addition, we reformulate the conventional coordinate ascent variation inference (CAVI) as a marginalized maximum a posteriori problem, followed by a single-step hyperparameter fitting. This reformulation obviates the need for multiple inner iterations inherent to CAVI and decouples the design of the covariance tracking filters. Consequently, this architecture permits the deployment of higher-order filters for covariance tracking and enables sliding-window hyperparameter estimation. Notably, when this window encompasses all historical data, the covariance tracking estimator intrinsically operates as a zero-phase filter. Numerical simulations validate the theoretical framework, demonstrating the enhanced convergence speed and superior estimation accuracy compared with existing methods.

stat.ML

Experiment-free disruption prediction for new devices enabled by synthetic diagnostic data augmentation

Deep learning based approaches have shown great promise in cross-device disruption prediction for tokamaks, however, the robustness of these models heavily relies on massive amounts of training data. For the upcoming ITER, to ensure the safety of the first plasma and subsequent operations, experimental data should be entirely unavailable initially, and disruptive discharges should be strictly avoided thereafter. This extreme data scarcity inherently conflicts with the data-intensive nature of deep learning algorithms. To address this challenge, we utilize synthetic diagnostic signals from the target device to supplement the experimental data from existing devices for the zero-shot disruption prediction on a new device. The detailed implementation pipeline of this scheme is presented. For experimental validation, a predictive model trained on data from the EAST tokamak is deployed for a zero-shot cross-device experiment on the J-TEXT tokamak. A synthetic diagnostic framework, configured with the diagnostic parameters of the target device, is developed to process NIMROD magnetohydrodynamic (MHD) simulation data based on the target device's magnetic configuration, thereby achieving effective data augmentation. Ultimately, the results demonstrate that by integrating the target device's synthetic diagnostic data with Fourier Domain Adaptation, the zero-shot accurate early warning rate of the model on 1,596 J-TEXT discharges is improved from 50% to 57%, while exhibiting enhanced predictive robustness.

physics.plasm-ph

Indexing the Unreadable: LLM-Native Recursive Construction and Search of Service Taxonomies

The era of the Internet of Agents (IoA) is taking shape: LLM agents are expected to fulfill user goals by orchestrating fast-growing populations of Model Context Protocol (MCP) servers, Agent-to-Agent (A2A) endpoints, reusable skills, and other LLM-callable services. Yet LLMs face a structural mismatch with this regime: effective context is a scarce resource that does not scale with the number of services. Concatenating thousands of service descriptions into a prompt overflows the context window, and even when the window is large enough, models systematically under-attend to information in the middle of long inputs, the well-documented Lost-in-the-Middle phenomenon. This is fundamentally a question of context management for service discovery. To address this, we propose an LLM-native progressive-disclosure scheme and its concrete instantiation, A2X (Agent-to-Anything service discovery): an LLM-driven pipeline that automatically organizes the registered services into a hierarchical taxonomy and walks it layer by layer at query time, so that every LLM call sees only a small candidate set highly relevant to the user query. This decouples effective-context scarcity from registry size and significantly reduces token consumption while improving retrieval accuracy. Compared to full-context dumping, A2X achieves a 6.2-point Hit Rate gain at one-ninth the prompt-token cost; compared to the state-of-the-art open-source embedding-based baseline, A2X improves Hit Rate by more than 20 points.

cs.AI

Nearly Optimal Subdata Selection

When, in terms of the number of data points, the size of a dataset exceeds available computing resources, or when labeling is expensive, an attractive solution consists of selecting only some of the data points (subdata) for further consideration. A central question for selecting subdata of size $n$ from $N$ available data points is which $n$ points to select. While an answer to this question depends on the objective, one approach for a parametric model and a focus on parameter estimation is to select subdata that retains maximal information. Identifying such subdata is a classical NP-hard problem due to its inherent discreteness. Based on optimal approximate design theory, we develop a new methodology for information-based subdata selection, resulting in subdata that approaches the optimal solution. To achieve this, we develop a novel algorithm that applies to a general model, accommodates arbitrary choices of $N$ and $n$, and supports multiple optimality criteria, and we prove its convergence. Moreover, the new methodology facilitates an assessment of the efficiency of subdata selected by any method by obtaining tight lower and upper bounds for the efficiency. We show that the subdata obtained through the new methodology is highly efficient and outperforms all existing methods.

stat.ME

Protecting Quantum Simulations of Lattice Gauge Theories through Engineered Emergent Hierarchical Symmetries

We present a strategy for the quantum simulation of many-body lattice models with constrained Hilbert spaces. We focus on lattice gauge theories (LGTs), which underlie a wide range of phenomena in particle physics, condensed matter, and quantum information. In present-day quantum computing platforms, perfect restrictions of the Hilbert space to the desired gauge sectors are beyond reach: for LGTs, violations of the local constraint are unavoidable, posing a formidable challenge for the emulation of the underlying physics. Here, we develop a Floquet-engineering framework that restructures departures from a target sector such that a series of emergent local symmetries occurs hierarchically in time and in a controllable way. This leads to a set of approximate dynamical selection rules that strongly restrict inter-sector couplings, resulting in a pronounced, symmetry-controlled hierarchy of lifetimes for the state population to spread among sectors. Concretely, this protects $U(1)$ LGTs against violations of the {defining} local symmetry. While some sectors remain very long-lived, others are destabilized on shorter timescales. We numerically verify our theory for the one-dimensional $U(1)$ quantum link model. In addition, we reveal that `defects', whose movement accounts for violations of the gauge constraint, are kinetically constrained, becoming mobile only through the assistance of intra-sector dynamics, which we describe using an effective quantum marble model. Our results can thus be used to extend the lifetime, in the spirit of passive error correction, of quantum simulations of complex many-body problems when emergent or desired local symmetries are only implemented approximately.

quant-ph

Exploring the Structure and Chemistry of 1D and 2D Lepidocrocite TiO2 at Atomic Resolution

Low dimensional materials are critical for enabling next generation applications that are central to addressing critical global challenges. Titanium dioxide nanostructures stand out due to their structural versatility and relevance to catalysis, energy conversion, and environmental remediation. Here, we employ a combination of advanced electron microscopy, spectroscopy, and first principles theoretical calculations to investigate the structural and chemical properties of one and two dimensional lepidocrocite type titania. Special emphasis is placed on the one dimensional material, which exhibits anisotropic growth, extending exclusively along a single crystallographic direction. Our analysis suggests that this unusual growth behavior can be attributed to light element impurities, such as carbon, that are incorporated during the bottom up synthesis. The results extend the understanding for these unexplored low dimensional titania materials and offer fundamental insights into their structure and chemistry.

cond-mat.mtrl-sci

Rethinking ANN-based Retrieval: Multifaceted Learnable Index for Large-scale Recommendation System

Approximate nearest neighbor (ANN) search is widely used in the retrieval stage of large-scale recommendation systems. In this stage, candidate items are indexed using their learned embedding vectors, and ANN search is executed for each user (or item) query to retrieve a set of relevant items. However, ANN-based retrieval has two key limitations. First, item embeddings and their indices are typically learned in separate stages: indexing is often performed offline after embeddings are trained, which can yield suboptimal retrieval quality-especially for newly created items. Second, although ANN offers sublinear query time, it must still be run for every request, incurring substantial computation cost at industry scale. In this paper, we propose MultiFaceted Learnable Index (MFLI), a scalable, real-time retrieval paradigm that learns multifaceted item embeddings and indices within a unified framework and eliminates ANN search at serving time. Specifically, we construct a multifaceted hierarchical codebook via residual quantization of item embeddings and co-train the codebook with the embeddings. We further introduce an efficient multifaceted indexing structure and mechanisms that support real-time updates. At serving time, the learned hierarchical indices are used directly to identify relevant items, avoiding ANN search altogether. Extensive experiments on real-world data with billions of users show that MFLI improves recall on engagement tasks by up to 11.8\%, cold-content delivery by up to 57.29\%, and semantic relevance by 13.5\% compared with prior state-of-the-art methods. We also deploy MFLI in the system and report online experimental results demonstrating improved engagement, less popularity bias, and higher serving efficiency.

cs.IR

Quantum Mpemba effect in Local Gauge Symmetry Restoration

Understanding relaxation in isolated quantum many-body systems remains a central challenge. Recently, the quantum Mpemba effect (QME), a counterintuitive relaxation phenomenon, has attracted considerable attention and has been extensively studied in systems with global symmetries. Here, we study the QME in gauge theories with massive local gauge symmetries. In the lattice Schwinger model, we demonstrate that the gauge structure of the reduced density matrix of a subsystem is entirely determined by the initial state and remain unchanged during the time evolution. We then investigate whether gauge symmetry can be dynamically restored following a symmetric quench. Analytical and numerical results show that when the Maxwell term is zero, gauge symmetry restoration fails due to the emergence of a peculiar conservation law. However, for any finite Maxwell term, subsystem gauge symmetry is restored in the thermodynamic limit. Based on these results, we systematically construct a families of initial states exhibiting the QME. We further explore the QME in the quantum link model-a truncated lattice Schwinger model, which has been realized in experiments. Moreover, we propose an experimentally accessible order parameter that correctly captures the QME. Our work demonstrates the generality of the quantum Mpemba effect even in the local gauge symmetries, and are directly relevant to ongoing quantum simulation experiments of gauge theories.

quant-ph

The Cream Rises to the Top: Efficient Reranking Method for Verilog Code Generation

LLMs face significant challenges in Verilog generation due to limited domain-specific knowledge. While sampling techniques improve pass@k metrics, hardware engineers need one trustworthy solution rather than uncertain candidates. To bridge this gap, we formulate it as a semantic alignment problem between requirements and Verilog implementations, and propose VCD-RNK, a discriminator model tailored for efficient Verilog code reranking. Specifically, VCD-RNKincorporates Verilog-specific reasoning by distilling expert knowledge across three dimensions: code semantic analysis, test case generation, and functional correctness assessment. By explicitly simulating the above reasoning processes during inference, VCD-RNK effectively avoids computationally intensive test execution in existing methods.

cs.AR

Large Language Model for Verilog Code Generation: Literature Review and the Road Ahead

Code generation has emerged as a critical research area at the intersection of Software Engineering (SE) and Artificial Intelligence (AI), attracting significant attention from both academia and industry. Within this broader landscape, Verilog, as a representative hardware description language (HDL), plays a fundamental role in digital circuit design and verification, making its automated generation particularly significant for Electronic Design Automation (EDA). Consequently, recent research has increasingly focused on applying Large Language Models (LLMs) to Verilog code generation, particularly at the Register Transfer Level (RTL), exploring how these AI-driven techniques can be effectively integrated into hardware design workflows. Despite substantial research efforts have explored LLM applications in this domain, a comprehensive survey synthesizing these developments remains absent from the literature. This review fill addresses this gap by providing a systematic literature review of LLM-based methods for Verilog code generation, examining their effectiveness, limitations, and potential for advancing automated hardware design. The review encompasses research work from conferences and journals in the fields of SE, AI, and EDA, encompassing 70 papers published on venues, along with 32 high-quality preprint papers, bringing the total to 102 papers. By answering four key research questions, we aim to (1) identify the LLMs used for Verilog generation, (2) examine the datasets and metrics employed in evaluation, (3) categorize the techniques proposed for Verilog generation, and (4) analyze LLM alignment approaches for Verilog generation. Based on our findings, we have identified a series of limitations of existing studies. Finally, we have outlined a roadmap highlighting potential opportunities for future research endeavors in LLM-assisted hardware design.

cs.AR

Cross-Layer Feature Self-Attention Module for Multi-Scale Object Detection

Recent object detection methods have made remarkable progress by leveraging attention mechanisms to improve feature discriminability. However, most existing approaches are confined to refining single-layer or fusing dual-layer features, overlooking the rich inter-layer dependencies across multi-scale representations. This limits their ability to capture comprehensive contextual information essential for detecting objects with large scale variations. In this paper, we propose a novel Cross-Layer Feature Self-Attention Module (CFSAM), which holistically models both local and global dependencies within multi-scale feature maps. CFSAM consists of three key components: a convolutional local feature extractor, a Transformer-based global modeling unit that efficiently captures cross-layer interactions, and a feature fusion mechanism to restore and enhance the original representations. When integrated into the SSD300 framework, CFSAM significantly boosts detection performance, achieving 78.6% mAP on PASCAL VOC (vs. 75.5% baseline) and 52.1% mAP on COCO (vs. 43.1% baseline), outperforming existing attention modules. Moreover, the module accelerates convergence during training without introducing substantial computational overhead. Our work highlights the importance of explicit cross-layer attention modeling in advancing multi-scale object detection.

cs.CV

Real-time vacuum-state quantum random number generator on a chip

Quantum random number generators (QRNGs) produce true random numbers, which are guaranteed by the fundamental principles of quantum physics. Miniaturization of QRNGs is crucial for a wide range of communication and cryptography applications. Here, we first report a fully functional QRNG chip based on vacuum-state fluctuations, with dimensions of 16.6 mm x 7.8 mm. The quantum entropy source, which is achieved via hybrid photonic integration with a SiO2 waveguide, generates raw quantum random numbers. The hybrid photonic and electrical components are assembled into a compact ceramic package using system-in-package technology. A microcontroller unit acquires the raw data and outputs the processed quantum random numbers via a serial peripheral interface. According to the characterization results, the QRNG chip achieves a constant real-time output rate of 5.2 Mbps across the industrial temperature range of -40°C to 85°C, making it suitable for practical applications.

quant-ph

Non-adiabatic linear response in open quantum systems

Adiabatic theorem and non-adiabatic corrections have been widely applied in modern quantum technology. Recently, non-adiabatic linear response theory has been developed to probe the many-body correlations in closed systems. In this work, we generalize the non-adiabatic linear response theory to open quantum many-body systems. We show that, similar to the closed case, the first-order deviation from the instantaneous steady state is memoryless -- it depends only on the final parameters and not on the initial state or ramping path. When ramping the Hamiltonian, the linear response of observables is governed by the derivative of the retarded Green's function, as in closed systems. In contrast, ramping the dissipation gives rise to a different response, characterized by a high-order correlation function defined in the steady state. Our results offer a compact and physically transparent formulation of non-adiabatic response in open systems, and demonstrate that ramping dynamics can serve as a versatile tool for probing many-body correlations beyond equilibrium.

cond-mat.quant-gas

Observatory Science with eXTP

Scheduled for launch in 2030, the enhanced X-ray Timing and Polarization (eXTP) telescope is a Chinese space-based mission aimed at studying extreme conditions and phenomena in astrophysics. eXTP will feature three main payloads: Spectroscopy Focusing Arrays (SFAs), Polarimetry Focusing Arrays (PFAs), and a Wide-field Camera (W2C). This white paper outlines observatory science, incorporating key scientific advances and instrumental changes since the publication of the previous white paper [1]. We will discuss perspectives of eXTP on the research domains of flare stars, supernova remnants, pulsar wind nebulae, cataclysmic variables, X-ray binaries, ultraluminous X-ray sources, AGN, and pulsar-based positioning and timekeeping.

astro-ph.IM

Visual Perturbation and Adaptive Hard Negative Contrastive Learning for Compositional Reasoning in Vision-Language Models

Vision-Language Models (VLMs) are essential for multimodal tasks, especially compositional reasoning (CR) tasks, which require distinguishing fine-grained semantic differences between visual and textual embeddings. However, existing methods primarily fine-tune the model by generating text-based hard negative samples, neglecting the importance of image-based negative samples, which results in insufficient training of the visual encoder and ultimately impacts the overall performance of the model. Moreover, negative samples are typically treated uniformly, without considering their difficulty levels, and the alignment of positive samples is insufficient, which leads to challenges in aligning difficult sample pairs. To address these issues, we propose Adaptive Hard Negative Perturbation Learning (AHNPL). AHNPL translates text-based hard negatives into the visual domain to generate semantically disturbed image-based negatives for training the model, thereby enhancing its overall performance. AHNPL also introduces a contrastive learning approach using a multimodal hard negative loss to improve the model's discrimination of hard negatives within each modality and a dynamic margin loss that adjusts the contrastive margin according to sample difficulty to enhance the distinction of challenging sample pairs. Experiments on three public datasets demonstrate that our method effectively boosts VLMs' performance on complex CR tasks. The source code is available at https://github.com/nynu-BDAI/AHNPL.

cs.CV