Searcharxiv⌕ Search

arXiv subjects

Wei Chen

Publications and source records attributed to Wei Chen.

At least 145 records · Page 8Linked to original sources

An improved moment QCD sum rule

QCD sum rules are among the most important non-perturbative tools in hadron physics, with the Laplace sum rule (LSR) and moment sum rule (MSR) being the two most commonly used formulations. Despite their widespread application, both approaches have significant shortcomings: the LSR relies on subjective criteria -- namely OPE convergence and pole dominance -- to constrain the parameter space, while the conventional MSR cannot extract the coupling constant of the interpolating current. More critically, the ground-state masses obtained from these two methods are often inconsistent. In this work, we propose an improved moment sum rule (IMSR) framework that resolves these issues simultaneously. Our method explicitly incorporates quark-hadron duality, which introduces the approximation condition on the OPE side and provides a natural a posteriori constraint on the parameters. We impose rigorous dependence conditions on the unphysical parameters $(Q^2_0,n)$ to quantify and control their influence. As a result, our framework uniquely determines both the optimal value of the duality parameter and the ground-state mass, without invoking any ad hoc or subjective criteria. It also allows for the simultaneous extraction of the current coupling. Applying the IMSR to a pseudoscalar $ud\Bar{d}\Bar{s}$ tetraquark system, the results are in excellent agreement with our previous LSR analyses, validating the effectiveness of the proposed scheme. The IMSR method substantially enhances the robustness and reliability of QCD sum rules, effectively eliminating the subjectivity that has long plagued conventional formulations.

hep-ph↗

From Self-Attention to Connection Laplacian: A Unified Operator View of Transformers

Self-attention is a ubiquitous primitive in modern sequence models, yet its operator-level geometry is only partially understood. We view a token sequence as a vector field over the token-position graph and identify attention as a connection walk: messages are aggregated by a nonnegative walk matrix while being transported along each edge by a learned linear map. Within this framework, we prove that single-head attention (SHA) is exactly a connection propagation step with constant transport, and that multi-head attention (MHA) is exactly a single edge-dependent connection walk whose effective transport is an attention-gated mixture of headwise transports. We further clarify the conditions under which the corresponding generator reduces to a random-walk connection Laplacian, highlighting the roles of stochasticity, reversibility, and metric-compatible transports. Empirically, we find that trained Transformers across scales (from 124M to 8B) and structures (encoder/decoder) exhibit geometric structure consistent with our theory: effective attention graphs converge to stable geometric operators in deeper layers, learned transports self-organize into approximate scaled isometries, and both phenomena strengthen consistently with scale. Overall, the paper provides a precise connection-walk formalism that links self-attention to classical geometric operators, along with a set of operator-level tools for analyzing transformer models from a geometric perspective.

cs.LG↗

Photorefractive-based on-chip optical power limiter against light-injection attacks in quantum key distribution

Light-injection attacks pose critical security threats to quantum key distribution (QKD) systems. Conventional countermeasures, such as isolators, filters, and optical power monitoring, suffer from limited on-chip compatibility and inherent security vulnerabilities. To overcome these limitations, we propose and experimentally demonstrate an integrated attack sensing and automatic response unit utilizing the photorefractive effect in a thin-film lithium niobate microring resonator. The unit provides a rejection ratio exceeding 25 dB against non-resonant injected light. Under resonant attacks with power levels above tens of microwatts, the unit autonomously attenuates the signal transmission, with 14 dB attenuation measured at the maximum tested attack power of 10 dBm, leading to a significant suppression of the secure key rate. We further verify its response to pulsed light injection and incorporate possible residual leakage associated with finite response time into the key-rate analysis. This work provides a highly sensitive, broadband, and fully on-chip defense mechanism that significantly enhances the physical-layer security of QKD systems against light-injection attacks.

quant-ph↗

Universal valley filtering via uniform dissipation and velocity contrast

Valley, as a ubiquitous degree of freedom in lattices, has found wide applications in both electronic and classical-wave devices in recent years. However, achieving valley-polarized states, a prerequisite for valley-based operations, still remains challenging. Here, we propose and experimentally demonstrate a universal non-Hermitian mechanism for valley filtering using only uniform background dissipation, which creates a propagation length contrast between valleys through their intrinsic group velocity differences. We implement this concept in an acoustic crystal, observing switchable and robust valley polarization of sound through large-scale field mapping. Remarkably, our approach is solely based on uniform loss, without the need for any special lattice structures, tailored excitations, or external fields. We further provide designs of our non-Hermitian valley filter on photonic and electronic platforms. Our results offer a simple and effective solution to valley-polarized state generation and may advance the development of novel valley-based devices in both classical and quantum regimes.

