arXiv subjects

Jing Wang

Publications and source records attributed to Jing Wang.

At least 73 records · Page 4Linked to original sources

arXiv2026

ST-Topo GAN: A Motor EEG-to-EMG Decoding Model Matched to Wrist Movement Complexity

The wrist plays a critical role in upper-limb function by enabling precise hand positioning, force regulation, and object manipulation. Continuous brain--muscle interfaces (BMIs) offer a promising approach for motor restoration by decoding neural activity into muscle activation signals. However, existing EEG-to-EMG models have mainly been developed for tasks with relatively stable muscle synergies and may be less effective for the heterogeneous and weakly coupled neuromuscular organisation involved in wrist movements. This paper proposes ST-Topo GAN, a Spatial--Temporal Topological Generative Adversarial Network for continuous EEG-to-EMG decoding of wrist movements. The framework integrates multi-band EEG representation, sensorimotor cortical topology modelling, and conditional adversarial learning to reconstruct multi-channel iEMG activation. The model was evaluated through cross-task comparison, wrist EEG-to-iEMG decoding, and ablation experiments. Compared with the WAY-EEG-GAL grasp-and-lift dataset, the wrist dataset exhibited lower inter-muscle activation similarity and greater decoding difficulty for conventional models. ST-Topo GAN achieved an average PCC of 0.4436 on the wrist dataset, outperforming all evaluated baselines, while the ablation study confirmed the contribution of its key components. These results support the effectiveness of ST-Topo GAN for continuous wrist EEG-to-iEMG decoding.

eess.SY↗

arXiv2026

Minutes-long soft X-ray prompt emission from a compact object merger

Compact object mergers are multi-messenger sources and known progenitors of some gamma-ray bursts, bright flashes of high-energy radiation powered by a central engine, either an accreting black hole or a neutron star. Our understanding of these events has so far been shaped primarily by observations in the gamma-ray band, leaving their prompt phase poorly constrained at lower energies. A long-lasting ($\approx$100 s) engine-driven X-ray emission was discussed to explain rapidly fading X-ray afterglows following several ($\approx$30%) bursts of short ($\lesssim$2 s) duration. However, this prompt X-ray component was not directly observed and past candidates were not confirmed. Here we report the discovery of EP250704a containing a minutes-long ($\sim$560 s) flash of soft (0.5--4 keV) X-rays immediately following the short ($\sim$0.4 s) GRB 250704B. The variability and spectral shape of this emission are inconsistent with the canonical picture of a hard, accretion-powered spike followed by a standard external-shock afterglow. Instead, the long-soft bump points to a distinct phase of prompt emission in X-rays, which would not have been detected without the soft X-ray coverage of Einstein Probe. The detection of a prompt soft X-ray counterpart in an otherwise ordinary short GRB shows that long-lasting X-ray emission is likely a common feature of merger-driven bursts and a promising electromagnetic counterpart to gravitational wave sources.

astro-ph.HE↗

arXiv2026

Pressure sensitivity in non-local flow behaviour of dense hydrogel particle suspensions

Slowly sheared particulate media like sand and suspensions flow heterogeneously as they yield via shear bands, in which most strain accumulates. Understanding shear band localization from microscopics is still a major challenge. One class of so-called non-local theories identified that the width of the shearing zone should depend on the stress field, in particular through the local distance to the yield point of the material. We explicitly test this stress sensitivity picture by using a uniquely stress-tunable suspension while probing its flow behavior in a classic geometry in which shear bands are known to scale nontrivially with local stress: the Split-Bottom Shear Cell. The stress-tunable suspension is composed of mildly polydisperse soft, slippery hydrogel spheres submersed in water. We measure their flow profiles and rheology while controlling the confinement stress via both hydrostatic effects and compression. Unique for these soft particles is that we can probe flow fields under confining normal stresses that reach about 1\% of their elastic modulus. We determine the average angular velocity profiles in the quasi-static flow regime using Magnetic Resonance Imaging based particle image velocimetry and discrete element method simulations. We explicitly match a pressure-sensitive non-local granular fluidity (NGF) model to observed flow behavior. We find that shear bands for this type of suspension become extremely broad under the low confining stresses from the almost density-matched fluid particle mixture, while collapsing to a narrow shear zone under finite, externally imposed compression levels. The DEM and NGF results match the observations qualitatively, confirming the conjectured pressure sensitivity for suspensions and its role in the NGF model. Our results indicate that pressure sensitivity should be part of non-local flow rules to describe slow flows of granular media.

