Searcharxiv⌕ Search

arXiv subjects

Dong Wang

Publications and source records attributed to Dong Wang.

At least 19 recordsLinked to original sources
arXiv2026

Twist and strain identification in moir\'e heterostructures

The geometrical and electronic properties of moir\'e materials are highly sensitive to the twist and strain in the samples due to the moir\'e magnifying effect. Accurate identification of twist and strain in moir\'e materials is therefore essential. In this work, we establish a general framework to extract the twist and strain configurations from moir\'e images with either atomic or moir\'e scale resolution. With only moir\'e-wavelength information, we show that there is a continuous family of possible twist and strain configurations, each one accounting for different orientations of the moir\'e pattern. To estimate the most likely twist-strain configuration, we discuss additional constraints and methods involving the minimum elastic energy and the electronic spectra. The minimum elastic energy, in particular, reflects that shear configurations become much more favorable as the strain increases. As an example of the developed methodology, we discuss the formation and identification of strained triangular moir\'e patterns. Our framework provides a comprehensive approach to identify the twist and strain configurations in systems with moir\'e-scale resolution.

cond-mat.mtrl-sci↗
arXiv2026

Tunable topological narrow bands in twisted bilayer-trilayer graphene

We investigate the low-energy band structure and topology of twisted bilayer--trilayer graphene with four stacking configurations: AB--ABC, BA--ABC, AB--ABA, and BA--ABA. Using both tight-binding and continuum models, we first establish that the two approaches show good agreement in the band structure in low-energy regime. We then study the evolution of the flat bands and their valley Chern numbers as functions of twist angle, perpendicular electric field, and the self-consistent Hartree potential. At relatively large twist angles and under electric field, we find a topological transition between the narrow bands, with the total Chern number of the flat bands following the Chern number sum rules derived from the chiral-limit description. We also observe another type of topological transition when the flat bands hybridize with adjacent remote bands, where gap closing and reopening processes lead to Chern number and charge density transfer. By constructing topological phase diagrams in the space of twist angle and electric field, we show that the perpendicular electric field provides an efficient tuning knob for controlling the stability and transitions of the Chern bands. Finally, we find that the Hartree potential mainly induce weak band shifts and reshaping in the narrow bands. However, with a combination of Hartree potential and the electric fields, the narrow bands show rich topological phase diagram. Our results clarify the interplay between the stacking, twist angle and electric field in manipulating the narrow bands and their topology in twisted bilayer--trilayer graphene, and provide guidance for engineering topological narrow bands with tunable Chern numbers in realistic twisted multilayer graphene systems.

cond-mat.mes-hall↗
arXiv2026

CEDAR: Error-Bounded Residual Routing for Efficient Long-Context Attention

Post-hoc sparse attention accelerates long-context prefill by routing each query to a small set of token-level interactions. Hard selection, however, assigns zero probability to every omitted chunk: a routing miss cannot be recovered, and a fixed expansion budget spends the same work on easy and ambiguous queries. We introduce Coarse-to-fine Error-aware Dynamic Attention Routing (CEDAR), a coarse-to-fine method that keeps the language model frozen while preserving global coverage. Each semantic chunk contributes a cheap key--value summary to a residual attention path; chunks with high estimated approximation error are then expanded to exact token attention. Exact and summarized contributions are combined in a single softmax normalization, so refinement replaces, rather than duplicates, coarse evidence. We derive an output-error bound governed by within-chunk key/value dispersion and use it to allocate a variable refinement budget. A controlled clustered-attention study shows that residual summaries reduce reconstruction error by more than 98% relative to hard dropping at equal exact-chunk budgets. Experiments on long-context benchmarks demonstrate that CEDAR recovers most of the quality lost by hard sparse routing while maintaining approximately $3\times$ kernel speedup at 128K context.

cs.CL↗
arXiv2026

Elastic Horizon: Discovering the Effective Interaction Frontier in Agentic Reinforcement Learning

Scaling the interaction horizon-the maximum number of environment interactions per episode-improves LLM agents on long-horizon tasks, and curriculum-based methods that progressively expand the horizon outperform fixed-horizon alternatives. However, existing schedules are open-loop: they monotonically increase the horizon until a manually specified maximum, with no mechanism to detect when further expansion stops helping. We propose the effective interaction frontier hypothesis: a dynamic boundary beyond which additional interactions yield diminishing returns while cost grows linearly. We then introduce Elastic Horizon, a closed-loop controller that tracks this boundary via the 90th percentile of successful trajectory lengths. On AppWorld and BFCL, fixed-horizon sweeps reveal clear saturation plateaus; Elastic Horizon stabilizes the horizon inside the saturation band from both under- and over-capacity initializations, attains the best success rates across 7B and 14B backbones, and saves up to 25% of per-step trajectory tokens. Our work shifts the paradigm from how to scale interaction horizons to when to stop scaling.

