arXiv subjects

Jun Wu

Publications and source records attributed to Jun Wu.

At least 73 records · Page 4Linked to original sources

arXiv2025

SemCovert: Secure and Covert Video Transmission via Deep Semantic-Level Hiding

Video semantic communication, praised for its transmission efficiency, still faces critical challenges related to privacy leakage. Traditional security techniques like steganography and encryption are challenging to apply since they are not inherently robust against semantic-level transformations and abstractions. Moreover, the temporal continuity of video enables framewise statistical modeling over extended periods, which increases the risk of exposing distributional anomalies and reconstructing hidden content. To address these challenges, we propose SemCovert, a deep semantic-level hiding framework for secure and covert video transmission. SemCovert introduces a pair of co-designed models, namely the semantic hiding model and the secret semantic extractor, which are seamlessly integrated into the semantic communication pipeline. This design enables authorized receivers to reliably recover hidden information, while keeping it imperceptible to regular users. To further improve resistance to analysis, we introduce a randomized semantic hiding strategy, which breaks the determinism of embedding and introduces unpredictable distribution patterns. The experimental results demonstrate that SemCovert effectively mitigates potential eavesdropping and detection risks while reliably concealing secret videos during transmission. Meanwhile, video quality suffers only minor degradation, preserving transmission fidelity. These results confirm SemCovert's effectiveness in enabling secure and covert transmission without compromising semantic communication performance.

eess.IV↗

arXiv2025

AndesVL Technical Report: An Efficient Mobile-side Multimodal Large Language Model

In recent years, while cloud-based MLLMs such as QwenVL, InternVL, GPT-4o, Gemini, and Claude Sonnet have demonstrated outstanding performance with enormous model sizes reaching hundreds of billions of parameters, they significantly surpass the limitations in memory, power consumption, and computing capacity of edge devices such as mobile phones. This paper introduces AndesVL, a suite of mobile-side MLLMs with 0.6B to 4B parameters based on Qwen3's LLM and various visual encoders. We comprehensively outline the model architectures, training pipeline, and training data of AndesVL, which achieves first-tier performance across a wide range of open-source benchmarks, including fields such as text-rich image understanding, reasoning and math, multi-image comprehension, general VQA, hallucination mitigation, multilingual understanding, and GUI-related tasks when compared with state-of-the-art models of a similar scale. Furthermore, we introduce a 1+N LoRA architecture alongside a Quantization-Aware LoRA Fine-Tuning (QALFT) framework to facilitate efficient task adaptation and model compression during mobile-side deployment of AndesVL. Moreover, utilizing our cache eviction algorithm -- OKV -- along with customized speculative decoding and compression strategies, we achieve a 6.7x peak decoding speedup ratio, up to 30.9% memory reduction, and 1.8 bits-per-weight when deploying AndesVL-4B on MediaTek Dimensity 9500 chips. We release all models on https://huggingface.co/OPPOer.

cs.CV↗

arXiv2025

Dimension theory of inhomogeneous Diophantine approximation with matrix sequences

In this paper, we investigate the Hausdorff dimension of naturally occurring sets of inhomogeneous well-approximable points with a sequence of real invertible matrices $\mathcal{A}=(A_n)_{n\in\mathbb{N}}$. Specifically, for a given point $\mathbf{y}\in [0,1)^d$ and a function $ψ: \mathbb{N} \to \mathbb{R}^+$, we study the limsup set \[ W\big(\mathcal{A},ψ,{\bf y}\big) =\Big\{\mathbf{x}\in [0,1)^d\colon A_n\mathbf{x}~(\bmod~1)\in B\big(\mathbf{y}, ψ(n)\big) {\rm ~ for~ infinitely ~many}~n\in\mathbb{N}\Big\}.\] The upper and lower bounds on the Hausdorff dimension of $W\big(\mathcal{A},ψ,{\bf y}\big)$ are determined by involving the singular values of $A_n$ and the successive minima of the lattice $A_n^{-1}\mathbb{Z}^d$, and both bounds are shown to be attainable for some matrices. Within this framework, we unify the problem of shrinking target sets and recurrence sets, establishing the Hausdorff dimensions for such limsup sets. As applications, our corresponding upper bounds for shrinking target and recurrence sets essentially improve those appearing in the present literature. Furthermore, explicit Hausdorff dimension formulas are derived for shrinking targets and recurrence sets associated with concrete classes of matrices. We extend the Mass Transference Principle for rectangles of Li-Liao-Velani-Wang-Zorin (Adv. Math., 2025) to rectangles under local isometries. This generalization yields a general lower bound for the Hausdorff dimension of $W\big(\mathcal{A},ψ,{\bf y}\big)$.

