Searcharxiv⌕ Search

arXiv subjects

Xinyang Wang

Publications and source records attributed to Xinyang Wang.

At least 37 records · Page 2Linked to original sources

ASTRA-QA: A Benchmark for Abstract Question Answering over Documents

Document-based question answering (QA) increasingly includes abstract questions that require synthesizing scattered information from long documents or across multiple documents into coherent answers. However, this setting is still poorly supported by existing benchmarks and evaluation methods, which often lack stable abstract references or rely on coarse similarity metrics and unstable head-to-head comparisons. To alleviate this issue, we introduce ASTRA-QA, a benchmark for AbSTRAct Question Answering over documents. ASTRA-QA contains 869 QA instances over academic papers and news documents, covering five abstract question types and three controlled retrieval scopes. Each instance is equipped with explicit evaluation annotations, including answer topic sets, curated unsupported topics, and aligned evidence. Building on these annotations, ASTRA-QA assesses whether answers cover required key points and avoid unsupported content by directly scoring topic coverage and curated unsupported content, enabling scalable evaluation without exhaustive head-to-head comparisons. Experiments with representative Retrieval-Augmented Generation (RAG) methods spanning vanilla, graph-based, and hierarchical retrieval settings show that ASTRA-QA provides reference-grounded diagnostics for coverage, hallucination, and retrieval-scope robustness. Our dataset and code are available at https://xinyangsally.github.io/astra-benchmark.

cs.CL↗

RG-Consistent (P)NJL Model: Impact of Thermal Cutoff Modifications on Thermodynamics and Net-Baryon Number Fluctuations

In this paper, we investigate the impact of renormalization group (RG) consistency on the chiral phase transition and thermodynamic properties of QCD matter using the RGNJL and RGPNJL models. By implementing a temperature-dependent thermal cutoff $Λ_T = kΛ_0$, we ensure that thermodynamic quantities converge toward the Stefan-Boltzmann limit at high temperatures, effectively extending the applicability of these effective theories. Our analysis shows that while the RG-consistency condition ($k \rightarrow \infty$) resolves causality violations in the RGNJL model by binding the speed of sound to the conformal limit, the RGPNJL model exhibits a more complex, non-monotonic sensitivity to the parameter $k$. Furthermore, we demonstrate that the RG-improved PNJL framework significantly enhances the description of net-baryon number fluctuations ($κσ^2$) relative to lattice QCD data at vanishing chemical potential, though the intensification of these fluctuations at high baryon density highlights a critical sensitivity to the model's parametric constraints. This study provides a rigorous evaluation of the RG-consistency framework's predictive power in mapping the QCD phase diagram and interpreting experimental observables.

hep-ph↗

Context-based Imitation and the Evolution of Behavioral Rules

We study the evolution of behavioral rules in environments with multiple contexts. Agents copy rules used by better-performing peers in the same context and apply them across contexts. Multiple contexts turn discrete-time imitation dynamics into a context-weighted social choice problem: the population converges to consensus if and only if some rule is a Condorcet winner; otherwise, persistent non-convergence can occur. Among same-context imitation protocols, imitate-if-better uniquely minimizes envy. The framework provides a new account of belief evolution, characterizing when imitation selects rational expectations and showing how persistent belief and consumption fluctuations can arise in stationary environments.

econ.TH↗

Equilibrium Stability and Uniqueness with a Large Number of Commodities and Patient Consumers

We show that a large effective number of commodities can be a source of equilibrium stability and uniqueness: expanding substitution opportunities strengthens aggregate substitution effects. We study finite dated-commodity exchange economies obtained by truncating a countably infinite-horizon environment with discounted, additively separable utilities. In this setting, the effective number of commodities is the discounted count of dated commodities, so greater patience makes distant commodities more relevant. With an appropriate normalization, equilibrium substitution effects accumulate at the rate of the effective number of commodities. When a preference diversification condition holds, equilibrium income effects grow at a lower rate. The condition is satisfied, for example, when agents have sparse or localized taste differences across commodities, or when their taste profiles become sufficiently heterogeneous as the commodity space expands. Hence, whenever the effective number of commodities is sufficiently large, every equilibrium is locally tâtonnement stable, which in turn implies equilibrium uniqueness.

econ.TH↗

Chiral Magnetic effect as the anomaly in the transverse axial vector Ward Identity

Through analyzing the quark propagator under the magnetic field, we establish that the axial anomaly originates from an additional Dirac structure in quark propagator induced by the magnetic field. This Dirac structure also allows one to connect the axial anomaly with the topological properties of the system by checking the axial vector Ward identity. For the tree level propagator, we reproduce the result of the anomalous axial current as in the Dirac Hamiltonian approach and kinetic theory. Particularly, we confirm that the chiral magnetic effect (CME) comes from the same term that is in charge of the axial anomaly, specifically, as the anomaly of the transversal axial vector Ward Identity. The identity guarantees that the CME conductivity $C_{\rm CME}$ is a constant as $C_{\rm CME}=\frac{1}{2π^2}$, and is robust against the temperature, chemical potential, magnetic field and also interaction. Finally, we verify this numerically by applying the full quark propagator under magnetic field calculated from the functional QCD methods.

