arXiv subjects

Jun Li

Publications and source records attributed to Jun Li.

At least 55 records · Page 3Linked to original sources

arXiv2026

Pressure induced magnetic-field-free superconducting diode effect in NbSe2 flake

The superconducting diode effect (SDE) is a fascinating nonreciprocal phenomenon where the critical current is different for opposite current directions. It is widely believed that realizing SDE requires breaking both inversion symmetry (IS) and time-reversal symmetry (TRS), which are usually achieved via heterostructure engineering and applying external magnetic fields. Here, we report a pressure-induced magnetic-field-free SDE in NbSe2 flakes without any heterostructures. We show that pressure alone breaks the IS, as confirmed by the second harmonic generation. Crucially, upon applying an out-of-plane magnetic field (B), the SDE exhibits even-in-B behavior, implying the absence of explicit TRS breaking. This finding challenges the prevailing theoretical paradigm and demonstrates that a magnetic-field-free SDE can emerge without explicitly breaking TRS. Thereby, our work establishes pressure engineering as a powerful tool for inducing nonreciprocal superconductivity and designing versatile, magnetic-field-free superconducting devices.

cond-mat.supr-con↗

arXiv2026

Smartwatch Photoplethysmography-Derived Heart Age via ECG-Guided Cross-Modal Pretraining as a Digital Biomarker of Vascular Aging

Digital biomarkers of cardiovascular aging, often termed heart or vascular age, have been widely studied, but most rely on resting electrocardiography (ECG), imaging, or specialized vascular assessments. Evidence linking wearable photoplethysmography (PPG) to arterial stiffness and hypertension remains limited. We developed an ECG-guided cross-modal framework that uses synchronized smartwatch ECG to enhance PPG representation learning during pretraining while requiring only PPG at inference. The study included three OPPO cohorts across China, comprising 581,804 participants and 7,452,131 recordings. The Vascular Health Study cohort supported ECG-PPG self-supervised pretraining, fine-tuning, and internal validation, while two external cohorts assessed associations with pulse wave velocity (PWV) and prevalent hypertension. Combining subject-aware learning with ECG-PPG contrastive alignment, the PPG-only model achieved subject-level mean absolute errors of 5.895 years (Pearson r=0.819) in the PWV cohort and 4.344 years (r=0.800) in the home blood pressure monitoring cohort. Aggregating repeated recordings further improved short-term stability. After adjustment for chronological age, heart age gap was associated with PWV (partial r=0.2627, P<0.001); each 1-year increase corresponded to 0.062 m/s higher PWV, and accelerated versus decelerated heart aging was associated with 0.91 m/s higher adjusted PWV. Each 1-SD increase in adjusted heart age gap was associated with greater odds of prevalent hypertension (OR 1.72, 95% CI 1.49-1.99), while the highest versus lowest quartile had an OR of 4.25. These findings support smartwatch PPG-derived heart age gap as a scalable digital biomarker of arterial stiffness and prevalent hypertension.

eess.SP↗

arXiv2026

Federated Learning-Based Localization with Heterogeneous Fingerprint Database

Fingerprint-based localization plays an important role in indoor location-based services, where the position information is usually collected in distributed clients and gathered in a centralized server. However, the overloaded transmission as well as the potential risk of divulging private information burdens the application.Owning the ability to address these challenges, federated learning (FL)-based fingerprinting localization comes into people's sights, which aims to train a global model while keeping raw data locally. However, in distributed machine learning (ML) scenarios, the unavoidable database heterogeneity usually degrades the performance of existing FL-based localization algorithm (FedLoc). In this paper, we first characterize the database heterogeneity with a computable metric, i.e., the area of convex hull, and verify it by experimental results. Then, a novel heterogeneous FL-based localization algorithm with the area of convex hull-based aggregation (FedLoc-AC) is proposed. Extensive experimental results, including real-word cases are conducted. We can conclude that the proposed FedLoc-AC can achieve an obvious prediction gain compared to FedLoc in heterogeneous scenarios and has almost the same prediction error with it in homogeneous scenarios. Moreover, the extension of FedLoc-AC in multi-floor cases is proposed and verified.

