Searcharxiv⌕ Search

arXiv subjects

Yao Wang

Publications and source records attributed to Yao Wang.

At least 55 records · Page 3Linked to original sources
arXiv2026

Can LLMs extract scientific consensus? A case study in high-temperature superconductivity

Scientific knowledge is increasingly dispersed across vast and heterogeneous scientific literature, where important claims are often implicit, evolving, and internally debated. While large language models (LLMs) have shown impressive performance in information extraction and summarization, their ability to recover latent scientific consensus remains unclear. Here, we investigate this problem in the context of high-temperature superconductivity (HTS), a long-standing and highly debated topic in condensed matter physics, as a challenging testbed. Using near 18,000 highly-cited publications over the past seven decades, we construct a structured knowledge graph linking competing superconducting mechanisms, material families, evidential modalities, and citation relations. We find that LLM-extracted representations recover coherent and physically interpretable structures, including family-dependent mechanism profiles, evidence-specific correlations, and citation-mediated temporal evolution of scientific beliefs. Ablation studies on LLM further show that the global structure remains robust across prompting, decoding, and model variations. Our results suggest that LLMs can indeed serve as scalable tools for deciphering scientific knowledge in domains characterized by competing interpretations and evolving knowledge.

cs.DL↗
arXiv2026

Reason Only When Needed: Efficient Generative Reward Modeling via Model-Internal Uncertainty

Recent advancements in the Generative Reward Model (GRM) have demonstrated its potential to enhance the reasoning abilities of LLMs through Chain-of-Thought (CoT) prompting. Despite these gains, existing implementations of GRM suffer from two critical limitations. First, CoT prompting is applied indiscriminately to all inputs regardless of their inherent complexity. This introduces unnecessary computational costs for tasks amenable to fast, direct inference. Second, existing approaches primarily rely on voting-based mechanisms to evaluate CoT outputs, which often lack granularity and precision in assessing reasoning quality. In this paper, we propose E-GRM, an efficient generative reward modeling framework grounded in model-internal uncertainty. E-GRM leverages the convergence behavior of parallel model generations to estimate uncertainty and selectively trigger CoT reasoning only when needed, without relying on handcrafted features or task-dependent signals. To improve reward fidelity, we introduce a lightweight discriminative scorer trained with a hybrid regression--ranking objective to provide fine-grained evaluation of reasoning paths. Experiments on multiple reasoning benchmarks show that E-GRM substantially reduces inference cost while consistently improving answer accuracy, demonstrating that model-internal uncertainty is an effective and general signal for efficient reasoning-aware reward modeling.

cs.CL↗
arXiv2026

Simulating non-Markovian open quantum dynamics by exploiting physics-informed neural network

This work integrates the physics-informed neural network (PINN) approach into the neural quantum state framework to simulate open quantum system dynamics, to circumvent the computationally expensive time-dependent variational principle required in conventional variational methods. The proposed PINN-DQME method employs time-encoded neural networks within a time-domain decomposition strategy to represent the evolution governed by the dissipaton-embedded quantum master equation (DQME). We implement and validate this approach in the single-impurity Anderson model, benchmarking the PINN-DQME results against the numerically exact hierarchical equations of motion. The PINN-DQME method demonstrates high accuracy in simulating quantum dissipative dynamics at high temperatures, where non-Markovian effects are weak. However, for strongly non-Markovian dynamics at low temperatures, it encounters challenges with error accumulation during time propagation, highlighting an area for future refinement in applying PINNs to complex quantum dynamical settings.

quant-ph↗
arXiv2026

Instability of Nagaoka State and Quantum Phase Transition via Kinetic Frustration Control

We investigate the Nagaoka-Thouless (NT) ferromagnetic instability in the strongly interacting $t$-$t'$ Hubbard model by continuously breaking particle-hole symmetry on a tunable square-triangular lattice geometry. We use an analytic approach to show that the fully spin-polarized state becomes unstable to a metastable spin-polaron when the kinetic frustration $t'/t$ exceeds a critical, dimension-dependent value. Large-scale density matrix renormalization group simulations reveal a quantum phase transition from the NT ferromagnet to a spiral spin-density wave, which evolves continuously into the Haerter-Shastry antiferromagnet in the large-frustration limit. Remarkably, this transition remains robust at low but finite hole density, making it accessible in cold-atom and moiré Hubbard platforms under strong interactions. A variational analysis further captures the instability mechanism at finite density via frustration-induced magnon band deformation.