hep-th↗

HaS: Accelerating RAG through Homology-Aware Speculative Retrieval

Retrieval-Augmented Generation (RAG) expands the knowledge boundary of large language models (LLMs) at inference by retrieving external documents as context. However, retrieval becomes increasingly time-consuming as the knowledge databases grow in size. Existing acceleration strategies either compromise accuracy through approximate retrieval, or achieve marginal gains by reusing results of strictly identical queries. We propose HaS, a homology-aware speculative retrieval framework that performs low-latency speculative retrieval over restricted scopes to obtain candidate documents, followed by validating whether they contain the required knowledge. The validation, grounded in the homology relation between queries, is formulated as a homologous query re-identification task: once a previously observed query is identified as a homologous re-encounter of the incoming query, the draft is deemed acceptable, allowing the system to bypass slow full-database retrieval. Benefiting from the prevalence of homologous queries under real-world popularity patterns, HaS achieves substantial efficiency gains. Extensive experiments demonstrate that HaS reduces retrieval latency by 23.74% and 36.99% across datasets with only a 1-2% marginal accuracy drop. As a plug-and-play solution, HaS also significantly accelerates complex multi-hop queries in modern agentic RAG pipelines. Source code is available at: https://github.com/ErrEqualsNil/HaS.

cs.IR↗

Determining the NJL Coupling and AMM in Magnetized QCD Matter via Machine Learning

In this study, we investigate the phase structure of magnetized QCD matter by determining the field-dependent parameters of the Nambu-Jona-Lasinio (NJL) model through a physics-informed machine learning framework. Specifically, we focus on extracting the optimal functional forms for the running coupling constant $G(eB)$ and the quark anomalous magnetic moment (AMM) ratio $v_2(eB)$, utilizing lattice QCD-computed quark condensate data as the ``ground truth". By embedding the NJL gap equation as a differentiable physics-constrained module, our neural network pipeline identifies continuous parameter functions that accurately reproduce the inverse magnetic catalysis (IMC) effect. Our results demonstrate that the magnetic field smoothly suppresses both $G$ and $v_2$. This approach not only bridges the gap between effective models and lattice data but also provides new microscopic insights into the response of the QCD vacuum to strong magnetic fields.

hep-ph↗

Transcending Classical Neural Network Boundaries: A Quantum-Classical Synergistic Paradigm for Seismic Data Processing

In recent years, a number of neural-network (NN) methods have exhibited good performance in seismic data processing, such as denoising, interpolation, and frequency-band extension. However, these methods rely on stacked perceptrons and standard activation functions, which imposes a bottleneck on the representational capacity of deep-learning models, making it difficult to capture the complex and non-stationary dynamics of seismic wavefields. Different from the classical perceptron-stacked NNs which are fundamentally confined to real-valued Euclidean spaces, the quantum NNs leverage the exponential state space of quantum mechanics to map the features into high-dimensional Hilbert spaces, transcending the representational boundary of classical NNs. Based on this insight, we propose a quantum-classical synergistic generative adversarial network (QC-GAN) for seismic data processing, serving as the first application of quantum NNs in seismic exploration. In QC-GAN, a quantum pathway is used to exploit the high-order feature correlations, while the convolutional pathway specializes in extracting the waveform structures of seismic wavefields. Furthermore, we design a QC feature complementarity loss to enforce the feature orthogonality in the proposed QC-GAN. This novel loss function can ensure that the two pathways encode non-overlapping information to enrich the capacity of feature representation. On the whole, by synergistically integrating the quantum and convolutional pathways, the proposed QC-GAN breaks the representational bottleneck inherent in classical GAN. Experimental results on denoising and interpolation tasks demonstrate that QC-GAN preserves wavefield continuity and amplitude-phase information under complex noise conditions.

cs.LG↗

Unifying Language-Action Understanding and Generation for Autonomous Driving

Vision-Language-Action (VLA) models are emerging as a promising paradigm for end-to-end autonomous driving, valued for their potential to leverage world knowledge and reason about complex driving scenes. However, existing methods suffer from two critical limitations: a persistent misalignment between language instructions and action outputs, and the inherent inefficiency of typical auto-regressive action generation. In this paper, we introduce LinkVLA, a novel architecture that directly addresses these challenges to enhance both alignment and efficiency. First, we establish a structural link by unifying language and action tokens into a shared discrete codebook, processed within a single multi-modal model. This structurally enforces cross-modal consistency from the ground up. Second, to create a deep semantic link, we introduce an auxiliary action understanding objective that trains the model to generate descriptive captions from trajectories, fostering a bidirectional language-action mapping. Finally, we replace the slow, step-by-step generation with a two-step coarse-to-fine generation method C2F that efficiently decodes the action sequence, saving 86% inference time. Experiments on closed-loop driving benchmarks show consistent gains in instruction following accuracy and driving performance, alongside reduced inference latency.