cond-mat.mes-hall↗

Implicit discretization schemes for full-kinetic ion and drift-kinetic electron simulations

We present a new electromagnetic plasma simulation model with full-kinetic ions and drift-kinetic electrons. This model (termed as FIDES) solves the electric field using the implicit perpendicular Ohm's law and a novel implicit parallel Ampere's law, where the latter requires an implicit scheme for the parallel electric field in advancing the electron weights. To suppress unphysical high-frequency instabilities, ion weights are advanced using an implicit scheme for perpendicular electric fields. Simulations of perpendicular and parallel waves validate the model's capability in handling high-frequency physics. Low-frequency wave simulations demonstrate that the implicit parallel Ampere's law can mitigate the cancellation problem more effectively than the conventional schemes using the parallel Ohm's law. To reduce the numerical damping from implicit time-stepping, we develop a second-order scheme for particle pushing. Meanwhile, an integrated strategy combining the first- and second-order schemes is employed to suppress odd-even decoupling while maintaining the accuracy of the second-order formulation.

physics.plasm-ph↗

HoloTetSphere: Unified TetSphere Mesh Reconstruction for Physical Simulations

Standard pipelines for physics-ready 3D reconstruction rely on a decoupled two-stage paradigm: extracting surface geometry followed by an error-prone tetrahedralization process. While recent Lagrangian methods like TetSphere Splatting attempt to bypass this by directly optimizing volumetric primitives, their homeomorphic constraints prevent topology-adaptive optimization. Consequently, they produce disjoint tetrahedra rather than a single connected mesh, rendering the structures unsuitable for further physical simulations. To address this, we propose a topology-adaptive framework for holistic tetrahedral mesh reconstruction through end-to-end topological and geometric optimization. First, by coupling Gaussian spheres to tetrahedral elements and leveraging edge connections, we estimate a continuous opacity field for differentiable element pruning. Next, jointly minimizing mesh smoothing energy and multi-view Gaussian rendering error drives alternating geometric refinement while preserving topological adaptivity. Consequently, our approach effectively constructs a unified and topologically coherent tetrahedral mesh. Extensive experiments demonstrate that our method outperforms state-of-the-art techniques by achieving superior geometric accuracy and producing coherent, single-connected tetrahedral meshes, thereby effectively bypassing the error-prone conventional tetrahedralization step for reconstructed surface meshes and streamlining downstream physical simulation.

cs.GR↗

VisTCP: A Visualization Framework to Construct Knowledge-Graph-Based Representation for Traditional Chinese Painting

Structured representation can characterize semantic objects and relationships in images. It provides a possible effective way for the semantic understanding of Traditional Chinese Paintings (TCPs) to better support archaeology and art history research. However, most image-oriented structured representation methods perform poorly on TCPs, due to two major challenges: 1) the objects and events of TCPs exhibit substantial differences from modern natural images, which results in semantic misunderstandings of TCPs; and 2) it is difficult to achieve accurate identification of ancient objects and events in TCPs, even for domain experts.In this paper, we propose VisTCP, a visualization framework that combines a TCP-oriented intelligent model and expert knowledge, which enables art historians to achieve trustworthy structured representations of TCPs in a human-in-the-loop manner. Firstly, we conduct a pilot study with three domain experts to build a semantic taxonomy of TCPs. Then, expert-annotated data are used to train a TCP-oriented structured representation model, which can automatically extract meaningful objects and their relationships in TCPs. To inform users of the model uncertainty, we design a joint embedding visualization view to show the differences between expert annotations and model predictions. This allows users to refine the structured representation based on their domain knowledge, enabling iterative optimization of the model. Finally, we conduct a case study, a usage scenario, and expert interviews on a real dataset to demonstrate the effectiveness of VisTCP in supporting the structured representation and semantic understanding of TCPs.

cs.HC↗

LLM-based Human Simulations Have Not Yet Been Reliable

