arXiv subjects

Hui Wu

Publications and source records attributed to Hui Wu.

At least 19 recordsLinked to original sources

arXiv2026

Integrated Hardware Annealing based on Langevin Dynamics for Ising Machines

Ising machines are non-von Neumann machines designed to solve combinatorial optimization problems (COP) by searching for the ground state, or the lowest energy configuration, within the Ising model. However, Ising machines often face the challenges of getting trapped in local minima due to the complex energy landscapes. Hardware annealing algorithms help mitigate this issue by using a probabilistic approach to steer the system toward the ground state. In this paper, we present a hardware annealing algorithm for Ising machines based on Langevin dynamics, a stochastic perturbation by random noise. Theoretical analysis, system-level design, and detailed circuit design are carried out. We evaluate the performance of the algorithm through chip-level simulation using a standard 65-nm CMOS technology to demonstrate the algorithm's efficacy. The results show that the proposed hardware annealing algorithm effectively guides the system to reach the ground state with a probability of 86.5%, significantly improving the solution quality by 97.5%. Further, we compare the algorithm with state-of-the-art hardware annealing methods through behavioral-level simulations, highlighting its improved solution quality alongside a 50% reduction in time-to-solution.

cs.AR↗

arXiv2026

Quantum Imaging via Kurtosis-Difference Weighted Covariance on 2D Camera

Camera-based quantum imaging detects spatially correlated photon pairs from spontaneous parametric down-conversion (SPDC). Conventional covariance methods typically require tens of thousands of frames to extract weak correlations from noise. While thick crystals can increase photon flux, they generate photon pairs from multiple emission positions within the crystal, producing multiple correlation centers with complex pairing geometries. In addition, conventional covariance methods assume a single pre-selected correlation center and cannot fully exploit these distributed correlations. We demonstrate that kurtosis difference, a fourth-order statistic measuring tail similarity, effectively discriminates correlated pixel pairs even when correlation coefficients remain low. Weighting covariance by an exponential function of absolute kurtosis difference can select symmetric pixels while preserving true coincidences. This kurtosis weighting automatically identifies correlated pairs within a broad search region and accommodates multiple pairing geometries without requiring precise correlation center calibration. At 5000 frames, our method yields a contrast-to-noise ratio (CNR) exceeding 7, whereas standard covariance remains below 2. Compared with standard covariance, the method reduces the acquisition time by 40-fold and could enable practical quantum imaging in sparse correlated-photon regimes.

quant-ph↗

arXiv2026

Knowledge Boundary Probing and Demand-Guided Intervention for LLM-Based Power System Code Generation

Large language models (LLMs) are increasingly used to automate power-system analysis, but many utilities and energy-research labs require on-premise serving for confidentiality, regulatory, reproducibility, and cost reasons. This makes the reliability of open-weight models a deployment issue. We show that first-pass failures in power-system code generation are dominated not by reasoning alone, but by structured API-knowledge boundary errors: hallucinated function names, misused parameters, and mishandled result tables in versioned simulation libraries. We introduce PowerCodeBench, an execution-validated benchmark generator that pairs natural-language operator queries with pandapower code and numerical ground truth; an L0-L3 documentation-driven probing procedure that measures per-model API knowledge profiles; and a boundary-aware intervention that combines query-side API demand estimation with targeted proactive documentation injection and routed reactive correction. On a 2,000-task frozen release, we evaluate ten open-weight LLMs (1.5B-480B parameters) and four commercial mid-tier APIs. The intervention improves every evaluated open-weight model of at least 7B parameters and every commercial API by 32 to 56 accuracy points. Open-weight models in the 70B-120B range match the commercial mid-tier accuracy range, while Llama-3.1-405B and Qwen3-Coder-480B lead the panel. The targeted prompts preserve the full-context accuracy ceiling while using 41% of the prompt-token cost. The result is an accuracy-side, deployment-time path toward reliable on-premise LLM assistance for grid-analysis workflows without fine-tuning or cloud inference.

cs.SE↗

arXiv2026

Delay-induced chimera transitions via mode selection in a multiplex FitzHugh Nagumo network

