Searcharxiv⌕ Search

arXiv subjects

Ming Zhang

Publications and source records attributed to Ming Zhang.

At least 19 recordsLinked to original sources
arXiv2026

NovGauge: A Fine-Grained Benchmark for Diagnosing LLMs' Capability in Paper Novelty Assessment

Large language models (LLMs) are increasingly used in peer review at major AI conferences, yet novelty remains a persistent weak point. Existing benchmarks assess novelty as a single holistic score, making it difficult to diagnose which dimension a model misjudges or whether its evidence is faithful. We present NovGauge, a human-anchored benchmark for fine-grained novelty assessment diagnosis. The benchmark contains 619 paper pairs and 50 multi-paper sets, drawn from two expert sources: ICLR reviewer overlap claims and survey co-citations. Instances are independently labeled along three dimensions: task, problem, and method, capturing application goals, technical challenges, and solution approaches. We propose a cascading diagnostic pipeline that verifies per-dimension correctness, evidence grounding, and logical support. Evaluation of 18 LLMs shows hallucination rates ranging from 0% to 39% across dimensions, and among non-hallucinated correct-positive judgments, over 70% cite evidence fails to logically support the stated reason. The best-performing model, GPT-5.5, achieves 43-72% Verified F1 across dimensions, while most models retain less than half of their raw F1 after faithfulness verification. These results suggest that current LLMs remain far from reliable scientific novelty assessment, particularly when correctness is conditioned on faithful evidence grounding.

cs.AI↗
arXiv2026

Observational constraints on a damped harmonic oscillator model of dark energy

We constrain a damped harmonic oscillator (DHO) dark-energy equation of state using the full cosmic microwave background (CMB) likelihoods in combination with DESI BAO and three distinct Type Ia supernova compilations: Pantheon+, DES-Dovekie, and Union3. The equation of state obeys a second-order damped oscillator equation in number of $e$-folds, so that its frequency $f$, damping rate $b$, and equilibrium value $w_{\rm m}$ fully specify the late-time dynamics. The model exhibits oscillatory behavior only at low redshifts, around the equilibrium value $w=-1$, with distinct characteristics for the different supernova compilations: an underdamped solution for DES-Dovekie and Union3, and an overdamped solution for Pantheon+. At higher redshifts, the model closely mimics $\Lambda$CDM and deviates significantly only at $z<0.6$, with the magnitude of the deviation depending on the supernova compilation. We further identify a region of the $(f,b)$ parameter space, corresponding to rapid variation of the equation of state at low redshift, in which the perturbation equations become numerically stiff and cannot be integrated with a canonical dark-energy sound speed i.e., $c_s^2 =1$. We show that reducing the rest-frame sound speed removes this obstruction while leaving the observables unchanged at the $10^{-3}$ level, and therefore treat it as a numerical prescription rather than a physical modification of the model. The model yields $H_0 = 67.53^{+1.22}_{-1.18}$ km/s/Mpc for Pantheon+, $H_0 = 69.08^{+1.23}_{-1.16}$ km/s/Mpc for DES-Dovekie, and $H_0 = 70.67^{+1.89}_{-1.87}$ km/s/Mpc for Union3. The present-day equation-of-state parameter is constrained to $w_0 = -0.521^{+0.891}_{-0.414}$, $-3.01^{+1.14}_{-1.21}$, and $-3.16^{+1.11}_{-1.16}$ for Pantheon+, DES-Dovekie, and Union3, respectively.

astro-ph.CO↗
arXiv2026

Safin-1: Safety from Within through Memory-Native State Evolution

