Searcharxiv⌕ Search

arXiv subjects

Peng Gao

Publications and source records attributed to Peng Gao.

At least 37 records · Page 2Linked to original sources

Ratios conjecture of quadratic Hecke $L$-functions of prime-related moduli

Using the method of multiple Dirichlet series, we develop L-functions ratios conjecture with one shift in both the numerator and denominator in certain ranges for quadratic families of Dirichlet and Hecke L-functions of primerelated moduli of imaginary quadratic number fields of class number one under the generalized Riemann hypothesis. As corollaries, we evaluate asymptotically the first moment of central values as well as the one-level density of the families of L-functions under consideration.

math.NT↗

BEACON: Behavior-Anchored Cross-Source Knowledge Graph Construction for Cyber Threat Intelligence

Cyber threat intelligence (CTI) is foundational to modern cyber defense, yet much of it resides in unstructured reports whose volume and heterogeneity far exceed manual analysis, motivating research on automatically constructing knowledge graphs from CTI reports. However, existing approaches mainly extract partial information within a single report, leaving the cross-source setting unexplored, where the same threat is given unrelated names. Our key insight is that attack behaviors, once mapped to MITRE ATT&CK (a standardized catalog of attack techniques), can anchor the rest of a report. Attack behaviors are the adversarial actions a report describes, while contextual entities (e.g., threat actors, campaigns, and affected products) and Indicators of Compromise (IoCs; e.g., IP addresses) are their participants and traces. Attaching them to these anchors places every per-report graph in one canonical space. We realize this insight in BEACON, an LLM-driven framework for cross-source CTI knowledge graph construction. Its first stage extracts each report into a graph under a propose-then-verify paradigm, grounding candidates in report evidence and official ATT&CK definitions, to suppress LLM misclassification and hallucination. Its second stage merges these graphs with a hierarchical alignment strategy that applies signals in decreasing order of determinism, from character-level and semantic similarity to overlapping technique neighborhoods, iterating as merges pool neighborhoods. No existing benchmark links entities to technique anchors or provides cross-source alignment ground truth. We therefore construct and release two human-annotated datasets from 34 sources: to our knowledge the largest for report-level CTI extraction (8,395 elements) and the first for cross-source consolidation (3,487). On them, BEACON outperforms all baselines by at least 23% and 9%, respectively.

cs.CR↗

AgentFlow: A Flow-Centric Policy Language and Framework for Securing LLM Agent Systems

LLM agents increasingly read untrusted content, invoke external tools, access private data, and delegate work to other agents. Harm often arises not from a single unsafe action but from the flow of sensitive data across a sequence of otherwise plausible steps. We present AgentFlow, a flow-centric policy language and runtime enforcement model for specifying where data may travel in agent systems. Policies are defined over labeled runtime edges and constrain which tools may receive sensitive fields, which sinks may receive released data, and what authority may cross delegation boundaries. The language supports flow and path rules, task-scoped capabilities, controlled release, and stateful taint semantics. A runtime reference monitor mediates agent actions, and a bounded SMT-based verifier checks safety properties for a structured policy fragment. We evaluate AgentFlow on multiple agent benchmarks. In our prototype, seven safety properties verify in under 0.5 seconds each, and the verifier catches all seeded unsafe policy variants in our study. On 949 AgentDojo injected cases across four suites, AgentFlow reduces confirmed compromise from 33.0\% to 0.0\% while improving aggregate utility from 46.7\% to 63.3\%. On a 200-case AgentDyn Dailylife benchmark, it reduces confirmed compromise from 73.5\% to 0.0\% while preserving near-baseline utility (44.5\% to 43.5\%). Breadth checks across ASB, InjecAgent, BIPIA, AgentHarm, and MCPTox replays suggest that the configured policies block the benchmark-specified policy-visible attacker flows; in ASB's direct-prompt-injection harness, attack success is 0/1{,}200. These results are preliminary and scoped to the modeled policy-visible agent behaviors and evaluated benchmarks.

cs.CR↗

An Empirical Study of Training Pixel-Space Text-to-Image Diffusion Models