math.NT↗

arXiv2025

START: Traversing Sparse Footholds with Terrain Reconstruction

Traversing terrains with sparse footholds like legged animals presents a promising yet challenging task for quadruped robots, as it requires precise environmental perception and agile control to secure safe foot placement while maintaining dynamic stability. Model-based hierarchical controllers excel in laboratory settings, but suffer from limited generalization and overly conservative behaviors. End-to-end learning-based approaches unlock greater flexibility and adaptability, but existing state-of-the-art methods either rely on heightmaps that introduce noise and complex, costly pipelines, or implicitly infer terrain features from egocentric depth images, often missing accurate critical geometric cues and leading to inefficient learning and rigid gaits. To overcome these limitations, we propose START, a single-stage learning framework that enables agile, stable locomotion on highly sparse and randomized footholds. START leverages only low-cost onboard vision and proprioception to accurately reconstruct local terrain heightmap, providing an explicit intermediate representation to convey essential features relevant to sparse foothold regions. This supports comprehensive environmental understanding and precise terrain assessment, reducing exploration cost and accelerating skill acquisition. Experimental results demonstrate that START achieves zero-shot transfer across diverse real-world scenarios, showcasing superior adaptability, precise foothold placement, and robust locomotion.

cs.RO↗

arXiv2025

Asymptotic stability of solitary waves for the b-family of equations

We establish the asymptotic stability of lefton solutions-exponentially localized stationary solitary waves-for the $b$-family of equations with positive momentum density in the regime $b < -1$. Unlike the completely integrable Camassa-Holm $(b=2)$ and Degasperis-Procesi $(b=3)$ cases, this parameter range lies outside integrability and exhibits distinct nonlinear dynamics. Our analysis adapts the Martel-Merle framework for generalized KdV equations to the nonlocal, non-integrable structure of the $b$-family of equations. The proof combines a nonlinear Liouville property for solutions localized near leftons with a refined spectral analysis of the associated linearized operator. These results provide the first rigorous asymptotic stability theory for leftons in the non-integrable $b$-family of equations.

math.AP↗

arXiv2025

A 1.431-Competitive Algorithm for Combinatorial Group Testing

In the context of fault-detection problems, the objective is to identify all defective items among a set of $n$ binary-state items using the minimum number of tests. The {group testing} paradigm, which allows testing a subset of items in a single test, serves as a fundamental technique for efficiently classifying large populations. We study a central problem in the combinatorial group testing model where the number $d$ of defective items is unknown in advance. Let $M_α(d|n)$ denote the maximum number of tests required by an algorithm $α$ for this problem, and $M(d,n)$ denote the minimum number of tests required in the worst case when $d$ is known in advance. An algorithm $α$ is called a $c$-\emph{competitive algorithm} if there exist constants $c$ and $a$ such that, for $0\le d < n$, $M_α(d|n)\le cM(d,n)+a$. We design a new adaptive algorithm with a competitive constant $c \le 1.431$, thus pushing the competitive ratio below the best-known one of $1.452$. To achieve this, we propose a novel solution framework based on an unexplored up-zig-zag strategy and a studied strongly competitive algorithm.

math.CO↗

arXiv2025

Data Value in the Age of Scaling: Understanding LLM Scaling Dynamics Under Real-Synthetic Data Mixtures

The rapid progress of large language models (LLMs) is fueled by the growing reliance on datasets that blend real and synthetic data. While synthetic data offers scalability and cost-efficiency, it often introduces systematic distributional discrepancies, particularly underrepresenting long-tail knowledge due to truncation effects from data generation mechanisms like top-p sampling, temperature scaling, and finite sampling. These discrepancies pose fundamental challenges in characterizing and evaluating the utility of mixed real-synthetic datasets. In this paper, we identify a three-phase scaling behavior characterized by two breakpoints that reflect transitions in model behavior across learning head and tail knowledge. We further derive an LLM generalization bound designed for real and synthetic mixtures, revealing several key factors that govern their generalization performance. Building on our theoretical findings, we propose an effective yet efficient data valuation method that scales to large-scale datasets. Comprehensive experiments across four tasks, including image classification, sentiment classification, instruction following, and complex reasoning, demonstrate that our method surpasses state-of-the-art baselines in data valuation with significantly low computational cost.

