arXiv subjects

Jun Chen

Publications and source records attributed to Jun Chen.

At least 37 records · Page 2Linked to original sources

arXiv2026

StepAudio 3 Gen Technical Report

We introduce StepAudio 3 Gen, a general-purpose audio generation model that supports zero-shot text-to-speech (TTS), voice design, vocal generation, sound effects, music, vibe speech, and mixtures of multiple audio types within a unified framework. At its core, StepAudio 3 Gen is a discrete autoregressive generator that models audio directly over residual vector quantization (RVQ) tokens, departing from the diffusion Transformer-based continuous generation paradigm prevalent in recent general audio models. Its StepAudio Tokenizer represents general audio at 12.5 Hz in a shared $16 \times 2048$ residual code space, jointly quantizing semantic and waveform-level acoustic features so that each code layer preserves both types of information. For generation, the backbone predicts the first codebook along the time axis using autoregressive modeling, while a lightweight causal Transformer completes the remaining fifteen codebooks along the codebook axis. Our study further identifies three key design principles: (1) interference-aware progressive pretraining for acquiring audio capabilities while preserving the textual abilities of the large language model, (2) RVQ Adaptor for effectively incorporating multi-codebook acoustic representations, and (3) discrete autoregressive modeling over a shared representation across general audio domains. With progressive pretraining, multi-task instruction training, and supervised fine-tuning, StepAudio 3 Gen achieves state-of-the-art performance on both TTS and voice design, while retaining strong generation capabilities across speech, vocals, sound effects, and music. Audio samples are available at https://stepaudiollm.github.io/step-audio-3-gen/.

cs.SD↗

arXiv2026

ChatPlanner: A Large Language Model Framework for Personalized Public Transit Routing

Personalized public transit routing in public transit systems remains challenging due to the difficulty of capturing and integrating diverse user preferences into routing algorithms. This paper presents ChatPlanner, a novel framework that leverages Large Language Models (LLMs) to enable preference-aware public transit routing. Our approach employs fine-tuned LLMs with Retrieval-Augmented Generation (RAG) to extract routing parameters and interpret conversationally expressed preferences from natural language queries as preference scores, subsequently integrating these preferences into the objective function of a public transit routing algorithm. This study designs preference-aware datasets incorporating eight personas and five contexts to establish scoring standards for both fine-tuning and RAG. This work conducted four experiments to validate the solutions' feasibility, extraction of routing information and preferences, solution set quality and completeness, and latency and computational tractability. Results demonstrate that ChatPlanner generates feasible solutions reliably. Fine-tuning enforces the required output structure and learns general preference patterns, while RAG provides query-specific context to resolve imprecise or conversational expressions and calibrate continuous scores. The combination of both achieves the highest accuracy in routing information extraction and rubric-consistent user preference interpretation. Results based on selected case studies show that by capturing user conversationally expressed preferences, ChatPlanner identifies preference-relevant solutions across different dimensions that existing route planners overlook, generating more route alternatives. The latency evaluation confirms that the framework is computationally tractable. This research establishes a new paradigm for integrating natural language understanding into transportation optimization.

cs.AI↗

arXiv2026

Bi-HYCO: Bi-Objective Cooperative Learning for PDE Parameter Identification under Fragmented Observations

Physical and synthetic models may describe complementary aspects of the same PDE-governed system while receiving different, possibly fragmented, observations. We propose Bi-Objective HYCO (Bi-HYCO), a cooperative framework that retains both representations and their local observational objectives while coupling their predicted states at unlabeled interaction points. These points contain no measurements and do not augment the data; they provide a communication mechanism in the common state space. The two criteria form a vector-valued objective, and weighted scalarizations provide computational realizations. For the deterministic shared-observation algorithm with fixed interaction points, we prove sufficient decrease and finite length of the whole alternating sequence, which converges to a mixed critical point under the stated Kurdyka-Lojasiewicz-type assumptions. Elliptic transmission and two-dimensional Navier-Stokes experiments assess parameter and state reconstruction, noise and scalarization effects, and PINN/XPINN references. Ablations show that removing state interaction while retaining aggregation deteriorates parameter recovery in the tested configurations, particularly for Navier-Stokes.

cs.LG↗

arXiv2026

EvoGS: Modeling Deformation Evolution for Dynamic Gaussian Splatting