cond-mat.soft↗

arXiv2026

TRACE-Memory: Public-Conditioned Retrieval and Utility-Aware Evidence Admission for Personalized Generation

Personalized generation systems retrieve user history by request--memory relevance and inject it into the model context. Yet relevant history may concern the wrong preference aspect, duplicate public information, or provide insufficient support. We argue that personal memory should be used only when it adds utility beyond a public-only response. We propose TRACE-Memory, a two-stage framework for selective personalization. Stage 1 queries for user-specific information missing from the request and public context, then retrieves a coverage-oriented candidate pool. Stage 2 admits a compact subset of source-traceable evidence units, or the empty set, according to response-level incremental utility. We progressively train the query-generation and evidence-admission policies through structured SFT initialization, reduced-space stage-wise GRPO warm-up, and nested multi-sample Joint GRPO. Across 4,500 Controlled and Natural tasks from Goodreads, Amazon Reviews, and Reddit, TRACE-Memory consistently outperforms random and lexical memory use, improves over semantic retrieval, remains competitive with frontier-LLM memory pipelines as local generator capacity increases, and conditions evidence admission on public-context sufficiency, supporting selective rather than default personalization.

cs.AI↗

arXiv2026

Droplet coalescence in fluids obeying Darcy's law

During drop coalescence, a connecting bridge of fluid forms and rapidly expands due to surface tension. For spherical drops, these dynamics are well understood in both the viscous and inertial regimes. However, under strong confinement, fluid motion is fundamentally altered by geometric constraints, leading to dissipation on small lengthscales. We investigate the coalescence of drops confined in a Hele-Shaw cell (two parallel plates separated by a narrow gap). In this geometry, the depth-averaged flow is governed by Darcy's law while surface tension drives the interface motion. We identify two distinct temporal regimes in the evolution of the bridge radius that evolves as a power law ($R_b$). At early times, the bridge grows as $R_b \sim t^{1/2}$, which results from a confinement-dependent meniscus instability that determines the initiation of contact between droplets prior to bridge formation. At later times, the bridge growth slows substantially and follows $R_b \sim t^{1/5}$, consistent with recent theoretical predictions for Darcy-governed coalescence. We show that the transition between these regimes is controlled by several geometric lengthscales. In particular, the onset of the Darcy regime occurs when the interface radius of curvature becomes comparable to the plate spacing, such that the flow becomes fully confined. Using a boundary integral formulation, we find that both scaling laws for $R_b$ are determined by the bridge width. Together, these results identify a new universal regime of drop coalescence in a broad class of fluids obeying Darcy's law.

physics.flu-dyn↗

arXiv2026

SSR-GRPO: Integrating Supervision and Semantic IDs into Reinforcement Learning for Dense Retrieval in E-commerce

Embedding-based retrieval (EBR) is pivotal in e-commerce search but often struggles with complex semantics. While recent methods often fine-tune large language models (LLMs) for representation learning, they typically lack robust mechanisms for handling complex and implicit semantics. While Retrieval-GRPO (R-GRPO) recently introduced reinforcement learning to dense retrieval, it suffers from noisy top-K candidates due to limited batch sampling and biased relevance assessments caused by using similarly trained LLMs as reward models. To tackle these issues, we propose Supervised Retrieval-GRPO with Semantic Identifiers (SSR-GRPO). Specifically, our method first proposes a dual-perspective framework for relevance assessment. It leverages both Semantic Identifiers (SIDs) produced by quantization learning and dense representation vectors to generate more unbiased relevance scores. Furthermore, leveraging the hierarchical similarity relationships of the generated SIDs, we mine a set of hard negative samples that serve two purposes: (1) to design a masking function integrated into R-GRPO, effectively filtering intra-group noisy samples; and (2) to construct a Retrieval-DPO task composed of positive and negative sample pairs, enabling the model to capture fine-grained semantic distinctions from a pair-wise perspective. By integrating these optimization strategies, we propose SSR-GRPO. Extensive offline and online experiments validate SSR-GRPO's effectiveness, and it has been deployed on a large-scale e-commerce platform.

