Searcharxiv⌕ Search

arXiv subjects

Yan Huang

Publications and source records attributed to Yan Huang.

At least 73 records · Page 4Linked to original sources
arXiv2026

Asymptotic-preserving deterministic particle methods for collisional plasma models

We develop novel asymptotic-preserving (AP) deterministic particle methods for collisional plasma models, including both Landau--Fokker--Planck and Dougherty collision operators, under hydrodynamic scaling. Our schemes treat the non-stiff transport part explicitly and the stiff collision operators fully implicitly through the energy-conserving Jordan--Kinderlehrer--Otto (JKO) schemes by exploiting their gradient flow structures. This approach extends our previous work on the space-homogeneous Landau equation [arXiv:2409.12296] and introduces a new treatment of the Dougherty operator via a projected gradient flow formulation. We identify the crucial role of Jacobian log-determinant evaluation in stiff regimes and introduce an inner-time quadrature strategy that improves both accuracy and efficiency. Furthermore, we uncover intriguing connections with score-based transport modeling, showing that both explicit and implicit score matching arise as special cases of our unified variational framework and exhibit limitations in the stiff regime. We also develop practical large-scale implementations via neural network parameterization and efficient training strategies. Various numerical examples demonstrate the structure-preserving and AP properties of our schemes for general initial data.

math.NA↗
arXiv2026

PanopticQuery: Unified Query-Time Reasoning for 4D Scenes

Understanding dynamic 4D environments through natural language queries requires not only accurate scene reconstruction but also robust semantic grounding across space, time, and viewpoints. While recent methods using neural representations have advanced 4D reconstruction, they remain limited in contextual reasoning, especially for complex semantics such as interactions, temporal actions, and spatial relations. A key challenge lies in transforming noisy, view-dependent predictions into globally consistent 4D interpretations. We introduce PanopticQuery, a framework for unified query-time reasoning in 4D scenes. Our approach builds on 4D Gaussian Splatting for high-fidelity dynamic reconstruction and introduces a multi-view semantic consensus mechanism that grounds natural language queries by aggregating 2D semantic predictions across multiple views and time frames. This process filters inconsistent outputs, enforces geometric consistency, and lifts 2D semantics into structured 4D groundings via neural field optimization. To support evaluation, we present Panoptic-L4D, a new benchmark for language-based querying in dynamic scenes. Experiments demonstrate that PanopticQuery sets a new state of the art on complex language queries, effectively handling attributes, actions, spatial relationships, and multi-object interactions. A video demonstration is available in the supplementary materials.

cs.CV↗
arXiv2026

VideoCoF: Unified Video Editing with Temporal Reasoner

Existing video editing methods face a critical trade-off: expert models offer precision but rely on task-specific priors like masks, hindering unification; conversely, unified temporal in-context learning models are mask-free but lack explicit spatial cues, leading to weak instruction-to-region mapping and imprecise localization. To resolve this conflict, we propose VideoCoF, a novel Chain-of-Frames approach inspired by Chain-of-Thought reasoning. VideoCoF enforces a ``see, reason, then edit" procedure by compelling the video diffusion model to first predict reasoning tokens (edit-region latents) before generating the target video tokens. This explicit reasoning step removes the need for user-provided masks while achieving precise instruction-to-region alignment and fine-grained video editing. Furthermore, we introduce a RoPE alignment strategy that leverages these reasoning tokens to ensure motion alignment and enable length extrapolation beyond the training duration. We demonstrate that with a minimal data cost of only 50k video pairs, VideoCoF achieves state-of-the-art performance on VideoCoF-Bench, validating the efficiency and effectiveness of our approach. Our code, weight, data are available at https://github.com/knightyxp/VideoCoF.

cs.CV↗
arXiv2026

Excitation function of femtoscopic Lévy source parameters of pion pairs in EPOS4