Large Language Models (LLMs) are increasingly employed for simulating human behaviors across diverse domains. However, our position is that current LLM-based human simulations remain insufficiently reliable, as evidenced by significant discrepancies between their outcomes and authentic human actions. Our investigation begins with a systematic review of LLM-based human simulations in social, economic, policy, and psychological contexts, identifying their common frameworks, recent advances, and persistent limitations. This review reveals that such discrepancies primarily stem from inherent limitations of LLMs and flaws in simulation design, both of which are examined in detail. Building on these insights, we propose a systematic solution framework that emphasizes enriching data foundations, advancing LLM capabilities, and ensuring robust simulation design to enhance reliability. Finally, we introduce a structured algorithm that operationalizes the proposed framework, aiming to guide credible and human-aligned LLM-based simulations. To facilitate further research, we provide a curated list of related literature and resources at https://github.com/Persdre/awesome-llm-human-simulation.

cs.CL↗

Performance Analysis and Optimization for Laser-Phase-Noise based Quantum Random Number Generation

The quantum random number generation based on laser phase noise, which is featured with high random number generation rate and ease for photonic integration, has been extensively investigated and demonstrated. Despite these advancements, a theoretical model to achieve optimal performance in terms of maximizing the random number generation rate is still incomplete. In this work, a comprehensive physical model for this scheme is introduced to accurately predict the power spectrum of entropy source and probability distribution of raw data, based on which the entropy source bandwidth and extractable randomness can be accordingly estimated and thus the system performance can be quantitatively evaluated and optimized. The model is sufficiently validated through both simulation and experiment with significant agreement under various typical setups. Furthermore, our proposal enables the proactive design of experimental parameters to achieve optimal system performance, which is crucial for the design and practical implementation of photonics integrated quantum random number generations.

quant-ph↗

MetricAnything: Scaling Metric Depth Pretraining with Noisy Heterogeneous Sources

Scaling has powered recent advances in vision foundation models, yet extending this paradigm to metric depth estimation remains challenging due to heterogeneous sensor noise, camera-dependent biases, and metric ambiguity in noisy cross-source 3D data. We introduce Metric Anything, a simple and scalable pretraining framework that learns metric depth from noisy, diverse 3D sources without manually engineered prompts, camera-specific modeling, or task-specific architectures. Central to our approach is the Sparse Metric Prompt, created by randomly masking depth maps, which serves as a universal interface that decouples spatial reasoning from sensor and camera biases. Using about 20M image-depth pairs spanning reconstructed, captured, and rendered 3D data across 10000 camera models, we demonstrate-for the first time-a clear scaling trend in the metric depth track. The pretrained model excels at prompt-driven tasks such as depth completion, super-resolution and Radar-camera fusion, while its distilled prompt-free student achieves state-of-the-art results on monocular depth estimation, camera intrinsics recovery, single/multi-view metric 3D reconstruction, and VLA planning. We also show that using pretrained ViT of Metric Anything as a visual encoder significantly boosts Multimodal Large Language Model capabilities in spatial intelligence. These results show that metric depth estimation can benefit from the same scaling laws that drive modern foundation models, establishing a new path toward scalable and efficient real-world metric perception. We open-source MetricAnything at http://metric-anything.github.io/metric-anything-io/ to support community research.

cs.CV↗

Measurement of solar $pp$ neutrino flux with the new PandaX-4T data

We report a new measurement of the solar proton--proton ($pp$) neutrino flux via neutrino--electron elastic scattering using the PandaX-4T Run 2 data set collected between 2024 and 2026, corresponding to an exposure of 1.9 tonne$\cdot$yr. Before Run 2 data taking, the detector underwent a series of upgrades to improve its response and background conditions. Time variations of radioactive noble-gas impurities are constrained using the physics data themselves, complemented by measurements from the gas-assay system. The analysis introduced improvements in the data processing chain, detector response characterization, and background models. A blind spectral analysis was then performed on the electronic-recoil data across a wide energy range from 20 to 1000 keV. In combination with the Run 0 data published earlier, the fitted $pp$ flux is $(8.5 \pm 3.5)\times 10^{10}$ $\mathrm{cm^{-2}s^{-1}}$, consistent with the prediction of the Standard Solar Model. With a statistical significance of $2.2σ$ above background, this marks the first positive indication of solar $pp$ neutrino--electron scattering below an electronic-recoil energy of 165 keV.

