Search arXiv⌕ Search

arXiv subjects

Peng Sun

Publications and source records attributed to Peng Sun.

At least 55 records · Page 3Linked to original sources
arXiv2026

Lattice QCD study of the $K^*(892)$ resonance at the physical point

We present a lattice QCD study of the $K^*(892)$ resonance using eight $N_f=2+1$ Wilson-Clover ensembles with three lattice spacings and six pion masses ranging from 135 to 320 MeV. For each ensemble, a large number of finite volume energy levels in the $P$-wave $Kπ$ channel are determined. The energy dependence of the scattering phase shift is then obtained from Lüscher's finite-volume method. To systematically assess parametrization dependence, the amplitude is described using three different models, which yield consistent results. The resulting phase shifts show a clear resonant behavior for all ensembles, and the corresponding $K^*(892)$ resonance pole is identified on the second Riemann sheet in the complex energy plane. The pole positions are extrapolated to the physical pion mass and the continuum limit, yielding a $K^*(892)$ resonance located at $\sqrt{s_0} = [883(22)-i20(13)]\mathrm{MeV}$, which is in excellent agreement with the experimental value. This study provides a first-principles QCD determination of the $K^*(892)$ mass and width with controlled systematic uncertainties.

hep-lat↗
arXiv2026

Self-Adversarial One Step Generation via Condition Shifting

The push for efficient text to image synthesis has moved the field toward one step sampling, yet existing methods still face a three way tradeoff among fidelity, inference speed, and training efficiency. Approaches that rely on external discriminators can sharpen one step performance, but they often introduce training instability, high GPU memory overhead, and slow convergence, which complicates scaling and parameter efficient tuning. In contrast, regression based distillation and consistency objectives are easier to optimize, but they typically lose fine details when constrained to a single step. We present APEX, built on a key theoretical insight: adversarial correction signals can be extracted endogenously from a flow model through condition shifting. Using a transformation creates a shifted condition branch whose velocity field serves as an independent estimator of the model's current generation distribution, yielding a gradient that is provably GAN aligned, replacing the sample dependent discriminator terms that cause gradient vanishing. This discriminator free design is architecture preserving, making APEX a plug and play framework compatible with both full parameter and LoRA based tuning. Empirically, our 0.6B model surpasses FLUX-Schnell 12B (20$\times$ more parameters) in one step quality. With LoRA tuning on Qwen-Image 20B, APEX reaches a GenEval score of 0.89 at NFE=1 in 6 hours, surpassing the original 50-step teacher (0.87) and providing a 15.33$\times$ inference speedup. Code is available https://github.com/LINs-lab/APEX.

cs.CV↗
arXiv2026

Hybrid Quantum-Classical Branch-and-Price for Intra-Day Electric Vehicle Charging Scheduling via Partition Coloring

The rapid deployment of electric vehicles (EVs) in public parking facilities and fleet operations raises challenging intra-day charging scheduling problems under tight charger capacity and limited dwell times. We model this problem as a variant of the Partition Coloring Problem (PCP), where each vehicle defines a partition, its candidate charging intervals are vertices, and temporal and resource conflicts are represented as edges in a conflict graph. On this basis, we design a branch-and-price algorithm in which the restricted master problem selects feasible combinations of intervals, and the pricing subproblem is a maximum independent set problem. The latter is reformulated as a quadratic unconstrained binary optimization (QUBO) model and solved by quantum-annealing-inspired algorithms (QAIA) implemented in the MindQuantum framework, specifically the ballistic simulated branching (BSB) and simulated coherent Ising machine (SimCIM) methods, while the master problem is solved by Gurobi. Computational experiments on a family of synthetic EV charging instances show that the QAIA-enhanced algorithms match the pure Gurobi-based branch-and-price baseline on small and medium instances, and clearly outperform it on large and hard instances. In several cases where the baseline reaches the time limit with non-zero optimality gaps, the QAIA-based variants close the gap and prove optimality within the same time budget. These results indicate that integrating QAIA into classical decomposition schemes are a promising direction for large-scale EV charging scheduling and related PCP applications.