cs.LG↗

arXiv2025

Trustworthy Transfer Learning: A Survey

Transfer learning aims to transfer knowledge or information from a source domain to a relevant target domain. In this paper, we understand transfer learning from the perspectives of knowledge transferability and trustworthiness. This involves two research questions: How is knowledge transferability quantitatively measured and enhanced across domains? Can we trust the transferred knowledge in the transfer learning process? To answer these questions, this paper provides a comprehensive review of trustworthy transfer learning from various aspects, including problem definitions, theoretical analysis, empirical algorithms, and real-world applications. Specifically, we summarize recent theories and algorithms for understanding knowledge transferability under (within-domain) IID and non-IID assumptions. In addition to knowledge transferability, we review the impact of trustworthiness on transfer learning, e.g., whether the transferred knowledge is adversarially robust or algorithmically fair, how to transfer the knowledge under privacy-preserving constraints, etc. Beyond discussing the current advancements, we highlight the open questions and future directions for understanding transfer learning in a reliable and trustworthy manner.

cs.LG↗

arXiv2025

SoulX-Podcast: Towards Realistic Long-form Podcasts with Dialectal and Paralinguistic Diversity

Recent advances in text-to-speech (TTS) synthesis have significantly improved speech expressiveness and naturalness. However, most existing systems are tailored for single-speaker synthesis and fall short in generating coherent multi-speaker conversational speech. This technical report presents SoulX-Podcast, a system designed for podcast-style multi-turn, multi-speaker dialogic speech generation, while also achieving state-of-the-art performance in conventional TTS tasks. To meet the higher naturalness demands of multi-turn spoken dialogue, SoulX-Podcast integrates a range of paralinguistic controls and supports both Mandarin and English, as well as several Chinese dialects, including Sichuanese, Henanese, and Cantonese, enabling more personalized podcast-style speech generation. Experimental results demonstrate that SoulX-Podcast can continuously produce over 90 minutes of conversation with stable speaker timbre and smooth speaker transitions. Moreover, speakers exhibit contextually adaptive prosody, reflecting natural rhythm and intonation changes as dialogues progress. Across multiple evaluation metrics, SoulX-Podcast achieves state-of-the-art performance in both monologue TTS and multi-turn conversational speech synthesis.

eess.AS↗

arXiv2025

Learning to Hash for Recommendation: A Survey

