SearcharxivSearch

arXiv subjects

Zilong He

Publications and source records attributed to Zilong He.

At least 19 recordsLinked to original sources

AgentChaos: Chaos Engineering for Agent Systems via Programmatic Fault Injection

Agent systems rely on LLM APIs for every response, but these APIs can return server errors, truncated responses, or corrupted content that propagates through downstream agents and causes task failure. Evaluating robustness under these faults is crucial for reliable deployment. Existing fault injection methods are offline, require source code modification, or cannot modify specific response fields. A comprehensive evaluation also requires a systematic fault taxonomy because different fault types affect downstream agents differently. We propose AgentChaos, a chaos engineering framework for controlled, runtime, non-intrusive LLM API fault injection. Since all agent systems access LLMs through the same HTTP interface, we inject faults at this shared layer without modifying source code. We define crash, omission, and value faults on content and tool call fields, intercept and modify LLM API responses at runtime, and verify whether each fault is triggered to filter untriggered tasks and avoid underestimating fault impact. Evaluations across agent systems, benchmarks, and backbone LLMs under 65 fault configurations show that all systems degrade under fault injection, with pass@1 dropping by up to 50 percentage points. The ranking is consistent across models, suggesting that robustness depends on system implementation rather than model capability. Existing fault diagnosis methods achieve below 53% accuracy on fault type and below 56% on fault step, leaving room for improvement. We further reveal practical findings for agent system developers.

cs.SE

The compositional inverses of the permutation polynomials of the form $x+\gamma\operatorname{Tr}_{q}^{q^n}(H(x))$ over $\mathbb{F}_{q^n}$

This paper focuses on computing the compositional inverses of permutation polynomials of the form $x+\gamma \operatorname{Tr}_{q}^{q^{n}}(H(x))$ over finite fields via the local method. We explicitly construct compositional inverses for four families of permutation polynomials of this type over $\mathbb{F}_{q^2}$, another four families over $\mathbb{F}_{q^3}$, and one general family over $\mathbb{F}_{q^n}$. The closed-form inverse expressions derived in this work supplement the theory of trace permutation polynomials.

math.NT

LIDL: LLM Integration Defect Localization via Knowledge Graph-Enhanced Multi-Agent Analysis

LLM-integrated software, which embeds or interacts with large language models (LLMs) as functional components, exhibits probabilistic and context-dependent behaviors that fundamentally differ from those of traditional software. This shift introduces a new category of integration defects that arise not only from code errors but also from misaligned interactions among LLM-specific artifacts, including prompts, API calls, configurations, and model outputs. However, existing defect localization techniques are ineffective at identifying these LLM-specific integration defects because they fail to capture cross-layer dependencies across heterogeneous artifacts, cannot exploit incomplete or misleading error traces, and lack semantic reasoning capabilities for identifying root causes. To address these challenges, we propose LIDL, a multi-agent framework for defect localization in LLM-integrated software. LIDL (1) constructs a code knowledge graph enriched with LLM-aware annotations that represent interaction boundaries across source code, prompts, and configuration files, (2) fuses three complementary sources of error evidence inferred by LLMs to surface candidate defect locations, and (3) applies context-aware validation that uses counterfactual reasoning to distinguish true root causes from propagated symptoms. We evaluate LIDL on 146 real-world defect instances collected from 105 GitHub repositories and 16 agent-based systems. The results show that LIDL significantly outperforms five state-of-the-art baselines across all metrics, achieving a Top-3 accuracy of 0.64 and a MAP of 0.48, which represents a 64.1% improvement over the best-performing baseline. Notably, LIDL achieves these gains while reducing cost by 92.5%, demonstrating both high accuracy and cost efficiency.

cs.SE

Local information of ADC quadratic lattices over algebraic number fields