eess.SP↗

arXiv2026

Providing Location Information at Edge Networks: A Federated Learning-Based Approach

Recently, the development of mobile edge computing has enabled exhilarating edge artificial intelligence (AI) with fast response and low communication cost. The location information of edge devices is essential to support the edge AI in many scenarios, like smart home, intelligent transportation systems and integrated health care. Taking advantages of deep learning intelligence, the centralized machine learning (ML)-based positioning technique has received heated attention from both academia and industry. However, some potential issues, such as location information leakage and huge data traffic, limit its application. Fortunately, a newly emerging privacy-preserving distributed ML mechanism, named federated learning (FL), is expected to alleviate these concerns. In this article, we illustrate a framework of FL-based localization system as well as the involved entities at edge networks. Moreover, the advantages of such system are elaborated. On practical implementation of it, we investigate the field-specific issues associated with system-level solutions, which are further demonstrated over a real-word database. Moreover, future challenging open problems in this field are outlined.

eess.SP↗

arXiv2026

Auto-JEPA: A Latent World Model of Continuous Intent for End-to-End Autonomous Driving

Existing autonomous-driving world models typically perform dense prediction of future videos, occupancy states, BEV representations, or agent motion. We argue that planning need not reconstruct the complete future world, but only focus on scene features that affect future ego action. Based on this perspective, we propose Auto-JEPA, an action-oriented latent world model that learns continuous future driving intent through joint-embedding prediction. Given visual observations, egomotion history, and navigation commands, Auto-JEPA predicts an intent embedding aligned with the latent representation of the future ego trajectory. The predicted intent retrieves executable trajectories from a fixed trajectory memory, which are then ranked by a scene-conditioned candidate selection module. Auto-JEPA keeps the visual encoder frozen, requires no explicit perception annotations, and uses no learned trajectory generator. By optimizing only task-specific modules for trajectory representation, intent prediction, and candidate selection, Auto-JEPA achieves 91.3 PDMS on NAVSIM v1 and 89.1 EPDMS on NAVSIM v2. Semantic occlusion experiments show that masking dynamic-agent regions induces an average intent change 2.97x that of equal-area random masking. Moreover, occluding vehicles that affect future driving substantially changes the predicted intent and selected trajectory, whereas both remain essentially unchanged when non-influential vehicles are occluded. These results show that future-intent prediction encourages the model to focus on planning-relevant visual features and supports high-quality planning without dense future-world modeling.

cs.RO↗

arXiv2026

CoDe-SSM: Context-Detail Decoupled State Space Model for Efficient UHD Image Restoration

Ultra-high-definition (UHD) image restoration must balance the aggregation of spatially recurring degradation cues with the preservation of localized image structures. Compact aggregation can reduce redundant processing but may attenuate edges, textures, and other fine structures. Existing approaches manage UHD restoration cost through downsampling, window partitioning, or cluster-based token reduction; yet many of them do not explicitly retain information that is poorly represented by shared aggregation. In this study, we propose a Context-Detail Decoupled State Space Model (CoDe-SSM) for UHD restoration, which processes aggregated context and clustering residuals in separate pathways. The context modeling pathway, implemented by the Global Cluster Scan Module (GCSM), aggregates features into $K$ input-dependent cluster centers and applies selective SSM reasoning over the resulting fixed-order sequence, enabling cross-region context sharing while decoupling computational cost from spatial resolution. The detail recovery pathway, implemented by the Local High-Frequency Module (LHFM), processes the clustering residual with an input-derived high-frequency mask and a sparse mixture of convolutional experts. Extensive experiments on five UHD benchmarks and five degradation types demonstrate that our explicit context-detail decoupling strategy yields substantial gains in restoration quality while maintaining desirable efficiency.