Long-horizon complex tasks require foundation models to accumulate information, maintain internal states, and adapt over extended interactions. Safety should be an intrinsic property of the model itself, rather than a behavioral constraint relying solely on external safeguards or post-hoc alignment such as supervised fine-tuning. This motivates Safety from Within, where safety-relevant capabilities are represented and invoked through the model's native computation. We present Safin-1, a family of foundation models realizing this principle through memory routing and state evolution. Safin-1 is built on Memory-Anchor Routing across Context History (MARCH), a network architecture that maintains structured memory states and selectively retrieves relevant historical information through content-conditioned routing. It supports test-time adaptation of persistent capability states without repeatedly modifying the backbone, enabling controlled specialization over a shared foundation. We investigate this interface on downstream safety tasks through a Safety State, demonstrating effective state-based adaptation with substantial safety improvements. More broadly, the routed-state interface unifies contextual memory and persistent capability adaptation within the model's native computation, reframing memory from a passive record of prior context into an active substrate for maintaining and evolving model behavior. Evaluations across general capabilities, long-context understanding, retrieval, and efficiency further validate Safin-1. These findings provide a path toward safety as a state-native and adaptively maintainable capability. This work is only an initial architectural exploration of Safety from Within, and substantial further work is needed to realize this broader vision.

cs.LG↗
arXiv2026

Quasinormal frequencies and greybody factors for axial perturbations of dilaton-Euler-Heisenberg de Sitter black holes

We investigate the quasinormal modes (QNMs) and greybody factors of dilaton-Euler-Heisenberg (dEH) de Sitter (dS) black holes in string-inspired Euler-Heisenberg gravity. Since the axial gravitational and electromagnetic perturbations decouple, we treat them independently. By applying the asymptotic iteration method (AIM) alongside a sixth-order WKB approximation, we compute the quasinormal frequencies and find excellent agreement between the two approaches. We also find that the QNM spectra depend sensitively on the magnetic charge $Q_{\text{m}}$, cosmological constant $\Lambda$, and nonlinear coupling $\epsilon$, with a notable topological anomaly appearing in the electromagnetic frequency trajectories. Additionally, larger values of $Q_{\text{m}}$ or the multipole number $l$ generally suppress wave transmission, while the electromagnetic sector with $\epsilon=1$ exhibits an anomalous response.

hep-th↗
arXiv2026

Intern-S2-Mobius: Foundation Model with Decoupled Knowledge and Reasoning

We introduce Mobius-v0, an architecture that comprises a globally shared Memory (FFN) that stores knowledge vectors and multiple Reasoners (Self-Attn) that iteratively achieve compositional reasoning. Using hidden states as cache and carrier, reasoners repeatedly query memory for required knowledge-vectors, while the knowledge is transmitted back to reasoning operators. Through this knowledge-reasoning-separation architecture, Mobius achieves better knowledge compression and reasoning efficiency. Built upon Mobius-v0 architecture: 1) Our 7B model trained-from-scratch achieves similar downstream score as a 7B Transformer baseline with 62.6% of baseline's training data. 2) Our Intern-S2-Mobius, continually-pretrained from Qwen3.5-35B, achieves similar downstream score while delivering nearly 4x end-to-end inference speedup.

cs.AI↗
arXiv2026

MuseCritic: Learning Multi-Aspect Song Rewards through Natural-Language Aesthetic Critiques

Long-form song generation models continue to improve in duration, structural integrity, and acoustic complexity, making reliable aesthetic rewards increasingly important for aligning these models with human preferences. However, reward models for complete songs remain limited, and existing evaluators typically predict scores in a single forward pass without providing readable explanations. We introduce MUSECRITIC, a semi-scalar reward model that generates a natural-language critique covering five aesthetic dimensions and uses it as an intermediate representation to predict continuous reward scores. MUSECRITIC follows a two-stage training pipeline: a teacher model first provides high-quality critiques for supervised fine-tuning, after which the fine-tuned model generates its own critiques for reward learning, mitigating distribution shift between training and inference. On an in-domain test set of 200 SongEval songs, MUSECRITIC reduces macro-averaged mean squared error from 0.2875 to 0.2316 and improves macro-averaged LCC, SRCC, and Kendall's tau to 0.9068, 0.8838, and 0.7178, respectively. On the out-of-domain Music Arena benchmark with 733 preference pairs, it achieves the highest accuracy of 71.35%. Moreover, using MUSECRITIC with GRPO improves Muse-0.6B on all nine aesthetic metrics from SongEval and Audiobox Aesthetics. These results demonstrate that critique-conditioned reward modeling reduces scoring error and provides an effective optimization signal for song generation. The project repository is available at https://github.com/WuqnEl/MuseCritic.

cs.SD↗
arXiv2026

