arXiv subjects

Chang Liu

Publications and source records attributed to Chang Liu.

At least 235 records · Page 13Linked to original sources

arXiv2026

Report of the 5th PVUW Challenge: Towards More Diverse Modalities in Pixel-Level Understanding

This report summarizes the objectives, datasets, and top-performing methodologies of the 2026 Pixel-level Video Understanding in the Wild (PVUW) Challenge, hosted at CVPR 2026, which evaluates state-of-the-art models under highly unconstrained conditions. To provide a comprehensive assessment, the 2026 edition features three specialized tracks: the MOSE track for tracking objects within densely cluttered and severely occluded scenarios; the MeViS-Text track for localizing targets via motion-focused linguistic expressions; and the newly inaugurated MeViS-Audio track, which pioneers acoustic-driven object segmentation. By introducing previously unreleased challenging data and analyzing the cutting-edge, multimodal solutions submitted by participants, this report highlights the community's latest technical advancements and charts promising future directions for robust video scene comprehension.

cs.CV↗

arXiv2026

High-Precision Ground Characterization of Test-Mass Magnetic Properties for the Taiji Gravitational Wave Mission via a Physics-Informed Neural Framework

Taiji is a gravitational wave detection mission in space initiated by the Chinese Academy of Sciences, which will open the millihertz window through a heliocentric triangular constellation of three drag-free spacecraft. Its ultimate sensitivity is determined partly by the residual acceleration noise of the gravitational reference sensors (GRS), within which the coupling between the test-mass and the fluctuating environmental magnetic field constitutes one of the key stray-force contributions. Following the path established by the LISA and TianQin teams, high-precision ground characterization of remanent magnetic moment $\vec{m}_r$ and volume susceptibility $χ$ of the test masses is a central step in the Taiji pre-launch test program. A persistent challenge for this characterization is the non-stationary, colored background noise inherent to torsion-pendulum facilities, which systematically biases classical Ordinary Least Squares (OLS) and Kalman filter (KF) estimators. We propose an AI-enhanced Differentiable Weighted Least Squares (AI-WLS) framework that fuses a dilated one-dimensional residual network, acting as a dynamic noise evaluator, with a fully differentiable analytical physical solver. This architecture preserves the exact linear mapping from the magnetic parameters to the torque response while autonomously identifying and suppressing contaminated data segments. Validated on real measured noise from the Changchun Institute of Optics, Fine Mechanics and Physics torsion-pendulum facility developed for Taiji, which achieves a torque sensitivity of order $10^{-13}\,\mathrm{N\cdot m\,Hz^{-1/2}}$, the AI-WLS framework bounds the maximum absolute estimation errors at $4.46\times 10^{-10}\,\mathrm{A\cdot m^2}$ for $\vec{m}_r$ and $7.8\times 10^{-8}$ for $χ$, satisfying Taiji's ground-test requirements on all these parameters simultaneously.

astro-ph.IM↗

arXiv2026

Adaptive Spatial-Temporal Graph Learning-Enabled Short-Term Voltage Stability Assessment against Time-Varying Topological Conditions

The emerging deep learning (DL) technology has recently exhibited great potential in data-driven short-term voltage stability (SVS) assessment of complex power grids. However, without sufficient attention to the time-varying topological structures of today's power grids, the majority of existing DL-based SVS assessment schemes could experience severe performance degradation in practice. To address this drawback, this paper proposes an adaptive spatial-temporal graph learning-enabled SVS assessment approach that can adapt well to various topological changes. First, considering the time-varying topological conditions of a given power grid, an adaptive graph representation matrix is automatically learned to effectively capture the complicated spatial correlations between individual buses within the grid. Then, to help better capture regional SVS features for subsequent learning processes, the adaptive graph representation matrix is properly adjusted by introducing a spatial attention mechanism. Further, with post-fault system trajectory data linked together via attention-based graph representation, a residual spatiotemporal graph convolutional network is carefully built with Optuna-based optimization to deeply mine system-wide spatiotemporal features and thus achieve structure-adaptive SVS assessment. Numerical test results on two representative sub-systems of a realistic provincial power grid in South China demonstrate the efficacy of the proposed approach under various changing topological conditions.

eess.SY↗

arXiv2026

Source localization realizes single frame super-resolution for fluorescence imaging