Recent extensions of 3D Gaussian Splatting (3DGS) enable real-time novel view synthesis in dynamic scenes by learning time-conditioned Gaussian deformations. However, existing MLP-based methods typically estimate deformations independently at each timestamp, making them less robust to large or abrupt motions. To address this issue, we propose \textbf{EvoGS}, a 3DGS-based dynamic reconstruction framework that models Gaussian deformation as a temporal evolution process. EvoGS maintains persistent deformation states for each Gaussian, extrapolates future states from historical deformation states, and corrects the predictions with MLP-derived observations. The correction is adaptively weighted using a temporal residual memory and evolution statistics such as deformation velocity and trajectory deviation. To further improve reconstruction quality, EvoGS introduces deformation-aware densification. Clone and split operations are performed along corrected deformation directions, while an uncertainty-aware strategy suppresses densification for Gaussians with unstable deformation histories. Experiments show that EvoGS improves dynamic novel view synthesis quality and achieves competitive performance across benchmarks.

cs.CV↗

arXiv2026

GTA-RAG: Graph-Trajectory-Augmented Reinforcement Learning for Multi-Turn Retrieval-Augmented Reasoning

Retrieval-augmented generation (RAG) enables LLMs to access external knowledge for answering knowledge-intensive questions. For complex multi-hop questions, multi-turn retrieval-augmented reasoning extends RAG into an iterative process that repeatedly searches for and integrates evidence across documents. However, existing reinforcement-learning (RL) approaches for agentic RAG are typically optimized with final-answer rewards, which provide sparse supervision and overlook whether the model actually retrieves the required evidence chain. We present \textsc{GTA-RAG}, a graph-trajectory-augmented RL framework for multi-turn retrieval-augmented reasoning. From an entity--document graph, we sample connected document paths, synthesize multi-hop QA trajectories, and validate them with the deployed retriever to obtain executable trajectory-level supervision. We then optimize the retrieval policy with Group Relative Policy Optimization (GRPO) and a trajectory-guided reward that encourages both accurate answers and acquisition of target evidence documents, followed by answer-reward training on natural QA instances. Experiments on three multi-hop and two simple QA benchmarks show that \method{} consistently outperforms RL-based RAG baselines with both Qwen2.5-3B and Qwen2.5-7B backbones, while substantially improving evidence-chain coverage. Our code is available at https://github.com/cjcj46262/GTA-RAG.

cs.CL↗

arXiv2026

Imaging and characterization of spontaneous vortices in a proximity-induced superconductor

Observation of spontaneous symmetry breaking is crucial for understanding continuous second-order phase transitions from disordered to ordered states, which often leads to the formation of topological defects. In superconductors, such topological defects manifest as quantized vortices. However, the formation and observation of spontaneous vortices in a uniform superconductor are challenging because extremely rapid cooling (>108 K/s) is generally required for that purpose. Here we conducted scanning superconducting quantum interference device microscope (SSM) measurements on an MgB2-based proximity-induced superconductor, an intrinsically inhomogeneous system. In this system, individual superconducting domains will reach internal equilibrium independently during cooling and choose their own phase before the global phase coherence is established via the long-range proximity coupling. The SSM measurements demonstrate that vortices are nucleated spontaneously even at a relatively slow cooling rate (~0.2 K/s). We also find that the vortices with different polarities, sizes, and shapes appear stochastically under near-zero-field conditions. The geometry of the spontaneous vortices is more extended than that of the field-induced Abrikosov vortices. Magnetic field profile analysis based on the London model elucidates that penetration depths of the extended vortices are anomalously large, exceeding several micrometers. This unusual morphology of the spontaneous vortices most likely imprints the information that is frozen at the moment of vortex formation. Our findings not only provide insights into the local phase differences present in the early stage of the phase transition in this proximity-induced superconducting system, but they also shed insights into the structure, formation, and stabilization of topological defects in highly disordered and inhomogeneous superconducting systems.

cond-mat.supr-con↗

arXiv2026

MDCPP: Multi-Robot Dynamic Coverage Path Planning for Workload Adaptation

Multi-robot coverage path planning commonly balances geometric area or path length under a constantspeed assumption. This assumption is inadequate when sensing or interaction tasks cause spatially varying traversal speeds, because equal areas can induce markedly different completion times. We propose Multi-Robot Dynamic Coverage Path Planning (MDCPP), which learns a Gaussian-mixture workload field from partial observations, predicts cell-wise service times, and repeatedly repartitions the uncovered cells through a distributed capacity-constrained assignment. We establish finite termination and pairwise local optimality of each synchronized assignment round, bound the service-time makespan degradation due to estimation error, and state sufficient conditions for complete coverage. A 600-run benchmark against sweeping, LS-MCPP, reactive reassignment, and an oracle shows that prediction is most valuable under strong heterogeneity and improves aggregate paired makespan over the nonpredictive alternatives. A three-UGV experiment further validates route execution and spatial speed adaptation under localization, drivetrain, and wireless-control effects.