MARCH: Scaling Recurrent Memory with Content-Routed State Anchors

Transformers owe much of their strong long-context retrieval capability to a token-level memory that grows with context length. This flexibility, however, incurs a quadratic computation complexity during training and a key--value cache that grows linearly during autoregressive inference. Recurrent alternatives offer efficient decoding by compressing the entire history into a fixed-size state, but often underperform on recall-intensive tasks since earlier associations usually get overwritten by subsequent updates, and only the most recent contextual information is retained. In this paper, we introduce Memory-Anchor Routing across Context History (MARCH), a network architecture that effectively scales state-space models beyond a fixed-size dimension, while maintaining computational efficiency over long-sequences. MARCH periodically caches cumulative recurrent-state checkpoints as state anchors and associates each anchor with a compact, content-conditioned anchor key. This lets MARCH maintain a memory bank, which can grow as context length increases, providing a controllable trade-off between historical resolution and memory cost. At each token, MARCH produces an anchor query to attend all causally available state anchors, and the output is calculated as an attention-style aggregation over all historical anchors along the current state. We show that after standard pretraining, MARCH consistently outperforms multiple linear attention variants across commonsense reasoning, LongBench, and in-context retrieval. These results demonstrate that content-routed state caching substantially strengthens recurrent long-range memory while preserving its native computation path.

cs.LG↗
arXiv2026

SPIEval: Evaluating Large Language Models as Mobile Assistants over Scattered Personal Information

Large language models (LLMs) are increasingly deployed as mobile assistants, where a key challenge is leveraging personal information scattered across multiple applications (apps) to complete user instructions. However, due to the lack of dedicated benchmarks, their capabilities remain poorly understood. To address this gap, we introduce SPIEval, a human-curated benchmark grounded in five cognitive capabilities (i.e., reasoning, disambiguation, integration, preference inference, and multi-intent decomposition). SPIEval comprises 250 tasks spanning 4,335 personal records distributed across 10 apps and supports multi-turn interaction through 21 tools. Analysis shows that the benchmark exhibits diverse scenarios, challenging tasks, scattered information, controllable environments, and verifiable outcomes. We evaluate nine representative LLMs and find substantial room for improvement. The best-performing model, GPT-5.5 (xhigh), achieves only 57.3% accuracy, while the weakest achieves just 16.4%. Further analysis reveals that 79% of failures stem from inaccurate information localization, as LLMs often commit to plausible but incorrect information instead of continuing retrieval for verification. We also find that fewer than 2% of retrieval actions employ advanced search methods and observe substantial variation in search efficiency across models. These findings expose fundamental limitations of current LLM-based mobile assistants and motivate future research in this direction. Data and code are available at https://huggingface.co/datasets/Junjie-Ye/SPIEval.

cs.CL↗
arXiv2026

AutoScientist-Quant: Self-Evolving Coding Agents for Automatic Research in Quantitative Investment

Large language model agents can discover alphas, yet current methods have three weaknesses. The search cannot adapt during the run, automation usually ends at alpha generation while library selection and model choice stay manual, and alpha discovery can read the test window through loop feedback or code problems. We present AutoScientist-Quant, a self evolving search process that regards quantitative research as one budgeted search problem. A single controller conditions every decision on the remaining budget, choosing at each round whether to improve, combine, pivot, or stop, which node to expand, how many alphas to generate, and how to retrieve past trajectories from the shared memory. The same core then selects from the library and tunes the model, closing the loop from hypothesis to deployable strategy. We also review the evaluation pipeline reused from prior work, fix two lookahead problems, and keep the feedback window disjoint from the held out test window, so every comparison tests true generalization. On CSI universes, the framework attains the best value of nearly every metric in every setting, and these conclusions hold across several backbones and markets.

cs.AI↗
arXiv2026

IACM-RL: Intent-Aware Context Management and Reinforcement Learning for Complex Tool Invocation under Dynamic Intent Fluctuations