cs.IR↗

arXiv2026

Fractional revival on oriented Cayley and semi-Cayley graphs over abelian groups

Fractional revival (FR), a generalization of perfect state transfer (PST), is a significant phenomenon in quantum state transfer that allows quantum information to be transmitted between two qubits with a certain probability. The existence of FR has been extensively studied on many classes of graphs. However, oriented graphs have not yet been investigated. In this paper, we investigate the existence of proper FR on oriented graphs. We first establish necessary and sufficient conditions for oriented graphs to admit proper FR between strongly cospectral vertices. Furthermore, we prove that oriented Cayley graphs over abelian groups do not admit proper FR, and we subsequently characterize the conditions under which oriented semi-Cayley graphs over abelian groups admit proper FR.

math.CO↗

arXiv2026

Best Reaction Target To Determine Proton Distribution Radii of Atomic Nuclei

We found that a heavy target such as Pb is most suitable for determining the proton distribution radii of unstable nuclei through charge-changing cross-section ($σ_\text{cc}$) measurements. As a heavy ion probe, low-$Z$ targets are routinely used to determine nucleon distribution radii of unstable isotopes. This approach has recently been extended to study proton distribution radii from $σ_\text{cc}$ measurements. However, empirical scaling factors have to be introduced to apply the Glauber models. In the present work, we systematically investigated the scaling factor using 39 new $σ_\text{cc}$ data of 18 $p$-shell nuclei on hydrogen, carbon, silver, and lead targets at around 240 MeV/nucleon. Together with the existing data, we reveal a universal dependence of the scaling factor on both the masses of target nuclei and the separation energies of projectile nuclei. The scaling factors decrease with increasing target-nucleus mass and converge to 1 for the highest-$Z$ target, making the scaling unnecessary. We conclude that instead of a low-$Z$ target, employing a heavy target such as Pb in $σ_\text{cc}$ measurements is the best option to determine the proton distribution radii of unstable nuclei.

nucl-ex↗

arXiv2026

Every Packet Counts: Dispersing Information for Loss-Resilient Learned Image Compression

Learned image compression (LIC) has achieved impressive rate-distortion performance. However, existing methods remain highly vulnerable to packet loss, a common challenge in satellite and emergency communications. This vulnerability stems from non-uniform information distribution at the packetization stage and sequential decoding dependencies at the entropy coding stage. We propose an end-to-end loss-resilient image compression scheme that addresses both. Before packetization, we introduce an Inter-Channel Redistribution (ICR) mechanism to redistribute channel energy, preventing critical information concentrating in a small subset of channels. Then, an Interleaved Channel Grouping (ICG) strategy partitions latent channels in a strided manner to disperse information across packets, with each packet kept within constrained sizes. To limit cascading errors from lost packets, we adopt a two-layer dual-branch autoregressive structure to shorten the dependency chain. Extensive experiments demonstrate that our method consistently outperforms existing approaches in both reconstruction quality and stability. At 20% packet loss, it achieves an average PSNR gain of 1.84 dB over LossResilientLIC while reducing PSNR variance by an order of magnitude. Notably, trained under uniform random loss only, our model generalizes to bursty loss modeled by the Gilbert-Elliott channel, outperforming methods explicitly trained for such conditions.

cs.CV↗

arXiv2026

FSTC-Encoder: Feature--Spatial--Temporal Correlation Learning for Generalizable RF Sensing