This paper investigates an increasingly important topic in generative modeling: pixel-space diffusion models. Although numerous studies have explored this topic, most focus on small-scale or class-conditional settings. Consequently, a practical recipe for training pixel-space models that rival or exceed well-established latent-space counterparts remains elusive. Through a comprehensive empirical study, we first observe that direct large-scale pre-training in pixel space converges substantially more slowly than in latent space. This observation motivates a latent-to-pixel strategy that acquires generative priors efficiently in latent space and transitions to pixel space during post-training. We then systematically investigate the key design choices governing this transition, including weight initialization, data composition, prediction target, decoder architecture, and noise schedule, and identify a practical recipe that makes the resulting pixel-space models match or outperform their latent-space counterparts while delivering 3.18 to 4.75 times end-to-end inference speedups. We hope that our findings provide useful empirical insights and practical guidelines for future research on pixel-space generation.

cs.CV↗

Polynomial mixing for the white-forced wave equation on the whole line

Our goal in this paper is to investigate the ergodicity of the white-forced wave equation on the whole line. Assuming that sufficiently many directions of the phase space are stochastically forced, we prove the uniqueness of the stationary measure and polynomial mixing in the dual-Lipschitz metric. The difficulties in our proof are twofold. On the one hand, in contrast to stochastic parabolic equations, the stochastic wave equation lacks both a smoothing effect and a strongly dissipative mechanism. On the other hand, the unboundedness of the whole line leads to a loss of compactness compared with the bounded domain case. To overcome these obstacles, our proof relies on four key ingredients: a new criterion for polynomial mixing established in [21], a novel weighted Foiaş-Prodi estimate for the wave equation on the whole line, weighted energy estimates for the stochastic wave equation, and the irreducibility of the stochastic wave equation.

math.DS↗

Bounds for moments of twisted quadratic characters of prime modulus

We study, under the Generalized Riemann Hypothesis (GRH), the moments of sums of Fourier coefficients of a fixed holomorphic Hecke eigenform twisted by the quadratic character $χ_{8p}$, where $p$ ranges over odd primes. We establish the correct order of magnitude for the unsmoothed $m$-th moment for all real $m\geq 4$, and a sharp upper bound of order $XY^{m/2}\,\, (\log X)^{m(m-3)/2}\,\,$ for the smoothed $m$-th moment for all integers $m\geq 4$. A matching lower bound for all even integers $m\geq 4$ shows that this bound is optimal.

math.NT↗

eMicro: Real-Time Multi-Hop Access Control for Microservices with eBPF

Modern cloud applications often comprise thousands of microservices whose interactions form complex request paths. Traditional inter-service access control restricts individual service-to-service requests, but fails to prevent multi-hop attacks, where each hop appears legitimate yet the overall path violates security intent. This gap leaves systems exposed to unauthorized access and data exfiltration. In this paper, we present eMicro, a path-aware defense system for microservices that prevents such attacks while remaining efficient and deployable. eMicro enforces real-time multi-hop access control through three key techniques: (1) history-based access control extended to capture service invocation sequences; (2) security policies encoded as efficient deterministic finite automaton (DFA), supporting constant-time lookups and compact label propagation; (3) eBPF-based in-kernel request tracing for transparent, low-overhead enforcement without code changes. Evaluations on DeathStarBench and production cloud traces from Uber, Alibaba, and ByteDance, covering 12 million request workflows and thousands of services, demonstrate the scalability of eMicro. eMicro performs policy checks in 1 microsecond, stores 50 million policies in only 100 MB, and reduces propagation overhead by 90% with negligible runtime impact. These results show that eMicro delivers scalable and efficient protection against multi-hop attacks, making it practical for deployment in large-scale microservice environments.

cs.CR↗

Exponential mixing for the stochastic Kuramoto-Sivashinsky equation on the 1D torus

In this paper, we study the large-time behaviors of the Kuramoto-Sivashinsky equation (KSE) on the 1D torus while being subjected to random perturbation via additive Gaussian noise. It is well-known that under suitable assumptions on the stochastic forcing, the KSE admits a unique invariant probability measure. In this work, we make further progress on the topic of ergodicity by addressing the issue of convergence rate toward equilibrium. In comparison with the previous results, we can prove that the unique invariant probability measure is exponentially attractive and smallness condition of anti-diffusion coefficient is not necessary here. The proof relies on a coupling argument while making use of Lyapunov functions motivated by those of deterministic equations.