We investigate delay-induced collective dynamics in a two-layer multiplex FitzHugh Nagumo network with nonlocal intra layer coupling and delayed inter layer interactions. While delay effects are often treated as secondary, we show that deterministic inter-layer delay alone can act as a control mechanism for spatial coherence. Through systematic numerical simulations, we observe a clear transition as the delay parameter increases: fragmented incoherence evolves into chimera-like partial coherence, and eventually into a coherent traveling-wave state. This transition is consistently captured by spatial snapshots, space-time plots, and mean phase velocity profiles. To explain this behavior, we analyze the stability of spatial Fourier modes and show that the delay term introduces a mode-dependent exponential factor in the characteristic equation. This term induces non-monotonic changes in modal stability, effectively acting as a mode-selection mechanism: intermediate delays selectively destabilize a subset of modes, producing chimera-like coexistence, while larger delays suppress incoherent modes and restore global coherence. Our results demonstrate that inter-layer delay provides a simple and robust mechanism for controlling pattern formation in multiplex excitable networks, offering new insight into delay driven synchronization phenomena.

physics.bio-ph↗

arXiv2026

Delay-Induced Stability Transitions in Directed Signed Consensus Networks

We study delay-induced transitions in consensus dynamics on signed networks with a ring topology. The proposed model is formulated as a system of delay differential equations incorporating both cooperative and antagonistic interactions, as well as heterogeneous time delays. We perform a stability analysis by deriving the associated characteristic equation and examining the real parts of its eigenvalues. It is shown that the stability of the consensus state depends critically on the magnitude of the delays. In particular, increasing time delays may destabilize the system and induce transitions from consensus to bounded non-convergent behavior or instability. A phase diagram in the parameter space is constructed to identify different dynamical regimes. Numerical simulations validate the theoretical results and illustrate the delay-induced transitions. Such delay-induced transitions have also been reported in various biological and engineered systems, highlighting the universal role of time delays in shaping collective dynamics.

math.DS↗

arXiv2026

Housing Decisions under Mobility Risk: A Stochastic Threshold Approach

We develop a stochastic free-boundary model of housing tenure decisions in markets with high mobility risk, such as areas near military installations. Housing prices and rents follow correlated diffusion processes, and households face an uncertain relocation horizon. We derive a closed-form characterization of the optimal buy-versus-rent boundary in terms of the price-to-rent ratio. The model highlights how mobility risk reduces the value of ownership by shortening the effective holding period and increasing uncertainty. As a result, identical price-to-rent ratios can imply different optimal decisions across locations. Numerical illustrations show how variations in volatility and relocation intensity shift the threshold, providing a structural interpretation of observed cross-market heterogeneity. The framework offers a tractable tool for analyzing housing decisions under uncertainty and for interpreting price-to-rent ratios in high-mobility environments.

math.OC↗

arXiv2026

From Intent to Evidence: A Categorical Approach for Structural Evaluation of Deep Research Agents

Deep Research Agents (DRAs) aim to answer complex questions by searching the web, checking evidence, and synthesizing conclusions across heterogeneous sources. We introduce a category-theoretic framework for evaluating and improving such agents. The framework treats deep research as a structured mapping from user intent to evidence-grounded conclusions, making retrieval traces, cross-source alignment, and final synthesis explicit. Guided by this view, we derive a mechanism-aware benchmark of 296 bilingual questions. The benchmark targets four structural skills central to real research: following multi-hop evidence chains, verifying claims across sources, re-ordering fragmented information, and rejecting unsupported assumptions. We evaluate 16 frontier systems with human verification and find that these structural tasks remain highly challenging: the best system reaches only 19.9% average accuracy. The results show that strong agents can sometimes reorganize evidence and detect false premises, but still struggle with long-horizon synthesis and intersection-heavy verification. Beyond evaluation, the same theory also leads to practical system improvements. We instantiate theory-guided interventions such as tracked search, which preserves retrieval traces, and category tools, which add explicit verification and synthesis steps. These interventions yield measurable gains in API-based deep research systems. Our work therefore provides both a challenging benchmark and concrete design guidance for building more reliable research agents.