Existing super-resolution microscopy is often constrained by inherent trade-offs between resolution, acquisition speed, phototoxicity, and hardware complexity. Computational post-processing approaches offer a promising alternative, but they typically suffer from linearity distortion, high computational cost, reliance on pre-training data, or reconstruction artifacts. Here, we present Source Localization (SoLo), a novel single-frame super-resolution algorithm for fluorescence imaging without these limitations. Built on the principle of inferring fluorescent source positions via sampling-detection strategy, SoLo achieves non-iterative, parallelizable computation, enabling real-time live-cell imaging with high spatiotemporal resolution. The intensity linearity preservation of SoLo makes it compatible with quantitative analysis such as calcium imaging and fluorescence resonance energy transfer. We further extended this framework to 3D-SoLo for volumetric imaging and nonlinear SoLo (NL-SoLo) for high-density fluorescence fluctuation imaging. With its ease of parameter tuning and compatibility with existing imaging systems, SoLo offers an accessible solution for ordinary labs, enabling diverse biomedical imaging applications.

physics.optics↗

arXiv2026

AT2024wpp: An Extremely Luminous Fast Ultraviolet Transient Powered by Accretion onto a Black Hole

We present the discovery of AT 2024wpp ("Whippet"), a fast and luminous 18cow-like transient. At a redshift of z=0.0868, revealed by Keck Cosmic Web Imager spectroscopy of its faint star-forming host, it is the fourth-nearest example of its class to date. Rapid identification of the source in the Zwicky Transient Facility data stream permitted ultraviolet-through-optical observations to be obtained prior to peak, allowing the first determination of the peak bolometric luminosity (2x10^45 erg/s), maximum photospheric radius (10^15 cm), and total radiated energy (10^51 erg) of an 18cow-like object. We present results from a comprehensive multiwavelength observing campaign, including a far-UV spectrum from the Cosmic Origins Spectrograph on the Hubble Space Telescope and deep imaging extending >100 days post-explosion from the Very Large Telescope, Hubble Space Telescope, Very Large Array, and Atacama Large Millimetre Array. We interpret the observations under a model in which a rapidly-accreting central engine blows a fast (~0.2c) wind into the surrounding medium and irradiates it with X-rays. The high Doppler velocities and intense ionization within this wind prevent identifiable spectroscopic features from appearing in the ejecta or in the surrounding circumstellar material. Weak H and He signatures do emerge in the spectra after 35 days in the form of double-peaked narrow lines. Each peak is individually narrow (full width ~3000 km/s) but the two components are separated by ~6600 km/s, indicating stable structures of denser material, possibly representing streams of tidal ejecta or an ablated companion star.

astro-ph.HE↗

arXiv2026

Evaluating Structured Strategy Backtests: Peer Benchmarks, Regime Timing, and Live Performance

Institutional allocators often evaluate structured strategies on the basis of marketed backtests -- hypothetical track records constructed by applying a strategy's rules to historical data prior to any live trading, also referred to as pro-forma performance. It is unclear how much of that signal survives once the strategy is actually traded. Using 1,726 commercially distributed structured strategies from ten global institutions, this paper shows that raw pro-forma performance has only limited portability into the live period and weakens sharply once live outcomes are measured relative to peer and external benchmarks. The evidence indicates that marketed backtests predominantly reflect the common factor regime present before launch rather than strategy-specific skill. Strategies launched after unusually strong bucket-factor conditions experience materially worse subsequent deterioration. For allocators, the implication is practical: backtests should be judged relative to appropriate peer benchmarks, and the discount applied to them should increase when launch occurs after an extreme factor run.

q-fin.PM↗

arXiv2026

Adaptive Local Frequency Filtering for Fourier-Encoded Implicit Neural Representations

Fourier-encoded implicit neural representations (INRs) have shown strong capability in modeling continuous signals from discrete samples. However, conventional Fourier feature mappings use a fixed set of frequencies over the entire spatial domain, making them poorly suited to signals with spatially varying local spectra and often leading to slow convergence of high-frequency details. To address this issue, we propose an adaptive local frequency filtering method for Fourier-encoded INRs. The proposed method introduces a spatially varying parameter $α(\mathbf{x})$ to modulate encoded Fourier components, enabling a smooth transition among low-pass, band-pass, and high-pass behaviors at different spatial locations. We further analyze the effect of the proposed filter from the neural tangent kernel (NTK) perspective and provide an NTK-inspired interpretation of how it reshapes the effective kernel spectrum. Experiments on 2D image fitting, 3D shape representation, and sparse data reconstruction demonstrate that the proposed method consistently improves reconstruction quality and leads to faster optimization compared with fixed-frequency baselines. In addition, the learned $α(\mathbf{x})$ provides an intuitive visualization of spatially varying frequency preferences, which helps explain the behavior of the model on non-stationary signals. These results indicate that adaptive local frequency modulation is a practical enhancement for Fourier-encoded INRs.

cs.CV↗

arXiv2026