Heterogeneous RF sensing differs substantially in feature structure, spatial layout, and temporal scale, making existing models difficult to reuse across devices, environments, and RF modalities. We propose FSTC-Encoder, which unifies heterogeneous RF representation learning through feature, spatial, and temporal correlation modeling. Structure-aware feature encoding accommodates different signal structures, set-based spatial encoding aggregates variable observations, and hierarchical temporal encoding jointly captures local variations and long-range dependencies. Across sensing tasks and modalities, FSTC-Encoder retains the same spatial--temporal backbone architecture while varying only the feature configuration and task head. Across Widar3.0, CSI-Bench, and XRF55, FSTC-Encoder achieves 92.15% mean Accuracy under multi-factor cross-domain protocols, ranks first on three of four additional sensing tasks, remains consistently strong across WiFi, millimeter-wave radar, and RFID, and reduces the cross-modality performance gap from 18.85% to 12.93% through cross-RF learning. These results demonstrate that FSTC-Encoder achieves high domain robustness, task generality, and modality extensibility.

cs.LG↗

arXiv2026

A Survey of Circuit Foundation Model: Foundation AI Models for VLSI Circuit Design and EDA

Artificial intelligence (AI)-driven electronic design automation (EDA) techniques have been extensively explored for VLSI circuit design applications. Most recently, foundation AI models for circuits have emerged as a new technology trend. Unlike traditional task-specific AI solutions, these new AI models are developed through two stages: 1) self-supervised pre-training on a large amount of unlabeled data to learn intrinsic circuit properties; and 2) efficient fine-tuning for specific downstream applications, such as early-stage design quality evaluation, circuit-related context generation, and functional verification. This new paradigm brings many advantages: model generalization, less reliance on labeled circuit data, efficient adaptation to new tasks, and unprecedented generative capability. In this paper, we propose referring to AI models developed with this new paradigm as circuit foundation models (CFMs). This paper provides a comprehensive survey of the latest progress in circuit foundation models, unprecedentedly covering over 130 relevant works. Over 90% of our introduced works were published in or after 2022, indicating that this emerging research trend has attracted wide attention in a short period. In this survey, we propose to categorize all existing circuit foundation models into two primary types: 1) encoder-based methods performing general circuit representation learning for predictive tasks; and 2) decoder-based methods leveraging large language models (LLMs) for generative tasks. For our introduced works, we cover their input modalities, model architecture, pre-training strategies, domain adaptation techniques, and downstream design applications. In addition, this paper discussed the unique properties of circuits from the data perspective. These circuit properties have motivated many works in this domain and differentiated them from general AI techniques.

cs.AR↗

arXiv2026

Temporal Concentration from Rollout Errors: Implicit Preference Optimization for Text-to-Video Diffusion

Recent advances in preference alignment for diffusion-based video generation, particularly via Direct Preference Optimization (DPO), have significantly improved visual quality. However, temporally sparse artifacts such as motion collapse, object flickering, and color oversaturation remain a major barrier to perceptual realism. Existing methods struggle with these issues due to two key limitations: (1) the preference attribution bottleneck, where offline human annotations are costly and fail to accurately capture learning dynamics, while online reward signals are rollout-aware but often unstable and biased; and (2) temporal credit misallocation, where uniformly applied supervision cannot effectively target the brief segments in which artifacts occur. To address these challenges, we propose concentrated Implicit Preference Optimization (cIPO), a post-training framework for video diffusion models. cIPO derives implicit preference signals directly from the denoising process: given a real video, the model adds forward noise and reconstructs it via iterative denoising, treating the original as the preferred sample and the reconstruction as the dispreferred one. This formulation captures inference-time errors without requiring human annotations or external reward models. Moreover, frame-level discrepancies between original and reconstructed videos reveal when failures occur. cIPO leverages this by computing temporal reconstruction errors and concentrating optimization on high-error segments, enabling more precise correction of failure-prone regions. Extensive experiments demonstrate that cIPO consistently enhances video authenticity and temporal coherence across multiple datasets, highlighting the effectiveness and efficiency of implicit preference with temporally concentrated optimization.

cs.CV↗

arXiv2026

FedTopo: Relation-Level Topology Sharing for Model-Heterogeneous Federated Learning