cs.LG↗

arXiv2026

GRAFITE: Generative Regression Analysis Framework for Issue Tracking and Evaluation

Large language models (LLMs) are largely motivated by their performance on popular topics and benchmarks at the time of their release. However, over time, contamination occurs due to significant exposure of benchmark data during training. This poses a risk of model performance inflation if testing is not carefully executed. To address this challenge, we present GRAFITE, a continuous LLM evaluation platform through a comprehensive system for maintaining and evaluating model issues. Our approach enables building a repository of model problems based on user feedback over time and offers a pipeline for assessing LLMs against these issues through quality assurance (QA) tests using LLM-as-a-judge. The platform enables side-by-side comparison of multiple models, facilitating regression detection across different releases. The platform is available at https://github.com/IBM/grafite. The demo video is available at www.youtube.com/watch?v=XFZyoleN56k.

cs.CL↗

arXiv2026

Representations of the modular shifted super Yangian $Y_{1|1}(\sigma)$

Let $Y_{1|1}$ be the Yangian associated to the general linear Lie superalgebra $\mathfrak{gl}_{1|1}$, defined over an algebraically closed field $\mathbbm{k}$ of characteristic $p>2$. In this paper, we classify the finite dimensional irreducible representations of the restricted super Yangian $Y_{1|1}^{[p]}$ and the restricted truncated shifted super Yangian $Y_{1|1,\ell}^{[p]}(\sigma)$.

math.RT↗

arXiv2026

Not All Preferences Deserve Gradients: Understanding Gradient Utility in Offline Reasoning Alignment

Offline preference optimization aligns reasoning models from fixed chosen--rejected pairs, yet standard methods apply gradient updates from every pair regardless of its training value under the current policy. We argue that this uniform treatment is wasteful and potentially harmful. From the perspective of gradient utility, we show that a pair's contribution depends jointly on informativeness and stability. Pair utility drifts as the policy evolves, high-gradient samples can coincide with high-curvature regions, leading to noisy and destabilizing updates, and the most effective supervision comes from stable confident errors where the model is reliably wrong yet curvature remains low. These findings motivate SAGE (Stability-Aware Gradient Efficiency), which maintains difficulty-stratified candidate pools refreshed during training and selects pairs within each pool by a forward-pass signal-to-curvature score. Only pairs with high current utility receive gradient computation; the rest are excluded from backpropagation. On mathematical reasoning benchmarks across multiple model scales, SAGE outperforms full-data and size-matched baselines while producing substantially smoother optimization trajectories.

cs.AI↗

arXiv2026

MARA: A Multimodal Adaptive Retrieval-Augmented Framework for Document Question Answering

Retrieval-based multimodal document QA aims to identify and integrate relevant information from visually rich documents with complex multimodal structures. While retrieval-augmented generation (RAG) has shown strong performance in text-based QA, its extensions to multimodal documents remain underexplored and face significant limitations. Specifically, current approaches rely on query-agnostic document representations that overlook salient content and use static top-k evidence selection, which fails to adapt to the uncertain distribution of relevant information. To address these limitations, we propose the Multimodal Adaptive Retrieval-Augmented (MARA) framework, which introduces query-adaptive mechanisms to both retrieval and generation. MARA consists of two components: a Query-Aligned Region Encoder that builds multi-level document representations and reweights them based on query relevance to improve retrieval precision; and a Self-Reflective Evidence Controller that monitors evidence sufficiency during generation and adaptively incorporates content from lower-ranked sources using a sliding-window strategy. Experiments on six multimodal QA benchmarks demonstrate that MARA consistently improves retrieval relevance and answer quality over existing SOTA method.

cs.IR↗

arXiv2025

ATLAS: A High-Difficulty, Multidisciplinary Benchmark for Frontier Scientific Reasoning

