Searcharxiv⌕ Search

arXiv subjects

Jie Ren

Publications and source records attributed to Jie Ren.

At least 37 records · Page 2Linked to original sources
arXiv2026

Optically Switched Phonon Superradiance of Surface Acoustic Wave in Diamond

Surface acoustic wave (SAW) phonon coupling with nitrogen-vacancy (NV) center spins in diamond offers a promising platform for on-chip quantum phononic manipulations. Although an ensemble of NV centers coupled to a common SAW phonon mode enables superradiance and collective quantum control, achieving a tunable superradiant phase transition remains challenging. Here, we show that optically driving NV centers level transitions enhances the effective spin-phonon coupling, triggering a SAW phonon superradiant phase transition in the weak-coupling regime. We also demonstrate that above a critical threshold, the driving light rapidly switches on the phonon superradiance--a dynamic effect that persists in finite-number NV ensembles. Our results provide a controllable route to coherent phonon-NV spin manipulation in solid state quantum devices.

cond-mat.mes-hall↗
arXiv2026

ROSE: Benchmarking the Perception-to-Action Gap in Multimodal Models

Multimodal large language models (MLLMs) are increasingly expected to act on visual information, yet the same scene may require different actions under different task contexts. How reliably can a model turn the same visual evidence into the action required by the current context? To answer this question, we introduce \textsc{ROSE} (\textbf{R}eference-conditioned \textbf{O}ddity and \textbf{S}ymbolic \textbf{E}xecution), a controlled benchmark that holds the visual scene fixed while varying region constraints and required symbolic outputs. Through coupled counting and coordinate-action tasks, \textsc{ROSE} tests whether models can infer an implicit majority reference and act on the resulting fine-grained visual evidence under changing contexts. Across nine recent MLLMs, performance drops by as much as 44.5 percentage points from counting-oriented tasks to region-conditioned action, despite 98.8\% human performance. The gap persists on paired scenes and regions for which the same model returns the correct count, while global-click and matched local controls show that coordinate grounding explains only part of the loss, revealing a distinct, model-dependent bottleneck in turning shared visual evidence into context-specific actions.

cs.CV↗
arXiv2026

AutoPass: Evidence-Guided LLM Agents for Compiler Performance Tuning

Large Language Models (LLMs) show promise for code compilation tasks, but applying them to runtime performance tuning is difficult due to complex microarchitectural effects and noisy runtime measurements. We present AutoPass, a multi-agent framework for compiler performance tuning that uses compiler and runtime evidence to guide LLM-generated optimization decisions. Rather than treating the compiler as a black box like prior auto-tuning schemes, AutoPass opens up the compiler to the LLM, enabling it to query compiler-internal optimization states and analyze the intermediate representation to orchestrate compiler options. The search process iteratively refines optimization configurations using measured runtime feedback to diagnose regressions and guide latency-improving edits. AutoPass operates in an inference-only, training-free setting and requires no offline training or task-specific fine-tuning, making it readily applicable to new benchmarks and platforms. We implement AutoPass on the LLVM compiler and evaluate it on server-grade x86-64 and embedded ARM64 systems. AutoPass outperforms expert-tuned heuristics and classical autotuning methods, achieving geometric-mean speedups of 1.043x and 1.117x over LLVM -O3 on x86-64 and ARM64, respectively.

cs.SE↗
arXiv2026

Moiré Strain Skyrmions in Sliding Twisted Bilayers

Strain defect is crucial to the physical properties of solid materials. Among them, strain glass induced by defect engineering provides an important paradigm for nanoscale domain manipulation. Here, we propose purely mechanical moiré strain Skyrmions, a topologically protected elastic textures whose motion can be controlled by interlayer sliding and the chirality of the moiré bilayer. Using an empirical continuum elastic model combined with symmetry analysis, we demonstrate the Skyrmion lattice structure as the elastic ground state. Under interlayer sliding, these moiré strain Skyrmions exhibit the Skyrmion Hall effect of transverse motion, with a Hall angle determined by bilayer chirality and inversely proportional to the moiré twist angle. Our work establishes interlayer sliding as an efficient, low-energy control knob for topological excitations, offering a new paradigm for designing chiral-material-based information transport devices.