Executing long-horizon tool invocations in real-world environments is severely challenged by dynamic user intent noise. Existing methods attempt robustness via implicit history scanning or text compression, yet predominantly assume perfect instructions in simplistic scenarios. Inevitably, under fluctuating contexts, obsolete constraints dilute model attention, triggering catastrophic intent deviation and infinite API loops. To resolve this, we propose IACM-RL, a comprehensive framework for robust tool invocation. First, we introduce the DynamicIntent pipeline, synthesizing trajectories across 13 fine-grained fluctuation scenarios, paired with a five-dimensional diagnostic metric suite. Second, IACM-RL deploys a BeliefState-based Self-Generated Context Manager that proactively tracks shifting goals and isolates overwritten parameters using structural stale flags. To autonomously internalize this state-tracking capability, we optimize the policy using a hierarchical intent-driven reward alongside three auxiliary losses (action calibration, CM extraction, and state distillation). Experiments on DynamicIntent, BFCL-V3, and $\mathrm{\tau}^2$-Bench demonstrate that IACM-RL significantly outperforms baselines, reducing infinite loops and stale context errors while enhancing out-of-domain generalization.

cs.CL↗
arXiv2026

PhySR: Physics-Informed Neural Network for Super-Resolution Reconstruction in Radio Synthesis Imaging

Radio telescope arrays are constrained by the number of antennas and baseline distribution, resulting in incomplete spatial-frequency sampling, limited image resolution, and blurring, distortion, and loss of small-scale structures caused by coupling between the primary and synthesized beams. Existing general-purpose model-driven methods remove observational effects sequentially and may accumulate errors, but cannot directly address limited imaging resolution, while data-driven methods lack explicit physical constraints. We propose PhySR, an end-to-end physics-informed neural network that combines a U-Net backbone, dynamic cascaded upsampling, a multiscale feature residual module, and a differentiable physical forward model incorporating the primary beam response, PSF convolution, and scale mapping. PhySR directly reconstructs high-resolution images from low-resolution dirty images without high-resolution labels while maintaining observation-domain consistency. Experiments on simulated SKA-Mid data show that, for 4x super-resolution, PhySR achieves a PSNR of 44.65 dB, an SSIM of 0.9940, and an RMSE of 0.0065. Compared with existing general-purpose methods, PSNR and SSIM improve by approximately 13.23 dB and 0.3760, respectively. Compared with mainstream deep learning models, PSNR and SSIM improve by 6.50 dB and 0.0682, while RMSE decreases by 0.0069. PhySR also remains stable for 2x and 8x super-resolution and achieves low observation-domain consistency errors, demonstrating advantages in coupling-effect removal, small-scale structure recovery, and physical consistency.

astro-ph.IM↗
arXiv2026

OxygenREC-v2: Internalizing Discrimination into Generative Recommendation

Generative recommendation unifies retrieval and ranking within a single model by autoregressively decoding semantic identifier (SID) sequences. Yet reliably incorporating behavior signals from clicks, cart additions, and orders remains challenging. Existing approaches either jointly optimize generative and discriminative objectives, requiring delicate trade-offs, or use a separate ranker as a post-hoc reinforcement-learning reward, risking out-of-distribution scoring and reward misalignment. We propose OxygenREC-v2, a generative recommender that Internalizes Discrimination into Generative Recommendation (IDGR). Rather than adding a separate discriminative objective, OxygenREC-v2 uses logged behavior to condition generation and supervise training. During pre-training, a behavior instruction conditions generation on the target behavior. During post-training, future interaction behaviors are exploited as privileged knowledge in our entropy-aware trajectory optimization self-distillation framework, enabling reward-model-free policy optimization. Throughout both training stages, OxygenREC-v2 maintains a single unified backbone. We implement OxygenREC-v2 as a 3B-parameter, 1B-activated MoE and deploy it on JD.com's large-scale e-commerce platform. Across multiple online A/B tests, OxygenREC-v2 improves user click-through conversion rate (UCTCVR) by 1.6--4.4% and GMV by 2.8--6.8% over OxygenREC-v1.

cs.IR↗
arXiv2026

Fully-connected three-mode squeezed vacuum: Gaussian entanglement, steering, and collective photon subtraction