cs.CE↗
arXiv2026

Error Estimates of the Gain Approximation by Hermite-Galerkin Method in Feedback Particle Filter

The feedback particle filter (FPF) is a promising nonlinear filtering (NLF) method, but its practical implementation is hindered by the intractability of the gain function, which satisfies a boundary value problem (BVP). This paper proposes a novel two-step Hermite-Galerkin spectral method to address this challenge. First, the unknown density in the BVP is approximated by a kernel density estimator, whose error bounds are well-established in the literature. Second, rather than directly approximating the gain function, we approximate an auxiliary variable via the Galerkin spectral method using generalized Hermite functions. This auxiliary variable inherits the rapid decay property of the density at infinity, which aligns perfectly with the exponential decay characteristic of generalized Hermite functions, thereby obviating the need for artificial boundary conditions or domain truncation. Furthermore, we rigorously establish two fundamental error estimates: the kernel approximation error decays at the rate $O(N_p^{-\frac{s}{2s+1}})$, while the spectral approximation error converges at $O(M^{-s+1}\log M)$, providing complete theoretical guarantees for the method's accuracy. Comprehensive numerical experiments validate the theoretical results and demonstrate that the proposed method outperforms existing gain approximation schemes in both accuracy and computational efficiency.

math.NA↗
arXiv2026

State estimations and noise identifications with intermittent corrupted observations via Bayesian variational inference

This paper focuses on the state estimation problem in distributed sensor networks, where intermittent packet dropouts, corrupted observations, and unknown noise covariances coexist. To tackle this challenge, we formulate the joint estimation of system states, noise parameters, and network reliability as a Bayesian variational inference problem, and propose a novel variational Bayesian adaptive Kalman filter (VB-AKF) to approximate the joint posterior probability densities of the latent parameters. Unlike existing AKF that separately handle missing data and measurement outliers, the proposed VB-AKF adopts a dual-mask generative model with two independent Bernoulli random variables, explicitly characterizing both observable communication losses and latent data authenticity. Additionally, the VB-AKF integrates multiple concurrent multiple observations into the adaptive filtering framework, which significantly enhances statistical identifiability. Comprehensive numerical experiments verify the effectiveness and asymptotic optimality of the proposed method, showing that both parameter identification and state estimation asymptotically converge to the theoretical optimal lower bound with the increase in the number of sensors.

stat.ML↗
arXiv2026

Motion Semantics Guided Normalizing Flow for Privacy-Preserving Video Anomaly Detection

As embodied perception systems increasingly bridge digital and physical realms in interactive multimedia applications, the need for privacy-preserving approaches to understand human activities in physical environments has become paramount. Video anomaly detection is a critical task in such embodied multimedia systems for intelligent surveillance and forensic analysis. Skeleton-based approaches have emerged as a privacy-preserving alternative that processes physical world information through abstract human pose representations while discarding sensitive visual attributes such as identity and facial features. However, existing skeleton-based methods predominantly model continuous motion trajectories in a monolithic manner, failing to capture the hierarchical nature of human activities composed of discrete semantic primitives and fine-grained kinematic details, which leads to reduced discriminability when anomalies manifest at different abstraction levels. In this regard, we propose Motion Semantics Guided Normalizing Flow (MSG-Flow) that decomposes skeleton-based VAD into hierarchical motion semantics modeling. It employs vector quantized variational auto-encoder to discretize continuous motion into interpretable primitives, an autoregressive Transformer to model semantic-level temporal dependencies, and a conditional normalizing flow to capture detail-level pose variations. Extensive experiments on benchmarks (HR-ShanghaiTech & HR-UBnormal) demonstrate that MSG-Flow achieves state-of-the-art performance with 88.1% and 75.8% AUC respectively.

cs.CV↗
arXiv2026

Edge-Cloud Collaborative Computing on Distributed Intelligence and Model Optimization: A Survey

