Search arXiv⌕ Search

arXiv subjects

Liang Wang

Publications and source records attributed to Liang Wang.

At least 55 records · Page 3Linked to original sources

Transition of Magnetic Reconnection Regimes in Partially Ionized Plasmas

Magnetic reconnection in partially ionized plasmas plays a crucial role in a wide range of solar, astrophysical, and laboratory environments. While reconnection in such plasmas is commonly characterized by the ion-neutral coupling strength and the ionization fraction $χ=n_{i}/(n_{i}+n_{n})$, most previous studies have focused primarily on the former. A systematic exploration of the ionization fraction, particularly in combination with ion-neutral coupling, is still lacking. This study presents the first systematic scan of the two-dimensional parameter space defined by ion-neutral collisionality and ionization fraction, enabling investigation of the transition from strongly coupled reconnection to faster, decoupled reconnection. To achieve this, we employ a new three-fluid, five-moment numerical model that treats electrons, ions, and neutrals as separate species on an equal footing. We find that in the strongly coupled regime, the reconnection rate is consistent with a $χ^{1/4}$ scaling. As collisionality decreases, the system transitions to a fast, ionization-independent regime. On the other hand, in the weakly coupled and fast-reconnection regimes, the current sheet approaches an ion-inertial-scale thickness rather than the expanded hybrid scale $d_{i}χ^{-1/2}$ predicted by fully coupled analytic fluid theories. The identified critical thickness and the resulting onset of fast reconnection agree reasonably well with recent fully kinetic simulations and laboratory experiments. In addition, we show that, over a wide range of coupling strengths, the ion outflow velocities remain Alfvénic, scaling with the appropriate ion or hybrid Alfvén speed, while the hybrid outflow velocity scales as $χ^{1/2}$ when normalized by ion Alfvén speed.

physics.plasm-ph↗

GRACE: Generative Recommender Acceleration Engine for Real-Time Ads Retrieval

Productionizing generative recommenders for high-volume, real-time ads retrieval creates two serving challenges: eligibility, ensuring that each generated ad is eligible for the request under the advertiser's audience targeting rules, and compute, which requires meeting strict latency and GPU cost requirements while remaining capable of generating thousands of ads per request with wide-beam decoding. This paper presents GRACE, a serving system for ads generative retrieval that addresses both challenges. For eligibility, GRACE introduces Generative Target Matching (GTM), which extends catalog-valid constrained decoding with personalized filtering over Semantic ID (SID) prefixes using bitmask and Bloom filter matchers derived from targeting rules. SID-level GTM improves final ad-level target matching pass rate from 23.55% to 40.42% over constrained decoding alone. For compute-cost and latency, GRACE targets encoder-decoder Transformers, which are more lightweight than LLMs. It redesigns the decoder around the wide-beam, short-sequence regime, covering attention kernels, KV cache, and beam search optimizations. On NVIDIA GH200, compared with the faster of FlashAttention-2 and FlashAttention-3 baselines, GRACE improves cross-attention latency by 68.0 times and self-attention latency by 23.4-25.8 times across decode steps. Together, these changes reduce decoder latency by 11.1 times, keeping ads generative retrieval within latency and compute requirements.

cs.IR↗

Simultaneous Mars-orbit observations reveal Kelvin-Helmholtz instability-driven bulk atmospheric ion escape

Atmospheric ion escape driven by the solar wind is a key process controlling the long-term loss of the Martian atmosphere. Localized plasma clouds can carry substantial fluxes of planetary ions away from Mars, representing episodes of bulk escape. However, their origin has remained unclear due to the absence of simultaneous upstream measurements. Using joint observations from the MAVEN and Tianwen-1 missions, which provide real-time upstream monitoring, we present direct evidence that these plasma clouds are nonlinear wave packets generated by the Kelvin-Helmholtz instability (KHI). The spatial scale of KH waves is constrained for the first time via two-point measurements. Ion fluxes within plasma clouds are one to two orders of magnitude higher than those in typical steady-state escape channels. Our results indicate that KHI is an important process for solar wind coupling to planetary upper atmospheres and plays a crucial role in shaping atmospheric ion escape for unmagnetized planets.

physics.space-ph↗

SyncPlan: Long-Horizon LLM Coordination with Explicit Synchronization and Adaptive Correction