cs.RO↗

arXiv2026

Deformations and homotopy theory of Rota-Baxter Lie algebras

For Rota-Baxter Lie algebras, a homotopy cooperad is exhibited, whose cobar construction is shown to be the minimal model of the operad of Rota-Baxter Lie algebras by using algebraic Morse theory. The deformation complex of Rota-Baxter Lie algebras as well as the $L_\infty$-algebra structure on this complex are deduced from the minimal model and the notion of homotopy Rota-Baxter Lie algebras is given as a consequence.

math.KT↗

arXiv2026

Heavy quark collisional energy loss in a nonextensive quark-gluon plasma

In this study, we derive the longitudinal and transverse gluon self-energies and the corresponding dielectric functions for a nonextensive QGP, based on nonextensive statistical mechanics and a kinetic theory framework. The nonextensive parameter $q$ enters these quantities primarily through the modification of the Debye mass. Utilizing the derived dielectric functions, we then calculate the collisional energy loss for a heavy quark using two established formalisms: the plasma physics-based Thoma-Gyulassy formula and the thermal field theory-originated Kirzhnits-Thoma formula. Our results show that for both formalisms, the collisional energy loss increases with the nonextensive parameter $q$ with this enhancement being more significant at higher incident quark momenta and suppressed for a heavier quark mass. The energy loss predicted from the Kirzhnits-Thoma formula is substantially larger than that from the Thoma-Gyulassy formula, and the nonextensive effect on the energy loss is more pronounced in the former. Furthermore, the mass suppression of the nonextensive effect on the energy loss is weaker in the Kirzhnits-Thoma approach. These calculations demonstrate that nonextensive statistics can significantly alter the energy loss in the QGP.

hep-ph↗

arXiv2026

Kimi K2.5: Visual Agentic Intelligence

We introduce Kimi K2.5, an open-source multimodal agentic model designed to advance general agentic intelligence. K2.5 emphasizes the joint optimization of text and vision so that two modalities enhance each other. This includes a series of techniques such as joint text-vision pre-training, zero-vision SFT, and joint text-vision reinforcement learning. Building on this multimodal foundation, K2.5 introduces Agent Swarm, a self-directed parallel agent orchestration framework that dynamically decomposes complex tasks into heterogeneous sub-problems and executes them concurrently. Extensive evaluations show that Kimi K2.5 achieves state-of-the-art results across various domains including coding, vision, reasoning, and agentic tasks. Agent Swarm also reduces latency by up to $4.5\times$ over single-agent baselines. We release the post-trained Kimi K2.5 model checkpoint to facilitate future research and real-world applications of agentic intelligence.

cs.CL↗

arXiv2026

Kimi K3: Open Frontier Intelligence

We introduce Kimi K3, a 2.8T parameter Mixture-of-Experts model with 104 billion activated parameters, native vision capabilities, and a 1-million-token context window. Kimi K3 is built on Kimi Delta Attention and Attention Residuals, which improve information flow across sequence length and model depth. Together with Stable LatentMoE, which effectively activates 16 of 896 routed experts per token, and refined training and data recipes, these advances yield an approximately 2.5x improvement in overall scaling efficiency over Kimi K2. Post-training highlights reinforcement learning across general, agentic, and coding domains and multiple reasoning-effort levels, enabling compositional generalization and robust long-horizon execution. At 2.8T scale, Kimi K3 is supported by infrastructure advances in multiple areas: algorithm-system co-design for KDA, perfectly balanced expert-parallel training with efficient memory management, million-token agentic RL with persistent rollout and sandbox states, and deployment innovations. Extensive evaluations show that Kimi K3 achieves frontier-level performance across long-horizon coding, agentic, knowledge, reasoning, and vision tasks. While its overall performance still trails the most powerful proprietary models, namely Claude Fable 5 and GPT-5.6 Sol, Kimi K3 consistently outperforms other open and proprietary models evaluated in our suite. We release the full Kimi K3 model weights to facilitate future research and accelerate the broader deployment and adoption of frontier intelligence.

cs.CL↗

arXiv2026

Diff-Symbo: Text-Controlled Long-Duration Symbolic Music Generation Using Autoregressive Latent Diffusion Model