cs.AI↗
arXiv2026

On the Interaction Between Model Compression and Test-Time Adaptation

Deep neural networks deployed in the wild must be both efficient and adaptable, requiring model compression and test-time adaptation (TTA). While both are well studied in isolation, their interaction remains poorly understood. We systematically analyze how structured compression affects a model's ability to adapt under distribution shift. Using ResNet-18 and ViT-Base on CIFAR-10-C and ImageNet-C, we evaluate multiple compression methods combined with standard TTA techniques. We introduce a diagnostic framework that examines representational expressivity and adaptation subspace compatibility. Our results reveal a consistent gap: although compressed models retain high accuracy under supervised adaptation, their TTA performance degrades significantly with increasing compression. We show that this stems from reduced representational diversity and structural constraints that limit recoverability. These effects strongly depend on the compression method, highlighting the need to design compression strategies that preserve adaptability.

cs.LG↗
arXiv2026

Learning to Track from Privileged Target Appearances

Target templates define what a visual tracker searches for, yet the templates available at inference trade off localization certainty with appearance freshness: the initial ground-truth template is exact but becomes stale, whereas recent templates better reflect the current appearance but are cropped from uncertain predictions. We quantify this bottleneck with a non-deployable oracle that supplies an exact current-frame target crop, improving AUC on LaSOT by 15.2 percentage points. This gap reveals a training-only opportunity: frame-level ground truths provide exact current- and future-frame target crops, although such crops are unavailable at deployment. We introduce Privileged Appearance Transfer for Tracking (PATT), a teacher-student training framework that transfers these privileged appearances to a deployable tracker through multi-level representation prediction. The privileged teacher observes exact target crops from past, current, and future frames, whereas the student receives only past-frame templates and learns to predict the teacher's search representations. To avoid transferring unreliable teacher signals, PATT weights this transfer by the teacher's relative localization advantage over the student and its absolute localization accuracy. After training, the teacher, latent predictor, reliability weights, and privileged crops are removed, leaving standard student-only inference. Across seven benchmarks at two model scales, PATT achieves consistent gains under both long- and short-term tracking protocols.

cs.CV↗
arXiv2026

The advantages of extended nonreciprocal quantum batteries

This study investigates the performance of extended nonreciprocal quantum batteries (QBs), as well as its advantages in energy storage and energy transfer compared to reciprocal charging and the original nonreciprocal batteries. After analyzing the detuning between the charging system and the external pump, we discover that resonance is a key factor in maintaining high-energy batteries and high charging power; furthermore, the detuning of the charger or battery determines the stability of the charging process for different structures. Research on steady-state energy storage in batteries revealed that single-threaded or multi-threaded charging can achieve nearly infinite energy storage in weakly localized environments, thereby demonstrating the significant energy advantages of extended nonreciprocal quantum batteries. Finally, by considering the energy distribution within the charging system, we observe that nonreciprocal charging offers energy transfer advantages unmatched by reciprocal charging; the former achieves a comprehensive balance between charging cost and energy storage capacity that the latter cannot match. As a novel and superior charging protocol, our findings are expected to provide a potent reference for the promotion and practical implementation of nonreciprocal charging.

quant-ph↗
arXiv2026

Rubric-to-Code Credit Assignment for Reinforcement Learning

Interactive web application generation requires models to produce usable HTML, CSS, and JavaScript applications from natural language requests. Unlike conventional code generation, application quality depends on multiple user-facing functional requirements, each often tied to localized code regions such as event handlers, state updates, DOM fragments, or CSS selectors. Standard GRPO collapses these structured outcomes into a single sequence-level reward and applies the resulting advantage uniformly to all tokens, weakening credit assignment. We propose \textbf{Rubric-to-Code Credit Assignment} (RCCA), a reinforcement learning framework that converts rubric-level functional feedback into localized optimization signals over generated code. RCCA builds training tasks around explicit functional rubrics, uses a hierarchical reward to separate format, source-code, runtime, and functional failures, and aligns evaluator-generated textual attributions with responsible code spans and generated tokens. The resulting model, \textbf{Ling-RCCA-Flash}, scores 41.25 on MiniAppBench, improving Ling-3.0-Flash by 32.20 points and slightly surpassing Claude Opus 4.5. It also reaches 76.19 on ArtifactsBench, improving the SFT model by 4.48 points and establishing a new top score under the official ArtifactsBench leaderboard setting by surpassing the GPT-5 score by 3.64 points, suggesting transferable implementation-level gains.