In the paper, we mainly determine the structures, counting formulas, and density sets of representations for binary and ternary ADC quadratic lattices over arbitrary non-archimedean local fields. In the binary case, we show that under certain conditions, there are finitely many primitive positive definite ADC lattices and infinitely many non-primitive ones. We also provide concise formulas for local densities and masses using invariants from BONGs theory, and show that these invariants completely determine the local densities over arbitrary non-archimedean local fields. Moreover, we compute the corresponding local quantities for ADC lattices over algebraic number fields. In the ternary case, we characterize the codeterminant set of spinor exceptions and integral spinor norm groups for ADC lattices over arbitrary non-archimedean local fields. Based on these results, we further establish some sufficient conditions on indefinite ADC lattices over algebraic number fields.

math.NT

InferLog: Accelerating LLM Inference for Online Log Parsing via ICL-oriented Prefix Caching

Modern software systems generate massive volumes of runtime logs, necessitating efficient and accurate log parsing to enable critical downstream tasks such as anomaly detection and root cause analysis. Recently, large language models (LLMs) have achieved advanced accuracy on log parsing, but their deployment in production environments faces two major limitations: (1) the privacy risks associated with commercial LLMs, driving the adoption of local deployment, and (2) the stringent latency and throughput requirements imposed by high-volume log streams, which existing LLM-based parsers fail to meet. Although recent efforts have reduced the number of LLM queries, they overlook the high latency of the LLM invocations, where concurrent log parsing requests can cause serve performance degradation of LLM inference system. In this study, we present InferLog, the first LLM inference optimization method for online log parsing. Our key insight is that the inference efficiency emerges as the vital bottleneck in LLM-based online log parsing, rather than parsing accuracy. InferLog accelerates inference by designing (1) A Prefix-aware ICL Refinement policy to refine the examples and permutation of in-context learning to improve the prefix caching efficiency. (2) A rapid and task-specific configuration tuning pipeline based on meta-learning to find the optimal LLM scheduling-related configuration for dynamic log parsing workloads. The experimental results based on Loghub dataset and vLLM demonstrate that InferLog significantly outperforms existing inference optimization methods and markedly accelerates the state-of-the-art LLM-based log parser without compromising parsing accuracy.

cs.SE

DaiFu: In-Situ Crash Recovery for Deep Learning Systems

Deep learning (DL) systems have been widely adopted in many areas, and are becoming even more popular with the emergence of large language models. However, due to the complex software stacks involved in their development and execution, crashes are unavoidable and common. Crashes severely waste computing resources and hinder development productivity, so efficient crash recovery is crucial. Existing solutions, such as checkpoint-retry, are too heavyweight for fast recovery from crashes caused by minor programming errors or transient runtime errors. Therefore, we present DaiFu, an in-situ recovery framework for DL systems. Through a lightweight code transformation to a given DL system, DaiFu augments it to intercept crashes in situ and enables dynamic and instant updates to its program running context (e.g., code, configurations, and other data) for agile crash recovery. Our evaluation shows that DaiFu helps reduce the restore time for crash recovery, achieving a 1372x speedup compared with state-of-the-art solutions. Meanwhile, the overhead of DaiFu is negligible (under 0.40%). We also construct a benchmark spanning 7 distinct crash scenarios in DL systems, and show the effectiveness of DaiFu in diverse situations.

cs.SE

FaaSRCA: Full Lifecycle Root Cause Analysis for Serverless Applications

Serverless becomes popular as a novel computing paradigms for cloud native services. However, the complexity and dynamic nature of serverless applications present significant challenges to ensure system availability and performance. There are many root cause analysis (RCA) methods for microservice systems, but they are not suitable for precise modeling serverless applications. This is because: (1) Compared to microservice, serverless applications exhibit a highly dynamic nature. They have short lifecycle and only generate instantaneous pulse-like data, lacking long-term continuous information. (2) Existing methods solely focus on analyzing the running stage and overlook other stages, failing to encompass the entire lifecycle of serverless applications. To address these limitations, we propose FaaSRCA, a full lifecycle root cause analysis method for serverless applications. It integrates multi-modal observability data generated from platform and application side by using Global Call Graph. We train a Graph Attention Network (GAT) based graph auto-encoder to compute reconstruction scores for the nodes in global call graph. Based on the scores, we determine the root cause at the granularity of the lifecycle stage of serverless functions. We conduct experimental evaluations on two serverless benchmarks, the results show that FaaSRCA outperforms other baseline methods with a top-k precision improvement ranging from 21.25% to 81.63%.