LLM-based multi-agent coordination faces a fundamental trade-off between efficiency and adaptivity in dynamic environments. Existing approaches typically rely on repeated LLM invocations or multi-round communication to adapt decisions during execution, introducing substantial latency and making coordination vulnerable to asynchronous progress and environmental changes. Conversely, one-shot planning reduces coordination overhead but produces open-loop plans that can quickly become stale or fail when actions depend on other agents and the environment. We introduce SyncPlan, a plan-execute-correct framework for long-horizon coordination through explicit synchronization and adaptive correction. Given the state and team-level task, a centralized LLM coordinator generates per-agent action chains in a single planning call. During execution, explicit wait primitives and deadlock detection enforce inter-agent and agent-environment dependencies, while a lightweight Plan Staleness Detector continuously assesses the remaining plan and triggers replanning when environmental changes invalidate its assumptions. We further optimize the coordinator through SFT and planning-oriented RL with dense task progress and outcome-level execution feedback. Experiments on the public Overcooked benchmark and the complex Honor of Kings environment show that SyncPlan achieves state-of-the-art task success rates while using less than 0.05% of the wall-clock runtime compared with existing LLM-based coordinators. Code and datasets will be made publicly available.

cs.RO↗

EviSD: Evidence-Conditioned Self-Distillation for Search-Augmented Agents

Outcome-based reinforcement learning enables search-augmented language agents to learn from verifiable final answers, but its trajectory-level credit cannot distinguish the contributions of individual actions in a multi-turn search process. We propose EviSD, an evidence-conditioned self-distillation framework that uses instance-level supporting evidence as privileged information for search actions and golden answers as complementary privilege for answer actions. During training, the student samples actions from the original context, while the same model re-scores them as a privileged teacher under an action-aligned context. EviSD converts the detached teacher--student gap into a bounded correction to the outcome-derived GRPO advantage and applies it only to generated action spans. This design localizes privileged guidance while preserving the update direction determined by the outcome reward, without an auxiliary distillation objective or any change at inference time. Across seven question-answering benchmarks and three backbones spanning model scales and generations, EviSD achieves the highest macro-average Exact Match in all evaluated settings, outperforming the strongest compared methods by 1.3--2.3 points while modulating only 6.7%--15.1% of response tokens. Code is available at https://github.com/JiananXie/EviSD.

cs.CL↗

A Survey of Graph Transformers: Architectures, Theories and Applications

Graph Transformers (GTs) have demonstrated a strong capability in modeling graph structures by addressing the intrinsic limitations of graph neural networks (GNNs), such as over-smoothing and over-squashing. Recent studies have proposed diverse architectures, enhanced explainability, and practical applications for Graph Transformers. In light of these rapid developments, we conduct a comprehensive review of Graph Transformers, covering aspects such as their architectures, theoretical foundations, and applications. In this survey, we first categorize the architecture of Graph Transformers according to their strategies for processing structural information, including graph tokenization, positional encoding, structure-aware attention, and model ensemble. Then, from the theoretical perspective, we examine the expressivity of Graph Transformers in various discussed architectures and contrast them with other advanced graph learning algorithms to discover their connections. For applications, we organize the literature around four graph organization forms, from relational, geometric, dynamic to heterogeneous. A Practical Guidance table then maps architectural components to these graph forms by adoption frequency, so practitioners can narrow down which design families to consider for a given input structure. Lastly, we will discuss the current challenges and prospective directions in Graph Transformers for potential future research.

cs.LG↗

An MLIR-Based Compilation Method for Large Language Models