cs.CV↗

A Consistency-Improved LiDAR-Inertial Bundle Adjustment

Simultaneous Localization and Mapping (SLAM) using 3D LiDAR has emerged as a cornerstone for autonomous navigation in robotics. While feature-based SLAM systems have achieved impressive results by leveraging edge and planar structures, they often suffer from the inconsistent estimator associated with feature parameterization and estimated covariance. In this work, we present a consistency-improved LiDAR-inertial bundle adjustment (BA) with tailored parameterization and estimator. First, we propose a stereographic-projection representation parameterizing the planar and edge features, and conduct a comprehensive observability analysis to support its integrability with consistent estimator. Second, we implement a LiDAR-inertial BA with Maximum a Posteriori (MAP) formulation and First-Estimate Jacobians (FEJ) to preserve the accurate estimated covariance and observability properties of the system. Last, we apply our proposed BA method to a LiDAR-inertial odometry.

cs.RO↗

Scaling functions in the soft-wall AdS/QCD models

We investigate the static scaling behavior of the chiral condensate near the two-flavor critical point within the framework of the soft-wall AdS/QCD. The scaling functions are extracted from the chiral order parameters and are found to precisely match those obtained through mean-field calculations. Additionally, it is also checked that the scaling functions are independent of the specific construction of the holographic model. Furthermore, we develop the formalism for calculating the chiral susceptibility and demonstrate that the pseudo-critical temperatures obey the scaling law for moderate quark masses. It is shown that the temperature scaling could be comparable with those obtained from Dyson-Schwinger equations and lattice simulations. These findings could help improve the effectiveness of the soft-wall AdS/QCD.

hep-ph↗

Reinforcement learning in pursuit-evasion differential game: safety, stability and robustness

Safety and stability are two critical concerns in pursuit-evasion (PE) problems in an obstacle-rich environment. Most existing works combine control barrier functions (CBFs) and reinforcement learning (RL) to provide an efficient and safe solution. However, they do not consider the presence of disturbances, such as wind gust and actuator fault, which may exist in many practical applications. This paper integrates CBFs and a sliding mode control (SMC) term into RL to simultaneously address safety, stability, and robustness to disturbances. However, this integration is significantly challenging due to the strong coupling between the CBF and SMC terms. Inspired by Stackelberg game, we handle the coupling issue by proposing a hierarchical design scheme where SMC and safe control terms interact with each other in a leader-follower manner. Specifically, the CBF controller, acting as the leader, enforces safety independently of the SMC design; while the SMC term, as the follower, is designed based on the CBF controller. We then formulate the PE problem as a zero-sum game and propose a safe robust RL framework to learn the min-max strategy online. A sufficient condition is provided under which the proposed algorithm remains effective even when constraints are conflicting. Simulation results demonstrate the effectiveness of the proposed safe robust RL framework.

eess.SY↗

Strategic learning for disturbance rejection in multi-agent systems: Nash and Minmax in graphical games

This article investigates the optimal control problem with disturbance rejection for discrete-time multi-agent systems under cooperative and non-cooperative graphical games frameworks. Given the practical challenges of obtaining accurate models, Q-function-based policy iteration methods are proposed to seek the Nash equilibrium solution for the cooperative graphical game and the distributed minmax solution for the non-cooperative graphical game. To implement these methods online, two reinforcement learning frameworks are developed, an actor-disturber-critic structure for the cooperative graphical game and an actor-adversary-disturber-critic structure for the non-cooperative graphical game. The stability of the proposed methods is rigorously analyzed, and simulation results are provided to illustrate the effectiveness of the proposed methods.

eess.SY↗

Pruner: A Draft-then-Verify Exploration Mechanism to Accelerate Tensor Program Tuning