hep-ex↗

Joint Reward Modeling: Internalizing Chain-of-Thought for Efficient Visual Reward Models

Reward models are critical for reinforcement learning from human feedback, as they determine the alignment quality and reliability of generative models. For complex tasks such as image editing, reward models are required to capture global semantic consistency and implicit logical constraints beyond local similarity. Existing reward modeling approaches have clear limitations. Discriminative reward models align well with human preferences but struggle with complex semantics due to limited reasoning supervision. Generative reward models offer stronger semantic understanding and reasoning, but they are costly at inference time and difficult to align directly with human preferences. To this end, we propose Joint Reward Modeling (JRM), which jointly optimizes preference learning and language modeling on a shared vision-language backbone. This approach internalizes the semantic and reasoning capabilities of generative models into efficient discriminative representations, enabling fast and accurate evaluation. JRM achieves state-of-the-art results on MMRB2 and EditReward-Bench, and significantly improves stability and performance in downstream online reinforcement learning. These results show that joint training effectively bridges efficiency and semantic understanding in reward modeling.

cs.AI↗

SpatialFlow-GRPO: Where Spatial Credit Drives Image Editing

Recent online reinforcement learning has substantially improved image editing quality. However, existing Flow-GRPO-style methods usually rely on a single whole-image reward, which makes fine-grained editing optimization difficult. We observe that a key obstacle in image editing is this spatial uniformity assumption: a whole-image reward cannot distinguish how different spatial regions contribute to image quality. To address this issue, we propose SpatialFlow-GRPO, a training framework that introduces spatially fine-grained reward feedback. The framework converts region-aware rewards into semantic-region-level optimization signals and aligns region advantages with the corresponding latent positions during policy updates. We also train a region-aware reward model, SFReward, construct SFReward-14K with region-annotated editing samples, and introduce MultiEditBench to evaluate multi-region editing ability. On OmniGen2 and FLUX.2-klein-4B, SpatialFlow-GRPO outperforms Flow-GRPO on GEdit-Bench, ImgEdit-Bench, and MultiEditBench. The results show that SpatialFlow-GRPO converts local feedback into spatially aligned update signals and improves editing quality.

cs.CV↗

GreenRFM: Learning a resource-efficient radiology vision-language foundation model via supervision-centric pre-training

Radiology foundation models (RFMs) have largely inherited the scale-first recipe of natural-image vision--language pre-training. This recipe is difficult to deploy in 3D radiology, where training corpora are smaller, reports vary across institutions, and receiving hospitals often need local adaptation under privacy and compute constraints. We ask whether routine radiology reports can instead be converted into auditable diagnostic supervision that shapes the image encoder, text encoder, aligned space, and local-adaptation procedure. We develop GreenRFM, a supervision-centric pre-training framework organized around four empirical principles: More distilled, Ubiquitous, Semantic-enforcing, and Task-aligning (MUST) supervision. These principles convert noisy reports into structured diagnostic signals and use them to learn discriminative unimodal encoders plus an aligned image--text space for diagnosis-centered multimodal use. GreenRFM requires 24 GPU-hours on a single 24GB GPU (lightweight variant: 6GB VRAM, 4~hours) and reaches a zero-shot CT-RATE AUC of 84.8. Evaluations using more than 200,000 volumes from six institutions and two modalities show transfer to private clinical cohorts and to musculoskeletal MRI. On a local institutional cohort, computationally feasible retraining raises macro-AUC from 70.5 to 82.1. The aligned space also improves hepatocellular-carcinoma microvascular-invasion prediction and trans-arterial chemoembolization response analysis over established clinical scores. These results support supervision-centric pre-training as a practical route to resource-efficient, locally adaptable, diagnosis-centered radiology vision--language representations.

cs.CV↗

Center-Fed Pinching Antenna System for Uplink Environment Sensing

A center-fed pinching antenna system (C-PASS)-enabled uplink environment sensing framework is proposed. Through the center-fed framework, doubled degrees of freedom is achieved compared to conventional end-fed PASS. Based on this, we consider an uplink sensing scenario, in which a linear inverse model is developed to reconstruct the environment through signals scattered by the environment object. In the proposed framework, the distance between the feed points for stable separation of the received signals is characterized in closed form. Furthermore, Ziv-Zakai bound (ZZB) expressions for the mean-squared reconstruction error are derived for C-PASS and end-fed PASS. Based on these theoretical results, it can be proved that C-PASS achieves a strictly lower reconstruction error bound than conventional PASS for uplink environment sensing. Finally, numerical results validate the accuracy of the derived ZZB expressions and 1) demonstrate that C-PASS provides more stable separation of the received signals, and 2) confirm the consistent performance advantages of C-PASS.

