SearcharxivSearch

arXiv subjects

Wei Yu

Publications and source records attributed to Wei Yu.

At least 19 recordsLinked to original sources

EraseSAE: Surgical Concept Erasure in Text-to-Video Diffusion Models via Sparse Autoencoders

Recent advances in text-to-video (T2V) diffusion models have demonstrated remarkable generative capabilities, yet their reliance on loosely curated training data raises pressing safety and copyright concerns. Concept erasure offers a principled remedy by removing unwanted semantics from pretrained models while preserving remaining concepts. However, existing approaches typically operate at a coarse granularity misaligned with the fine-grained, distributed nature of concept representations, leading to incomplete removal or degraded generation quality. We argue that surgical erasure fundamentally requires intervention at the level of monosemantic features, where each unit encodes a single interpretable concept. To this end, we propose EraseSAE, a novel framework that leverages sparse autoencoders to achieve surgical concept erasure in DiT-based T2V diffusion models via a principled decompose-attribute-erase pipeline. We first introduce the Partitioned Convolutional Sparse Autoencoder, which decomposes dense spatiotemporal activations into disentangled, interpretable sparse features while preserving spatiotemporal coherence. A contrastive attribution mechanism then contrasts activations from paired prompts to isolate concept-specific feature kernels. At inference, timestep-resolved spatiotemporal masks derived from the identified kernels confine erasure to regions where the target concept is active, leaving unrelated content intact. Extensive experiments across diverse diffusion models and concept erasure tasks demonstrate that EraseSAE achieves precise and robust concept removal with minimal quality degradation, substantially outperforming state-of-the-art methods. The code is available at https://github.com/HiDream-ai/EraseSAE.

cs.CV

Matrix-Game 3.5: Enhancing Real-Time Streaming Interactive World Models with Patch Memory

Interactive world models extend video generation from offline clip synthesis toward persistent simulation of interactive virtual worlds, enabling applications in games, robotics, embodied agents, and XR. Achieving stable long-horizon interactive generation, however, remains challenging, as the model must simultaneously preserve scene geometry, dynamic consistency, and camera control while supporting real-time autoregressive generation. Building upon Matrix-Game 3.0, we present Matrix-Game 3.5, as shown in Figure 1, which advances real-time interactive world generation toward geometry-aware and long-horizon consistent simulation through three key improvements. First, we propose a unified geometry-aware memory framework, whose patch-memory and tiled-PRoPE components introduce no additional learnable parameters, combining explicit 3D patch retrieval with projective camera conditioning to enable geometry-consistent camera control and faithful long-horizon scene recall. Second, we introduce a static-dynamic disentangled world representation that separately models static scene geometry and dynamic subjects, preserving both geometric consistency and subject identity throughout long-horizon generation. Third, we develop a two-stage progressive real-time distillation framework that converts a bidirectional diffusion model into a few-step causal generator through Perceptual Flow Matching and curriculum based Self-Rollout DMD, enabling minute-long real-time interactive generation. Extensive experiments demonstrate that, with a unified training corpus spanning Unreal simulation environments, open-world games, and internet videos, MatrixGame 3.5 achieves strong performance in long-horizon scene recall, precise camera control, subject consistency, prompt-driven world generation, and stable real-time open-world interaction.

cs.CV

Training-Free Inference-Time Self-Reflection and Cost-Bounded Early Stopping for Large Language Models

Reinforcement-learning training of reasoning LLMs (e.g., GRPO) is expensive and requires a controllable environment, committing every contribution to a full training pipeline. We present EvoResearcher, a training-free, inference-time protocol that adds cost-bounded self-reflection to a single frozen LLM backbone. The protocol iterates generate -> self-critique -> revise until a maximum depth D is reached or the critique returns the CONFIRMED sentinel, an implicit early stop that lets the backbone self-verify its answer under a strict compute budget. Four self-reflective meta-reward components (correctness, efficiency, reflection depth, tool-call diversity) act as design principles instantiated as prompt-level mechanisms, so their benefits accrue with zero gradient updates. We validate the protocol on Big-Bench Hard (100 questions) and establish cross-domain behavior on GSM8K (500) and MATH (500) on the same frozen backbone, with cross-model replication on Qwen2.5-72B. All experiments use pure-reasoning benchmarks; the tool-call diversity component is validated in prompt-level form, and the environment-level and multi-agent extensions are design blueprints left to future work. On clean BBH the protocol does not raise accuracy beyond the 95% Wilson interval; its value is cost-bounded self-verification, with the CONFIRMED early stop terminating 82-88% of items at equal accuracy (about 2.1 generations per question).