cs.SE

Mint: Cost-Efficient Tracing with All Requests Collection via Commonality and Variability Analysis

Distributed traces contain valuable information but are often massive in volume, posing a core challenge in tracing framework design: balancing the tradeoff between preserving essential trace information and reducing trace volume. To address this tradeoff, previous approaches typically used a '1 or 0' sampling strategy: retaining sampled traces while completely discarding unsampled ones. However, based on an empirical study on real-world production traces, we discover that the '1 or 0' strategy actually fails to effectively balance this tradeoff. To achieve a more balanced outcome, we shift the strategy from the '1 or 0' paradigm to the 'commonality + variability' paradigm. The core of 'commonality + variability' paradigm is to first parse traces into common patterns and variable parameters, then aggregate the patterns and filter the parameters. We propose a cost-efficient tracing framework, Mint, which implements the 'commonality + variability' paradigm on the agent side to enable all requests capturing. Our experiments show that Mint can capture all traces and retain more trace information while optimizing trace storage (reduced to an average of 2.7%) and network overhead (reduced to an average of 4.2%). Moreover, experiments also demonstrate that Mint is lightweight enough for production use.

cs.SE

EE-MLLM: A Data-Efficient and Compute-Efficient Multimodal Large Language Model

Recent advancements in Multimodal Large Language Models (MLLMs) have demonstrated satisfactory performance across various vision-language tasks. Current approaches for vision and language interaction fall into two categories: self-attention-based and cross-attention-based methods. However, both approaches present inherent limitations, forcing a trade-off between data and computational efficiency. To address this issue, we introduce the Data-$\textbf{E}$fficient and Compute-$\textbf{E}$fficient $\textbf{MLLM}$ ($\textbf{EE-MLLM}$). Specifically, we modify the original self-attention mechanism in MLLM to a composite attention mechanism. This mechanism has two key characteristics: 1) eliminating the computational overhead of self-attention among visual tokens to achieve $\textbf{compute efficiency}$, and 2) reusing the weights from each layer of LLM to facilitate effective vision-language modality alignment for $\textbf{data efficiency}$. As a result, EE-MLLM significantly outperforms Flamingo with limited training data, and reduces the prefilling time to 79 ms on an H800 GPU, compared to LLaVA's 277 ms. To further investigate the efficiency of EE-MLLM, we present a training-free variant named EE-MLLM-F, which reduces the computation cost of self-attention-based method without additional training. Experimental results demonstrate the effectiveness of EE-MLLM across a range of benchmarks, including general-purpose datasets like MMBench and SeedBench, as well as fine-grained tasks such as TextVQA and DocVQA.

cs.CV

Arithmetic Springer theorem and $n$-universality under field extensions

Based on BONGs theory, we prove the norm principle for integral and relative integral spinor norms of quadratic forms over general dyadic local fields, respectively. By virtue of these results, we further establish the arithmetic version of Springer's theorem for indefinite quadratic forms. Moreover, we solve the lifting problems on $n$-universality over arbitrary local fields.

math.NT

On $n$-ADC integral quadratic lattices over algebraic number fields

In the paper, we extend the ADC property to the representation of quadratic lattices by quadratic lattices, which we define as $ n $-ADC-ness. We explore the relationship between $ n$-ADC-ness, $ n $-regularity and $ n $-universality for integral quadratic lattices. Also, for $ n\ge 2 $, we give necessary and sufficient conditions for an integral quadratic lattice over arbitrary non-archimedean local fields to be $ n $-ADC. Moreover, we show that over any algebraic number field $ F $, an integral $ \mathcal{O}_{F} $-lattice with rank $ n+1 $ is $n$-ADC if and only if it is $\mathcal{O}_{F}$-maximal of class number one.