Text-controlled symbolic music generation has recently gained research attention due to its versatile, flexible and straightforward approach to music composition. However, previous approaches tend to generate symbolic music with compromising quality, diversity, controllability and limited duration. In this paper, we present Diff-Symbo, an innovative method that uses latent diffusion model (LDM) to generate high-quality, diverse and long-duration symbolic music. To address the lack of text-symbolic music dataset, we develop a comprehensive dataset with 19,345 text templates by employing large language model. Furthermore, we design a music information encoder to reduce the training overhead while extracting more effective control representations. Given textual descriptions, our proposed method leverages LDM to improve the quality and diversity of music generation. Our method also improves the duration and the compositional consistency of music generation through an autoregressive approach. Experimental results show significant improvements of Diff-Symbo in text controllability, duration, and the quality of generated music compared to the baseline models such as GPT-4, MuseCoco and Multitrack Music Transformer (MMT). As one of the pioneer models in this field, Diff-Symbo paves the way towards controllable and high-quality symbolic music composition based on LDM, offering valuable contributions to both music amateurs and practitioners.

cs.SD↗

arXiv2026

TurnFSM for Full-Duplex Dialogue System: Internalizing State-Machine Logic for Streaming Semantic Voice Activity Detection and Utterance-Level Rejection

Full-duplex voice assistants must continuously listen while speaking, handling user interruptions under low-latency and resource-constrained streaming conditions. Existing end-to-end full-duplex models can compromise reasoning-related capabilities after speech-domain adaptation, whereas cascaded pipelines introduce extra inference overhead and handcrafted control logic. We propose TurnFSM, an LLM-based state prediction framework that internalizes turn control as explicit finite-state transitions, unifying streaming semantic VAD and utterance-level rejection. TurnFSM decomposes submission and rejection into a serial decision process, reducing multi-task interference while maintaining performance comparable to single-task models. We further introduce a first-order state transition mechanism that enforces the dependency on only the previous state during training, enabling compact inference with the standard causal mask and original LLM positional encoding while avoiding historical state-token accumulation and unnecessary step-by-step state generation. Experimental results show that TurnFSM consistently outperforms the binary-head baseline and remains competitive with task-specific models.

eess.AS↗

arXiv2026

Mutate to Bypass: Autonomous Endpoint Evasion via Knowledge-Driven Multi-Agent Orchestration

Public reports and open-source resources expose many EDR evasion techniques, but it remains unclear whether commercial Endpoint Detection and Response (EDR) systems can withstand these documented attacks. Evaluating them requires turning fragmented security knowledge into working payloads and refining those payloads from opaque alerts, tasks that existing automation does not address. We present AutoBypass, a knowledge-grounded, closed-loop multi-agent framework for automated EDR resilience assessment. A Detection-Aware Knowledge Base structures threat intelligence, expert analyses, and open-source proofs of concept into evasion techniques and operational constraints. Agents use this knowledge to plan attacks, generate polymorphic code, and compile binaries, while a telemetry-driven reasoning engine diagnoses failures and feeds corrective evidence back into the strategy. Across seven commercial endpoint security platforms, AutoBypass bypassed every target, reaching 90% evasion against Windows Defender and 86.7% against Trend Micro AV. Ablations show that the knowledge base raises the success rates of 8B open-weight models from 27--53% to 43--83%, bringing them close to large proprietary models. These results demonstrate a systematic way to operationalize public security knowledge for continuous, automated assessment of EDR resilience.

cs.CR↗

arXiv2026

Rethinking IRSTD: Single-Point Supervision Guided Encoder-only Framework is Enough for Infrared Small Target Detection

Infrared small target detection (IRSTD) aims to separate small targets from clutter backgrounds. Extensive research is dedicated to the pixel-level supervision-guided "encoder-decoder" segmentation paradigm. Although having achieved promising performance, they neglect the fact that small targets only occupy a few pixels and are usually accompanied with blurred boundary caused by clutter backgrounds. Based on this observation, we argue that the first principle of IRSTD should be target localization instead of separating all target region accompanied with indistinguishable background noise. In this paper, we reformulate IRSTD as a centroid regression task and propose a novel Single-Point Supervision guided Infrared Probabilistic Response Encoding method (namely, SPIRE), which is indeed challenging due to the mismatch between reduced supervision network and equivalent output. Specifically, we first design a Point-Response Prior Supervision (PRPS), which transforms single-point annotations into probabilistic response map consistent with infrared point-target response characteristics, with a High-Resolution Probabilistic Encoder (HRPE) that enables encoder-only, end-to-end regression without decoder reconstruction. By preserving high-resolution features and increasing effective supervision density, SPIRE alleviates optimization instability under sparse target distributions. Finally, extensive experiments on various IRSTD benchmarks, including SIRST-UAVB and SIRST4 demonstrate that SPIRE achieves competitive target-level detection performance with consistently low false alarm rate (Fa) and significantly reduced computational cost. Code is publicly available at: https://github.com/NIRIXIANG/SPIRE-IRSTD.