We investigate a fully-connected three-mode squeezed vacuum (FC-C3MSV) state, where all three modes are pairwise coupled through nonlinear interactions in a triangle ($K_3$) topology. Using the integration-within-ordered-product technique, we derive the normal product form of the squeezing operator and obtain the covariance matrix directly from the Bogoliubov transformation. Under symmetric coupling, the physical state is genuinely tripartite entangled for any nonzero squeezing, while the three Armstrong-type witnesses provide a finite-window sufficient experimental test; in the chain-type C3MSV only one of these witnesses is violated. We find that, despite two-mode entanglement, the fully-connected topology admits \emph{no} two-mode Gaussian steering ($\mathcal{G}^{i\to j}=0$) between any pair of physical modes; the steering resource is instead collective one-mode-versus-two steering $\mathcal{G}^{i\to jk}$, which is $\theta$-independent and grows with $r$. We analyze independent vacuum losses and obtain critical transmittances for steering survival: under full symmetric loss at $r=0.5$, one-to-two collective steering disappears at $\eta\approx0.58$, whereas reverse two-to-one collective steering survives down to $\eta\approx0.502$ and the underlying two-mode entanglement persists for all $\eta>0$. Finally, we revisit photon subtraction using a normalized phase-space derivation. A photon subtraction on a single physical mode does not generate Wigner negativity on another single mode, consistent with the absence of two-mode steering. Wigner negativity can instead be generated when Bob subtracts from the collective mode $(b+c)/\sqrt{2}$, with a loss threshold $\eta_c\approx0.667$ at $r=0.5$. These results distinguish pairwise and collective nonclassical resources in the FC-C3MSV and clarify the operational role of the complete-graph topology.

quant-ph↗
arXiv2026

Boogu-Image-0.1: Boosting Open Agentic Multimodal Generation via Understanding under a Minimal Budget

We introduce Boogu-Image-0.1, an open-source unified multimodal understanding and generation model family, comprising Base, Turbo, Edit, and Edit-Turbo variants. It delivers competitive performance in high-quality text-to-image generation, fast inference, instruction-based editing, and bilingual (Chinese-English) text rendering. Closed-source multimodal systems like Nano-Banana-Pro and GPT-Image-2 achieve strong performance through system-level integration rather than a single model, yet their internal practices remain largely undisclosed. In this work, we demonstrate that strengthening the understanding capability of the system, through a stronger multimodal encoder, agentic prompt rewriting, and related techniques, together with improvements in data quality, training pipelines, and agentic inference-time scaling, can substantially enhance generation and editing performance even under highly constrained compute budgets. Comprehensive evaluations show that Boogu-Image-0.1 consistently matches or surpasses other open-source models across standard benchmarks, and achieves results approaching leading closed-source systems. Notably, this is accomplished with only 208.62 million unique images. The base model's theoretical training cost is only approximately \$400K. We share practical discussions that we believe are valuable to the broader research community, and release weights, code, and recipes under Apache 2.0 to advance the open ecosystem for unified multimodal understanding and generation. Our code is available here: https://github.com/Boogu-Project/Boogu-Image.

cs.CV↗
arXiv2026

Observational Study of Multi-wavelength Synergistic Effects in 3C 120

The energy dissipation and particle acceleration mechanisms within relativistic jets remain fundamental questions in active galactic nuclei (AGN) research. In this paper, we present a comprehensive 13-year (2012-2025) multi-wavelength study of the broad-line radio galaxy 3C 120, utilizing Fermi-LAT ($\gamma$-ray), ASAS-SN (optical), and high-resolution VLBA (15 GHz and 43 GHz) monitoring. Cross-correlation analyses reveal that $\gamma$-ray flares lead radio emission by $11.08_{-1.88}^{+4.03}$ months at 15 GHz and $8.27_{-5.55}^{+3.45}$ months at 43 GHz. This frequency-dependent temporal hierarchy positions the high-energy dissipation zone upstream of the radio core, corroborating the opacity-driven core-shift effect. By tracking the parsec-scale jet morphology during major $\gamma$-ray flaring epochs, we demonstrate that radio outbursts systematically coincide with compact core brightening, pronounced surges in polarized flux, abrupt electric vector position angle rotations, and the subsequent ejection of superluminal knots. Ultimately, our internal radio correlations suggest that jet dynamics are governed by a dual mechanism: long-term kinematic and flux baseline variations are geometrically modulated by a secular jet precession, while rapid, highly energetic polarimetric bursts are driven by short-lived internal shocks propagating down the jet channel.