cs.AI

Stable X-ray reverberation lags in the black hole X-ray binary Swift J1727.8-1613

Aims. We investigate the evolution of X-ray reverberation lags in the black hole X-ray binary Swift J1727.8-1613 during its 2023 outburst, with the aim of probing the inner accretion flow geometry across spectral states. Methods. We analyzed NICER observations covering the low-hard state (LHS) and hard-intermediate state (HIMS). The time lags were computed using Fourier-based techniques, and we constructed lag-frequency and lag-energy spectra. To obtain a robust estimate of the soft lag amplitude, we focused on a frequency range in which the reverberation signal dominates and remains stable, thereby minimizing contamination from hard lags and phase-wrapping effects. Results. The soft lag amplitude increases rapidly from the LHS to the early HIMS and then stays near 10 ms throughout the HIMS. In the frequency range in which reverberation lags prevail, the lag shows little dependence on Fourier frequency. On the other hand, the observed low-frequency lags change from hard-lag dominated to soft-lag dominated, with amplitudes comparable to those measured at higher frequencies. Conclusions. These results suggest that the reverberation lag varies little during the HIMS, consistent with a relatively stable inner accretion geometry during this state. The apparent evolution of the lag amplitude from the LHS to the HIMS can be largely explained by the diminishing effect of hard lags and does not necessarily require significant changes in the intrinsic light-travel timescale. Swift J1727.8-1613 therefore provides a case in which the reverberation signal can be studied with reduced contamination over a broad frequency range, offering new insight into the evolution of the accretion geometry in black hole X-ray binaries.

astro-ph.HE

HIVE-3D: Hierarchical Voxel Enhancement for High-Quality 3D Scene Generation

Recently, a line of works can generate impressive 3D objects from a single image, but they are limited by restricted representation resolution, making them unsuitable for 3D scene generation. In this work, we introduce HIVE-3D, a novel method for high-quality 3D scene generation based on hierarchical voxel enhancement framework. Specifically, given a single scene image as input, we first produce a coarse initial scene, then introduce image segmentation and attention-based retrieval to align 2D image components with 3D scene components. Subsequently, we organize these scene relations into a hierarchical component tree, where nodes closer to the leaves denote finer-grained components. Finally, we propose a voxel super-resolution model that generates refined voxels for the target instance while maintaining strong consistency with the coarse voxels. Equipped with this model, we perform coarse-to-fine hierarchical super-resolution on images and voxels for each component, producing a high-resolution and high-quality 3D scene. Extensive experiments demonstrate that our method significantly outperforms previous approaches, achieving state-of-the-art performance.

cs.CV

Spectral and timing variability of the transient ultraluminous X-ray source NGC 4631 X-4

Ultraluminous X-ray sources (ULXs) are among the best laboratories for studying super-Eddington accretion onto compact objects. We present a detailed spectral and timing analysis of the transient ULX NGC 4631 X-4 using archival Chandra, XMM-Newton, and Swift/XRT observations. The source exhibits pronounced spectral and flux variability on both short and long timescales, with luminosity variations exceeding two orders of magnitude. Its X-ray spectra are well described by absorbed multicolor disk blackbody and power-law models, with characteristic inner disk temperatures of 0.9-1.4 keV and photon indices of 2.0-2.4. The source does not follow the standard luminosity-temperature relation expected for a geometrically thin, optically thick accretion disk. No coherent pulsations or quasi-periodic oscillations are detected, while the short-term variability is dominated by aperiodic fluctuations and kilosecond peak-like structures, consistent with clumpy winds and geometric effects in a super-Eddington accretion flow. Overall, the spectral and timing properties support super-Eddington accretion onto a stellar-mass compact object, although the current data do not allow us to distinguish uniquely between a neutron star and a stellar-mass black hole accretor.