cs.CV↗

arXiv2026

Magnetic hopfions at room temperature

Hopfions are three-dimensional (3D) topological solitons predicted to exist in diverse magnetic systems, yet their practical utility has been largely restricted to cryogenic environments. Here, we overcome this temperature constraint by demonstrating stable magnetic hopfions in the chiral magnet Co8Zn8Mn4 at and above room temperature. Using a transmission electron microscope equipped for in situ optical excitation, we generate magnetic hopfions with femtosecond laser pulses. Long-term observations further reveal Brownian-like motion at room temperature and thermally activated collapse upon approaching the high-temperature regime. Together with micromagnetic simulations and homotopy group analysis, our experimental observations uncover the hopfion formation mechanism through the fusion of bimeron pairs. These findings establish room-temperature magnetic hopfions and provide a framework for their further studies under technologically relevant conditions.

cond-mat.mtrl-sci↗

arXiv2026

A Framework for Quantum Data Center Emulation Using Digital Quantum Computers

As quantum computers scale, single-chip architectures face inherent limitations in qubit count. This drives the need for modular quantum computing and Quantum Data Centers (QDCs), where multiple quantum processor units (QPUs) are interconnected to enable the distributed execution of a quantum algorithm. However, evaluating distributed quantum computing (DQC) architectures is challenging. Classical simulation is limited by the exponential growth of the state vector, limiting its ability to model large systems and realistically capture hardware noise and timing. Meanwhile, implementing QDC introduces interconnect noise challenges such as transduction inefficiency and optical fiber loss. In this work, we introduce a hardware-based emulation framework by partitioning a single quantum processor's qubit coupling map into multiple logical QPUs. We show how noise arising from transduction and optical fiber can be modeled by adding an ancilla qubit representing the environment, based on quantum collisional dynamics. This model is then translated into a gate-based circuit, in which the couplings between each portion act as controllable noisy quantum communication channels. We demonstrate the framework on IBM quantum hardware by executing remote gates under controllable communication noise. To highlight the flexibility of the platform, we further replicate the implementation results of distributed Grover's search algorithm on an ion-trap system. Finally, we test a larger circuit, i.e., a five-qubit Quantum Fourier Transform (QFT), achieving reasonable fidelity across logical QPUs. Overall, the framework provides a scalable hardware-level emulation platform that captures noise sources through physical qubits, and is compatible with any platform supporting the Qiskit SDK.

quant-ph↗

arXiv2026

Convergence-Latency-Aware Adaptive Modulation and Resource Allocation in RIS-Assisted Wireless Federated Learning

Federated learning (FL) over wireless networks suffers from significant training latency and degraded convergence due to unreliable wireless transmission, especially under blocked propagation environments. Although reconfigurable intelligent surfaces (RISs) can improve communication reliability, existing wireless FL studies rarely characterize the trade-off between learning convergence and communication delay under modulation-dependent transmission errors. In this paper, we consider a wireless FL system operating under RIS-assisted blocked-link propagation scenarios, and focus on adaptive modulation and sub-channel allocation for convergence-latency aware communication design. By characterizing the effect of symbol errors on uploaded local gradients, we derive a convergence-related upper bound that reveals the impact of symbol error rate (SER) on FL loss decay. Based on this result, we formulate a joint convergence-latency optimization problem, which is cast as a mixed-integer nonlinear programming (MINLP) problem, and solve it using a low-complexity hybrid alternating optimization framework. Extensive experiments on MNIST, CIFAR-10, and Speech Commands show that the proposed scheme consistently achieves faster convergence and higher test accuracy than existing adaptive communication schemes, especially in complex tasks and challenging wireless scenarios.

cs.LG↗

arXiv2026

A Covert Precision Satellite Communication Framework Assisted by Cooperative IRSs