With the explosive growth of users and items, Recommender Systems are facing unprecedented challenges in terms of retrieval efficiency and storage overhead. Learning to Hash techniques have emerged as a promising solution to these issues by encoding high-dimensional data into compact hash codes. As a result, hashing-based recommendation methods (HashRec) have garnered growing attention for enabling large-scale and efficient recommendation services. This survey provides a comprehensive overview of state-of-the-art HashRec algorithms. Specifically, we begin by introducing the common two-tower architecture used in the recall stage and by detailing two predominant hash search strategies. Then, we categorize existing works into a three-tier taxonomy based on: (i) learning objectives, (ii) optimization strategies, and (iii) recommendation scenarios. Additionally, we summarize widely adopted evaluation metrics for assessing both the effectiveness and efficiency of HashRec algorithms. Finally, we discuss current limitations in the field and outline promising directions for future research. We index these HashRec methods at the repository \href{https://github.com/Luo-Fangyuan/HashRec}{https://github.com/Luo-Fangyuan/HashRec}.

cs.IR↗

arXiv2025

Bridging the gap between experimental burden and statistical power for quantiles equivalence testing

Testing the equivalence of multiple quantiles between two populations is important in many scientific applications, such as clinical trials, where conventional mean-based methods may be inadequate. This is particularly relevant in bridging studies that compare drug responses across different experimental conditions or patient populations. These studies often aim to assess whether a proposed dose for a target population achieves pharmacokinetic levels comparable to those of a reference population where efficacy and safety have been established. The focus is on extreme quantiles which directly inform both efficacy and safety assessments. When analyzing heterogeneous Gaussian samples, where a single quantile of interest is estimated, the existing Two One-Sided Tests method for quantile equivalence testing (qTOST) tends to be overly conservative. To mitigate this behavior, we introduce $α$-qTOST, a finite-sample adjustment that achieves uniformly higher power compared to qTOST while maintaining the test size at the nominal level. Moreover, we extend the quantile equivalence framework to simultaneously assess equivalence across multiple quantiles. Through theoretical guarantees and an extensive simulation study, we demonstrate that $α$-qTOST offers substantial improvements, especially when testing extreme quantiles under heteroskedasticity and with small, unbalanced sample sizes. We illustrate these advantages through two case studies, one in HIV drug development, where a bridging clinical trial examines exposure distributions between male and female populations with unbalanced sample sizes, and another in assessing the reproducibility of an identical experimental protocol performed by different operators for generating biodistribution profiles of topically administered and locally acting products.

stat.ME↗

arXiv2025

StyleDecipher: Robust and Explainable Detection of LLM-Generated Texts with Stylistic Analysis

With the increasing integration of large language models (LLMs) into open-domain writing, detecting machine-generated text has become a critical task for ensuring content authenticity and trust. Existing approaches rely on statistical discrepancies or model-specific heuristics to distinguish between LLM-generated and human-written text. However, these methods struggle in real-world scenarios due to limited generalization, vulnerability to paraphrasing, and lack of explainability, particularly when facing stylistic diversity or hybrid human-AI authorship. In this work, we propose StyleDecipher, a robust and explainable detection framework that revisits LLM-generated text detection using combined feature extractors to quantify stylistic differences. By jointly modeling discrete stylistic indicators and continuous stylistic representations derived from semantic embeddings, StyleDecipher captures distinctive style-level divergences between human and LLM outputs within a unified representation space. This framework enables accurate, explainable, and domain-agnostic detection without requiring access to model internals or labeled segments. Extensive experiments across five diverse domains, including news, code, essays, reviews, and academic abstracts, demonstrate that StyleDecipher consistently achieves state-of-the-art in-domain accuracy. Moreover, in cross-domain evaluations, it surpasses existing baselines by up to 36.30%, while maintaining robustness against adversarial perturbations and mixed human-AI content. Further qualitative and quantitative analysis confirms that stylistic signals provide explainable evidence for distinguishing machine-generated text. Our source code can be accessed at https://github.com/SiyuanLi00/StyleDecipher.

cs.CL↗

arXiv2025

Broadband, robust, and tunable beam splitter based on topological unidirectional surface magnetoplasmons

Beam splitters are pivotal components in integrated microwave and photonic systems. However, conventional designs based on directional coupling or multi-mode interference often suffer from back scattering, frequency-dependent splitting ratios, and limited bandwidth. To overcome these limitations, here, we propose a new physical mechanism to achieve a broadband, robust, and tunable beam splitter by manipulating the mode coupling of the topological unidirectional surface magnetoplasmons (USMP) at the input and output waveguides. We show that the beam splitter not only exhibits strong robustness against obstacles but also achieves a broad bandwidth across nearly the entire USMP band with arbitrarily tunable and frequency-independent splitting ratios. Moreover, the operating band of the beam splitter can be actively tuned by adjusting the external magnetic field, while its robust and broadband characteristics are retained. Our results extend the research frontier of beam splitters and may have potential applications in integrated photonic devices and modern communication systems.

physics.optics↗

arXiv2025

Purest Quantum State Identification

Quantum noise constitutes a fundamental obstacle to realizing practical quantum technologies. To address the pivotal challenge of identifying quantum systems least affected by noise, we introduce the purest quantum state identification, which can be used to improve the accuracy of quantum computation and communication. We formulate a rigorous paradigm for identifying the purest quantum state among $K$ unknown $n$-qubit quantum states using total $N$ quantum state copies. For incoherent strategies, we derive the first adaptive algorithm achieving error probability $\exp\left(- Ω\left(\frac{N H_1}{\log(K) 2^n }\right) \right)$, fundamentally improving quantum property learning through measurement optimization. By developing a coherent measurement protocol with error bound $\exp\left(- Ω\left(\frac{N H_2}{\log(K) }\right) \right)$, we demonstrate a significant separation from incoherent strategies, formally quantifying the power of quantum memory and coherent measurement. Furthermore, we establish a lower bound by demonstrating that all strategies with fixed two-outcome incoherent POVM must suffer error probability exceeding $ \exp\left( - O\left(\frac{NH_1}{2^n}\right)\right)$. This research advances the characterization of quantum noise through efficient learning frameworks. Our results establish theoretical foundations for noise-adaptive quantum property learning while delivering practical protocols for enhancing the reliability of quantum hardware.

quant-ph↗

arXiv2025

Conceptual Design Report of Super Tau-Charm Facility: The Accelerator

Electron-positron colliders operating in the GeV region of center-of-mass energies or the Tau-Charm energy region, have been proven to enable competitive frontier research, due to its several unique features. With the progress of high energy physics in the last two decades, a new-generation Tau-Charm factory, Super Tau Charm Facility (STCF) has been actively promoting by the particle physics community in China. STCF holds great potential to address fundamental questions such as the essence of color confinement and the matter-antimatter asymmetry in the universe in the next decades. The main design goals of STCF are with a center-of-mass energy ranging from 2 to 7 GeV and a peak luminosity surpassing 5*10^34 cm^-2s^-1 that is optimized at a center-of-mass energy of 4 GeV, which is about 50 times that of the currently operating Tau-Charm factory - BEPCII. The STCF accelerator is composed of two main parts: a double-ring collider with the crab-waist collision scheme and an injector that provides top-up injections for both electron and positron beams. As a typical third-generation electron-positron circular collider, the STCF accelerator faces many challenges in both accelerator physics and technology. In this paper, the conceptual design of the STCF accelerator complex is presented, including the ongoing efforts and plans for technological R&D, as well as the required infrastructure. The STCF project aims to secure support from the Chinese central government for its construction during the 15th Five-Year Plan (2026-2030) in China.

physics.acc-ph↗

arXiv2025

Toward Multi-Functional LAWNs with ISAC: Opportunities, Challenges, and the Road Ahead

Integrated sensing and communication (ISAC) has been envisioned as a foundational technology for future low-altitude wireless networks (LAWNs), enabling real-time environmental perception and data exchange across aerial-ground systems. In this article, we first explore the roles of ISAC in LAWNs from both node-level and network-level perspectives. We highlight the performance gains achieved through hierarchical integration and cooperation, wherein key design trade-offs are demonstrated. Apart from physical-layer enhancements, emerging LAWN applications demand broader functionalities. To this end, we propose a multi-functional LAWN framework that extends ISAC with capabilities in control, computation, wireless power transfer, and large language model (LLM)-based intelligence. We further provide a representative case study to present the benefits of ISAC-enabled LAWNs and the promising research directions are finally outlined.

eess.SP↗

arXiv2025

ZPD-SCA: Unveiling the Blind Spots of LLMs in Assessing Students' Cognitive Abilities

Large language models (LLMs) have demonstrated potential in educational applications, yet their capacity to accurately assess the cognitive alignment of reading materials with students' developmental stages remains insufficiently explored. This gap is particularly critical given the foundational educational principle of the Zone of Proximal Development (ZPD), which emphasizes the need to match learning resources with Students' Cognitive Abilities (SCA). Despite the importance of this alignment, there is a notable absence of comprehensive studies investigating LLMs' ability to evaluate reading comprehension difficulty across different student age groups, especially in the context of Chinese language education. To fill this gap, we introduce ZPD-SCA, a novel benchmark specifically designed to assess stage-level Chinese reading comprehension difficulty. The benchmark is annotated by 60 Special Grade teachers, a group that represents the top 0.15% of all in-service teachers nationwide. Experimental results reveal that LLMs perform poorly in zero-shot learning scenarios, with Qwen-max and GLM even falling below the probability of random guessing. When provided with in-context examples, LLMs performance improves substantially, with some models achieving nearly double the accuracy of their zero-shot baselines. These results reveal that LLMs possess emerging abilities to assess reading difficulty, while also exposing limitations in their current training for educationally aligned judgment. Notably, even the best-performing models display systematic directional biases, suggesting difficulties in accurately aligning material difficulty with SCA. Furthermore, significant variations in model performance across different genres underscore the complexity of task. We envision that ZPD-SCA can provide a foundation for evaluating and improving LLMs in cognitively aligned educational applications.

cs.CL↗

arXiv2025

Advancing the Control of Low-Altitude Wireless Networks: Architecture, Design Principles, and Future Directions

This article introduces a control-oriented low-altitude wireless network (LAWN) that integrates near-ground communications and remote estimation of the internal system state. This integration supports reliable networked control in dynamic aerial-ground environments. First, we introduce the network's modular architecture and key performance metrics. Then, we discuss core design trade-offs across the control, communication, and estimation layers. A case study illustrates closed-loop coordination under wireless constraints. Finally, we outline future directions for scalable, resilient LAWN deployments in real-time and resource-constrained scenarios.

eess.SP↗