cs.IT↗

Graph-Based Modeling of Financial Volatility Dynamics

Accurate forecasting of realized volatility ($RV$) is crucial for risk management and derivatives pricing. Although the implied volatility ($IV$) surface offers rich informational content, prevailing methods that treat it as a static image fail to capture its inherent dynamics. To overcome this limitation, we propose the Finance-Aware Graph Spatio-Temporal Network (FA-GSTN), a novel architecture that reframes $RV$ forecasting as modeling the evolution of a structured financial object. FA-GSTN builds a spatio-temporal graph sequence from the $IV$ surface, where nodes correspond to grid points and edges encode adaptive spatial (intra-day) and explicit temporal (inter-day) dependencies. The model incorporates domain knowledge through finance-aware node features (e.g., option Greeks) and tackles high-frequency noise via a multi-scale temporal smoothing gate coupled with an adaptive robust loss function. Comprehensive evaluations on a large-scale equity options dataset show that FA-GSTN sets a new state of the art, delivering superior predictive accuracy ($R^2$ up to 0.473). It also demonstrates remarkable data efficiency, substantially outperforming strong Vision Transformer baselines when trained on only one year of data ($R^2$: 0.372 vs. 0.315). Furthermore, the model exhibits enhanced robustness during periods of market stress, such as 2020--2021. Ablation studies confirm the vital roles of the spatio-temporal graph structure, finance-aware components, and integrated noise-handling modules. Our work underscores the substantial benefits of explicitly modeling temporal dynamics and infusing financial inductive biases for accurate and robust volatility forecasting.

q-fin.ST↗

Fine-Tuned Machine-Learned Interatomic Potentials for Structural and Vibrational Properties of Twisted 2D Materials

Twisted van der Waals bilayers form moiré superlattices whose structural and vibrational properties are highly sensitive to variations in local stacking registry and the degree of atomic reconstruction, yet accurate atomistic modeling of these systems at the DFT level remains computationally prohibitive at small twist angles. We investigate machine-learned interatomic potentials for moiré systems, using twisted bilayer graphene, \textit{h}-BN, and MoS$_2$ as representative materials spanning a broad spectrum of mechanical compliance and atomic reconstruction behavior. We show that fine-tuning universal atomistic foundation models is essential to achieve DFT accuracy for layered materials, as broadly trained foundation models prove insufficient for resolving the subtle interlayer energetics that govern atomic reconstruction. Through local strain tensor analysis and the phonon band unfolding technique, our fine-tuned MACE model reveals a consistent reconstruction-induced strain landscape in all three materials, with extended low-energy stacking domains separated by narrow soliton lines where deformation concentrates. The system progressively optimizes the local stacking registry within each domain, giving rise to a spatially structured deformation field whose amplitude scales with the mechanical compliance of the material and can be further tuned by external perturbation. The obtained results of both atomic reconstructed structures and moiré phonon spectra present a good agreement with the reported experiments, thereby demonstrating the accuracy and efficiency of our methodology in modeling of these large scale nanomaterials.

cond-mat.mtrl-sci↗

Trip+: Benchmarking Agents in Personalized Interactive Travel Planning

Interactive travel planning has become a popular use case for language models. Agents are deployed to manage evolving preferences and unexpected disruptions over multiple turns. Such settings require models to make complex, profile-conditioned planning decisions. However, existing benchmarks often evaluate feasibility, personalization, or interaction in relatively isolated settings. We therefore introduce Trip+ to measure the ability of agents to plan travel holistically. In Trip+, given traveler profiles and dynamic interactions, agents must generate and revise minute-level itineraries. End-to-end traveler experiences are evaluated via an LLM-based simulator, enabling the assessment of subjective metrics like fatigue. Our scenarios range from simple request resolutions to complex environment-driven replanning. We evaluate 18 LMs and find a consistent gap in experiential quality. Models favor technically feasible but exhausting itineraries that diverge sharply from profiled traveler preferences.

cs.AI↗