Federated learning (FL) enables collaborative learning over decentralized data silos without centralizing raw data. However, heterogeneous local architectures often induce non-aligned representation spaces, making it difficult to transfer global knowledge across silos. Existing paradigms share this knowledge as model parameters, distilled predictions, or class prototypes, yet all encode it in an absolute space that must be aligned across clients. Heterogeneous backbones break this alignment, so the shared knowledge becomes unreliable and misleads local training. We propose FedTopo, a relation-level framework that encodes global knowledge as class relation topology, capturing how classes relate within each client rather than where they lie in feature space. Each client builds its relation topology from local prototypes and uploads it with class statistics. The server then aggregates these relations in a reliability-aware manner that down-weights weakly supported ones, and broadcasts the global topology to clients. The global topology guides local training by emphasizing topology-similar negative classes. Experiments on three datasets under eight heterogeneous backbones show that FedTopo consistently outperforms parameter-, distillation-, and prototype-sharing baselines, with low communication and no inference overhead. Our code is available at https://github.com/Zhaoyang-Ma/FedTopo.

cs.LG↗

arXiv2026

Comparing the Performance of Foundation Model Derived Embeddings with Traditional Approaches for Distant Metastasis Prediction in Head and Neck Cancer

Background: Early prediction of distant metastasis (DM) risk in head and neck cancer (HNC) can enable timely interventions that may improve treatment outcomes. Many current machine learning methods rely on prior knowledge of the region of interest such as tumor segmentations, which require expert knowledge, is time-consuming and introduces user-dependent variability. Medical image-based foundation models have recently been developed for specific imaging modalities to streamline down-stream prediction tasks by extracting modality-relevant features. Purpose: In this study, we evaluate the effectiveness of using a foundation model as the feature extractor to predict DM risk in HNC patients and compare its performance with traditional approaches that require prior knowledge on the regions of interest. Methods: Preoperative CT images of 2327 patients from the RADCURE dataset were used. Three features-sets were created including radiomics, deep-learning based features, and CT Foundation derived features. The feature-sets were used individually in a multi-layer perceptron (MLP) to predict DM risk. Results: The model using CT Foundation embeddings outperformed the radiomics and deep learning-based models, achieving a Receiver Operating Characteristic Area Under the Curve (AUC) of 0.791, compared to AUC values of 0.772 and 0.753 for the radiomics and deep learning-based models, respectively. The CT Foundation based model had similar performance to a model that combined the use of radiomics and deep learning-based features that achieved an AUC of 0.794. Conclusions: Features based on foundation models offer a promising alternative to traditional radiomics while reducing the need for domain expertise and extensively annotated datasets. Their minimal preprocessing requirements also make them a more accessible and scalable option.

cs.CV↗

arXiv2026

InnoText: A Unified Model for Visual Text Generation and Editing

Diffusion models have recently achieved remarkable success in high-fidelity image synthesis, yet their application to visual text generation and editing remains relatively underexplored. Unlike general image generation, visual text tasks demand precise structural regularity and legibility, which may pose additional challenges for small-scale text and non-Latin scripts such as Chinese. Existing UNet-based models often struggle to produce clear and coherent text, while DiT-based models, though more expressive, are typically limited to a single task, which may lead to redundant training pipelines, inconsistent visual styles, and reduced cross-task generalization. To address these challenges, we propose InnoText, a unified DiT-based framework capable of performing both text generation and editing within a single model. We introduce a Font Size-Aware Modulation (FSAM) module to enhance representations across font scales, a Small-Character Aware Augmentation strategy to improve fine-grained fidelity, and a Task-Specific Region Weighted Loss for adaptive optimization. To support training and evaluation, we also construct a high-quality bilingual (English-Chinese) visual text dataset covering diverse fonts, sizes, and backgrounds. Experimental results demonstrate that our method achieves superior generation accuracy and editing quality, producing visually appealing and realistic text images.

cs.CV↗

arXiv2026

Value-Monotonicity Matters: A Concordance Loss for Deep Survival Prediction