cs.AI↗
arXiv2026

HUG-VIS: A Multimodal Benchmark for Human-centered Understanding and Generation in Visual Intelligence

Visual intelligence seeks to perceive, interpret, and synthesize the visual world and is central to modern computer vision. Human-centered visual intelligence is especially demanding because it studies people as expressive, socially situated subjects whose meaning is rarely conveyed by appearance alone. It couples vision with audio and language across four representative tasks: human emotion recognition, human video generation, human voice cloning, and human video matting. Yet existing resources remain task-specific, providing modalities and annotations for individual problems rather than a shared foundation coordinating understanding and generation. This limits multimodal signal use and broader research. We address this gap with HUG-VIS, a unified benchmark for Human-centered Understanding and Generation in Visual Intelligence. It contains 8,400 seated half-body videos of 30 professional actors, each performing the same 280 emotion-action-prompt assignments under a controlled Mandarin studio protocol, with synchronized video, audio, text, and alpha mattes. We evaluate diverse open- and closed-source models across the four tasks under a unified zero-shot protocol using automatic metrics, criterion-specific mean opinion scores, and multiple cross-task analyses. Results show that (i) linguistic content dominates current emotion recognition, while purely visual affect recognition is weakest; (ii) in video generation and voice cloning, automatic metrics and human judgment agree overall but differ in their top rankings, requiring joint reporting; (iii) boundary fidelity under motion is the main remaining obstacle for human matting; and (iv) task difficulty varies across emotions, models, and metrics, with notable cross-task correlations. The dataset and results are available at https://github.com/GML-MMGroup/HUG-VIS.

cs.CV↗
arXiv2026

PropUQ-MAS: Propagation-Aware Uncertainty Quantification for LLM Multi-Agent Systems

LLM-based multi-agent systems (MAS) solve complex tasks through communication among role-specialized agents. However, inter-agent dependencies introduce reliability risks beyond isolated agent failures. For instance, errors in intermediate messages could be inherited and amplified by downstream agents. Existing uncertainty quantification (UQ) methods mainly target isolated responses or single-agent reasoning, and therefore fail to capture uncertainty propagation in MAS. To this end, we propose PropUQ-MAS, an error propagation-aware UQ framework that represents MAS execution as a communication-structured graph and estimates each step's reliability by combining local uncertainty with uncertainty inherited from upstream messages. Extensive experiments demonstrate that PropUQ-MAS consistently improves UQ in MAS, with average relative gains of +6.10% in AUROC and +47.58% in PRR.

cs.MA↗
arXiv2026

Beyond Truth Discovery: A Two-Stage Framework to Assess the Severity of False Claim during Disasters

False information spreads rapidly on social media during disasters and can undermine emergency response efforts, public trust, and crisis communication. Existing research primarily focuses on determining whether social media posts contain false information, but provides limited insight into the specific false claims embedded within posts and the severity of individual false claims. To address the limitations, we propose a two-stage framework to assess the severity of false claims during disasters. In the first stage, we develop a false claim extraction agent that identifies false claims from multimodal social media posts containing text, images, videos, and links. A subsequent verification step validates extracted claims with supporting evidence. In the second stage, we define false claim severity as the combination of two complementary dimensions: believability, which determines the likelihood that a claim will be believed, and harmfulness, which captures the potential consequences if it is believed. Human annotators assess both dimensions to construct a claim-level severity benchmark using false claims extracted from Reddit posts related to hurricanes and wildfires. Building upon this benchmark, we investigate false claim severity assessment as a human-AI alignment problem, evaluating whether models can reproduce human judgments under a shared evaluation rubric rather than merely predicting severity labels. Experiments on the benchmark show that traditional supervised models exhibit limited alignment with human judgments, whereas Large Language Models (LLMs) achieve substantially stronger performance. Among the evaluated strategies, in-context learning consistently achieves the strongest alignment with human judgments, highlighting the importance of human examples and shared decision criteria for severity assessment.