Edge-cloud collaborative computing (ECCC) has emerged as a pivotal paradigm for addressing the computational demands of modern intelligent applications, integrating cloud resources with edge devices to enable efficient, low-latency processing. Recent advancements in AI, particularly deep learning and large language models (LLMs), have dramatically enhanced the capabilities of these distributed systems, yet introduce significant challenges in model deployment and resource management. In this survey, we comprehensive examine the intersection of distributed intelligence and model optimization within edge-cloud environments, providing a structured tutorial on fundamental architectures, enabling technologies, and emerging applications. Additionally, we systematically analyze model optimization approaches, including compression, adaptation, and neural architecture search, alongside AI-driven resource management strategies that balance performance, energy efficiency, and latency requirements. We further explore critical aspects of privacy protection and security enhancement within ECCC systems and examines practical deployments through diverse applications, spanning autonomous driving, healthcare, and industrial automation. Performance analysis and benchmarking techniques are also thoroughly explored to establish evaluation standards for these complex systems. Furthermore, the review identifies critical research directions including LLMs deployment, 6G integration, neuromorphic computing, and quantum computing, offering a roadmap for addressing persistent challenges in heterogeneity management, real-time processing, and scalability. By bridging theoretical advancements and practical deployments, this survey offers researchers and practitioners a holistic perspective on leveraging AI to optimize distributed computing environments, fostering innovation in next-generation intelligent systems.

cs.DC↗
arXiv2026

Rethinking UMM Visual Generation: Masked Modeling for Efficient Image-Only Pre-training