math.NT

The mass of shifted lattices and class numbers of inhomogeneous quadratic polynomials

In this paper, we investigate class numbers of shifted quadratic lattices $L+\frac{\boldsymbol{u}}{c}$ with $\boldsymbol{u}\in L$ and odd conductor $c\in \mathbb{N}$. For a lattice $L$ whose genus only contains one class, we determine a lower bound for the number of classes in the genus of $L+\frac{\boldsymbol{u}}{c}$ depending on $c$. As a result, we obtain an explicit bound $c_0$ such that any such shifted lattice with one class in its genus must have conductor smaller than $c_0$, restricting the possible choices of such $L+\frac{\boldsymbol{u}}{c}$ to a finite set.

math.NT

On $k$-universal quadratic lattices over unramified dyadic local fields

Let $k$ be a positive integer and let $F$ be a finite unramified extension of $\mathbb{Q}_2$ with ring of integers $\mathcal{O}_F$. An integral (resp. classic) quadratic form over $\mathcal{O}_F$ is called $k$-universal (resp. classically $k$-universal) if it represents all integral (resp. classic) quadratic forms of dimension $k$. In this paper, we provide a complete classification of $k$-universal and classically $k$-universal quadratic forms over $\mathcal{O}_F$. The results are stated in terms of the fundamental invariants associated to Jordan splittings of quadratic lattices.

math.NT

On classic $n$-universal quadratic forms over dyadic local fields

Let $ n $ be an integer and $ n\ge 2 $. A classic integral quadratic form over local fields is called classic $ n $-universal if it represents all $n$-ary classic integral quadratic forms. We determine the equivalent conditions and minimal testing sets for classic $ n $-universal quadratic forms over dyadic local fields.

math.NT

On indefinite $k$-universal integral quadratic forms over number fields

An integral quadratic lattice is called indefinite $k$-universal if it represents all integral quadratic lattices of rank $k$ for a given positive integer $k$. For $k\geq 3$, we prove that the indefinite $k$-universal property satisfies the local-global principle over number fields. For $k=2$, we show that a number field $F$ admits an integral quadratic lattice which is locally $2$-universal but not indefinite 2-universal if and only if the class number of $F$ is even. Moreover, there are only finitely many classes of such lattices over $F$. For $k=1$, we prove that $F$ admits a classic integral lattice which is locally classic $1$-universal but not classic indefinite $1$-universal if and only if $F$ has a quadratic unramified extension where all dyadic primes of $F$ split completely. In this case, there are infinitely many classes of such lattices over $F$. All quadratic fields with this property are determined.

math.NT

Pythagoras number of quartic orders containing $\sqrt{2}$

Let $K$ be a quartic number field containing $\sqrt{2}$ and let $\mathcal{O}\subseteq K$ be an order such that $\sqrt{2}\in \mathcal{O}$. We prove that the Pythagoras number of $\mathcal{O}$ is at most 5. This confirms a conjecture of Kr\'{a}sensk\'{y}, Ra\v{s}ka and Sgallov\'a. The proof makes use of Beli's theory of bases of norm generators for quadratic lattices over dyadic local fields.

math.NT

On $n$-universal quadratic forms over dyadic local fields

Let $ n \ge 2$ be an integer. We give necessary and sufficient conditions for an integral quadratic form over dyadic local fields to be $ n $-universal by using invariants from Beli's theory of bases of norm generators. Also, we provide a minimal set for testing $ n $-universal quadratic forms over dyadic local fields, as an analogue of Bhargava and Hanke's 290-theorem (or Conway and Schneeberger's 15-theorem) on universal quadratic forms with integer coefficients.

math.NT