Large Language Models (LLMs) have become the dominant workload on modern AI accelerators, yet deploying them on specialized hardware still faces two core challenges: how to import a trained model into a compiler-friendly intermediate representation, and how to efficiently schedule the autoregressive inference loop under limited on-chip memory. This paper presents an MLIR (Multi-Level Intermediate Representation) based compilation method for large language models, illustrated using two dialects of operators, TopOp and TpuOp. TopOp serves as a high-level graph dialect that is independent of both the source framework and the target chip, and is responsible for expressing model semantics; TpuOp serves as the target hardware dialect, carrying chip-related decisions such as quantization, layer groups, and memory layout. A model is first represented as TopOp, then lowered layer by layer to TpuOp, and finally a deployable binary is generated. In addition, each Transformer layer is split into three stages for static compilation: prefill, prefill_kv (prefill with historical key-value cache), and decode, so as to accommodate the different computational characteristics of prompt-parallel processing and per-token generation. The method has been implemented in the TPU-MLIR compiler {https://github.com/sophgo/tpu-mlir} and the LLM-TPU deployment project {https://github.com/sophgo/LLM-TPU}, supporting a variety of generative models including the Qwen, Llama, InternVL, and MiniCPM-V series, as well as multiple quantization and deployment forms such as GPTQ, AWQ, and AutoRound.

cs.CL↗

Stop to Decide: Latency-Aware Proprioceptive Navigation Primitives for Mapping-Free Quadruped Inspection

Onboard quadruped inspection systems often share limited compute between perception and navigation, reducing the rate at which event-triggered controllers evaluate proprioceptive signals. We study this latency in stair-summit detection and propose a climb--settle ``stop-to-decide'' cadence for structured, mapping-free inspection. On a Unitree Go2, the integrated stair loop ran at $\approx$15 Hz. On a three-level stepped platform whose 50 cm top was shorter than the robot, continuous-climb overshoot increased with per-period advance $v/f$, whereas the climb--settle cadence held observed overshoot near zero (22/45 vs 1/45 pooled over $\approx$30/20/15 Hz; Fisher $p\approx2.4\times10^{-7}$). A logistic dose--response model gives a model-based critical rate of $\approx$19 Hz at 0.30 m/s; a pre-specified 40 Hz held-out check was consistent with the protocol-clean fit. We integrated the detector with line following and a three-segment 90$^\circ$ corridor maneuver in a fully onboard, learning-free stack using an IMU, foot-force sensing, three 1-D ranges, and one line camera. The corridor maneuver completed 20/20 trials without contact, compared with 14/20 completions and 12 wall contacts for in-place yaw; the full course completed 18/20 trials. Results are limited to one calibrated course, robot, and operator but identify loop rate as a deployment parameter for proprioceptive event detection.

cs.RO↗

BitNet Text Embeddings

LLM-based text embedders have substantially improved retrieval and semantic representation quality, but their deployment remains costly: large backbone models slow down embedding inference, while high-dimensional full-precision embeddings impose substantial storage and bandwidth overhead on large-scale indexes. In this paper, we present BITEMBED, an extreme low-bit framework for LLM-based text embedding that jointly targets encoding efficiency and vector storage. BITEMBED converts pretrained LLM backbones into BitNet-style embedding encoders with ternary weights, quantized activations, and lightweight normalization refinement. The converted model is adapted to representation learning through continual contrastive pre-training, followed by supervised contrastive fine-tuning with both similarity-distribution distillation and attention-relation distillation from a full-precision teacher. Beyond quantizing the backbone, BITEMBED further trains output embeddings to support multiple storage precisions meeting different storage needs in various scenarios. Experiments on MMTEB (eng, v2) with Qwen3-0.6B and Gemma3-270M show that BITEMBED is largely comparable to full precision teacher embedders. Moreover, BITEMBED flexibly obtains text embeddings of various precisions, achieving a trade-off between performance and storage cost.

cs.CL↗

Style over Substance: A Shortcut Audit of Emotion-Description Preference Evaluation

Preference over model-generated emotion descriptions is emerging as a standard evaluation metric for multimodal emotion understanding, exemplified by the MER2026 MER-Prefer track on EmoPrefer. Such benchmarks assume that predicting the preferred description requires grounded cross-modal understanding of the video. We conduct a systematic shortcut audit of EmoPrefer using content-blind probes. A simple logistic regression using only description length and generator identity, without processing the text, video, or audio, performs comparably to LoRA-finetuned 7B text and audio-visual judges (65.8 versus 66.8 WAF on EmoPrefer-V2). Generator identity is recoverable from description text with 99.5 percent accuracy, every candidate pair contrasts two distinct generators, and the human preference labels agree with a fold-exclusive per-generator win-rate prior on 66 percent of the evaluated pairs. When the human label conflicts with this prior, trained judges still follow the style prior on 63 to 80 percent of the pairs. On a length-matched subset that neutralizes verbosity bias, the tested media configurations yield no statistically significant improvement, while an ODIN-inspired diagnostic that decouples the style shortcut leaves its content head near chance. These results do not imply that human preferences are inherently stylistic or that the descriptions contain no emotional information. Instead, they show that the current scores can be reached without verifying either description against the video. We recommend source-balanced pairing, strict length control, counter-stereotypical sliced reporting, and multi-annotator consensus for future cross-generator evaluations. Code is available at https://github.com/jiabingyang01/EmoPrefer-Audit.

cs.CV↗

FlowWAM: Optical Flow as a Unified Action Representation for World Action Models

World Action Models (WAMs) are able to leverage pretrained video generators for both world modeling and action prediction. However, directly leveraging such video generators for control raises a new challenge: how to represent actions in a suitable form that aligns with pretrained video generators while carrying enough motion cues for accurate control. Existing numerical actions fail to satisfy the former, and prior visual action representations overlook the temporal motion structure across frames. We address this issue with FlowWAM, a dual-stream diffusion framework that adopts optical flow as a unified, video-native action representation. Flow videos share the same format as RGB videos and encode rich per-pixel displacement. By jointly modeling them within a shared pretrained video generator, FlowWAM can naturally implement two modes of WAMs. In policy mode, FlowWAM generates flow for action prediction, while in world-model mode, it uses target flow sequences to guide future video generation. Moreover, since flow can be easily extracted from raw videos without action labels, FlowWAM can leverage large-scale action-unlabeled video datasets for pretraining. We empirically find that our flow-based action representation delivers gains across both modes. On RoboTwin manipulation, FlowWAM raises the success rate to 92.94% on the Clean setting and 92.14% on Random, outperforming both VLA and WAM baselines. On WorldArena world modeling, it achieves the best overall EWMScore (63.71) with an 18.4% relative improvement in trajectory accuracy. More results can be found on our project website: https://flow-wam.github.io .

cs.RO↗

Predict the Retrieval! Test time adaptation for Retrieval Augmented Generation

Retrieval-Augmented Generation (RAG) has emerged as a powerful approach for enhancing large language models' question-answering capabilities through the integration of external knowledge. However, when adapting RAG systems to specialized domains, challenges arise from distribution shifts, resulting in suboptimal generalization performance. In this work, we propose TTARAG, a test-time adaptation method that dynamically updates the language model's parameters during inference to improve RAG system performance in specialized domains. Our method introduces a simple yet effective approach where the model learns to predict retrieved content, enabling automatic parameter adjustment to the target domain. Through extensive experiments across six specialized domains, we demonstrate that TTARAG achieves substantial performance improvements over baseline RAG systems. Code available at https://github.com/sunxin000/TTARAG.

cs.CL↗

$E$ and $J$ type $\mathcal{N}=(0,2)$ disordered models and higher-spin symmetry

In this work, we investigate the emergence of higher-spin structure in 2d $\mathcal{N}=(0,2)$ disordered models. While previous studies focused on the $J$-type model where the $E$-term in the Fermi multiplet was discarded. We extend the discussion to $\mathcal{N}=(0,2)$ disordered models with $E$-type potential. In terms of (disordered) $\mathcal{N}=(0,2)$ Landau-Ginzburg theory, we establish a duality between two models. By solving the Schwinger-Dyson equations and the ladder kernel matrix for 4-point functions, we verify that the $E$-type model is dynamically equivalent to the $J$-type model in the IR regime. Furthermore, we demonstrate that the $E$-type model also exhibits emergent higher-spin symmetry in certain limits. Our results reveal a larger region of the moduli space of 2D $\mathcal{N}=(0,2)$ disordered theories and provides insights into the holographic transition from finite to tensionless strings that can be diagnosed by the emergence of higher-spin symmetries.

hep-th↗

PUMA: Perception-driven Unified Foothold Prior for Mobility Augmented Quadruped Parkour

Parkour tasks for quadrupeds have emerged as a promising benchmark for agile locomotion. While human athletes can effectively perceive environmental characteristics to select appropriate footholds for obstacle traversal, endowing legged robots with similar perceptual reasoning remains a significant challenge. Existing methods often rely on hierarchical controllers that follow pre-computed footholds, thereby constraining the robot's real-time adaptability and the exploratory potential of reinforcement learning. To overcome these challenges, we present PUMA, an end-to-end learning framework that integrates visual perception and foothold priors into a single-stage training process. This approach leverages terrain features to estimate egocentric polar foothold priors, composed of relative distance and heading, guiding the robot in active posture adaptation for parkour tasks. Extensive experiments conducted in simulation and real-world environments across various discrete complex terrains, demonstrate PUMA's exceptional agility and robustness in challenging scenarios.

cs.RO↗

DIM-WAM: World-Action Modeling with Diverse Historical Event Memory

World-action models have shown promising robot-manipulation performance by jointly predicting future visual states and actions. However, existing methods mainly rely on short-term history and short-horizon future prediction, which is insufficient for long-horizon tasks whose correct execution depends on earlier observations and task progress. Such temporally dependent tasks require effective use of complementary temporal information, including recent local context, cross-stage historical events, immediate future dynamics, and global task progress. To address long-term forgetting and poor awareness of the global task state, we introduce DiM-WAM, a memory-augmented world-action model that integrates multi-scale historical context, local future dynamics, and global task progress. The memory extracts compact visual event information from real observations, updates multiple memory banks through independent similarity-based merging, and then reads the bank-identity- and time-embedded long-term context to condition video and action denoising. A progress-supervision objective further encourages memory tokens to encode not only completed historical events but also the current task stage and its implications for the remaining task. On RMBench, DiM-WAM raises average success from 28.4% with LingBot-VA to 69.8%, exceeding the explicit-memory Mem-0 baseline at 42.0%. On four real-world Franka tasks, it improves average stage success from 70.7% to 91.5% and full-task success from 52.5% to 80.0%. Project page: https://wangkai-casia.github.io/dim-wam.

cs.RO↗

Hierarchical Multi-to-Single-Modal Knowledge Distillation for Disruption Prediction in EAST

Plasma disruption is a critical threat to tokamak safety. Existing data-driven predictors mainly rely on time-series diagnostic signals, while visible images provide complementary spatial cues including plasma deformation, local brightening, and radiation-structure evolution. Although the image modality improves the model's discriminative capability, it also substantially increases the computational cost during inference. To address this issue, we propose a hierarchical multi-to-single-modal knowledge distillation framework for disruption prediction on a synchronized EAST multimodal dataset. During training, visible images and time-series signals are used to train a multimodal teacher, which learns disruption precursor representations through Transformer-based encoders and a prototype-guided spatiotemporal hypergraph module. During inference, only the time-series student is retained, with multimodal knowledge transferred through graph-structure-level, representation-level, and decision-level distillation. On the 640-discharge EAST dataset, the results demonstrate that the proposed framework can preserve the discriminative advantages of multimodal learning while substantially reducing inference cost, and providing an effective route for efficient disruption prediction in EAST. The source code of this paper will be released on https://github.com/Event-AHU/OpenFusion.

cs.CV↗

Spin-Orbit Geometry of AU Mic b and c from Back-to-Back Transits Observed Contemporaneously with Magellan PFS, LCOGT, and CHEOPS

Young planets offer a unique window into the early stages of planetary evolution. AU Mic is one of the nearest (9.8 pc) pre-main sequence stars (~20 Myr), hosting two transiting Neptune-sized planets and a debris disk. Previous studies have shown that the rotation of the central star, the debris disk, and the inner planet b are all aligned, suggesting that the system has not undergone violent evolution. Here we report new Rossiter-McLaughlin (RM) measurements for both AU Mic b and c, which happened to transit back-to-back on Aug 24 and 25, 2024, using the Magellan Planet Finder Spectrograph (PFS), accompanioned with contanporaneous photometry from LCOGT and CHEOPS. We confirm the aligned orbit of AU Mic b ($λ_b=1° \pm 12°$) and finding two possible solutions for AU Mic c: we slightly favor an aligned solution ($λ_c=-10° \pm 16°$) but cannot rule out a polar solution ($λ_c=87°\ ^{+36°}_{-29°}$). Broader considerations, including dynamical stability and transit possibility, also support the mutually aligned scenario. An unexpected stellar signal during ingress and the poor TTV predictions of AU Mic c prevent a precise constraint on its obliquity, and various attempts using chromatic spectral analyses fail to outperform simple data exclusion in mitigating the stellar contamination. Our observation highlights the importance of understanding stellar activity across multiple timescales and channels when characterizing young, active systems. A robust solution for the AU Mic architecture will require either a better understanding of stellar activity or future observations fortuitously free from strong stellar contamination.

astro-ph.EP↗

Arko-T: A Foundation Model for Text-to-Structured 3D Generation

Text-to-3D systems can now synthesize a model from a single sentence, yet the result is a shape to render, not a design to edit. We present Arko-T, a 4B-parameter text-to-design model that maps natural-language intent directly into executable, parametric CAD programs. Rather than optimizing for code executability alone, Arko-T aligns every stage of the pipeline to a formal notion of design state, so that data curation, code normalization, and execution-grounded supervision all work to preserve the features, parameters, and construction logic that make a CAD artifact editable. Benchmarked against seven frontier LLMs across 12 metrics, Arko-T attains the best score on 8 and the second-best on 3 more, at roughly one-tenth the per-benchmark cost. The results suggest that targeted design-level training at moderate scale can match frontier general-purpose models on structured CAD generation.

cs.LG↗