Three-dimensional (3D) femtoscopic source parameters of pions provide a sensitive probe of the space-time structure of particle-emitting sources in high-energy heavy-ion collisions. Compared to one-dimensional measurements, three-dimensional femtoscopy not only provides a valuable cross-check but also offers a more complete characterization of the source geometry and its dynamical evolution. Particularly, differences between the out and side directions are sensitive to signals of a strong first-order phase transition, while the collision-energy dependence of Lévy radii may reveal non-monotonic features related to the equation of state. In this work, we systematically investigate the transverse mass (mT) and collision-energy (sqrt(sNN)) dependence of the three-dimensional femtoscopic parameters of pion pairs with Lévy-type sources in the STAR Beam Energy Scan (BES) range from sqrt(sNN) = 7.7 to 200 GeV using the EPOS4 model. The analyzed parameters include the Lévy index alpha, the correlation strength lambda, and the three-dimensional radii Rout, Rside and Rlong, corresponding to the outward, sideward, and longitudinal (beam) directions. Derived quantities such as the out-side squared radius difference and the out/side ratio are also investigated. The results show that the extracted radii Rside and Rlong decrease with increasing transverse mass and increase gradually with collision energy, while Rout shows little energy dependence. The Lévy index alpha exhibits only a mild dependence on mT and collision energy, whereas the correlation strength lambda shows a clear mT dependence and generally decreases with increasing collision energy. A comparison with EPOS3 results indicates general agreement within approximately 2sigma, with the notable exception of Rside, which is systematically smaller in EPOS4.

nucl-th↗
arXiv2026

JKO for Landau: a variational particle method for homogeneous Landau equation

Inspired by the gradient flow viewpoint of the Landau equation and the corresponding dynamic formulation of the Landau metric in [arXiv:2007.08591], we develop a novel implicit particle method for the Landau equation in the framework of the JKO scheme. We first reformulate the Landau metric in a computationally friendly form, and then translate it into the Lagrangian viewpoint using the flow map. A key observation is that, while the flow map evolves according to a rather complicated integral equation, the unknown component is simply a score function of the corresponding density plus an additional term in the null space of the collision kernel. This insight guides us in designing and training the neural network for the flow map. Additionally, the objective function is in a double summation form, making it highly suitable for stochastic methods. Consequently, we design a tailored version of stochastic gradient descent that maintains particle interactions and significantly reduces the computational complexity. Compared to other deterministic particle methods, the proposed method enjoys exact entropy dissipation and unconditional stability, therefore making it suitable for large-scale plasma simulations over extended time periods.

math.NA↗
arXiv2026

EgoDemoGen: Egocentric Demonstration Generation for Viewpoint Generalization in Robotic Manipulation

Imitation learning based visuomotor policies have achieved strong performance in robotic manipulation, yet they often remain sensitive to egocentric viewpoint shifts. Unlike third-person viewpoint changes that only move the camera, egocentric shifts simultaneously alter both the camera pose and the robot action coordinate frame, making it necessary to jointly transfer action trajectories and synthesize corresponding observations under novel egocentric viewpoints. To address this challenge, we present EgoDemoGen, a framework that generates paired observation--action demonstrations under novel egocentric viewpoints through two key components: 1{)} EgoTrajTransfer, which transfers robot trajectories to the novel egocentric coordinate frame through motion-skill segmentation, geometry-aware transformation, and inverse kinematics filtering; and 2{)} EgoViewTransfer, a conditional video generation model that fuses a novel-viewpoint reprojected scene video and a robot motion video rendered from the transferred trajectory to synthesize photorealistic observations, trained with a self-supervised double reprojection strategy without requiring multi-viewpoint data. Experiments in simulation and real-world settings show that EgoDemoGen consistently improves policy success rates under both standard and novel egocentric viewpoints, with absolute gains of +24.6\% and +16.9\% in simulation and +16.0\% and +23.0\% on the real robot. Moreover, EgoViewTransfer achieves superior video generation quality for novel egocentric observations.

cs.RO↗
arXiv2026

FloorPlan-VLN: A New Paradigm for Floor Plan Guided Vision-Language Navigation

Existing Vision-Language Navigation (VLN) task requires agents to follow verbose instructions, ignoring some potentially useful global spatial priors, limiting their capability to reason about spatial structures. Although human-readable spatial schematics (e.g., floor plans) are ubiquitous in real-world buildings, current agents lack the cognitive ability to comprehend and utilize them. To bridge this gap, we introduce \textbf{FloorPlan-VLN}, a new paradigm that leverages structured semantic floor plans as global spatial priors to enable navigation with only concise instructions. We first construct the FloorPlan-VLN dataset, which comprises over 10k episodes across 72 scenes. It pairs more than 100 semantically annotated floor plans with Matterport3D-based navigation trajectories and concise instructions that omit step-by-step guidance. Then, we propose a simple yet effective method \textbf{FP-Nav} that uses a dual-view, spatio-temporally aligned video sequence, and auxiliary reasoning tasks to align observations, floor plans, and instructions. When evaluated under this new benchmark, our method significantly outperforms adapted state-of-the-art VLN baselines, achieving more than a 60\% relative improvement in navigation success rate. Furthermore, comprehensive noise modeling and real-world deployments demonstrate the feasibility and robustness of FP-Nav to actuation drift and floor plan distortions. These results validate the effectiveness of floor plan guided navigation and highlight FloorPlan-VLN as a promising step toward more spatially intelligent navigation.