Unified Multimodal Models (UMMs) are often constrained by the pre-training of their $\textbf{visual generation components}$, which typically relies on inefficient paradigms and scarce, high-quality text-image paired data. In this paper, we systematically analyze pre-training recipes for $\textbf{UMM visual generation}$ and identify these two issues as the major bottlenecks. To address them, we propose $\textbf{Image-Only Training for UMMs (IOMM)}$, a data-efficient two-stage training framework. The first stage pre-trains the visual generative component $\textbf{exclusively}$ using abundant unlabeled image-only data, thereby removing the dependency on paired data $\textbf{for this costly phase}$. The second stage fine-tunes the model using a mixture of unlabeled images and a small curated set of text-image pairs, leading to improved instruction alignment and generative quality. Extensive experiments show that IOMM not only improves training efficiency but also achieves state-of-the-art (SOTA) performance. For example, our IOMM-B (3.6B) model was trained from scratch using only $\sim \textbf{1050}$ H800 GPU hours (with the vast majority, $\textbf{1000}$ hours, dedicated to the efficient $\textbf{image-only pre-training stage}$). It achieves $\textbf{0.89}$ on GenEval and $\textbf{0.55}$ on WISE--surpassing strong baselines such as BAGEL-7B (0.82 & 0.55) and BLIP3-o-4B (0.84 & 0.50). Code is available $\href{https://github.com/LINs-lab/IOMM}{https://github.com/LINs-lab/IOMM}$.

cs.CV↗
arXiv2026

SFIBA: Spatial-based Full-target Invisible Backdoor Attacks

Multi-target backdoor attacks pose significant security threats to deep neural networks, as they can preset multiple target classes through a single backdoor injection. This allows attackers to control the model to misclassify poisoned samples with triggers into any desired target class during inference, exhibiting superior attack performance compared with conventional backdoor attacks. However, existing multi-target backdoor attacks fail to guarantee trigger specificity and stealthiness in black-box settings, resulting in two main issues. First, they are unable to simultaneously target all classes when only training data can be manipulated, limiting their effectiveness in realistic attack scenarios. Second, the triggers often lack visual imperceptibility, making poisoned samples easy to detect. To address these problems, we propose a Spatial-based Full-target Invisible Backdoor Attack, called SFIBA. It restricts triggers for different classes to specific local spatial regions and morphologies in the pixel space to ensure specificity, while employing a frequency-domain-based trigger injection method to guarantee stealthiness. Specifically, for injection of each trigger, we first apply fast fourier transform to obtain the amplitude spectrum of clean samples in local spatial regions. Then, we employ discrete wavelet transform to extract the features from the amplitude spectrum and use singular value decomposition to integrate the trigger. Subsequently, we selectively filter parts of the trigger in pixel space to implement trigger morphology constraints and adjust injection coefficients based on visual effects. We conduct experiments on multiple datasets and models. The results demonstrate that SFIBA can achieve excellent attack performance and stealthiness, while preserving the model's performance on benign samples, and can also bypass existing backdoor defenses.

cs.CR↗
arXiv2026

PromptTuner: SLO-Aware Elastic System for LLM Prompt Tuning

Prompt tuning has become a prominent strategy for enhancing the performance of Large Language Models (LLMs) on downstream tasks. Many IT enterprises now offer Prompt-Tuning-as-a-Service to fulfill the growing demand for prompt tuning LLMs on downstream tasks. Their primary objective is to satisfy users Service Level Objectives (SLOs) while reducing resource provisioning costs. Nevertheless, our characterization analysis for existing deep learning resource management systems reveals that they are insufficient to optimize these objectives for LLM prompt tuning workloads. In this paper, we introduce PromptTuner, an SLO-aware elastic system to optimize LLM prompt tuning. It contains two innovations. (1) We design a Prompt Bank to identify efficient initial prompts to expedite the convergence of prompt tuning. (2) We develop aWorkload Scheduler to enable fast resource allocation to reduce the SLO violation and resource costs. In our evaluation, PromptTuner reduces SLO violations by 4.0x and 7.9x, and lowers costs by 1.6x and 4.5x, compared to INFless and ElasticFlow respectively.

cs.DC↗
arXiv2026

Accurate B meson and Bottomonium masses and decay constants from the tadpole improved clover ensembles

We present a determination of the bottom quark mass, the masses of S-wave bottom mesons, and their decay constants using an anisotropic clover fermion discretization for the heavy quark, on $2+1$ flavor isotropic QCD ensembles. Our analysis is based on 16 ensembles spanning 6 lattice spacings, with pion masses in the range of 135-350 MeV and several values of the strange quark mass. We demonstrate that the effective anisotropy parameter for the heavy quark approaches unity with controllable $\mathcal{O}(a^2)$ corrections. A non-perturbative renormalization procedure is developed and validated through predictions of the bottom quark mass and decay constants. This framework enables calculations at the physical $b$-quark mass even on lattices with spacing $a \sim 0.1$ fm, where $m_b a \sim 2.5$, while keeping discretization errors in hadronic matrix elements at the $\sim 10$% level which can be eliminated properly through the continuum extrapolation. Using the physical $Υ$ mass as input, we obtain $m_b^{\overline{\mathrm{MS}}}(m_b) = 4.185(37)$ GeV and the full spectrum of S-wave bottom mesons with 0.1% uncertainty or less. Pseudoscalar and vector decay constants and their ratios for all kinds of S-wave bottom mesons are also provided.

hep-lat↗
arXiv2026

Precision determination of nucleon iso-vector scalar and tensor charges at the physical point

We report a high precision calculation of the isospin vector charge $g_{S,T}$ of the nucleon using recently proposed ``blending" method which provides a high-precision stochastic estimate of the all-to-all fermion propagator. Through multiplying the current operator by the traditional nucleon interpolator, we create a new operator that captures the major excited state contaminations. The linear combination of this new operator and traditional nucleon interpolator reduces these excited states and improves the robustness of the multi-state fit. Using 15 $N_f=2+1$ lattice ensembles which cover 5 lattice spacing, 5 combinations with the same quark masses and lattice spacing but multiple volumes, including three at the physical pion mass, we report so far most precise lattice QCD prediction $g_T^{\rm QCD} = 1.0264[77]_{\rm tot}(53)_{\rm stat} (13)_{a} (46)_{\rm FV} (01)_χ(28)_{\rm ex} (04)_{\rm re}$ and $g_S^{\rm QCD} = 1.106[43]_{\rm tot}(31)_{\rm stat} (03)_{a} (28)_{\rm FV} (01)_χ(08)_{\rm ex} (08)_{\rm re}$ at $\overline{\mathrm{MS}}$ 2~GeV, with the systematic uncertainties from continuum, infinite volume, chiral extrapolations, excited state contamination and also renormalization.

hep-lat↗
arXiv2026

Plug, Play, and Fortify: A Low-Cost Module for Robust Multimodal Image Understanding Models

Missing modalities present a fundamental challenge in multimodal models, often causing catastrophic performance degradation. Our observations suggest that this fragility stems from an imbalanced learning process, where the model develops an implicit preference for certain modalities, leading to the under-optimization of others. We propose a simple yet efficient method to address this challenge. The central insight of our work is that the dominance relationship between modalities can be effectively discerned and quantified in the frequency domain. To leverage this principle, we first introduce a Frequency Ratio Metric (FRM) to quantify modality preference by analyzing features in the frequency domain. Guided by FRM, we then propose a Multimodal Weight Allocation Module, a plug-and-play component that dynamically re-balances the contribution of each branch during training, promoting a more holistic learning paradigm. Extensive experiments demonstrate that MWAM can be seamlessly integrated into diverse architectural backbones, such as those based on CNNs and ViTs. Furthermore, MWAM delivers consistent performance gains across a wide range of tasks and modality combinations. This advancement extends beyond merely optimizing the performance of the base model; it also manifests as further performance improvements to state-of-the-art methods addressing the missing modality problem.

cs.CV↗
arXiv2026

Fast and Scalable Analytical Diffusion

Analytical diffusion models offer a mathematically transparent path to generative modeling by formulating the denoising score as an empirical-Bayes posterior mean. However, this interpretability comes at a prohibitive cost: the standard formulation necessitates a full-dataset scan at every timestep, scaling linearly with dataset size. In this work, we present the first systematic study addressing this scalability bottleneck. We challenge the prevailing assumption that the entire training data is necessary, uncovering the phenomenon of Posterior Progressive Concentration: the effective golden support of the denoising score is not static but shrinks asymptotically from the global manifold to a local neighborhood as the signal-to-noise ratio increases. Capitalizing on this, we propose Dynamic Time-Aware Golden Subset Diffusion (GoldDiff), a training-free framework that decouples inference complexity from dataset size. Instead of static retrieval, GoldDiff uses a coarse-to-fine mechanism to dynamically pinpoint the ''Golden Subset'' for inference. Theoretically, we derive rigorous bounds guaranteeing that our sparse approximation converges to the exact score. Empirically, GoldDiff achieves a $\bf 71 \times$ speedup on AFHQ while matching or achieving even better performance than full-scan baselines. Most notably, we demonstrate the first successful scaling of analytical diffusion to ImageNet-1K, unlocking a scalable, training-free paradigm for large-scale generative modeling.

cs.LG↗
arXiv2026

Duality Models: An Embarrassingly Simple One-step Generation Paradigm

Consistency-based generative models like Shortcut and MeanFlow achieve impressive results via a target-aware design for solving the Probability Flow ODE (PF-ODE). Typically, such methods introduce a target time $r$ alongside the current time $t$ to modulate outputs between a local multi-step derivative ($r = t$) and a global few-step integral ($r = 0$). However, the conventional "one input, one output" paradigm enforces a partition of the training budget, often allocating a significant portion (e.g., 75% in MeanFlow) solely to the multi-step objective for stability. This separation forces a trade-off: allocating sufficient samples to the multi-step objective leaves the few-step generation undertrained, which harms convergence and limits scalability. To this end, we propose Duality Models (DuMo) via a "one input, dual output" paradigm. Using a shared backbone with dual heads, DuMo simultaneously predicts velocity $v_t$ and flow-map $u_t$ from a single input $x_t$. This applies geometric constraints from the multi-step objective to every sample, bounding the few-step estimation without separating training objectives, thereby significantly improving stability and efficiency. On ImageNet 256 $\times$ 256, a 679M Diffusion Transformer with SD-VAE achieves a state-of-the-art (SOTA) FID of 1.79 in just 2 steps. Code is available at: https://github.com/LINs-lab/DuMo

cs.LG↗
arXiv2026

CONCUR: High-Throughput Agentic Batch Inference of LLM via Congestion-Based Concurrency Control

Batch inference for agentic workloads stresses the GPU key-value (KV) cache in a sustained and cumulative manner, often causing severe throughput degradation well before memory capacity is exhausted. We identify this phenomenon as middle-phase thrashing, a previously under-characterized pathology in which cache efficiency collapses as long-lived agents accumulate state over time. We argue that mitigating this pathology requires moving beyond reactive, request-level cache management to proactive, agent-level admission control. Drawing inspiration from congestion control in distributed systems, we view the KV cache as a shared resource whose efficient utilization depends on feedback-driven regulation. Based on this insight, we present CONCUR, a lightweight control layer that regulates agent admission to bound aggregate cache pressure while preserving execution continuity. CONCUR adapts a cache-aware control algorithm to dynamically adjust the number of active agents using runtime cache signals. Across large models and real-world agent workloads, CONCUR prevents middle-phase thrashing and improves batch inference throughput by up to 4.09x on Qwen3-32B and 1.9x on DeepSeek-V3, while remaining compatible with existing LLM serving systems.

cs.DC↗
arXiv2026

TwinFlow: Realizing One-step Generation on Large Models with Self-adversarial Flows

Recent advances in large multi-modal generative models have demonstrated impressive capabilities in multi-modal generation, including image and video generation. These models are typically built upon multi-step frameworks like diffusion and flow matching, which inherently limits their inference efficiency (requiring 40-100 Number of Function Evaluations (NFEs)). While various few-step methods aim to accelerate the inference, existing solutions have clear limitations. Prominent distillation-based methods, such as progressive and consistency distillation, either require an iterative distillation procedure or show significant degradation at very few steps (< 4-NFE). Meanwhile, integrating adversarial training into distillation (e.g., DMD/DMD2 and SANA-Sprint) to enhance performance introduces training instability, added complexity, and high GPU memory overhead due to the auxiliary trained models. To this end, we propose TwinFlow, a simple yet effective framework for training 1-step generative models that bypasses the need of fixed pretrained teacher models and avoids standard adversarial networks during training, making it ideal for building large-scale, efficient models. On text-to-image tasks, our method achieves a GenEval score of 0.83 in 1-NFE, outperforming strong baselines like SANA-Sprint (a GAN loss-based framework) and RCGM (a consistency-based framework). Notably, we demonstrate the scalability of TwinFlow by full-parameter training on Qwen-Image-20B and transform it into an efficient few-step generator. With just 1-NFE, our approach matches the performance of the original 100-NFE model on both the GenEval and DPG-Bench benchmarks, reducing computational cost by $100\times$ with minor quality degradation. Project page is available at https://zhenglin-cheng.com/twinflow.

cs.CV↗
arXiv2026

Total Gluon Helicity Contribution to the Proton Spin from Lattice QCD

We report a state-of-the-art lattice QCD calculation of the total gluon helicity contribution to the proton spin, $ΔG$. The calculation is done on ensembles with three different lattice spacings $a=\{0.08, 0.09, 0.11\}$ fm. By employing distillation and momentum smearing for proton external states, we extract the bare matrix elements of the topological current $K^μ$ using 5-HYP smeared Coulomb gauge fixing configurations. Furthermore, we apply a non-perturbative $\mathrm{RI/MOM}$ renormalization scheme augmented by the Cluster Decomposition Error Reduction (CDER) technique to determine the renormalization constants of $K^μ$. The results obtained from different components $K^{t,i}$ (with $i$ being the direction of proton momentum or polarization) are consistent with Lorentz covariance within uncertainties. After extrapolating to the continuum limit, $ΔG$ is found to be $ΔG = 0.231(17)^{\mathrm{sta.}}(44)^{\mathrm{sym.}}$ at the $\overline{\mathrm{MS}}$ scale $μ^2=10\ \mathrm{GeV}^2$, which constitutes approximately $46(9)\%$ of the proton spin.

hep-lat↗