Deep survival models are evaluated almost exclusively by the concordance index (C-index), yet they are commonly trained using likelihood objectives such as the Cox partial likelihood, discrete-time negative log-likelihood, and DeepHit likelihood. This mismatch is usually considered acceptable because the C-index can be recomputed on validation data during training. However, for end-to-end training of high-capacity encoders on small, heavily censored oncology cohorts, frequent C-index evaluation is computationally expensive, making the loss value itself an important signal for monitoring, early stopping, and model selection. We show that likelihood losses are unreliable for this purpose and propose a value-monotone concordance loss. We prove that every strictly proper survival likelihood admits directions where the loss decreases while the C-index remains unchanged, causing the loss value to decouple from ranking performance. We then study a sigmoid concordance loss (SCL), whose value approximates one minus the C-index up to a temperature term, ensuring that lower loss corresponds to higher C-index during optimization. The loss is architecture agnostic and reduces to a convex survival ranking support vector machine for linear models. Across eighteen datasets from four modalities using a unified five-fold cross-validation protocol, SCL achieves discrimination comparable to standard likelihood losses and is the best or within one standard deviation of the best C-index. Unlike likelihood losses, SCL maintains a strong correlation between loss value and C-index during training, with rank correlations of 0.96 to 0.99 compared with -0.03 to 0.53 for likelihood losses. Calibration measured by the integrated Brier score is comparable. SCL provides a value-monotone optimization objective whose value can serve as a reliable surrogate for the C-index during expensive end-to-end training.

cs.LG↗

arXiv2026

Structural Compression for Phylogenetic Inference under Alignment Instability and Indel-Rich Evolution

Phylogenetic inference traditionally relies on aligned characters under substitution models, but this framework becomes less reliable when alignments are unstable or when evolution is dominated by insertions, deletions, repeats, and other structural changes. We adapt Ladderpath as an alignment-free distance approach for phylogenetic inference. Motivated by algorithmic information theory, Ladderpath decomposes sequences into derived, reusable units (``ladderons'', rather than fixed-length $k$-mers) organized hierarchically, from which pairwise distances are computed. The premise is that shared derived sequence structure, including repeated or reused segments that are poorly represented by column-wise substitutions, can retain phylogenetic information. The bacteriophage T7 known lineage, the cpSSR repeat-rich marker, and a cytochrome~$c$ protein dataset confirm that Ladderpath recovers topologies consistent with the known experimental history or with established alignment-based methods. Its advantage emerges under stress: in block-translocation and indel-dominated simulations Ladderpath remains stable while alignment-dependent pipelines deteriorate; on banana mitochondrial and plastome genomes it scales to genome length and captures the expected contrast between organellar histories, all from unaligned input. These results support Ladderpath as an alignment-free, structurally informed method that could complement standard pipelines in cases where higher-order sequence structure carries phylogenetic signal.

q-bio.PE↗

arXiv2026

TMallGS: Scaling Unified Feature and Sequence Modeling for Generative E-commerce Search

In industrial search and ranking systems, Click-Through Rate (CTR) prediction is shifting from traditional Deep Learning Recommendation Models (DLRM) toward unified, compute-intensive Transformer architectures. This transition is driven by the need to improve Model FLOPs Utilization (MFU) and achieve predictable gains through scaling laws. However, existing approaches such as OneTrans and Climber often adopt an all-in-tokenization strategy when adapting Large Language Model (LLM) architectures, overlooking the heterogeneous nature of ranking features. We propose TmallGS, a scalable ranking architecture for Tmall search. TmallGS includes five key components: (1) Hierarchical Distribution-Calibrated Tokenization, which combines Field-wise Saliency Reweighting (FSR) and Distribution-Calibrated Projection (DCP) to map diverse features into optimized subspaces; (2) a Field-Adaptive Gated Transformer Backbone with per-field QKV projections and noise-adaptive gating for refined semantic interaction; (3) Decoupled FiLM Late Fusion to preserve explicit high-frequency signals; (4) a Context-Aware Bias Net to decouple systemic bias from user intent; and (5) Error-Aware Progressive Training with dynamically weighted losses for robust learning. Extensive offline experiments and online A/B tests on Tmall Search show that TmallGS improves training throughput and achieves substantial gains in UCTCVR and GMV.

cs.IR↗