astro-ph.HE

Modulo Quantization Coding for Primitive Relay and Diamond Channels with Correlated Noises

This paper proposes modulo quantization (MQ) coding as a simple, structured, and low-complexity scheme for channels with primitive (i.e., noiseless digital) relay links and correlated Gaussian noises across terminals. The key component of MQ coding is the modulo quantization operation, which maps a real-valued symbol to its uniform-quantization index taken modulo a fixed integer. This operation allows effective exploitation of the common noise component shared across the terminals. For the Gaussian primitive relay channel with perfectly correlated noises, where a relay has a finite-capacity link to the receiver, MQ coding can be shown to achieve the capacity of this channel. For the Gaussian primitive diamond channel with perfectly correlated noises, where two relays can forward information through finite-capacity links to a receiver that has no direct observation of the transmitted signal, MQ coding yields novel achievability bounds that improve upon previously known bounds and coincide with the cut-set upper bound in certain signal-to-noise ratio (SNR) regimes. In scenarios with highly but non-perfectly correlated noises, MQ coding can approach the performance of compress-forward (CF) at significantly lower complexity, while surpassing decode-forward (DF) for the Gaussian primitive relay channel in certain SNR ranges. For the Gaussian primitive diamond channel with non-perfectly correlated noises, MQ can outperform both CF and DF at moderate SNR.

cs.IT

MetaResearcher: Scaling Deep Research via Self-Reflective Reinforcement Learning in Adversarial Virtual Environments

Deep research agents have demonstrated remarkable capabilities in autonomous information gathering and synthesis, yet their training remains constrained by the static nature of simulated environments, the limits of fact-retrieval-only task designs, and the inefficiency of outcome-based reinforcement learning. In this work, we propose MetaResearcher, a novel framework that scales deep research agent training across four synergistic dimensions. First, we introduce an Evolving Virtual World that injects temporal dynamics and adversarial misinformation into the training environment, forcing agents to develop source credibility assessment and temporal conflict resolution skills. Second, we design Discovery-Oriented Tasks -- including hypothesis generation and contradiction resolution -- that transcend simple fact retrieval and push agents toward genuine research behaviors. Third, we propose a Self-Reflective Meta-Reward mechanism within the GRPO framework that jointly optimizes for answer correctness, search path efficiency, reflection depth, and tool call diversity, directly addressing the repetitive action loop problem observed in prior work. Fourth, we introduce a Heterogeneous Multi-Agent Swarm architecture comprising specialized Scout, Filter, and Synthesizer models that learn collaborative research strategies through coordinated reinforcement learning. Built upon the LiteResearcher infrastructure, MetaResearcher requires zero marginal API cost for training while targeting substantial improvements in both benchmark performance (GAIA, Xbench-DS) and epistemic robustness under adversarial conditions. We present the complete framework design, training methodology, and planned experimental validation.

cs.AI

Precoding Sequence Design for MIMO Sensing with Scatterers Based on Prior Information

The presence of interfering scatterers fundamentally changes the design principle for MIMO sensing. Unlike the target-only case, where MIMO sensing sequence design reduces to optimizing the transmit sample covariance, this paper shows that scatterer-induced signal-dependent interference makes the Bayesian Fisher information depend on the full temporal precoding sequence. Consequently, for the MIMO sensing problem with scatterers using the Bayesian Cram\'er-Rao lower bound (BCRLB) as the objective, the entire sensing sequence must be designed explicitly, instead of just the precoding matrix. This paper considers such a precoding sequence design problem under hardware constraint for MIMO sensing for estimating the azimuth angles of multiple targets based on the prior information of both the targets and the scatterers. We formulate a worst-case BCRLB minimization across multiple target angles, yielding a max-min fractional program under constant-modulus or constant-norm hardware constraints. We further develop a constant-norm linear transform that converts the ratio objectives into linear forms, leading to an iterative algorithm with closed-form precoder updates. The framework extends to joint precoder-combiner design and multi-stage sensing with adaptive prior refinement. Numerical results demonstrate the effectiveness and the efficiency of the proposed algorithm, revealing sweeping-like beampatterns that illuminate target angular regions while suppressing interference from the scatterers.