cond-mat.mtrl-sci↗
arXiv2026

Why Retrieval-Augmented Generation Fails: A Graph Perspective

Retrieval-Augmented Generation (RAG) has become a powerful and widely used approach for improving large language models by grounding generation in retrieved evidence. However, RAG systems still produce incorrect answers in many cases. Why RAG fails despite having access to external information remains poorly understood. We present a model-internal study of retrieval-augmented generation that examines how retrieved evidence influences answer generation. Using circuit tracing, we construct attribution graphs that model the flow of information through transformer layers during decoding. These graphs represent interactions among retrieved context, intermediate model activations, and generated tokens, providing a graph, circuit-level view of how external evidence is integrated into the model's reasoning process across multiple question answering benchmarks, we observe consistent structural differences: correct predictions exhibit deeper reasoning paths, more distributed evidence flow, and a more structured pattern of local connectivity, while failed predictions show shallower, fragmented, and overly concentrated evidence flow. Building on these findings, we develop a graph-based error detection framework that uses attribution-graph topology features. Furthermore, we show that attribution graphs enable targeted interventions. By reinforcing question-constrained evidence grounding, we reshape internal routing so that answer generation remains guided by the question, leading to more effective integration of retrieved information and fewer errors.

cs.CL↗
arXiv2026

Distributed Generative Inference of LLM at Internet Scales with Multi-Dimensional Communication Optimization

Decentralized LLM inference distributes computation among heterogeneous nodes across the internet, offering a performant and cost-efficient solution, alternative to traditional centralized inference. However, the low cross-node network bandwidth makes communication the primary bottleneck. In this paper, we introduce BloomBee, an internet-scale distributed LLM inference framework. BloomBee integrates LLM-layer assignment, micro-batching and tensor offloading to optimize communication from multiple dimensions. Additionally, BloomBee formulates the coordination of these techniques as an optimization problem and solves it using dynamic programming. BloomBee also customizes lossless compression and speculative decoding according to low-bandwidth network settings to reduce communication overhead. We evaluate BloomBee across a spectrum of network environments and show that it improves service throughput by up to 1.76x. It also reduces average latency by up to 43.20% compared to state-of-the-art decentralized LLM inference systems. BloomBee is open-sourced.

cs.DC↗
arXiv2026

Beyond Pixels: Introspective and Interactive Grounding for Visualization Agents

Vision-Language Models (VLMs) frequently misread values, hallucinate details, and confuse overlapping elements in charts. Current approaches rely solely on pixel interpretation, creating a Pixel-Only Bottleneck: agents treat interactive charts as static images, losing access to the structured specification that encodes exact values. We introduce Introspective and Interactive Visual Grounding (IVG), a framework that combines (1) spec-grounded introspection, which queries the underlying specification for deterministic evidence, with (2) view-grounded interaction, which manipulates the view to resolve visual ambiguity. To enable evaluation without VLM bias, we present iPlotBench, a benchmark of 500 interactive Plotly figures with 6,706 binary questions and ground-truth specifications. Experiments show that introspection improves data reconstruction fidelity, while the combination with interaction achieves the highest QA accuracy (0.81), with +6.7 % gains on overlapping geometries. We further demonstrate IVG in deployed agents that explore data autonomously and collaborate with human users in real time.

cs.CL↗
arXiv2026

Taming GPU Underutilization via Static Partitioning and Fine-grained CPU Offloading

Advances in GPU compute throughput and memory capacity brings significant opportunities to a wide range of workloads. However, efficiently utilizing these resources remains challenging, particularly because diverse application characteristics may result in imbalanced utilization. Multi-Instance GPU (MIG) is a promising approach to improve utilization by partitioning GPU compute and memory resources into fixed-size slices with isolation. Yet, its effectiveness and limitations in supporting HPC workloads remain an open question. We present a comprehensive system-level characterization of different GPU sharing options using real-world scientific, AI, and data analytics applications, including NekRS, LAMMPS, Llama3, and Qiskit. Our analysis reveals that while GPU sharing via MIG can significantly reduce resource underutilization, and enable system-level improvements in throughput and energy, interference still occurs through shared resources, such as power throttling. Our performance-resource scaling results indicate that coarse-grained provisioning for tightly coupled compute and memory resources often mismatches application needs. To address this mismatch, we propose a memory-offloading scheme that leverages the cache-coherent Nvlink-C2C interconnect to bridge the gap between coarse-grained resource slices and reduce resource underutilization.