math.PR↗

The MiniMax-M2 Series: Mini Activations Unleashing Max Real-World Intelligence

We introduce the MiniMax-M2 series, a family of Mixture-of-Experts language models built around the principle that mini activations can unleash maximum real-world intelligence. The flagship M2 contains 229.9B total parameters with only 9.8B activated per token. Designed end-to-end for agentic deployment, the M2 series rests on three components: (i) agent-driven data pipelines producing large-scale, verifiable trajectories across agentic coding and agentic cowork, each grounded in an executable workspace and an artifact-aligned reward; (ii) Forge, a scalable agent-native RL system that adapts to long-horizon agent trajectories, paired with windowed-FIFO scheduling, prefix-tree merging, inference optimization, and a clean training-inference-agent decoupling that supports both white-box and black-box agents; (iii) the latest M2.7 checkpoint takes an early step toward self-evolution -- autonomously debugging training runs and modifying its own scaffold. Across M2 through M2.7, this combination translates a mini-activation footprint into frontier-tier performance on agentic coding, deep search, office-task, and reasoning benchmarks.

cs.AI↗

Direct Measurement of Exciton Dispersion in the Long-Wavelength Limit

Exciton dispersion, which governs the propagation, scattering and radiative decay of electron-hole pairs, is essential to optoelectronics and quantum materials. In two-dimensional systems, weakened dielectric screening and long-range electron-hole exchange are predicted to induce nonanalytic exciton dispersion in the long-wavelength limit. However, direct quantitative characterization of its dimensional evolution remains lacking, especially in the ultralow-q regime (q < 0.02 $Å^{-1}$). Here we employ defocus-engineered momentum-resolved electron energy-loss spectroscopy in scanning transmission electron microscopy, achieving an ultrahigh momentum resolution of 0.0002 $Å^{-1}$. Using freestanding hBN as a prototypical platform, we resolve layer-dependent exciton dispersion and quantify its characteristic crossover momentum and group velocity in the long-wavelength limit. With increasing thickness, the nonanalytic linear-dispersion regime is progressively compressed, manifested by a reduction in characteristic crossover momentum q_c from $1.82 \times 10^{-1} Å^{-1}$ in the monolayer to $3.0 \times 10^{-1} Å^{-1}$ in 25 layers. Meanwhile, the low-q group velocity increases from $2.0 \times 10^{-3} c$ to $2.9 \times 10^{-2} c$, before the dispersion ultimately approaches the bulk-like parabolic limit. We further examine how the exciton band structure of monolayer hBN responds to its surrounding environment, including temperature, adjacent graphene layers, and interlayer twist in BN/graphene heterostructures. These findings uncover the fundamental physics of low-dimensional excitons, deliver valuable guidance for modulating exciton transport, diffusion and quasiparticle coupling in layered quantum materials, and establish a powerful experimental route to explore low-dimensional exciton physics.

cond-mat.mes-hall↗

Direct observation of anisotropic exciton dispersion in the 2D semiconductor CrSBr

We report momentum-resolved measurements of exciton dispersion in multilayer CrSBr using defocus-engineered electron energy-loss spectroscopy, supported by first-principles calculations. A pronounced in-plane anisotropy is observed, with the exciton exhibiting a linear dispersion along $Γ$Y within $\lvert \boldsymbol{q} \rvert$ < 0.007 Å$^{-1}$, while remaining nearly dispersionless along $Γ$X. The slope reaches 7.02 eV Å, among the largest reported in low-dimensional systems. The calculations reproduce the experimentally observed linear dispersion, confirming its intrinsic origin. We attribute the anisotropic dispersion to the long-range electron--hole exchange interaction, enhanced by strong out-of-plane confinement and governed by the directional selection rules of the transition dipole moment. Comparative measurements across the magnetic phase transition from the paramagnetic to the A-type antiferromagnetic state show that the dispersion remains essentially unchanged, indicating negligible coupling between exciton propagation and magnetic order. These results establish CrSBr as a model system for investigating anisotropic exciton dynamics in low-symmetry layered semiconductors.