eess.SP

Towards Reliable Sequential Object Picking in Clutter: The Runner-up Solution to RGMC 2025

As a long-standing challenge in robotic manipulation, stable and efficient grasping in cluttered environments is of great importance in industrial settings. While recent studies have achieved relatively high success rates in grasping from clutter, there remain few mature solutions for more demanding tasks such as sequential object search and sorting. This work addresses sequential object picking in cluttered environments based on the Cluttered Environment Picking Benchmark (CEPB) and presents our solution to the Pick-in-Clutter track of the 10th Robotic Grasping and Manipulation Competition (RGMC) at ICRA 2025. The task poses several key challenges. First, it requires robust and collision-aware grasping with high success rates across a diverse set of objects, including both rigid and deformable ones. Second, it demands efficient search for target objects, which places stringent requirements on the decluttering and searching strategies of the solution. To address the above challenges, we design an integrated hardware-software pipeline that combines object recognition, decluttering, and multi-modal grasping. The main contributions include the hardware design of a multifunctional gripper and novel representations for object distribution and occlusion relationships in cluttered space. This pipeline enables efficient recognition, search, and sequential grasping of objects in clutter, demonstrating strong performance in both laboratory tests and competition scenarios, and ultimately achieving second place in the Pick-in-Clutter track of the RGMC 2025.

cs.RO

YouZhi: Towards High-Concurrency Financial LLMs via Adaptive GQA-to-MLA Transition

Large language models (LLMs) drive significant financial innovations, yet their high-concurrency deployment is severely bottlenecked by KV cache memory overhead, which inflates infrastructure costs and throttles scalability. To address this, we propose YouZhi-LLM, a highly efficient financial LLM empowered by a comprehensive structural transition and training pipeline natively built on the Huawei Ascend ecosystem. At its algorithmic core, YouZhi-LLM features a layer-adaptive GQA-to-MLA transition framework that dynamically assigns per-layer FreqFold sizes, maximizing KV-cache compression while minimizing perplexity degradation. To recover representation capacity and inject domain expertise, the Ascend-based training pipeline seamlessly integrates generalized knowledge distillation with financial-specific supervised fine-tuning. Evaluations demonstrate the superiority of this systematic approach, with the adaptive transition reducing perplexity degradation by up to 35% over uniform baselines. Crucially, when evaluated on Ascend NPUs via vLLM-Ascend, the massive KV-cache reduction translates directly into deployment efficiency. Compared to their respective base models, YouZhi-7B yields a 12.3% improvement in average financial benchmark score alongside a 2.69$\times$ increase in maximum concurrency; similarly, YouZhi-14B achieves a 7.0% accuracy gain and a 2.43$\times$ concurrency boost, establishing a new paradigm for cost-effective, high-throughput financial inference.

cs.CL

A candidate cyclotron line at 1.89 keV in the ultraluminous X-ray source NGC 4861 X-2

In this Letter, we report the detection of an absorption-like feature at ~1.89 keV in Chandra/ACIS spectra of the ultraluminous X-ray source NGC 4861 X-2, based on the deepest observation (ObsID 20992; ~58 ks). The feature is consistently recovered across independent continuum models and significantly improves the fit statistics. Monte Carlo simulations yield a detection significance of ~3.5-4.1 sigma, depending on the adopted continuum, and a blind line scan reveals a single, localized peak at the same energy. The observed properties are consistent with a proton cyclotron resonant scattering feature (CRSF), implying a magnetic field strength of B ~(3-4) x 10^14 G. The spectrum is well described by a multicolor disk blackbody (diskbb) with kTin ~0.8 keV or a strongly curved continuum with a low cutoff energy (cutoffpl; Ecut ~1.3 keV). The source shows variability confined to the soft X-ray band in the two Chandra observations where the absorption-like feature is detected. In these observations, a candidate periodic signal at P ~7.4 s is also detected, with a global significance of ~2.5 sigma.