cs.DC↗
arXiv2026

ChunQiuTR: Time-Keyed Temporal Retrieval in Classical Chinese Annals

Retrieval shapes how language models access and ground knowledge in retrieval-augmented generation (RAG). In historical research, the target is often not an arbitrary relevant passage, but the exact record for a specific regnal month, where temporal consistency matters as much as topical relevance. This is especially challenging for Classical Chinese annals, where time is expressed through terse, implicit, non-Gregorian reign phrases that must be interpreted from surrounding context, so semantically plausible evidence can still be temporally invalid. We introduce \textbf{ChunQiuTR}, a time-keyed retrieval benchmark built from the \textit{Spring and Autumn Annals} and its exegetical tradition. ChunQiuTR organizes records by month-level reign keys and includes chrono-near confounders that mirror realistic retrieval failures. We further propose \textbf{CTD} (Calendrical Temporal Dual-encoder), a time-aware dual-encoder that combines Fourier-based absolute calendrical context with relative offset biasing. Experiments show consistent gains over strong semantic dual-encoder baselines under time-keyed evaluation, supporting retrieval-time temporal consistency as a key prerequisite for faithful downstream historical RAG. Our code and datasets are available at \href{https://github.com/xbdxwyh/ChunQiuTR}{\texttt{github.com/xbdxwyh/ChunQiuTR}}.

cs.CL↗
arXiv2026

Programmable superconducting neuron with intrinsic in-memory computation and dual-timescale plasticity for ultra-efficient neuromorphic computing

The escalating energy demands of artificial intelligence pose a critical challenge to conventional computing. Leveraging the efficiency of event-driven, in-memory neuromorphic architectures into the superconducting circuits with ultra-high speed and low power dissipation advantages offers a promising solution to energy-efficient computing. However, the potential of such a solution has yet to be realized, owning to the absence of a fundamental superconducting unit that unifies programmability, local memory, and multi-timescale plasticity. Here, we introduce a programmable Josephson-junction-based leaky integrate-and-fire (LIF) neuron that features intrinsic static memory and precise programmability by encoding somatic and synaptic parameters directly in the bias current. This neuron is also capable of dual-timescale plasticity: picosecond-scale short-term modulation of spike transmission and long-term weight retention exceeding 10,000 seconds, facilitating both rapid temporal adaptation and robust weight storage. It can operate up to 45 GHz with femtojoule-level energy dissipation per spike, and supports 10 somatic threshold levels and 20 synaptic states. Furthermore, we demonstrate a crossbar-based spiking neural network (SNN) utilizing this neuron, which achieves outstanding performance across multiple tasks. By fusing computation, memory and plasticity into a single superconducting unit, our work paves the way for the next generation of ultrafast, energy-efficient neuromorphic computing.

cs.ET↗
arXiv2026

KappaFormer: Physics-aware Transformer for lattice thermal conductivity via cross-domain transfer learning

Machine learning has been widely used for predicting material properties. However, efficient prediction of lattice thermal conductivity ($κ_\mathrm{L}$) remains a long-standing challenge, primarily due to the scarcity of high-quality training data. Here we introduce KappaFormer, a physics-aware Transformer architecture that embeds the harmonic-anharmonic decomposition of $κ_\mathrm{L}$ within the network. KappaFormer comprises a harmonic branch pre-trained on large-scale elastic property data and an anharmonic branch fine-tuned on limited experimental $κ_\mathrm{L}$ data, enabling effective knowledge transfer and enhanced generalization. High-throughput screening with KappaFormer identifies multiple candidates with ultralow $κ_\mathrm{L}$, which are further confirmed by first-principles calculations. Physics interpretability further elucidates the vibrational mechanisms governing thermal transport suppression, linking structural motifs to strong anharmonicity. This study provides a generalizable framework for physics-guided machine learning to accelerate the discovery of new materials.

cond-mat.mtrl-sci↗
arXiv2026

Collective Interference of Phonon Spin and Dipole Moment Rotation Induced Circular Dichroism

The classical field description of phonon spin relies on the invariance of a continuous elastic field under infinitesimal rotation. However, a local medium element in the continuous field may contain large numbers of vibrational particles at microscopic level, like for complex lattices with many atoms in a unit cell. We find this causes the phonon spin in real materials no longer a simple sum of each atom rotation, but a collective interference of many atoms, since phonons are phase-coherent vibrational modes across unit cells. We demonstrate the collective interference phonon spin manifested as the dipole moment rotating (DMR) of charge-polarized unit cell, by deriving the infrared circular dichroism (ICD) with phonon-photon interaction in complex lattices. We compare the DMR with the local atom rotation without interference, and exemplify their distinct ICD spectrum in a chiral lattice model and two realistic chiral materials. Detectable ICD measurements are proposed in quartz with Weyl phonon near Gamma point. Our study underlies the important role of collective interference and uncovers a deeper insight of phonon spin in real materials with complex lattices.

cond-mat.mtrl-sci↗
arXiv2026

FCMBench: The First Large-scale Financial Credit Multimodal Benchmark for Real-world Applications

FCMBench is the first large-scale and privacy-compliant multimodal benchmark for real-world financial credit applications, covering tasks and robustness challenges from domain specific workflows and constraints. The current version of FCMBench covers 26 certificate types, with 5198 privacy-compliant images and 13806 paired VQA samples. It evaluates models on Perception and Reasoning tasks under real-world Robustness interferences, including 3 foundational perception tasks, 4 credit-specific reasoning tasks demanding decision-oriented visual evidence interpretation, and 10 real-world challenges for rigorous robustness stress testing. Moreover, FCMBench offers privacy-compliant realism with minimal leakage risk through in-house scenario-aware captures of manually synthesized templates, without any publicly released images. We conduct extensive evaluations of 28 state-of-the-art vision-language models spanning 14 AI companies and research institutes. Among them, Gemini 3 Pro achieves the best F1 score as a commercial model (65.16), Kimi-K2.5 achieves the best score as an open-source baseline (60.58). The mean and the std. of all tested models is 44.8 and 10.3 respectively, indicating that FCMBench is non-trivial and provides strong resolution for separating modern vision-language model capabilities. Robustness evaluations reveal that even top-performing models experience notable performance degradation under the designed challenges. We have open-sourced this benchmark to advance AI research in the credit domain and provide a domain-specific task for real-world AI applications.

cs.CV↗
arXiv2026

Complexity Powered Machine Intelligent Classification of Quantum Many-Body Dynamics

Identifying and classifying quantum phases from measurable time series in many-body dynamics have significant values, yet face formidable challenges, requiring profound knowledge of physicists. Here, to achieve a pure data-driven machine intelligent classification, we introduce a complexity boosted distance measure that captures the inherent complexity of dynamic evolution series in different quantum many-body phases. Significantly, the introduction of complexity-boosted distance leads to remarkable improvements of unsupervised manifold learning of quantum many-body dynamics, which are exemplified in discrete time crystal model, Aubry-André model, and quantum east model. Our method does not require any prior knowledge and exhibits effectiveness even in imperfect, disordered, and noisy situations that are challenging for human scientists. Successful classification of dynamic phases in many-body systems holds the potential to enable crucial applications, including identification of tsunamis, earthquakes, catastrophes and future trends in finance.

cond-mat.mes-hall↗
arXiv2026

Ctrl-GenAug: Controllable Generative Augmentation for Medical Sequence Classification

In the medical field, the limited availability of large-scale datasets and labor-intensive annotation processes hinder the performance of deep models. Diffusion-based generative augmentation approaches present a promising solution to this issue, having been proven effective in advancing downstream medical recognition tasks. Nevertheless, existing works lack sufficient semantic and sequential steerability for challenging video/3D sequence generation, and neglect quality control of noisy synthesized samples, resulting in unreliable synthetic databases and severely limiting the performance of downstream tasks. In this work, we present Ctrl-GenAug, a novel and general generative augmentation framework that enables highly semantic- and sequential-customized sequence synthesis and suppresses incorrectly synthesized samples, to aid medical sequence classification. Specifically, we first design a multimodal conditions-guided sequence generator for controllably synthesizing diagnosis-promotive samples. A sequential augmentation module is integrated to enhance the temporal/stereoscopic coherence of generated samples. Then, we propose a noisy synthetic data filter to suppress unreliable cases at semantic and sequential levels. Extensive experiments on 3 medical datasets, using 11 networks trained on 3 paradigms, comprehensively analyze the effectiveness and generality of Ctrl-GenAug, particularly in underrepresented high-risk populations and out-domain conditions.

cs.CV↗
arXiv2026

A Non-compact Positivity-Preserving Scheme for Parabolic PDE via Conditional Expectation

We propose a novel non-compact, positivity-preserving scheme for linear non-divergence form parabolic equations. Based on the Feynman-Kac formula, the solution is expressed as a conditional expectation of an associated diffusion process. Instead of using compact Markov chain approximations, we employ a wide stencil scheme to approximate the conditional expectation, ensuring consistency and positivity preservation. This method is effective for anisotropic diffusion with mixed derivatives, where classical schemes often fail unless the covariance matrix is diagonally dominated. A key feature of our framework is its robust treatment of boundary conditions, which avoids the accuracy loss commonly encountered in BZ and semi-Lagrangian schemes. For Dirichlet boundaries, we introduce (i) a quad-tree non-uniform stopping time scheme with O($Δt^{1/2}$) accuracy and (ii) a quad-tree uniform stopping time scheme with O($Δt$) accuracy. For Neumann boundaries, we use discrete specular reflection with O($Δt^{1/2}$) convergence, while periodic boundaries are treated using modular wrapping, achieving O($Δt$) accuracy. All analyses are conducted under the practical scaling $Δt \sim h$. Except for the uniform stopping time scheme, all schemes are explicit. The schemes are unconditionally stable and positive preserving, thanks to the probabilistic structure. To ensure consistency, a non-compact stencil is involved, which leads to the large time step constraint $Δt \sim h$. Numerical experiments confirm the predicted $L^\infty$ convergence rates for all types of boundary conditions.

math.NA↗
arXiv2026

Artificial Gauge Field Engineered Excited-State Topology: Control of Dynamical Evolution of Localized Spinons

Spinons are elementary excitations at the core of frustrated quantum magnets. Although it is well-established that a pair of spinons can emerge from a magnon via deconfinement, controlled manipulation of individual spinons and direct observation of their deconfinement remain elusive. We propose an artificial gauge field scenario that enables the engineering of specific excited states in quantum spin models. This generates spatially localized individual spinons with high controllability. By applying time-dependent gauge fields, we realize adiabatic braiding of these spinons, as well as their dynamical evolution in a controllable manner. These results not only provide the first direct visualization of individual spinons localized in the bulk, but also point to new possibilities to simulate their confinement process. Finally, we demonstrate the feasibility of our scenario in Rydberg atoms, which suggests an experimentally viable direction--gauge field engineering of correlated phenomena in excited states.

cond-mat.str-el↗
arXiv2025

SETS: Leveraging Self-Verification and Self-Correction for Improved Test-Time Scaling

Recent advancements in Large Language Models (LLMs) have created new opportunities to enhance performance on complex reasoning tasks by leveraging test-time computation. However, existing scaling methods have key limitations: parallel methods like repeated sampling are often inefficient and quickly saturate, while sequential methods like SELF-REFINE struggle to improve after a few rounds. Although combining these approaches shows promise, current methods require fine-tuned reward and revision models. This paper proposes Self-Enhanced Test-Time Scaling (SETS), a simple yet effective approach that overcomes these limitations by strategically combining parallel and sequential techniques and fully leveraging LLMs' self-improvement abilities. SETS exploits the inherent self-verification and self-correction capabilities of LLMs, unifying sampling, verification, and correction within a single framework. This facilitates efficient and scalable test-time computation for enhanced performance on complex tasks without any model training. Our comprehensive experimental results on challenging benchmarks spanning planning, reasoning, math, and coding demonstrate that SETS achieves significant performance improvements and more advantageous test-time scaling behavior than the alternatives.

cs.AI↗