Frequency-Decomposed INR for NIR-Assisted Low-Light RGB Image Denoising

Addressing the issues of severe noise and high frequency structural degradation in visible images under low-light conditions, this paper proposes a Near Infrared (NIR) aided low light image restoration method based on Frequency Decoupled Implicit Neural Representation (FDINR). Based on the statistical prior of RGB-NIR cross-modal frequency correlations, specifically that low-frequency RGB signals are more reliable, whereas high frequency NIR signals exhibit higher correlation, we explicitly decompose images into distinct frequency components via multi-scale wavelet transforms and construct a dual-branch implicit neural representation framework. Within this framework, we design a cross modal differentiated frequency supervision mechanism, leveraging low light RGB to guide the reconstruction of low frequency luminance and color, and utilizing high-SNR NIR signals to constrain the generation of high frequency texture details, thereby achieving complementary advantages in the frequency domain. Furthermore, an uncertainty-based adaptive weighting loss function is introduced to automatically balance the contributions of different frequency tasks, solving the problems of color distortion and artifacts caused by rigid fusion in the spatial domain common in traditional methods. Experimental results demonstrate that FD-INR not only effectively restores image luminance consistency and structural details but also, benefitting from its implicit continuous representation, outperforms existing methods in arbitrary-resolution reconstruction tasks, significantly enhancing the reliability of low light perception.

cs.CV↗

arXiv2026

Into the Gray Zone: Domain Contexts Can Blur LLM Safety Boundaries

A central goal of LLM alignment is to balance helpfulness with harmlessness, yet these objectives conflict when the same knowledge serves both legitimate and malicious purposes. This tension is amplified by context-sensitive alignment: we observe that domain-specific contexts (e.g., chemistry) selectively relax defenses for domain-relevant harmful knowledge, while safety-research contexts (e.g., jailbreak studies) trigger broader relaxation spanning all harm categories. To systematically exploit this vulnerability, we propose Jargon, a framework combining safety-research contexts with multi-turn adversarial interactions that achieves attack success rates exceeding 93% across seven frontier models, including GPT-5.2, Claude-4.5, and Gemini-3, substantially outperforming existing methods. Activation space analysis reveals that Jargon queries occupy an intermediate region between benign and harmful inputs, a gray zone where refusal decisions become unreliable. To mitigate this vulnerability, we design a policy-guided safeguard that steers models toward helpful yet harmless responses, and internalize this capability through alignment fine-tuning, reducing attack success rates while preserving helpfulness.

cs.CR↗

arXiv2026

BOOKAGENT: Orchestrating Safety-Aware Visual Narratives via Multi-Agent Cognitive Calibration

Recent advancements in Large Generative Models (LGMs) have revolutionized multi-modal generation. However, generating illustrated storybooks remains an open challenge, where prior works mainly decompose this task into separate stages, and thus, holistic multi-modal grounding remains limited. Besides, while safety alignment is studied for text- or image-only generation, existing works rarely integrate child-specific safety constraints into narrative planning and sequence-level multi-modal verification. To address these limitations, we propose BookAgent, a safety-aware multi-agent collaboration framework designed for high-quality, safety-aware visual narratives. Different from prior story visualization models that assume a fixed storyline sequence, BookAgent targets end-to-end storybook synthesis from a user draft by jointly planning, scripting, illustrating, and globally repairing inconsistencies. To ensure precise multi-modal grounding, BookAgent dynamically calibrates page-level alignment between textual scripts and visual layouts. Furthermore, BookAgent calibrates holistic consistency from the temporal dimension, by verifying-then-rectifying global inconsistencies in character identity and storytelling logic. Extensive experiments demonstrate that BookAgent significantly outperforms current methods in narrative coherence, visual consistency, and safety compliance, offering a robust paradigm for reliable agents in complex multi-modal creation. The implementation will be publicly released at https://github.com/bogao-code/BookAgent/tree/main.

cs.CV↗

arXiv2026

Diagnosing and Improving Diffusion Models by Estimating the Optimal Loss Value

Diffusion models have achieved remarkable success in generative modeling. Despite more stable training, the loss of diffusion models is not indicative of absolute data-fitting quality, since its optimal value is typically not zero but unknown, leading to confusion between large optimal loss and insufficient model capacity. In this work, we advocate the need to estimate the optimal loss value for diagnosing and improving diffusion models. We first derive the optimal loss in closed form under a unified formulation of diffusion models, and develop effective estimators for it, including a stochastic variant scalable to large datasets with proper control of variance and bias. With this tool, we unlock the inherent metric for diagnosing the training quality of mainstream diffusion model variants, and develop a more performant training schedule based on the optimal loss. Moreover, using models with 120M to 1.5B parameters, we find that the power law is better demonstrated after subtracting the optimal loss from the actual training loss, suggesting a more principled setting for investigating the scaling law for diffusion models.