cs.CV↗

arXiv2026

ParaASR: Multi-Token Prediction for Fast and Long-Context LLM-Based Speech Recognition

Audio-encoder-LLM-decoder architectures have become the dominant paradigm for modern automatic speech recognition (ASR), improving transcription quality through large-scale language modeling. However, the cost of autoregressive decoding scales with decoder size, creating a fundamental trade-off between recognition quality and serving latency. We argue this trade-off is not inherent: unlike open-ended text generation, ASR outputs are strongly anchored to the input speech signal, providing a natural inductive bias toward high-parallelism decoding. Building on this, we introduce ParaASR, an ASR system that leverages Multi-Token Prediction (MTP) to let a 4B LLM decoder emit multiple tokens per forward step. Starting from a publicly available audio-language foundation, the model first establishes a robust autoregressive recognizer and then aligns five future-token branches through a staged optimization recipe. At inference, it proposes a six-token continuation per step and admits only the verified prefix into the transcript, preserving the safety of standard autoregressive decoding. The average accepted length reaches 5.0 out of 6 proposed tokens, confirming that the deterministic structure of speech makes ASR an especially natural setting for multi-token decoding. ParaASR further retains a native 32K-context window and transcribes up to 30 minutes of audio in a single pass. Across diverse benchmarks, it attains average error rates of 2.97%, 3.68%, and 3.70% on Chinese, English, and long-form evaluations, respectively, while reaching a real-time factor (RTF) as low as 0.0053. These results show that decoder scaling, low-latency inference, and long-context transcription need not be competing goals when future-token proposals are anchored by the acoustic signal and guarded by autoregressive verification.

cs.SD↗

arXiv2026

On The Most Discriminative Boolean Functions for Correlated Sources

Motivated by a conjecture of Amari and Kobayashi, we study the problem of identifying pairs of Boolean functions that maximize the Kullback-Leibler divergence between two distributions obtained by separately compressing two correlated sources. When the reference distribution corresponds to independent sources, this problem reduces to the problem of maximizing mutual information, for which the optimality of dictator functions has been proved by Pichler, Piantanida, and Matz. For the problem of maximizing Fisher information, which can be viewed as a local version of the problem studied in this paper, Amari and Kobayashi conjectured that parity functions are optimal. For unbiased pairs of Boolean functions, and for identical pairs in the nonnegative correlation regime, we prove that both the divergence and the Fisher information are maximized by level-$k$ functions, namely, functions whose Fourier coefficients are supported only on level $k$. Since level-$k$ functions include parity functions, this gives a partial resolution of the conjecture of Amari and Kobayashi. Furthermore, in the framework of Bayesian distributed one-bit hypothesis testing, we prove that level-$k$ functions are optimal among all pairs of functions. Finally, we also discuss the one function version of the problem studied in this paper, which can be regarded as the divergence analogue of the Courtade and Kumar conjecture.

cs.IT↗

arXiv2026

Dynamics modeling and analysis of batoid-type locomotion powered by tensegrity wing structure

Control signals and kinematics in batoid swimming are difficult to measure experimentally, making body-fluid interaction models essential for studying their underlying locomotion principles. To address this challenge, we developed a body-fluid interaction model of batoid-type swimming that is appropriate for both neural control study and engineering design. The body trunk is modeled as a rigid body with six degrees of freedom. The flexible pectoral fins attached to the trunk are modeled by a tensegrity structure consisting of rigid struts and elastic cables that resembles a biological musculoskeletal system. The fin is actuated by changing the tension of elastic cables distributed across the fin surface, enabling controllable and realistic deformation. Utilizing an analytical fluid force model, the body-fluid interaction model is exercised through simulation examples that respectively investigate the speed difference between tension actuation and fin kinematic waves, the effects of fin stiffness and resonance exploitation on swimming performance, and the different fin kinematics resulting from different body inertial motions.

physics.bio-ph↗