Satellite communication (SatCom), as an effective complement to terrestrial networks, has attracted considerable attention from both academia and industry owing to its wide coverage and high flexibility. However, the inherent openness of satellite links renders them highly vulnerable to eavesdropping, thereby posing significant security challenges. In this paper, we propose a satellite covert precision wireless communication (CPWC) system, where multiple intelligent reflecting surfaces (IRSs) cooperate to assist satellite transmissions, ensuring that confidential information is delivered to legitimate users while remaining undetectable to wardens. To further enhance covertness, an orthogonal frequency division multiplexing (OFDM)-based random subcarrier selection (RSCS) method is developed to concentrate the signal energy at the intended receiver. Under a practical satellite-terrestrial channel model, we derive closed-form covertness constraints for the CPWC system based on relative entropy and detection error probability. Under the relative-entropy constraint and the satellite power constraint, we maximize the covert rate by an alternating-optimization (AO) based semidefinite relaxation (SDR) iterative algorithm and obtain a high-quality feasible solution. Using this solution as a warm start, we further impose the detection-error-probability constraint and refine the beamformer through a sequential quadratic programming (SQP) based algorithm. Numerical results demonstrate the effectiveness of the proposed CPWC system, where the detection-error-probability-based scheme outperforms the second-order cone programming (SOCP) benchmark, the random-phase-shift design, the one-bit IRS quantized scheme, and the SDR baseline without precise communication (PC) in terms of covert rate.

eess.SP↗

arXiv2026

Pipelined Gradient Coding

In large-scale machine learning, distributed training commonly involves multiple workers evaluating the gradients of the model on different dataset partitions. A common challenge is the presence of straggling workers, which may significantly slow down training. Traditional gradient coding (GC) addresses this by duplicating dataset partitions across workers, allowing for the replacement of missing gradients from stragglers. However, GC requires workers to evaluate gradients on multiple dataset partitions in each step, potentially increasing overall training time. In this paper, we propose to pipeline GC, such that gradient evaluation is segmented across multiple steps and each worker evaluates gradients on just a single dataset partition per step. We develop the pipelined version for fractional repetition (FR) and cyclic repetition (CR), two representative dataset placement schemes in GC, and prove convergence guarantees for both. Through extensive simulations and experiments on cloud infrastructure, our schemes not only significantly reduce training time but also accelerate convergence compared to GC and other baselines.

cs.IT↗

arXiv2026

FedCod: An Efficient Communication Protocol for Cross-Silo Federated Learning with Coding

Federated Learning (FL) is an innovative distributed machine learning paradigm that enables multiple parties to collaboratively train a model without sharing their raw data, thereby preserving data privacy. Communication efficiency concerns arise in cross-silo FL, particularly due to the network heterogeneity and fluctuations associated with geo-distributed silos. Most existing solutions to these problems focus on algorithmic improvements that alter the FL algorithm but sacrificing the training performance. How to address these problems from a network perspective that is decoupled from the FL algorithm remains an open challenge. In this paper, we propose FedCod, a new application layer communication protocol designed for cross-silo FL. FedCod transparently utilizes a coding mechanism to enhance the efficient use of idle bandwidth through client-to-client communication, and dynamically adjusts coding redundancy to mitigate network bottlenecks and fluctuations, thereby improving the communication efficiency and accelerating the training process. In our real-world experiments, FedCod demonstrates a significant reduction in average communication time by up to 62% compared to the baseline, while maintaining FL training performance and optimizing inter-client communication traffic.

cs.DC↗

arXiv2026

Taxonomy-Targeted Error Generation for Quantitative Reasoning

Personalized tutoring, teacher preparation, and education research can benefit from worked errors annotated by the mechanisms that produced them. Authentic student errors with such cognitive labels are costly to collect and share, motivating the study of whether LLMs can generate taxonomy-targeted synthetic errors as complementary candidate material. We present a task-specific framework that generates errors targeted to a five-class Bloom-informed student-error taxonomy. A Generation Agent (GA) drafts a candidate erroneous solution conditioned on a target class, and an Examination Agent (EA) judges whether the draft is incorrect and class-consistent. The framework yields a reusable recipe for building class-stratified synthetic error datasets where authentic student corpora are unavailable. As a secondary diagnostic, targeted error generation is substantially harder than free-form incorrect-answer generation, and answer-grounding contributes more than expanded examples or external textbook content.