cond-mat.mtrl-sci↗

Long-time behaviour of dynamical systems driven by bounded mixing noises

We study the mixing properties of discrete-time and continuous-time dissipative dynamical systems driven by bounded mixing random forces. The continuous-time systems are reduced to discrete-time random dynamical systems generated by time-one maps, so that the main analysis is carried out in the discrete setting. We introduce a class of mixing random forcings whose regular conditional distributions with respect to the past satisfy natural regularity, recurrence, and non-degeneracy assumptions, extending the framework previously developed for more restrictive classes of processes in a paper by Kuksin-Shirikyan in GAFA (2025). Under a linearised controllability assumptions on the system, we prove exponential mixing in the total variation metric for finite-dimensional phase spaces. We then establish an infinite-dimensional counterpart yielding exponential mixing in the dual-Lipschitz metric under suitable amendments of restrictions on the system and the random forcing. Our approach is based on lifting the dynamics to an appropriate Markov process on an infinite-dimensional history space and applying a Doeblin coupling argument through the method of Kantorovich functional. As applications, we derive exponential mixing for a broad class of ordinary differential equations driven by mixing random processes with bounded continuous trajectories. As an application of our result to PDEs we discuss the randomly perturbed primitive equations of atmospheric dynamics.

math.DS↗

CatalogAgent: A Supervisor-mediated Self-Learning System Enabling Context Engineering for GenAI Models

Product catalogs are the backbone of e-commerce sites, yet a large number of structured attributes (SAs) -- such as material, color, and shape -- often have missing values. Typically, SA values are extracted from product information, including titles and descriptions. While LLM-based generator-evaluator frameworks have demonstrated effectiveness for SA prediction -- where an LLM generates SA values and another evaluates them -- they face challenges when the Generator and Evaluator produce conflicting outputs, as either component can make mistakes. We introduce \texttt{CatalogAgent}, a novel agentic system that continuously improves Generator and Evaluator models for e-commerce catalog enrichment. When disagreements arise from (1) internal conflicts between the LLM-based Generator and Evaluator, or (2) external feedback from sellers on LLM outputs, a Supervisor Agent intervenes to mediate these conflicts and make final decisions. The system also incorporates a Memory Base and a Memory Summarizer that stores Supervisor Agent activities from individual cases and aggregates patterns into learnings. These learnings are fed back to the worker Generator and Evaluator LLMs, enabling self-improvement without human intervention. Through context engineering -- injecting learnings and insights into worker LLMs' contexts -- the system successfully transfers the Supervisor's capabilities to the Generator and Evaluator, improving their performance by 15.24\% and 13.98\%, respectively. Our experiments demonstrate a new paradigm of Supervisor Agent-mediated self-learning systems for improving generative AI model accuracy.

cs.AI↗

Z-Reward: Beyond Scalar Rewards by Internalizing Reasoning into Score Distributions

Reward models are central to text-to-image post-training, but visual preference is subjective and better represented as a distribution over rubric scores than as a deterministic scalar. Existing scalar, score-token, and pairwise reward models over-compress uncertainty and fine-grained score differences, while reasoning-based generative rewards provide stronger judgments but are costly to deploy and difficult to use as direct optimization signals. We propose Z-Reward, a teacher-student reward modeling framework that decouples reasoning-heavy judgment from efficient reward deployment. The teacher is a large VLM that uses reasoning to infer rubric-aligned score distributions, and is trained with Group-wise Direct Score Optimization (GDSO), which combines policy-gradient rewards from distribution expectations with direct pointwise and pairwise supervision on score distributions and score gaps. The student is trained with Reasoning-Internalized Score Distillation (RISD), which transfers the teacher's reasoning-conditioned score distribution into a compact VLM without requiring explicit reasoning chains at inference time. On our internally annotated evaluation set, the 27B GDSO teacher reaches 89.6% human preference accuracy, outperforming SFT, RewardDance, and GRPO, while the 9B RISD student reaches 88.6%, outperforming the OPD baseline and closely matching the larger teacher. We further show that Z-Reward can serve as a differentiable reward signal for text-to-image optimization, yielding a 41.3% net human-preference improvement over the SFT baseline.