cs.LG↗

arXiv2026

Bi-Level Optimization for Generative Recommendation: Bridging Tokenization and Generation

Generative recommendation is emerging as a transformative paradigm by directly generating recommended items, rather than relying on matching. Building such a system typically involves two key components: (1) optimizing the tokenizer to derive suitable item identifiers, and (2) training the recommender based on those identifiers. Existing approaches often treat these components separately--either sequentially or in alternation--overlooking their interdependence. This separation can lead to misalignment: the tokenizer is trained without direct guidance from the recommendation objective, potentially yielding suboptimal identifiers that degrade recommendation performance. To address this, we propose BLOGER, a Bi-Level Optimization for GEnerative Recommendation framework, which explicitly models the interdependence between the tokenizer and the recommender in a unified optimization process. The lower level trains the recommender using tokenized sequences, while the upper level optimizes the tokenizer based on both the tokenization loss and recommendation loss. We adopt a meta-learning approach to solve this bi-level optimization efficiently, and introduce gradient surgery to mitigate gradient conflicts in the upper-level updates, thereby ensuring that item identifiers are both informative and recommendation-aligned. Extensive experiments on multiple real-world datasets demonstrate that BLOGER consistently outperforms state-of-the-art generative recommendation methods while maintaining practical efficiency with no significant additional computational overhead, effectively bridging the gap between item tokenization and autoregressive generation. We release our code at https://github.com/Ten-Mao/BLOGER.

cs.IR↗

arXiv2026

GTCN-G: A Residual Graph-Temporal Fusion Network for Imbalanced Intrusion Detection

The escalating complexity of network threats and the inherent class imbalance in traffic data present formidable challenges for modern Intrusion Detection Systems (IDS). While Graph Neural Networks (GNNs) excel in modeling topological structures and Temporal Convolutional Networks (TCNs) are proficient in capturing time-series dependencies, a framework that synergistically integrates both while explicitly addressing data imbalance remains an open challenge. This paper introduces a novel deep learning framework, named Gated Temporal Convolutional Network and Graph (GTCN-G), engineered to overcome these limitations. Our model uniquely fuses a Gated TCN (G-TCN) for extracting hierarchical temporal features from network flows with a Graph Convolutional Network (GCN) designed to learn from the underlying graph structure. The core innovation lies in the integration of a residual learning mechanism, implemented via a Graph Attention Network (GAT). This mechanism preserves original feature information through residual connections, which is critical for mitigating the class imbalance problem and enhancing detection sensitivity for rare malicious activities (minority classes). We conducted extensive experiments on two public benchmark datasets, UNSW-NB15 and ToN-IoT, to validate our approach. The empirical results demonstrate that the proposed GTCN-G model achieves state-of-the-art performance, significantly outperforming existing baseline models in both binary and multi-class classification tasks.

cs.LG↗

arXiv2026

Bridging Linguistic Gaps: Cross-Lingual Mapping in Pre-Training and Dataset for Enhanced Multilingual LLM Performance

Multilingual Large Language Models (LLMs) struggle with cross-lingual tasks due to data imbalances between high-resource and low-resource languages, as well as monolingual bias in pre-training. Existing methods, such as bilingual fine-tuning and contrastive alignment, can improve cross-lingual performance, but they often require extensive parallel data or suffer from instability. To address these challenges, we introduce a Cross-Lingual Mapping Task during the pre-training phase, which enhances cross-lingual alignment without compromising monolingual fluency. Our approach bi-directionally maps languages within the LLM embedding space, improving both language generation and comprehension. We further propose a Language Alignment Coefficient to robustly quantify cross-lingual consistency, even in limited-data scenarios. Experimental results on machine translation (MT), cross-lingual natural language understanding (CLNLU), and cross-lingual question answering (CLQA) show that our model achieves gains of up to 11.9 BLEU points in MT, 6.72 points in CLQA BERTScore-Precision, and more than 5% in CLNLU accuracy over strong multilingual baselines. These findings highlight the potential of incorporating cross-lingual objectives into pre-training to improve multilingual LLMs.

cs.CL↗

arXiv2026

Natural Gradient Gaussian Approximation Filter on Lie Groups for Robot State Estimation