cs.SI↗
arXiv2026

SCoRD: Semantic-Assisted Continual Retriever-Reranker Distillation for LLM-Based Recommendation

Recommendation systems increasingly adopt a two-stage pipeline, where an ID-based retriever retrieves candidates and an LLM-based reranker refines their rankings. To improve retrieval quality, reranker-to-retriever distillation is commonly used to transfer the reranker's knowledge to the retriever. For practical deployment, however, this pipeline must continually adapt to evolving interests and incoming interactions. A naive solution is to repeatedly update the LLM reranker and distill its latest knowledge, but this incurs prohibitive costs. Updating the retriever alone is cheaper, but its limited capacity makes adaptation from sparse data difficult. We propose SCoRD, a continual knowledge distillation framework for LLM-based reranking pipelines under a non-stationary data stream. SCoRD introduces a semantic reasoning assistant that distills the LLM's ability to infer underlying user intents into reusable intent-level guidance. It selectively distills reranker knowledge to the retriever on low-confidence sequences, guides retriever-only updates without repeated LLM inference, and feeds retriever-derived representations and intent-drift signals back to the reranker. Experiments on real-world datasets show that SCoRD enables effective and efficient retriever-reranker co-adaptation.

cs.IR↗
arXiv2026

Overlap-free multi-material topology optimization for minimum compliance in two and three dimensions by level-set-based negative-mapping interpolation

To address challenges such as gray elements and material overlaps, this paper extends the level set-based negative-mapping interpolation method to the multi-material proportional topology optimization of macro-scale structures in two and three dimensions. The approach utilizes an alternating active-phase algorithm to decompose M-phase problems into simplified two-phase subproblems described by level set functions. By integrating an evolutionary strategy, the method circumvents complex sensitivity calculations. A negative-mapping interpolation then removes the material overlaps at the interfaces. Numerical experiments on 2D cantilever and MBB beams and on a 3D cantilever beam demonstrate that the present method eradicates gray elements, produces smooth boundaries and ensures overlap-free material distributions at a compliance comparable to that of the classical SIMP method, lower than the SIMP value in four of the eight two-dimensional test cases and higher by 0.3%, 0.4%, 4.8% and 12.7% in the other four; the influence of the material properties, of the interface treatment and of the number of iterations on the results is also discussed.

cs.CE↗
arXiv2026

AnyTrack: Unifying Visual Object Tracking with Any Modalities

Visual object tracking aims to continuously locate specific targets within sequential frames, evolving from single-modal methods to multi-modal ones. However, existing multi-modal trackers are typically designed for fixed modality combinations, requiring separate models for different inputs. This leads to a poor adaptability to missing or imperfect modalities, and limited generalization. To address these issues, we propose a novel unified framework called AnyTrack for object tracking with any modalities. Specifically, we design a Modality-aware Interaction Module (MIM) to facilitate dynamic interaction across diverse modalities. This module bridges modality discrepancies and aggregates temporal cues to maintain spatio-temporal consistency during cross-modal interaction. Furthermore, we introduce a Context Understanding Module (CUM) to establish spatial correspondence between visual features and target locations via global-local prompts. This module employs target-aware context modeling to enhance foreground-background discrimination for precise localization. Finally, to support the training and evaluation under diverse modalities, we extend existing multi-modal object tracking benchmarks by incorporating grayscale images, language descriptions, and audio clips. Extensive experiments with both complete and missing modality settings demonstrate that our AnyTrack achieves state-of-the-art performance, validating its effectiveness and flexibility. The source code is available at https://github.com/IdolLab/AnyTrack.

cs.CV↗
arXiv2026

Agent-Based Test Assertion Generation via Diverse Perspective Aggregation

Test assertions are critical elements of unit tests, serving as checkpoints to validate expected behavior and ensure software correctness. Numerous techniques have been proposed to automate assertion generation, with recent progress notably driven by large language models (LLMs). Despite the promise, existing approaches such as ChatAssert suffer from modest accuracy, heavy reliance on oversampling, and vulnerability to model randomness due to one-shot prompting. To address these limitations, we propose AssertMate, a novel agent-based assertion generation framework that enhances the quality and reliability of LLM-generated assertions through three key components: (1) actual value construction that identifies assertion targets via static analysis and type-aware heuristics; (2) multi-perspective expected value prediction using code generation, retrieval-augmented generation (RAG), and chain-of-thought (CoT) reasoning agents; and (3) an LLM-as-a-Judge collaboration mechanism to select the most appropriate assertion. Evaluation on the Defects4J benchmark demonstrates that AssertMate significantly outperforms state-of-the-art techniques in compilation success and pass rates, along with substantially higher bug detection capabilities. Integration with EvoSuite further validates AssertMate's practicality, yielding superior mutation coverage and kill counts. Ablation studies reveal that each of the three components makes a significant and complementary contribution to the overall performance. This work affirms the great potential of aggregating diverse perspectives to enhance the effectiveness of LLM-based assertion generation.