Tensor program tuning is essential for the efficient deployment of deep neural networks. Search-based approaches have demonstrated scalability and effectiveness in automatically finding high-performance programs for specific hardware. However, the search process is often inefficient, taking hours or even days to discover optimal programs due to the exploration mechanisms guided by an accurate but slow-learned cost model. Meanwhile, the learned cost model trained on one platform cannot seamlessly adapt online to another, which we call cross-platform online unawareness. In this work, we propose Pruner and MoA-Pruner. Pruner is a "Draft-then-Verify" exploration mechanism that accelerates the schedule search process. Instead of applying the complex learned cost model to all explored candidates, Pruner drafts small-scale potential candidates by introducing a naive Symbol-based Analyzer (draft model), then identifies the best candidates by the learned cost model. MoA-Pruner introduces a Momentum online Adaptation strategy to address the cross-platform online unawareness. We incorporate Pruner into the TVM and conduct extensive experiments on three GPU-based platforms. Results show considerable speedup in schedule search time. In online tuning scenarios, Pruner and MoA-Pruner achieve an average speedup of $2.6 \times$ and $4.82 \times$ compared to Ansor. In offline tuning scenarios, Pruner achieves an average speedup of $4.75 \times$ and $4.05\times$ compared to TenSet and TLP, respectively. Furthermore, Pruner achieves an average speedup of $4.08 \times$ compared to MetaSchedule on TensorCore.

cs.LG↗

Circularly polarized photon emission from magnetized chiral plasmas

We investigate the emission of circularly polarized photons from a magnetized quark-gluon plasma with nonzero quark-number and chiral charge chemical potentials. These chemical potentials qualitatively influence the differential emission rates of circularly polarized photons. A nonzero net electric charge density, induced by quark-number chemical potentials, enhances the overall emission of one circular polarization over the other, while a nonzero chiral charge density introduces a spatial asymmetry in the emission with respect to reflection in the transverse plane. The signs of the electrical and chiral charge densities determine which circular polarization dominates overall and whether the emission preferentially aligns with or opposes the magnetic field. Based on these findings, we propose that polarized photon emission is a promising observable for characterizing the quark-gluon plasma produced in heavy-ion collisions.

hep-ph↗

From Twitter to Reasoner: Understand Mobility Travel Modes and Sentiment Using Large Language Models

Social media has become an important platform for people to express their opinions towards transportation services and infrastructure, which holds the potential for researchers to gain a deeper understanding of individuals' travel choices, for transportation operators to improve service quality, and for policymakers to regulate mobility services. A significant challenge, however, lies in the unstructured nature of social media data. In other words, textual data like social media is not labeled, and large-scale manual annotations are cost-prohibitive. In this study, we introduce a novel methodological framework utilizing Large Language Models (LLMs) to infer the mentioned travel modes from social media posts, and reason people's attitudes toward the associated travel mode, without the need for manual annotation. We compare different LLMs along with various prompting engineering methods in light of human assessment and LLM verification. We find that most social media posts manifest negative rather than positive sentiments. We thus identify the contributing factors to these negative posts and, accordingly, propose recommendations to traffic operators and policymakers.

cs.LG↗

MePT: Multi-Representation Guided Prompt Tuning for Vision-Language Model

Recent advancements in pre-trained Vision-Language Models (VLMs) have highlighted the significant potential of prompt tuning for adapting these models to a wide range of downstream tasks. However, existing prompt tuning methods typically map an image to a single representation, limiting the model's ability to capture the diverse ways an image can be described. To address this limitation, we investigate the impact of visual prompts on the model's generalization capability and introduce a novel method termed Multi-Representation Guided Prompt Tuning (MePT). Specifically, MePT employs a three-branch framework that focuses on diverse salient regions, uncovering the inherent knowledge within images which is crucial for robust generalization. Further, we employ efficient self-ensemble techniques to integrate these versatile image representations, allowing MePT to learn all conditional, marginal, and fine-grained distributions effectively. We validate the effectiveness of MePT through extensive experiments, demonstrating significant improvements on both base-to-novel class prediction and domain generalization tasks.

cs.CV↗

Self-Supervised Diffusion Model for 3-D Seismic Data Reconstruction

Seismic data reconstruction is an effective tool for compensating nonuniform and incomplete seismic geometry. Compared with methods for 2D seismic data, 3D reconstruction methods could consider more spatial structure correlation in seismic data. In the early studies, 3D reconstruction methods are mainly theory-driven and have some limitations due to their prior assumptions on the seismic data. To release these limitations, deep learning-based reconstruction methods rise and show potential in dealing with reconstruction problems. However, there are mainly two shortcomings in existing deep learning-methods. On the one hand, most of existing deep learning-based methods adopt the convolutional neural network, having some difficulties in dealing with data with complex or time-varying distributions. Recently, the diffusion model has been reported to possess the capability to solve data with complex distributions by gradually complicating the distribution of data to optimize the network. On the other hand, existing methods need enough paired-data to train the network, which are very hard to obtain especially for the starved 3D seismic data. Deep prior-based unsupervised and sampling-based self-supervised networks offer an available solution to this problem. In this paper, we develop a self-supervised diffusion model (S2DM) for 3D seismic data reconstruction. The proposed model mainly contains a diffusion restoration model and a variational time-spatial module. Extensive synthetic and field experiments demonstrate the superiority of the proposed S2DM algorithm.

physics.geo-ph↗