astro-ph.HE

AffordVLA: Injecting Affordance Representations into Vision-Language-Action Models via Implicit Feature Alignment

Recent advances in Vision-Language-Action (VLA) models have shown strong potential for general-purpose robotic manipulation. However, the visual representations of most VLA models are often dominated by global object appearance and struggle to focus on task-relevant functional interaction regions, which limits their robustness in unstructured environments. Existing affordance-based methods typically rely on explicit mask injection or external perception modules, requiring additional annotations while introducing cascading perception errors and inference overhead. To address these limitations, we propose AffordVLA, an affordance-enhanced VLA framework that internalizes manipulation-centric affordance perception into VLA visual representations through implicit representation alignment. Specifically, we construct a zero-shot affordance teacher to extract task-conditioned affordance visual representations from RGB observations and language instructions. AffordVLA aligns the intermediate visual representations of the VLA with the affordance visual representations extracted by the teacher, thereby implicitly injecting manipulation-centric affordance perception into VLA visual representations and improving action accuracy. Extensive simulation and real-world experiments demonstrate that AffordVLA and its affordance teacher achieve state-of-the-art performance and outperform strong baselines. Ablation analyses show that AffordVLA effectively reshapes VLA visual representations while preserving inference efficiency, leading to improved manipulation success rates and training efficiency.

cs.RO

SID: Sliding into Distribution for Robust Few-Demonstration Manipulation

Generalizing robotic manipulation across object poses, viewpoints, and dynamic disturbances is difficult, especially with only a few demonstrations. End-to-end visuomotor policies are expressive but data-hungry, while planning and optimization satisfy explicit constraints but do not directly capture the interaction strategies demonstrated by humans. We propose Sliding into Distribution (SID), a structured framework that learns an object-centric motion field from canonicalized demonstrations to iteratively slide the system toward the demonstrated manifold and into the reliable operating region of a lightweight egocentric execution policy, mitigating out-of-distribution (OOD) execution. The motion field provides large corrective motions when far from the demonstration manifold and naturally vanishes near convergence, enabling robust reaching under substantial pose and viewpoint shifts. Within the reached regime, an egocentric policy trained with conditioned flow matching performs task-specific manipulation, supported by kinematically consistent point-cloud reprojection augmentation that preserves action-observation consistency. Across six real-world tasks, SID achieves approximately 90% success under OOD initializations with only two demonstrations, with under a 10% drop under distractors and external disturbances. Overall, SID provides a new paradigm for few-shot manipulation: explicitly managing distribution shift via online distribution recovery.

cs.RO

EmambaIR: Efficient Visual State Space Model for Event-guided Image Reconstruction

Recent event-based image reconstruction methods predominantly rely on Convolutional Neural Networks (CNNs) and Vision Transformers (ViTs) to process complementary event information. However, these architectures face fundamental limitations: CNNs often fail to capture global feature correlations, whereas ViTs incur quadratic computational complexity (e.g., $O(n^2)$), hindering their application in high-resolution scenarios. To address these bottlenecks, we introduce EmambaIR, an Efficient visual State Space Model designed for image reconstruction using spatially sparse and temporally continuous event streams. Our framework introduces two key components: the cross-modal Top-k Sparse Attention Module (TSAM) and the Gated State-Space Module (GSSM). TSAM efficiently performs pixel-level top-k sparse attention to guide cross-modal interactions, yielding rich yet sparse fusion features. Subsequently, GSSM utilizes a nonlinear gated unit to enhance the temporal representation of vanilla linear-complexity ($O(n)$) SSMs, effectively capturing global contextual dependencies without the typical computational overhead. Extensive experiments on six datasets across three diverse image reconstruction tasks - motion deblurring, deraining, and High Dynamic Range (HDR) enhancement - demonstrate that EmambaIR significantly outperforms state-of-the-art methods while offering substantial reductions in memory consumption and computational cost. The source code and data are publicly available at: https://github.com/YunhangWickert/EmambaIR