The rapid advancement of Large Language Models (LLMs) has led to performance saturation on many established benchmarks, questioning their ability to distinguish frontier models. Concurrently, existing high-difficulty benchmarks often suffer from narrow disciplinary focus, oversimplified answer formats, and vulnerability to data contamination, creating a fidelity gap with real-world scientific inquiry. To address these challenges, we introduce ATLAS (AGI-Oriented Testbed for Logical Application in Science), a large-scale, high-difficulty, and cross-disciplinary evaluation suite composed of approximately 800 original problems. Developed by domain experts (PhD-level and above), ATLAS spans seven core scientific fields: mathematics, physics, chemistry, biology, computer science, earth science, and materials science. Its key features include: (1) High Originality and Contamination Resistance, with all questions newly created or substantially adapted to prevent test data leakage; (2) Cross-Disciplinary Focus, designed to assess models' ability to integrate knowledge and reason across scientific domains; (3) High-Fidelity Answers, prioritizing complex, open-ended answers involving multi-step reasoning and LaTeX-formatted expressions over simple multiple-choice questions; and (4) Rigorous Quality Control, employing a multi-stage process of expert peer review and adversarial testing to ensure question difficulty, scientific value, and correctness. We also propose a robust evaluation paradigm using a panel of LLM judges for automated, nuanced assessment of complex answers. Preliminary results on leading models demonstrate ATLAS's effectiveness in differentiating their advanced scientific reasoning capabilities. We plan to develop ATLAS into a long-term, open, community-driven platform to provide a reliable "ruler" for progress toward Artificial General Intelligence.

cs.CL↗

arXiv2025

InfinityStar: Unified Spacetime AutoRegressive Modeling for Visual Generation

We introduce InfinityStar, a unified spacetime autoregressive framework for high-resolution image and dynamic video synthesis. Building on the recent success of autoregressive modeling in both vision and language, our purely discrete approach jointly captures spatial and temporal dependencies within a single architecture. This unified design naturally supports a variety of generation tasks such as text-to-image, text-to-video, image-to-video, and long interactive video synthesis via straightforward temporal autoregression. Extensive experiments demonstrate that InfinityStar scores 83.74 on VBench, outperforming all autoregressive models by large margins, even surpassing some diffusion competitors like HunyuanVideo. Without extra optimizations, our model generates a 5s, 720p video approximately 10x faster than leading diffusion-based methods. To our knowledge, InfinityStar is the first discrete autoregressive video generator capable of producing industrial level 720p videos. We release all code and models to foster further research in efficient, high-quality video generation.

cs.CV↗

arXiv2025

Evolution from Topological Dirac Metal to Flat-band-Induced Antiferromagnet in Layered KxNi4S2 (0<=x<=1)

Condensed matter systems with coexisting Dirac cones and flat bands, and a switchable control between them within a single system, are desirable but remarkably uncommon. Here we report a layered quantum material system, KxNi4S2 (0 <= x <= 1), that simultaneously hosts both characteristics without involving typical Kagome/honeycomb lattices. Enabled by a topochemical K-deintercalation process, the Fermi surface can be fine-tuned continuously over a wide range of energies. Consequently, a non-magnetic Dirac-metal state with a topological nontrivial Z2 index of 1;(000), supported by first-principles calculations and high mobility up to 1471 cm2V-1s-1, is observed on the K-rich x = 1 side, whereas a flat-band induced antiferromagnetic state with TN up to 10.1 K emerges as K-content approaches 0. The KxNi4S2 system offers a versatile platform for exploring emerging phenomena and underscores a viable pathway for in-situ control of quantum materials dominated by Dirac cones, flat bands, and their interplay.

cond-mat.mtrl-sci↗

arXiv2025

Staying in the Sweet Spot: Responsive Reasoning Evolution via Capability-Adaptive Hint Scaffolding