cs.CV↗

Plug-and-Play Reweighting for Resilient Collaborative Decision-Making in Connected Autonomous Driving

Collaborative decision-making is a fundamental capability in multi-robot systems, such as connected autonomous vehicles. However, perceptual noise and adversarial attacks in collaborators can severely affect decision reliability. Overall, existing methods typically rely on retraining with attack-specific defenses or on restrictive perturbation assumptions to improve resilience, which limits their practicality. In this paper, we propose a novel Resilient Collaborative Decision-Making (RCDM) framework that consists of an attention-based encoder for extracting individual robot perceptual embeddings and an attention-based decoder for fusing collaborator perceptions and making decisions. To improve resilience to corrupted observations, we design a novel plug-and-play reweighting module that down-weights the influence of corrupted inputs by analyzing the consistency of neighborhood points relative to the local structure and assigning smaller weights to points that deviate strongly from the local median. This module can be seamlessly integrated into attention-based collaborative decision-making without requiring additional training. We evaluate our method in high-fidelity simulations, considering perceptual noise and five types of attacks across diverse accident-prone scenarios. Experimental results demonstrate that our approach consistently outperforms existing methods by up to 26% and achieves state-of-the-art resilient performance.

cs.RO↗

UBG-Net: An Uncertainty-aware Bayesian Gating Network for Robust Audio-Visual Speech Recognition

Audio-Visual speech recognition systems often degrade in real-world scenarios due to signal corruption and distribution shifts. To address this, we propose a unified uncertainty-modeling framework, namely the uncertainty-aware Bayesian gating network (UBG-Net). UBG-Net features a Modality Uncertainty-aware Bayesian Fusion (MUBF) mechanism that injects signal-level aleatoric uncertainty into a Bayesian network to model epistemic uncertainty, thereby ensuring robust fusion of pre-trained backbone features. For inference, we introduce Distribution Uncertainty-aware Hierarchical Voting (DUHV) to select transcripts from Monte Carlo samples, prioritizing frequency and using inference scores in case of a tie. Experiments on the AVCocktail and LRS2 datasets demonstrate the overall superiority of UBG-Net compared to SOTA baselines. Ablation studies confirm that MUBF and DUHV effectively filter noise, enhancing fusion and decoding robustness.

eess.AS↗

Z-Image: An Efficient Image Generation Foundation Model with Single-Stream Diffusion Transformer

The landscape of high-performance image generation models is currently dominated by proprietary systems, such as Nano Banana Pro and Seedream 4.0. Leading open-source alternatives, including Qwen-Image, Hunyuan-Image-3.0 and FLUX.2, are characterized by massive parameter counts (20B to 80B), making them impractical for inference, and fine-tuning on consumer-grade hardware. To address this gap, we propose Z-Image, an efficient 6B-parameter foundation generative model built upon a Scalable Single-Stream Diffusion Transformer (S3-DiT) architecture that challenges the "scale-at-all-costs" paradigm. By systematically optimizing the entire model lifecycle -- from a curated data infrastructure to a streamlined training curriculum -- we complete the full training workflow in just 314K H800 GPU hours (approx. $630K). Our few-step distillation scheme with reward post-training further yields Z-Image-Turbo, offering both sub-second inference latency on an enterprise-grade H800 GPU and compatibility with consumer-grade hardware (<16GB VRAM). Additionally, our omni-pre-training paradigm also enables efficient training of Z-Image-Edit, an editing model with impressive instruction-following capabilities. Both qualitative and quantitative experiments demonstrate that our model achieves performance comparable to or surpassing that of leading competitors across various dimensions. Most notably, Z-Image exhibits exceptional capabilities in photorealistic image generation and bilingual text rendering, delivering results that rival top-tier commercial models, thereby demonstrating that state-of-the-art results are achievable with significantly reduced computational overhead. We publicly release our code, weights, and online demo to foster the development of accessible, budget-friendly, yet state-of-the-art generative models.

cs.CV↗