Accurate state estimation for robotic systems evolving on Lie group manifolds, such as legged robots, is a prerequisite for achieving agile control. However, this task is challenged by nonlinear observation models defined on curved manifolds, where existing filters rely on local linearization in the tangent space to handle such nonlinearity, leading to accumulated estimation errors. To address this limitation, we reformulate manifold filtering as a parameter optimization problem over a Gaussian-distributed increment variable, thereby avoiding linearization. Under this formulation, the increment can be mapped to the Lie group through the exponential operator, where it acts multiplicatively on the prior estimate to yield the posterior state. We further propose a natural gradient optimization scheme for solving this problem, whose iteration process leverages the Fisher information matrix of the increment variable to account for the curvature of the tangent space. This results in an iterative algorithm named the Natural Gradient Gaussian Approximation on Lie Groups (NANO-L) filter. Leveraging the perturbation model in Lie derivative, we prove that for the invariant observation model widely adopted in robotic localization tasks, the covariance update in NANO-L admits an exact closed-form solution, eliminating the need for iterative updates thus improving computational efficiency. Hardware experiments on a Unitree GO2 legged robot operating across different terrains demonstrate that NANO-L achieves approximately 40% lower estimation error than commonly used filters at a comparable computational cost.

cs.RO↗

arXiv2026

The diophantine equation $(2^{k}-1)(b^{k}-1)=y^{q}$

In this paper, we consider the exponential Diophantine equation $ (2^k-1)(b^k-1)=y^q $ with $k\ge 2$, odd integer $b$ and an odd prime exponent $q$ and obtain effective upper bounds for $q$ in terms of $b$. In particular, we show that $q\le \log_2(b+1)$ holds apart from a finite, explicitly determined set of exceptional pairs $(b,q)$ when $3\le b<10^6$. As an application, we prove that the related equation $ (2^k-1)(b^k-1)=x^n, $ has no positive integer solution $(k,x,n)$ for several specific odd values of $b$, including $b\in\{5,7,11,13,21,23,27,29\}$.

math.NT↗

arXiv2026

FluxMC: Rapid and High-Fidelity Inference for Space-Based Gravitational-Wave Observations

Bayesian inference in the physical sciences faces a fundamental challenge: the imperative for high-fidelity physical modeling often clashes with the intrinsic limitations of stochastic sampling algorithms. Complex, high-dimensional parameter spaces expose the universal vulnerability of conventional methods, e.g., Markov Chain Monte Carlo (MCMC), which struggle with the prohibitive costs of likelihood evaluations and the risk of entrapment in local optima. To resolve this impasse, we introduce FluxMC (Flow-guided Unbiased eXploration Monte Carlo), a machine learning-enhanced framework designed to shift the inference paradigm from blind local search to globally guided transport. It integrates Flow Matching with Parallel Tempering MCMC, effectively combining the global foresight of generative AI with the rigorous asymptotic convergence and local robustness of temperature-based sampling. We showcase the efficacy of this framework through the lens of space-based gravitational-wave (GW) astronomy -- a field representing the frontier of challenging parameter inversion. In the analysis of massive black hole binaries using high-fidelity waveforms (IMRPhenomHM), FluxMC achieves robust convergence in under five hours, whereas traditional Parallel Tempering MCMC fails to converge even after hundreds of hours, yielding high Jensen-Shannon divergences (JSD) of $O(10^{-1})$. Our method reduces the distributional error by two to three orders of magnitude. Furthermore, for computationally efficient models (IMRPhenomD), it eliminates systematic biases caused by local-optima entrapment. Ultimately, FluxMC removes the necessity to compromise between model accuracy and analysis speed, establishing a new computational foundation where scientific discovery is limited only by observational data quality, not by algorithmic capacity.

astro-ph.IM↗

arXiv2026

CCD-CBT: Multi-Agent Therapeutic Interaction for CBT Guided by Cognitive Conceptualization Diagram

Large language models show potential for scalable mental-health support by simulating Cognitive Behavioral Therapy (CBT) counselors. However, existing methods often rely on static cognitive profiles and omniscient single-agent simulation, failing to capture the dynamic, information-asymmetric nature of real therapy. We introduce CCD-CBT, a multi-agent framework that shifts CBT simulation along two axes: 1) from a static to a dynamically reconstructed Cognitive Conceptualization Diagram (CCD), updated by a dedicated Control Agent, and 2) from omniscient to information-asymmetric interaction, where the Therapist Agent must reason from inferred client states. We release CCDCHAT, a synthetic multi-turn CBT dataset generated under this framework. Evaluations with clinical scales and expert therapists show that models fine-tuned on CCDCHAT outperform strong baselines in both counseling fidelity and positive-affect enhancement, with ablations confirming the necessity of dynamic CCD guidance and asymmetric agent design. Our work offers a new paradigm for building theory-grounded, clinically-plausible conversational agents.

cs.CL↗