cs.SE↗
arXiv2026

Reinforcement-Learned Electric-Field Sensing with Asymmetrically Blockaded Rydberg Arrays

We present a reinforcement learning-optimized Rydberg electrometer based on the asymmetric blockade effect and achieve high-sensitivity electric field sensing in Rydberg arrays. Microwave dressing induces asymmetric blockade to suppress interactions between target atoms, while keeping the coupling between the central control atom and target atoms field-tunable near F\"orster resonance. The field-regulated blockade radius affects the detectable atomic population signals, thereby enabling electric field sensing via state-selective readout. In planar atomic arrays, classical Fisher information exhibits near-quadratic scaling with atom number and approaches the Heisenberg limit. Reinforcement learning-designed composite pulses greatly enhance quantum Fisher information by up to one order of magnitude compared with single $\pi$ pulses. We further establish a compact six-atom spherical configuration for vector electrometry, in which field orientation is extracted from calibrated axial populations, and weak bias fields eliminate dipole-dipole-induced sign and magic-angle ambiguities. Numerical tests against Rabi frequency deviation, positional error, residual inter-target coupling and projection noise demonstrate the reliability of this scheme. This work provides an experimentally viable approach to realize high-precision three-dimensional Rydberg electric field sensing.

quant-ph↗
arXiv2026

Deep Learning-Based Estimation of Ground Reaction Forces in Parkinsonian Gait Using an Optimized Set of IMU Data

Accurate gait analysis in Parkinson's disease (PD) typically relies on laboratory-based systems to capture biomechanical data, such as ground reaction forces (GRFs). Estimating GRFs using inertial measurement units (IMUs) provides a feasible alternative. However, this approach remains challenging in pathological gait like PD due to its high variability and complexity. Moreover, existing monitoring approaches often require multiple body-mounted sensors, which limit practicality and reduce patient compliance. To date, no study has investigated the application of deep learning approaches to address this challenge. This study proposes, for the first time, a deep learning framework to estimate bilateral vertical GRFs (vGRFs) in PD using an optimized set of wearable IMUs. A hybrid CNN-BiLSTM model was trained separately on data from 61 PD patients and 65 healthy controls (HC) using 13 IMUs. The model achieved high intra-subject accuracy ($R^2$ = 0.98) and strong inter-subject generalization ($R^2$ = 0.93 for HC, $R^2$ = 0.91 for PD). Sensor configuration was found to significantly influence estimation accuracy, with optimal sensor placement varying between PD patients and HC. For PD patients, estimation accuracy dropped markedly when reducing to a single IMU. The optimal configuration for PD used four IMUs. We identified a minimal setup with only two IMUs still enabled robust estimation. This compact setup offers a practical and scalable solution. Overall, the proposed approach supports the development of wearable vGRF-based gait analysis systems for Parkinsonian gait and potentially other pathological conditions, enabling accessible clinical assessments, remote monitoring, and personalized rehabilitation.

cs.LG↗
arXiv2026

A Thresholding Based Operator-Splitting Method for Curvature-Regularized Surface Reconstruction

Surface reconstruction from point clouds is a fundamental problem in computational geometry with broad applications in computer graphics, medical imaging, and manufacturing. In this paper, we propose an efficient method for solving a curvature-regularized surface reconstruction model. To avoid the computational cost associated with reinitialization in traditional level set methods, we represent the reconstructed surface by an indicator function. By introducing an auxiliary variable, we reformulate the original optimization problem as the computation of the steady-state solution of an initial value problem. We then develop an operator-splitting method to decompose the resulting problem into two tractable subproblems, one of which can be efficiently solved by iterative thresholding. The proposed approach combines the advantages of curvature regularization, operator splitting, and threshold dynamics. Numerical experiments show that the proposed method is computationally efficient and can accurately reconstruct sharp corners and concave features.

math.NA↗