cond-mat.str-el↗
arXiv2026

DV-World: Benchmarking Data Visualization Agents in Real-World Scenarios

Real-world data visualization (DV) requires native environmental grounding, cross-platform evolution, and proactive intent alignment. Yet, existing benchmarks often suffer from code-sandbox confinement, single-language creation-only tasks, and assumption of perfect intent. To bridge these gaps, we introduce DV-World, a benchmark of 260 tasks designed to evaluate DV agents across real-world professional lifecycles. DV-World spans three domains: DV-Sheet for native spreadsheet manipulation including chart and dashboard creation as well as diagnostic repair; DV-Evolution for adapting and restructuring reference visual artifacts to fit new data across diverse programming paradigms and DV-Interact for proactive intent alignment with a user simulator that mimics real-world ambiguous requirements. Our hybrid evaluation framework integrates Table-value Alignment for numerical precision and MLLM-as-a-Judge with rubrics for semantic-visual assessment. Experiments reveal that state-of-the-art models achieve less than 50% overall performance, exposing critical deficits in handling the complex challenges of real-world data visualization. DV-World provides a realistic testbed to steer development toward the versatile expertise required in enterprise workflows. Our data and code are available at \href{https://github.com/DA-Open/DV-World}{this project page}.

cs.CL↗
arXiv2026

Comparison of sEMG Encoding Accuracy Across Speech Modes Using Articulatory and Phoneme Features

We test whether Speech Articulatory Coding (SPARC) features can linearly predict surface electromyography (sEMG) envelopes across aloud, mimed, and subvocal speech in twenty-four subjects. Using elastic-net multivariate temporal response function (mTRF) with sentence-level cross-validation, SPARC yields higher prediction accuracy than phoneme one-hot representations on nearly all electrodes and in all speech modes. Aloud and mimed speech perform comparably, and subvocal speech remains above chance, indicating detectable articulatory activity. Variance partitioning shows a substantial unique contribution from SPARC and a minimal unique contribution from phoneme features. mTRF weight patterns reveal anatomically interpretable relationships between electrode sites and articulatory movements that remain consistent across modes. This study focuses on representation/encoding analysis (not end-to-end decoding) and supports SPARC as a robust and interpretable intermediate target for sEMG-based silent-speech modeling.

cs.SD↗
arXiv2026

Quantum Knowledge Graph: Modeling Context-Dependent Triplet Validity

Knowledge graphs (KGs) are increasingly used to support large lan guage model (LLM) reasoning, but standard triplet-based KGs treat each relation as globally valid. In many settings, whether a relation should count as evidence depends on the context. We therefore formulate triplet validity as a triplet-specific function of context and refer to this formulation as a Quantum Knowledge Graph (QKG). We instantiate QKG in medicine using a diabetes-centered PrimeKG subgraph, whose 68,651 context-sensitive relations are further annotated with patient-group-specific constraints. We evaluate it in a reasoner--validator pipeline for medical question answering on a KG-grounded subset of MedReason containing 2,788 questions. With Haiku-4.5 as both the Reasoner and the Validator, KG-backed validation significantly improves over a no-validator baseline ($+0.61$ pp), and QKG with context matching yields the largest gain, outperforming both KG validation without context matching ($+0.79$ pp) and the no-validator baseline ($+1.40$ pp; paired McNemar, all $p<0.05$). Under a stronger validator (Qwen-3.6-Plus), the raw QKG gain over the no-validator baseline grows from $+1.40$ pp to $+5.96$ pp; the context-matching gap is non-significant ($p=0.73$) on the raw set but becomes borderline significant ($p=0.05$) after adjustment for knowledge leakage and suspicious questions, consistent with a benchmark-gold ceiling rather than a QKG limitation. Taken together, the results support the view that the value of a KG in LLM-based clinical reasoning lies not merely in storing medically related facts, but in representing whether those facts are applicable to the specific patient context. For reproducibility and further research, we release the curated QKG datasets and source code.\footnote{https://github.com/HKAI-Sci/QKG}

cs.CL↗
arXiv2026

Why Supervised Fine-Tuning Fails to Learn: A Systematic Study of Incomplete Learning in Large Language Models

Supervised Fine-Tuning (SFT) is the standard approach for adapting large language models (LLMs) to downstream tasks. However, we observe a persistent failure mode: even after convergence, models often fail to correctly reproduce a subset of their own supervised training data. We refer to this behavior as the Incomplete Learning Phenomenon(ILP). This paper presents the first systematic study of ILP in LLM fine-tuning. We formalize ILP as post-training failure to internalize supervised instances and demonstrate its prevalence across multiple model families, domains, and datasets. Through controlled analyses, we identify five recurrent sources of incomplete learning: (1) missing prerequisite knowledge in the pre-trained model, (2) conflicts between SFT supervision and pre-training knowledge, (3) internal inconsistencies within SFT data, (4) left-side forgetting during sequential fine-tuning, and (5) insufficient optimization for rare or complex patterns. We introduce a diagnostic-first framework that maps unlearned samples to these causes using observable training and inference signals, and study several targeted mitigation strategies as causal interventions. Experiments on Qwen, LLaMA, and OLMo2 show that incomplete learning is widespread and heterogeneous, and that improvements in aggregate metrics can mask persistent unlearned subsets. The findings highlight the need for fine-grained diagnosis of what supervised fine-tuning fails to learn, and why.

cs.CL↗
arXiv2026

Novel Light-Induced States in Triangular Metallic Magnet

Novel nonequilibrium states of magnet induced by light attract considerable attention both in nature of physics and apply. In this work, we systematically explore the electronic and magnetic states of a double-exchange model on a triangular lattice under the irradiation of circularly polarized continuous wave field, by means of molecular dynamics calculation. Several exotic nonequilibrium magnetic states are discovered, including a vortex state, long-range magnetic orders at the $Γ$ and $\textbf{K}/2$, as well as quasi(dynamical)-long-range magnetic order at the $\textbf{K}$ and $\textbf{M}$, respectively. Correspondingly, the evolution of electron bands and fillings are also uncovered. These results offer a promising candidate approach for the optical control of exotic magnetic and electronic states.

cond-mat.str-el↗
arXiv2026

Compressive hyperspectral phasor imaging with single-pixel detection for spectral tasks

Spectral vision task plays a pivotal role in extracting discriminative spectral-spatial features from high-dimensional data, enabling fine-grained identification beyond human vision. Traditional methods usually involve first collecting rich spectral-spatial information and then using complex algorithms to digitally process it into scene classification and recognition. However, the complexity of processing massive three-dimensional (3D) hyperspectral datasets poses challenges for algorithms. Here, we demonstrate a compressive Hyperspectral Phasor Imaging with Single-pixel detection (HyPIS) that leverages highly compressed spatial-spectral data to achieve spectral task. Two optical encoders are used for wavelength-dependent sine- and cosine-encoding that transforms spectral signals into a two-dimensional (2D) phasor plot. By applying spatial-temporal illumination patterns, a single-pixel detector is enough to reconstruct the phasor image of the object. This allows to directly generate pixel-wise spectral task, bypassing 3D hyperspectral data. Our experiments show that HyPIS can perform real-time classification and recognition tasks of different scenes, reducing the required amount of data by two orders of magnitude, and it can still accurately classify under low light and uneven lighting conditions. This work develops a completely new spectral technology that enables spectral tasks to be performed without obtaining high-resolution hyperspectral datasets, holding promise for spectral applications in mobile devices, robotics, and satellite technologies.

physics.optics↗
arXiv2026

Local thermal probe in a one-dimensional chain: An efficient dissipaton-based approach

We study a system consisting of an infinite one-dimensional molecular chain and a locally coupled probe. Starting from the Hamiltonian of the chain-probe composite and the corresponding spectral densities, we evaluate the heat current between the probe and the chain. For this purpose, we develop a dissipaton-based quantum approach that is fully nonperturbative and non-Markovian. The dissipaton algebra yields a set of hierarchically coupled equations of motion for the dissipaton moments, with cross-tier connections in an iterative manner if higher-order chain-probe interactions are included. Numerical results demonstrate the effects of temperature, frequency, onsite energy modification and higher-order couplings on heat transport. This work provides a general framework for thermal transport and other properties in locally probed systems and can be straightforwardly extended to higher-dimensional materials and electronic transport problems with strong many-body effects.

physics.chem-ph↗
arXiv2026

Open Quantum Systems from Dynamical Constraints

Open quantum systems are traditionally described by decomposing the total Hilbert space into a system and an external environment, linked by an explicit interaction Hamiltonian. We propose an alternative framework in which the environment is not introduced as an independent sector a priori, but instead emerges from the dynamical activation of constraints in an initially constrained quantum system. Within Dirac quantization, the physical degrees of freedom define the system, whereas the constraint sector, once promoted to carry its own dynamics, functions as an environment. In this picture, the system-environment coupling is not added through a separate interaction term, but is encoded directly in the constraint structure. As an example, we study a quantum particle coupled to a Brownian-oscillator environment and show how the resulting environmental influence can be formulated in this constraint-based setting. Our results provide a new perspective on the origin of quantum environments and point toward a general framework for open quantum systems rooted in constrained quantization.

quant-ph↗
arXiv2026

Privacy-Preserving EHR Data Transformation via Geometric Operators: A Human-AI Co-Design Technical Report

Electronic health records (EHRs) and other real-world clinical data are essential for clinical research, medical artificial intelligence, and life science, but their sharing is severely limited by privacy, governance, and interoperability constraints. These barriers create persistent data silos that hinder multi-center studies, large-scale model development, and broader biomedical discovery. Existing privacy-preserving approaches, including multi-party computation and related cryptographic techniques, provide strong protection but often introduce substantial computational overhead, reducing the efficiency of large-scale machine learning and foundation-model training. In addition, many such methods make data usable for restricted computation while leaving them effectively invisible to clinicians and researchers, limiting their value in workflows that still require direct inspection, exploratory analysis, and human interpretation. We propose a real-world-data transformation framework for privacy-preserving sharing of structured clinical records. Instead of converting data into opaque representations, our approach constructs transformed numeric views that preserve medical semantics and major statistical properties while, under a clearly specified threat model, provably breaking direct linkage between those views and protected patient-level attributes. Through collaboration between computer scientists and the AI agent \textbf{SciencePal}, acting as a constrained tool inventor under human guidance, we design three transformation operators that are non-reversible within this threat model, together with an additional mixing strategy for high-risk scenarios, supported by theoretical analysis and empirical evaluation under reconstruction, record linkage, membership inference, and attribute inference attacks.

cs.CR↗
arXiv2026

FB-CLIP: Fine-Grained Zero-Shot Anomaly Detection with Foreground-Background Disentanglement

Fine-grained anomaly detection is crucial in industrial and medical applications, but labeled anomalies are often scarce, making zero-shot detection challenging. While vision-language models like CLIP offer promising solutions, they struggle with foreground-background feature entanglement and coarse textual semantics. We propose FB-CLIP, a framework that enhances anomaly localization via multi-strategy textual representations and foreground-background separation. In the textual modality, it combines End-of-Text features, global-pooled representations, and attention-weighted token features for richer semantic cues. In the visual modality, multi-view soft separation along identity, semantic, and spatial dimensions, together with background suppression, reduces interference and improves discriminability. Semantic Consistency Regularization (SCR) aligns image features with normal and abnormal textual prototypes, suppressing uncertain matches and enlarging semantic gaps. Experiments show that FB-CLIP effectively distinguishes anomalies from complex backgrounds, achieving accurate fine-grained anomaly detection and localization under zero-shot settings.

cs.CV↗
arXiv2026

Programmable, Spontaneous Superlattice Memory in a Monolayer Topological Insulator

Memory is a foundational concept across disciplines, from neurobiology and electronics to artificial intelligence and quantum gravity. In materials, memory effects typically arise from ferroic orders, such as ferroelectricity and ferromagnetism, where information is stored in charge or spin degrees of freedom. Here, we report a surprising discovery of a nonvolatile superlattice memory effect in monolayer TaIrTe4, a dual quantum spin Hall insulator, where information is encoded through sharply contrasting lattice periodicities. In particular, in a pristine monolayer, we observe the spontaneous emergence of a long-period superlattice that can be programmed ON and OFF in a nonvolatile manner by electrostatic tuning of low-energy electronic states. This switching toggles the system between two structural configurations with unit cell areas differing by nearly two orders of magnitude. Mechanistically, our results reveal two independent and distinct instabilities, one in the lattice and the other in the QSH electrons, which are coupled, leading to electrostatic control of lattice configurations with nonvolatile memory. This finding is enabled by combining linear and nonlinear transport measurements, Raman spectroscopy, and scanning tunneling microscopy, which probe complementary aspects of the underlying orders. Remarkably, this nonvolatile memory effect stabilizes a spontaneous superlattice with a periodicity on the few-nanometer scale that remains robust across a wide doping range, persists over days, and survives above 70 K. Combined with the QSH topology, this stability offers a promising route to nonvolatile memory control of topological flat bands and their filling enabled quantum states. Our preliminary data indeed show the emergence of new insulating states at fractional superlattice fillings, which can be clearly switched ON and OFF together with the superlattice.

cond-mat.mes-hall↗
arXiv2026

Event-Centric Human Value Understanding in News-Domain Texts: An Actor-Conditioned, Multi-Granularity Benchmark

Existing human value datasets do not directly support value understanding in factual news: many are actor-agnostic, rely on isolated utterances or synthetic scenarios, and lack explicit event structure or value direction. We present \textbf{NEVU} (\textbf{N}ews \textbf{E}vent-centric \textbf{V}alue \textbf{U}nderstanding), a benchmark for \emph{actor-conditioned}, \emph{event-centric}, and \emph{direction-aware} human value recognition in factual news. NEVU evaluates whether models can identify value cues, attribute them to the correct actor, and determine value direction from grounded evidence. Built from 2{,}865 English news articles, NEVU organizes annotations at four semantic unit levels (\textbf{Subevent}, \textbf{behavior-based composite event}, \textbf{story-based composite event}, and \textbf{Article}) and labels \mbox{(unit, actor)} pairs for fine-grained evaluation across local and composite contexts. The annotations are produced through an LLM-assisted pipeline with staged verification and targeted human auditing. Using a hierarchical value space with \textbf{54} fine-grained values and \textbf{20} coarse-grained categories, NEVU covers 45{,}793 unit--actor pairs and 168{,}061 directed value instances. We provide unified baselines for proprietary and open-source LLMs, and find that lightweight adaptation (LoRA) consistently improves open-source models, showing that although NEVU is designed primarily as a benchmark, it also supports supervised adaptation beyond prompting-only evaluation. Data availability is described in Appendix~\ref{app:data_code_availability}.

cs.CL↗
arXiv2026

Tensor Completion Leveraging Graph Information: A Dynamic Regularization Approach with Statistical Guarantees

We consider the problem of tensor completion with graphs serving as side information to represent interrelationships among variables. Existing approaches suffer from several limitations: (1) they are often task-specific and lack generality or systematic formulation; (2) they typically treat graphs as static structures, ignoring their inherent dynamism in tensor-based settings; (3) they lack theoretical guarantees on statistical and computational complexity. To address these issues, we introduce a pioneering framework that systematically develops a novel model, theory, and algorithm for dynamic graph-regularized tensor completion. At the modeling level, we establish a rigorous mathematical representation of dynamic graphs and derive a new tensor-oriented graph smoothness regularization effectively capturing the similarity structure of the tensor. At the theory level, we establish the statistical consistency for our model under certain conditions, providing the first theoretical guarantees for tensor recovery in the presence of graph information. Moreover, we develop an efficient algorithm with guaranteed convergence. A series of experiments on both synthetic and real-world data demonstrate that our method achieves superior recovery accuracy, especially under highly sparse observations and strong dynamics.

cs.LG↗
arXiv2026

All-day Multi-scenes Lifelong Vision-and-Language Navigation with Tucker Adaptation

Deploying vision-and-language navigation (VLN) agents requires adaptation across diverse scenes and environments, but fine-tuning on a specific scenario often causes catastrophic forgetting in others, which severely limits flexible long-term deployment. We formalize this challenge as the all-day multi-scenes lifelong VLN (AML-VLN) problem. Existing parameter-efficient adapters (e.g., LoRA and its variants) are limited by their two-dimensional matrix form, which fails to capture the multi-hierarchical navigation knowledge spanning multiple scenes and environments. To address this, we propose Tucker Adaptation (TuKA), which represents the multi-hierarchical navigation knowledge as a high-order tensor and leverages Tucker decomposition to decouple the knowledge into shared subspaces and scenario-specific experts. We further introduce a decoupled knowledge incremental learning strategy to consolidate shared subspaces while constraining specific experts for decoupled lifelong learning. Building on TuKA, we also develop a VLN agent named AlldayWalker, which continually learns across multiple navigation scenarios, achieving all-day multi-scenes navigation. Extensive experiments show that AlldayWalker consistently outperforms state-of-the-art baselines.

cs.CV↗