cs.RO↗
arXiv2026

Open-Vocabulary Octree-Graph for 3D Scene Understanding

Open-vocabulary 3D scene understanding is indispensable for embodied agents. Recent works leverage pretrained vision-language models (VLMs) for object segmentation and project them to point clouds to build 3D maps. Despite progress, a point cloud is a set of unordered coordinates that requires substantial storage space and does not directly convey occupancy information or spatial relation, making existing methods inefficient for downstream tasks, e.g., path planning and text-based object retrieval. To address these issues, we propose \textbf{Octree-Graph}, a novel scene representation for open-vocabulary 3D scene understanding. Specifically, a Chronological Group-wise Segment Merging (CGSM) strategy and an Instance Feature Aggregation (IFA) algorithm are first designed to get 3D instances and corresponding semantic features. Subsequently, an adaptive-octree structure is developed that stores semantics and depicts the occupancy of an object adjustably according to its shape. Finally, the Octree-Graph is constructed where each adaptive-octree acts as a graph node, and edges describe the spatial relations among nodes. Extensive experiments on various tasks are conducted on several widely-used datasets, demonstrating the versatility and effectiveness of our method. Code is available \href{https://github.com/yifeisu/OV-Octree-Graph}{here}.

cs.CV↗
arXiv2026

Towards Visual Query Segmentation in the Wild

In this paper, we introduce visual query segmentation (VQS), a new paradigm of visual query localization (VQL) that aims to segment all pixel-level occurrences of an object of interest in an untrimmed video, given an external visual query. Compared to existing VQL locating only the last appearance of a target using bounding boxes, VQS enables more comprehensive (i.e., all object occurrences) and precise (i.e., pixel-level masks) localization, making it more practical for real-world scenarios. To foster research on this task, we present VQS-4K, a large-scale benchmark dedicated to VQS. Specifically, VQS-4K contains 4,111 videos with more than 1.3 million frames and covers a diverse set of 222 object categories. Each video is paired with a visual query defined by a frame outside the search video and its target mask, and annotated with spatial-temporal masklets corresponding to the queried target. To ensure high quality, all videos in VQS-4K are manually labeled with meticulous inspection and iterative refinement. To the best of our knowledge, VQS-4K is the first benchmark specifically designed for VQS. Furthermore, to stimulate future research, we present a simple yet effective method, named VQ-SAM, which extends SAM 2 by leveraging target-specific and background distractor cues from the video to progressively evolve the memory through a novel multi-stage framework with an adaptive memory generation (AMG) module for VQS, significantly improving the performance. In our extensive experiments on VQS-4K, VQ-SAM achieves promising results and surpasses all existing approaches, demonstrating its effectiveness. With the proposed VQS-4K and VQ-SAM, we expect to go beyond the current VQL paradigm and inspire more future research and practical applications on VQS. Our benchmark, code, and results will be made publicly available.

cs.CV↗
arXiv2026

An Attempt to Search for Unintended Electromagnetic Radiation from Starlink Satellites with the 21 Centimeter Array: Methodology and RFI Characterization

The rapid expansion of low-Earth-orbit (LEO) megaconstellations introduces new risks to radio astronomy from unintended electromagnetic radiation (UEMR). In this work, we present an attempt to search for UEMR from Starlink satellites using the 21 Centimeter Array (21CMA). Because the sensitivity of a single pod observation is limited, we focus on developing a robust observing and detection pipeline. Using Two-Line Element (TLE) data, we predict satellite transit times to guide the observations, and we define entry into the field of view (FoV) as an apparent declination greater than $85^{\circ}$ with respect to the 21CMA. We analyze the system equivalent flux density (SEFD) and the resulting single-pod sensitivity limits, which explain the detection of emission originating from the ORBCOMM satellites, rather than any detectable broadband UEMR in our dynamic spectra. To validate the methodology, we developed a Python package, orbdemod, to demodulate ORBCOMM downlink signals in our data. The recovered satellite ID agrees with the satellite predicted by our maximum-declination analysis, thereby validating the accuracy of our transit prediction and identification framework. Furthermore, via modulation power spectrum analysis, we show that the impulsive broadband bursts are produced by power line arcing near the array rather than by satellite UEMR.

astro-ph.IM↗
arXiv2026

Simulation and Data Processing of Beamforming Experiments with Four 21CMA Stations

We present an end-to-end simulation and data-processing framework for digital beamforming experiments conducted with four stations of the 21 Centimeter Array (21CMA). Motivated by the need to characterize instrumental systematics, such as those arising from station-level digital beam synthesis and two-stage channelization, and to validate the data-processing pipeline framework for a future upgraded 21CMA with beamforming capability across all stations, we simulate interferometric visibilities using realistic four-station layouts with radio interferometer simulation software OSKAR. Two representative pointings are considered: a bright, complex Cassiopeia A field and a near-north celestial pole (NCP) calibration field. The sky model combines cataloged point sources with a diffuse Galactic component from the Global Sky Model (GSM), and frequency-dependent thermal noise is injected. We further quantify the imprint of two-stage channelization by comparing an ideal beamformer with a coarse-channel phase approximation, demonstrating that off-axis sources exhibit a characteristic piecewise-linear spectral modulation across coarse-channel boundaries. A data-processing pipeline, including Radio Frequency Interference (RFI) mitigation, calibration, imaging, and mosaicking steps consistent with current low-frequency radio astronomy practice, is constructed. The resulting synthetic images and background root-mean-square (RMS) noise measurements demonstrate the feasibility of adapting established 21CMA calibration and imaging strategies to digital beamforming modes, and provide a framework that can be further developed for beam-aware processing in future full-scale 21CMA beamforming observations.

astro-ph.IM↗
arXiv2026

Towards the Giant Radio Array for Neutrino Detection (GRAND): the GRANDProto300 and GRAND@Auger prototypes

The Giant Radio Array for Neutrino Detection (GRAND) is a proposed multi-messenger observatory of Ultra-High-Energy (UHE) particles of cosmic origin. Its main goal is to find the long-sought origin of UHE cosmic rays by detecting large numbers of them and the secondary particles created by their interactions like gamma rays and neutrinos. The GRAND Collaboration plans to achieve this using large arrays of radio antennas that look for the radio signals emitted by the air showers initiated by the interactions of the UHE particles in the atmosphere. Since 2023, three small-scale prototype GRAND arrays have been in operation: GRAND@Nançay in France, GRAND@Auger in Argentina, and GRANDProto300 in China. Together, their goal is to validate the detection principle of GRAND under prolonged field conditions, achieving efficient, autonomous radio-detection of air showers. We describe the hardware, software, layout, and operation of the GRAND prototypes. Using their data, we show a first characterization of the local electromagnetic environment of each site and a measurement of the Galactic synchrotron emission. Despite challenges, the successful operation of the prototypes confirms that the GRAND instrumentation is apt to address the goals of the experiment and lays the groundwork for its ensuing stages.

astro-ph.IM↗
arXiv2026

LMSeg: Unleashing the Power of Large-Scale Models for Open-Vocabulary Semantic Segmentation

It is widely agreed that open-vocabulary-based approaches outperform classical closed-set training solutions for recognizing unseen objects in images for semantic segmentation. Existing open-vocabulary approaches leverage vision-language models, such as CLIP, to align visual features with rich semantic features acquired through pre-training on large-scale vision-language datasets. However, the text prompts employed in these methods are short phrases based on fixed templates, failing to capture comprehensive object attributes. Moreover, while the CLIP model excels at exploiting image-level features, it is less effective at pixel-level representation, which is crucial for semantic segmentation tasks. In this work, we propose to alleviate the above-mentioned issues by leveraging multiple large-scale models to enhance the alignment between fine-grained visual features and enriched linguistic features. Specifically, our method employs large language models (LLMs) to generate enriched language prompts with diverse visual attributes for each category, including color, shape/size, and texture/material. Additionally, for enhanced visual feature extraction, the SAM model is adopted as a supplement to the CLIP visual encoder through a proposed learnable weighted fusion strategy. Built upon these techniques, our method, termed LMSeg, achieves state-of-the-art performance across all major open-vocabulary segmentation benchmarks. The code will be made available soon.

cs.CV↗
arXiv2026

Pareto-optimal Trade-offs Between Communication and Computation with Flexible Gradient Tracking

This paper addresses distributed stochastic optimization problems under non-i.i.d. data, focusing on the inherent trade-offs between communication and computational efficiency. To this end, we propose FlexGT, a flexible snapshot gradient tracking method that enables tunable numbers of local updates and neighbor communications per round, thereby adapting efficiently to diverse system resource conditions. Leveraging a unified convergence analysis framework, we derive tight communication and computational complexity for FlexGT with explicit dependence on objective properties and certain tunable parameters. Moreover, we introduce an accelerated variant, termed Acc-FlexGT, and prove that, with prior knowledge of the graph, it achieves Pareto-optimal trade-offs between communication and computation. Particularly, in the nonconvex case, Acc-FlexGT achieves the optimal iteration complexity of $\tilde{\mathcal{O}}\left( \left( Lσ^2 \right) /\left( nε^2 \right) +L/\left( ε\sqrt{1-\sqrt{ρ_W}} \right) \right) $ and optimal communication complexity of $\tilde{\mathcal{O}}\left( L/\left( ε\sqrt{1-\sqrt{ρ_W}} \right) \right)$ for appropriately chosen numbers of local updates, matching existing lower bounds up to logarithmic factors. And, it improves the existing results for the strongly convex case by a factor of $\tilde{\mathcal{O}} \left( 1/\sqrtε \right)$, where $ε$ is the targeted accuracy, $n$ the number of nodes, $L$ the Lipschitz constant, $ρ_W$ the connectivity of the graph, and $σ$ the stochastic gradient variance. Numerical experiments corroborate the theoretical results and demonstrate the effectiveness of the proposed methods.

math.OC↗
arXiv2026

PaperX: A Unified Framework for Multimodal Academic Presentation Generation with Scholar DAG

Transforming scientific papers into multimodal presentation content is essential for research dissemination but remains labor intensive. Existing automated solutions typically treat each format as an isolated downstream task, leading to redundant processing and semantic inconsistency. We introduce PaperX, a unified framework that models academic presentation generation as a structural transformation and rendering process. Central to our approach is the Scholar DAG, an intermediate representation that decouples the paper's logical structure from its final presentation syntax. By applying adaptive graph traversal strategies, PaperX generates diverse, high quality outputs from a single source. Comprehensive evaluations demonstrate that our framework achieves the state of the art performance in content fidelity and aesthetic quality while significantly improving cost efficiency compared to specialized single task agents.

cs.DL↗
arXiv2026

Beyond Closed-Pool Video Retrieval: A Benchmark and Agent Framework for Real-World Video Search and Moment Localization

Traditional video retrieval benchmarks focus on matching precise descriptions to closed video pools, failing to reflect real-world searches characterized by fuzzy, multi-dimensional memories on the open web. We present \textbf{RVMS-Bench}, a comprehensive system for evaluating real-world video memory search. It consists of \textbf{1,440 samples} spanning \textbf{20 diverse categories} and \textbf{four duration groups}, sourced from \textbf{real-world open-web videos}. RVMS-Bench utilizes a hierarchical description framework encompassing \textbf{Global Impression, Key Moment, Temporal Context, and Auditory Memory} to mimic realistic multi-dimensional search cues, with all samples strictly verified via a human-in-the-loop protocol. We further propose \textbf{RACLO}, an agentic framework that employs abductive reasoning to simulate the human ``Recall-Search-Verify'' cognitive process, effectively addressing the challenge of searching for videos via fuzzy memories in the real world. Experiments reveal that existing MLLMs still demonstrate insufficient capabilities in real-world Video Retrieval and Moment Localization based on fuzzy memories. We believe this work will facilitate the advancement of video retrieval robustness in real-world unstructured scenarios.

cs.CV↗
arXiv2026

BridgeV2W: Bridging Video Generation Models to Embodied World Models via Embodiment Masks

Embodied world models have emerged as a promising paradigm in robotics, most of which leverage large-scale Internet videos or pretrained video generation models to enrich visual and motion priors. However, they still face key challenges: a misalignment between coordinate-space actions and pixel-space videos, sensitivity to camera viewpoint, and non-unified architectures across embodiments. To this end, we present BridgeV2W, which converts coordinate-space actions into pixel-aligned embodiment masks rendered from the URDF and camera parameters. These masks are then injected into a pretrained video generation model via a ControlNet-style pathway, which aligns the action control signals with predicted videos, adds view-specific conditioning to accommodate camera viewpoints, and yields a unified world model architecture across embodiments. To mitigate overfitting to static backgrounds, BridgeV2W further introduces a flow-based motion loss that focuses on learning dynamic and task-relevant regions. Experiments on single-arm (DROID) and dual-arm (AgiBot-G1) datasets, covering diverse and challenging conditions with unseen viewpoints and scenes, show that BridgeV2W improves video generation quality compared to prior state-of-the-art methods. We further demonstrate the potential of BridgeV2W on downstream real-world tasks, including policy evaluation and goal-conditioned planning. More results can be found on our project website at https://BridgeV2W.github.io .

cs.RO↗