astro-ph.GA↗
arXiv2026

Review of Machine Learning Models for Solar Energetic Particle Prediction

Solar energetic particle (SEP) events have attracted increasing attention due to their significant radiation hazards for aviation, spacecraft electronics, and human missions beyond Earth's magnetosphere. From a scientific perspective, SEP events are intriguing because they arise from a set of physical processes extending from the solar surface and corona through the heliosphere, offering insight into particle acceleration and transport mechanisms that are widely applicable across astrophysics. Therefore, advancing our ability to understand and predict SEP events is essential both for deepening our knowledge of such mechanisms and for safeguarding space technologies and exploration. Traditionally, researchers have modeled SEPs using physics-based simulations and empirical methods. More recently, machine learning (ML) has emerged as a new tool for understanding and predicting SEP events. The purpose of this manuscript is to review the currently available ML models for SEP prediction, identify the datasets used for training, compare their architectures, inputs, and outputs, and, based on these insights, outline good practices and recommendations for future research.

astro-ph.SR↗
arXiv2026

A multi-agent system for spine MRI report generation from multi-sequence imaging

Spinal pathology is a leading cause of pain and disability worldwide. Spine MRI is central to clinical evaluation, yet its interpretation remains complex and time-consuming, requiring integration of information across multiple imaging sequences and anatomical regions. Despite recent advances in automated MRI analysis, effectively combining multi-sequence data while preserving sequence-specific diagnostic information remains an open challenge. Here we present SpineAgent, a multi-agent framework for spine MRI report generation built upon a multi-sequence foundation model trained on routine clinical data from 32,047 patients and 453,683 MRI series, comprising a total of 13,441,191 MRI slices. To accommodate diverse modalities of sequences, we first pre-train two DINOv3-based encoders separately on T1- and T2-weighted sequences. We then introduce a continual training strategy that learns a synthesizer to embed images of other sequences using the T1 and T2 encoders, producing patient-level embedding that integrates various signals across MRI sequences. Using these embeddings, SpineAgent achieves state-of-the-art performance, and demonstrates strong generalizability under cross-manufacturer and cross-cohort evaluation. Beyond classification, SpineAgent enables pathology localization by identifying findings-relevant slices and segmenting pathological regions. It also supports multimodal image-report retrieval, providing a solid foundation for scalable and explainable MRI report generation. We further integrate these validated capabilities of SpineAgent into 37 specialized agents. Finally, we incorporate their outputs as structured tokens within a Medical Report Agent trained end-to-end for report generation. Through both automated metrics and expert evaluation by five radiologists, SpineAgent achieves leading performance in spine MRI report generation.

cs.CV↗
arXiv2026

Holographic complexity of de-Sitter black holes

We investigate holographic complexity within the Schwarzschild-de Sitter (SdS) black hole spacetime. Two distinct de Sitter holography prescriptions are examined: the static patch scheme restricted to the stretched horizon and the de Sitter/Conformal Field Theory (dS/CFT) correspondence scheme defined at asymptotic future and past infinities. We evaluate the Complexity equals Volume (CV) conjecture and extend the analysis to codimension-zero proposals, specifically Complexity equals Spacetime Volume (CV2.0) and Complexity equals Action (CA), through the Wheeler-DeWitt (WDW) patch we construct. The behaviors of the complexity in the static patch holography at late time and in the dS/CFT at infinite spacelike boundary coordinate are studied, respectively. We find that under both the CV and CV2.0 conjectures, the static patch holographic complexity and the dS/CFT holographic complexity consistently exhibit linear growth. Conversely, regarding the CA conjecture, the holographic complexity growth rates for both the static patch and the dS/CFT correspondence vanish. This behavior is attributed to the finiteness of the (regularized) action within the restricted WDW region. Furthermore, it is demonstrated that the complexity growth rate of the static patch scheme is identical to that in the dS/CFT scheme. This equivalence implies the existence of a unified description for bulk dynamics within de Sitter holography.

hep-th↗