cs.CL↗

arXiv2026

CANN Bench: Benchmarking Agent Generated Kernels against Real NPU and Algorithmic Limits

AI agents are now capable of writing, compiling, and iteratively optimizing low-level operator kernels on different hardware platforms. Existing benchmarks, however, focus almost exclusively on CUDA and Triton, leaving hardware ecosystems with less-exposed programming models without a common evaluation baseline. We present CANN Bench, an open benchmark for AI-generated operator code on Huawei's Ascend NPU. The current release covers 53 operators and 1060 test cases organized into four difficulty tiers -- from simple elementwise primitives to MoE dispatch and FlashAttention kernels -- spanning FP16, BF16, FP32, and INT8 precision formats. Evaluation adopts a \textbf{three-dimensional weighted composite score} that treats compilation, functional correctness, and performance as independent axes, providing a principled reward signal for kernel-generation agents. Performance is graded against an out-of-the-box PyTorch-on-Ascend baseline and an analytical per-case Hardware-Anchored Performance (HAP) limit on real NPU hardware, ensuring scores reflect genuine optimization headroom rather than measurement artifacts. The evaluation harness is designed to resist reward hacking from the ground up. CANN Bench is versioned within the official CANN repository and is designed for long-term community co-construction, providing the Ascend ecosystem with a quantitative, reproducible, and sustainably maintained yardstick for AI operator-authoring capability.

cs.AI↗

arXiv2026

ImputeECG: Deep Learning Reconstruction of Complete 12-Lead Electrocardiograms from Incomplete Recordings for Cardiac Assessment

Complete digital 12-lead electrocardiograms (ECGs) are essential for AI-enabled cardiovascular assessment, yet many clinical ECG records, particularly those digitized from ECG images, remain incomplete because of short display formats, incomplete waveform digitization, lead loss, or signal corruption. We developed ImputeECG, a mask-conditioned one-dimensional Transformer autoencoder that completes 12-lead, 10-s ECGs while retaining all observed samples. The model was trained on PTB-XL and evaluated on PTB-XL and CPSC2018 under simulated incomplete settings, with additional real-world validation in a 43,633-record Kailuan clinical cohort after ECG image digitization. Metrics were computed over originally missing regions, with analyses of morphology and downstream diagnostic utility. On PTB-XL, ImputeECG reduced missing-region MAE by 41.7-51.0% and MSE by 54.0-63.7% versus the strongest baseline, with lower errors in R-peak timing, RR interval, QRS duration, QT interval, and P-wave, QRS-complex, and T-wave reconstruction. On CPSC2018, ImputeECG reduced MAE by 49.7-51.9%, supporting external generalization. In downstream multi-label classification, ImputeECG restored performance to 92.28% AUROC and 33.88% AUPRC in the most incomplete PTB-XL setting, approaching complete-ECG performance. On CPSC2018, completed ECGs achieved 94.75-95.89% AUROC and 78.83-81.86% AUPRC across settings. In Kailuan, ECG completion improved zero-shot sex prediction AUROC from 82.6% to 85.8% and reduced age prediction MAE from 10.72 to 9.87 years after image-based ECG digitization. These findings support ECG completion as a practical strategy for converting incomplete ECG records into AI-ready 12-lead, 10-s digital signals and extending the usable scope of ECG archives for digital cardiac assessment.

cs.LG↗

arXiv2026

Distance Determination of Southern Galactic Plane Supernova Remnants with the Mopra CO Survey and DECaPS 3D Dust Map