cs.CV

Active MIMO Sensing With Exploration-Exploitation Tradeoff

This paper develops an active sensing framework for designing the transmit and receive beamformers of a multiple-input multiple-output (MIMO) radar system. In the proposed technique, the beamformers are adaptively designed in each sensing stage based on the measurements made in the previous sensing stages. The beamformers are determined by minimizing the Bayesian Cram{\'e}r-Rao bound (BCRB) for the estimation of the unknown sensing parameters at each stage via Lagrangian dual optimization. To address the exploration-exploitation tradeoff that is inherent to such an adaptive design, this paper proposes two variants of the BCRB optimization problem: an exploration-centric variant, that ensures that multiple orthogonal beamforming directions are probed in each sensing stage, and an exploitation-centric variant, that does not restrict the number of optimal beamformers. Each variant of the optimization problem is solved via an alternating optimization algorithm that alternates between solving for the transmit beamformers and solving for the receive beamformers. The algorithm is shown to converge to a stationary point provided that each optimization problem is solved to global optimality. Moreover, this paper studies each of the two BCRB optimization sub-problems in the Lagrangian dual domain and shows that despite the non-convexity, global optimality is guaranteed provided that certain sufficient conditions hold. The conditions pertain to the multiplicity of the eigenvalues of a specific direction matrix that can be analytically written in terms of the optimal dual variables. These conditions further imply the tightness of the semidefinite relaxation of the optimization problems. Simulation results demonstrate the benefits of the proposed BCRB-based design compared to state-of-the-art adaptive beamforming strategies.

eess.SP

Site-Specific Channel Modeling and Optimization of RIS-Assisted Multiuser MISO Systems

This paper presents a physics-based channel modeling and optimization framework for reconfigurable intelligent surface (RIS)-assisted downlink multi-user multiple-input single-output (MU-MISO) communication systems in site-specific environments. A hybrid ray-tracing (RT) and full-wave electromagnetic analysis approach is developed to construct a deterministic channel model that explicitly captures multipath propagation, RIS scattering behavior, and mutual coupling effects through a non-diagonal load impedance representation. Based on this model, an alternating optimization scheme jointly updates the base-station (BS) beamformer and RIS load impedances to maximize the minimum achievable rate under a total transmit power constraint and practical capacitance limits. The objective of the proposed framework is to provide a reliable initial assessment of the system-level impact of RIS deployment in realistic propagation scenarios. To evaluate this capability, the RIS is operated in a column-paired 1-bit control mode that enables exhaustive evaluation of all realizable configurations in both simulation and measurement. Performance is compared at the distribution level through achievable-rate histograms across all configurations and further examined under small user-location variations. The observed agreement between simulation and measurement demonstrates that the proposed framework reliably captures practical performance trends and provides useful guidance for the design and deployment of RIS-assisted MU-MISO systems in site-specific environments.

eess.SP

MosaicMem: Hybrid Spatial Memory for Controllable Video World Models

Video diffusion models are moving beyond short, plausible clips toward world simulators that must remain consistent under camera motion, revisits, and intervention. Yet spatial memory remains a key bottleneck: explicit 3D structures can improve reprojection-based consistency but struggle to depict moving objects, while implicit memory often produces inaccurate camera motion even with correct poses. We propose Mosaic Memory (MosaicMem), a hybrid spatial memory that lifts patches into 3D for reliable localization and targeted retrieval, while exploiting the model's native conditioning to preserve prompt-following generation. MosaicMem composes spatially aligned patches in the queried view via a patch-and-compose interface, preserving what should persist while allowing the model to inpaint what should evolve. With PRoPE camera conditioning and two new memory alignment methods, experiments show improved pose adherence compared to implicit memory and stronger dynamic modeling than explicit baselines. MosaicMem further enables minute-level navigation, memory-based scene editing, and autoregressive rollout.

cs.CV