Reinforcement learning with verifiable rewards (RLVR) has achieved remarkable success in enhancing the reasoning capabilities of large language models (LLMs). However, existing RLVR methods often suffer from exploration inefficiency due to mismatches between the training data's difficulty and the model's capability. LLMs fail to discover viable reasoning paths when problems are overly difficult, while learning little new capability when problems are too simple. In this work, we formalize the impact of problem difficulty by quantifying the relationship between loss descent speed and rollout accuracy. Building on this analysis, we propose SEELE, a novel supervision-aided RLVR framework that dynamically adjusts problem difficulty to stay within the high-efficiency region. SEELE augments each training sample by appending a hint (part of a full solution) after the original problem. Unlike previous hint-based approaches, SEELE deliberately and adaptively adjusts the hint length for each problem to achieve an optimal difficulty. To determine the optimal hint length, SEELE employs a multi-round rollout sampling strategy. In each round, it fits an item response theory model to the accuracy-hint pairs collected in preceding rounds to predict the required hint length for the next round. This instance-level, real-time difficulty adjustment aligns problem difficulty with the evolving model capability, thereby improving exploration efficiency. Experimental results show that SEELE outperforms Group Relative Policy Optimization (GRPO) and Supervised Fine-tuning (SFT) by +11.8 and +10.5 points, respectively, and surpasses the best previous supervision-aided approach by +3.6 points on average across six math reasoning benchmarks.

cs.LG↗

arXiv2025

Sylow numbers and the structure of finite groups

Suppose that the finite group $G=AB$ is a mutually permutable product of two subgroups $A$ and $B$. By using Sylow numbers of $A$ and $B$, we present some new bounds of the $p$-length $l_p(G)$ of a $p$-solvable group $G$ and the nilpotent length $F_l(G)$ and the derived length $dl(G/\Phi(G))$ of a solvable group $G$. Some known results of Zhang in J. Algebra 1995, 176 are extended.

math.GR↗

arXiv2025

Retrieval Augmented Learning: A Retrial-based Large Language Model Self-Supervised Learning and Autonomous Knowledge Generation

The lack of domain-specific data in the pre-training of Large Language Models (LLMs) severely limits LLM-based decision systems in specialized applications, while post-training a model in the scenarios requires significant computational resources. In this paper, we present Retrial-Augmented Learning (RAL), a reward-free self-supervised learning framework for LLMs that operates without model training. By developing Retrieval-Augmented Generation (RAG) into a module for organizing intermediate data, we realized a three-stage autonomous knowledge generation of proposing a hypothesis, validating the hypothesis, and generating the knowledge. The method is evaluated in the LLM-PySC2 environment, a representative decision-making platform that combines sufficient complexity with domain-specific knowledge requirements. Experiments demonstrate that the proposed method effectively reduces hallucination by generating and utilizing validated knowledge, and increases decision-making performance at an extremely low cost. Meanwhile, the approach exhibits potential in out-of-distribution(OOD) tasks, robustness, and transferability, making it a cost-friendly but effective solution for decision-making problems and autonomous knowledge generation.

cs.AI↗

arXiv2025

BioChemInsight: An Online Platform for Automated Extraction of Chemical Structures and Activity Data from Patents

The automated extraction of chemical structures and their corresponding bioactivity data is essential for accelerating drug discovery and enabling data-driven research. Current optical chemical structure recognition tools lack the capability to autonomously link molecular structures with their bioactivity profiles, posing a significant bottleneck in structure-activity relationship analysis. To address this, we present BioChemInsight, an open-source pipeline that integrates DECIMER Segmentation with MolNexTR for chemical structure recognition, GLM-4.5V for compound identifier association, and PaddleOCR combined with GLM-4.6 for bioactivity extraction and unit normalization. We evaluated BioChemInsight on 181 patents covering 15 therapeutic targets. The system achieved an average extraction accuracy of above 90% across three key tasks: chemical structure recognition, bioactivity data extraction, and compound identifier association. Our analysis indicates that the chemical space covered by patents is largely complementary to that contained in established public database ChEMBL. Consequently, by enabling systematic patent mining, BioChemInsight provides access to chemical information underrepresented in ChEMBL. This capability expands the landscape of explorable compound-target interactions, enriches the data foundation for quantitative structure-activity relationship modeling and targeted screening, and reduces data preprocessing time from weeks to hours. BioChemInsight is available at https://github.com/dahuilangda/BioChemInsight.

q-bio.QM↗