Accurate distance measurements to supernova remnants (SNRs) are crucial for understanding their physical properties, evolutionary processes, and role in the Galactic interstellar medium (ISM) cycle. In this study, we apply for the first time to the southern Galactic plane a distance determination method that utilizes CO emission data from the Mopra survey to identify molecular clouds (MCs) interacting with SNRs. By combining this with extinction-distance profiles from the DECaPS three-dimensional (3D) extinction map, we directly measure the distances to the associated MCs, thereby obtaining precise distances to the remnants. To overcome the extinction-missing bias in extremely dense regions where the 3D map suffers from a deficit of background stars, we supplement our analysis with two-dimensional (2D) extinction maps as cross-validation. Applying this method, we have derived precise distances for nine SNRs: G290.1-0.8 (7.32+0.60/-0.47 kpc), G292.2-0.5 (10.85+0.43/-0.68 kpc), G296.1-0.5 (4.59+0.18/-0.19 kpc), G296.8-0.3 (8.74+0.40/-0.29 kpc), G298.6-0.0 (6.50 +/- 0.21 kpc), G312.4-0.4 (3.60+0.19/-0.23 kpc), G332.4-0.4 (2.66+0.23/-0.15 kpc), G335.2+0.1 (2.76+0.37/-0.31 kpc), and G353.6-0.7 (1.81+0.18/-0.14 kpc). Additionally, we established a robust lower distance limit of 1.34 kpc for G351.7+0.8.

astro-ph.GA↗

arXiv2026

RASR: Retrieval-Augmented Semantic Reasoning for Fake News Video Detection

Multimodal fake news video detection is a crucial research direction for maintaining the credibility of online information. Existing studies primarily verify content authenticity by constructing multimodal feature fusion representations or utilizing pre-trained language models to analyze video-text consistency. However, these methods still face the following limitations: (1) lacking cross-instance global semantic correlations, making it difficult to effectively utilize historical associative evidence to verify the current video; (2) semantic discrepancies across domains hinder the transfer of general knowledge, lacking the guidance of domain-specific expert knowledge. To this end, we propose a novel Retrieval-Augmented Semantic Reasoning (RASR) framework. First, a Cross-instance Semantic Parser and Retriever (CSPR) deconstructs the video into high-level semantic primitives and retrieves relevant associative evidence from a dynamic memory bank. Subsequently, a Domain-Guided Multimodal Reasoning (DGMP) module incorporates domain priors to drive an expert multimodal large language model in generating domain-aware, in-depth analysis reports. Finally, a Multi-View Feature Decoupling and Fusion (MVDFF) module integrates multi-dimensional features through an adaptive gating mechanism to achieve robust authenticity determination. Extensive experiments on the FakeSV and FakeTT datasets demonstrate that RASR significantly outperforms state-of-the-art baselines, achieves superior cross-domain generalization, and improves the overall detection accuracy by up to 0.93%.

cs.CV↗

arXiv2026

DiStash: A Disaggregated Multi-Stash Transactional Key-Value Store

A stash is a storage medium such as Dynamic Random Access Memory (DRAM), Solid State Disk (SSD), Hard Disk Drive (HDD), or Non-Volatile Memory (NVM). This paper presents a disaggregated transactional key-value (KV) store, DiStash, that governs KVs cross pools of stash types. It enables an application to use a single transaction to read and write different copies of one or more key-value pair across the different pools of stashes. It simplifies the application logic by (a) preventing undesirable race conditions that may cause copies of data across different stash pools to reflect different values and/or (b) failures that may result in loss of key-value pairs. A configuration of DiStash may use a pool of stashes as either ephemeral or durable storage. The application dictates whether the content of its participating stashes are inclusive (replicated) or exclusive (tiered). We implement a DiStash by extending FoundationDB. We quantify the tradeoffs with its design decisions using microbenchmarks and eBay's production workload. We open source our implementation at https://github.com/ebay-USC/DiStash.

cs.DB↗