SearcharxivSearch

arXiv subjects

Zibo Wang

Publications and source records attributed to Zibo Wang.

At least 19 recordsLinked to original sources

LOCAL: Enabling Learning On-device Contiguously for Agent LLMs

On-device LLM agents interact repeatedly with users on local hardware, producing private traces that are valuable for adaptation but should not be sent to a remote trainer. Ideally, such agents would learn contiguously---adapting from every interaction without pausing or suspending user-facing inference---yet existing inference runtimes assume stable weights and existing RL systems assume separated resources, so neither can support this continuity. We present LOCAL, the first single-GPU runtime that enables contiguous on-device learning for LLM agents. The key insight is that GPU scheduling, adapter version management, and KV-cache validity cannot be handled by independent subsystems: adapter updates invalidate cached KV tensors from older versions, and cache retention affects the memory available for training. LOCAL makes adapter version, task priority, and cache state visible to three cooperating components---a cooperative scheduler, a version-aware KV-cache manager, and a multi-agent model runtime---that share this state to keep scheduling, execution, and cache maintenance mutually consistent. On a single 24 GB GPU with 7B-class models, LOCAL lowers foreground queue-wait p95 by 3.1x over FIFO, lowers p95 time-to-first-token (TTFT) by 1.55x versus non-preemptible training, cuts post-publish first-hit prefill p99 by 25.6% and cross-agent TTFT p99 by 21.9%, and keeps background learning progressing under tight KV budgets.

cs.DC

LAFA: Agentic LLM-Driven Federated Analytics over Decentralized Data Sources

Large Language Models (LLMs) have shown great promise in automating data analytics tasks by interpreting natural language queries and generating multi-operation execution plans. However, existing LLM-agent-based analytics frameworks operate under the assumption of centralized data access, offering little to no privacy protection. In contrast, federated analytics (FA) enables privacy-preserving computation across distributed data sources, but lacks support for natural language input and requires structured, machine-readable queries. In this work, we present LAFA, the first system that integrates LLM-agent-based data analytics with FA. LAFA introduces a hierarchical multi-agent architecture that accepts natural language queries and transforms them into optimized, executable FA workflows. A coarse-grained planner first decomposes complex queries into sub-queries, while a fine-grained planner maps each subquery into a Directed Acyclic Graph of FA operations using prior structural knowledge. To improve execution efficiency, an optimizer agent rewrites and merges multiple DAGs, eliminating redundant operations and minimizing computational and communicational overhead. Our experiments demonstrate that LAFA consistently outperforms baseline prompting strategies by achieving higher execution plan success rates and reducing resource-intensive FA operations by a substantial margin. This work establishes a practical foundation for privacy-preserving, LLM-driven analytics that supports natural language input in the FA setting.

cs.AI

STAR: Decode-Phase Rescheduling for LLM Inference

Large Language Model (LLM) inference has emerged as a fundamental paradigm, however, variations in output length cause severe workload imbalance in the decode phase, particularly for long-output reasoning tasks. Existing systems, such as PD disaggregation architectures, rely on static prefill-to-decode scheduling, which often results in SLO violations and OOM failures under evolving decode workloads. In this paper, we propose STAR, a decode rescheduling system powered by length prediction to anticipate future workloads. Our core contributions include: (1) A lightweight and continuous LLM-native prediction method that leverages LLM hidden state to model remaining generation length with high precision (reducing MAE by 49.42%) and low overhead (cutting predictor parameters by 93.28%); (2) A rescheduling solution in decode phase with a dynamic balancing mechanism that integrates current and predicted workloads, reducing P99 TPOT by 75.1% and achieving 2.63 times higher goodput.

cs.DC

On the vanishing viscosity limit of Hamilton-Jacobi equations with nearly optimal discount

In this paper, we establish the convergence of solutions to the viscous Hamilton-Jacobi equation (with a Tonelli Hamiltonian): \[ \lambda u +H(x, du)=\varepsilon(\lambda)\Delta u,\quad \lambda>0 \] as $\lambda\rightarrow 0_+$, once the modulus $\varepsilon(\lambda)$ satisfies $\varlimsup_{\lambda\rightarrow 0_+}\varepsilon(\lambda)/\lambda=0$. Such an exponent of $\varepsilon(\lambda)$ is nearly optimal in the convergence.

math.AP

SmartSwap: Swap-Based Memory Optimization for LLM Training under Varying Operator Sequences

The increasing size of large language models (LLMs) has led to a surge in memory requirements during training, often exceeding the capacity of high-bandwidth memory (HBM). Swap-based memory optimization incurs neither accuracy loss nor additional end-to-end overhead when effectively overlapped, thus being an attractive solution. However, existing swap methods assume consistent operator sequences, which is impractical in Eager Mode, where operator sequences can vary during change. We propose Chameleon, which redesigns the end-to-end process of swap-based memory optimization and is the first work to consider varying operator sequences in Eager Mode. Chameleon (i) introduces a lightweight online profiler to enable continuous profiling for monitoring operator sequences, (ii) generates effective swap policies with limited operator information, and (iii) optimizes the policy execution module for accurate policy application and better performance. Experimental results demonstrate that Chameleon reduces profiling overhead by 84.25%, enables training models up to 4x larger than hardware memory while adapting to changes in operator sequences, improves performance by up to 38.94% compared to recomputation or high-degree parallelism.

cs.DC

Accelerating Mixture-of-Experts Inference by Hiding Offloading Latency with Speculative Decoding

Recent advancements in Mixture of Experts (MoE) models have significantly increased their parameter scale as well as model performance. Extensive offloading techniques have been proposed to address the GPU memory limitations of MoE inference. However, due to the I/O bottleneck and sparse computation of MoE models, existing offloading techniques still suffer from low hardware utilization. To fully utilize the hardware resources, we propose SpecMoEOff, which employs the speculative decoding technique to enlarge the workload of each expert. SpecMoEOff orchestrates the GPU and CPU by both theoretical and empirical roofline analysis. In addition, we develop a dedicated CPU chunked attention verification kernel to fit the speculative decoding in offloading scenarios as well as minimizing the additional overhead led by draft models. SpecMoEOff further integrates an optimizer to automatically tune the hyperparameters of speculative decoding under given hardware and workload. Experimental results show that SpecMoEOff achieves up to 2.5x decode throughput improvement over the state-of-the-art MoE offloading techniques.

cs.DC

Echo: Efficient Co-Scheduling of Hybrid Online-Offline Tasks for Large Language Model Serving

Large language models have been widely deployed in various applications, encompassing both interactive online tasks and batched offline tasks. Given the burstiness and latency sensitivity of online tasks, over-provisioning resources is common practice. This allows for the integration of latency-insensitive offline tasks during periods of low online load, enhancing resource utilization. However, strategically serving online and offline tasks through a preemption mechanism fails to fully leverage the flexibility of offline tasks and suffers from KV cache recomputation and irregular workloads. In this paper, we introduce Echo, a collaborative online-offline task serving system, including a scheduler, a KV cache manager, and estimation toolkits. The scheduler and KV cache manager work tightly to maximize the throughput of offline tasks, while the estimator further predicts execution time to ensure online task SLOs. The scheduler leverages the batch information of last iteration to reduce the search space for finding the optimal schedule. The KV cache manager sets the priority of the KV cache based on the type of tasks and the opportunity of prefix sharing to reduce the recomputation. Finally, the estimation toolkits predict the execution time, future memory consumption, and the throughput of offline tasks to guide the scheduler, KV cache manager, and the system deployer. Evaluation based on real-world workloads demonstrates that Echo can increase offline task throughput by up to $3.3\times$, while satisfying online task SLOs.

cs.DC

Long-horizon Embodied Planning with Implicit Logical Inference and Hallucination Mitigation

Long-horizon embodied planning underpins embodied AI. To accomplish long-horizon tasks, one of the most feasible ways is to decompose abstract instructions into a sequence of actionable steps. Foundation models still face logical errors and hallucinations in long-horizon planning, unless provided with highly relevant examples to the tasks. However, providing highly relevant examples for any random task is unpractical. Therefore, we present ReLEP, a novel framework for Real-time Long-horizon Embodied Planning. ReLEP can complete a wide range of long-horizon tasks without in-context examples by learning implicit logical inference through fine-tuning. The fine-tuned large vision-language model formulates plans as sequences of skill functions. These functions are selected from a carefully designed skill library. ReLEP is also equipped with a Memory module for plan and status recall, and a Robot Configuration module for versatility across robot types. In addition, we propose a data generation pipeline to tackle dataset scarcity. When constructing the dataset, we considered the implicit logical relationships, enabling the model to learn implicit logical relationships and dispel hallucinations. Through comprehensive evaluations across various long-horizon tasks, ReLEP demonstrates high success rates and compliance to execution even on unseen tasks and outperforms state-of-the-art baseline methods.

cs.RO

A Survey on Federated Analytics: Taxonomy, Enabling Techniques, Applications and Open Issues

The escalating influx of data generated by networked edge devices, coupled with the growing awareness of data privacy, has restricted the traditional data analytics workflow, where the edge data are gathered by a centralized server to be further utilized by data analysts. To continue leveraging vast edge data to support various data-incentive applications, computing paradigms have promoted a transformative shift from centralized data processing to privacy-preserved distributed data processing. The need to perform data analytics on private edge data motivates federated analytics (FA), an emerging technique to support collaborative data analytics among diverse data owners without centralizing the raw data. Despite the wide applications of FA in industry and academia, a comprehensive examination of existing research efforts in FA has been notably absent. This survey aims to bridge this gap by first providing an overview of FA, elucidating key concepts, and discussing its relationship with similar concepts. We then thoroughly examine FA, including its key challenges, taxonomy, and enabling techniques. Diverse FA applications, including statistical metrics, frequency-related applications, database query operations, FL-assisting FA tasks, and other wireless network applications are then carefully reviewed. We complete the survey with several open research issues, future directions, and a comprehensive lessons learned part. This survey intends to provide a holistic understanding of the emerging FA techniques and foster the continued evolution of privacy-preserving distributed data processing in the emerging networked society.

cs.DC

Autothrottle: A Practical Bi-Level Approach to Resource Management for SLO-Targeted Microservices

Achieving resource efficiency while preserving end-user experience is non-trivial for cloud application operators. As cloud applications progressively adopt microservices, resource managers are faced with two distinct levels of system behavior: end-to-end application latency and per-service resource usage. Translating between the two levels, however, is challenging because user requests traverse heterogeneous services that collectively (but unevenly) contribute to the end-to-end latency. We present Autothrottle, a bi-level resource management framework for microservices with latency SLOs (service-level objectives). It architecturally decouples application SLO feedback from service resource control, and bridges them through the notion of performance targets. Specifically, an application-wide learning-based controller is employed to periodically set performance targets -- expressed as CPU throttle ratios -- for per-service heuristic controllers to attain. We evaluate Autothrottle on three microservice applications, with workload traces from production scenarios. Results show superior CPU savings, up to 26.21% over the best-performing baseline and up to 93.84% over all baselines.

cs.DC

DPBalance: Efficient and Fair Privacy Budget Scheduling for Federated Learning as a Service

Federated learning (FL) has emerged as a prevalent distributed machine learning scheme that enables collaborative model training without aggregating raw data. Cloud service providers further embrace Federated Learning as a Service (FLaaS), allowing data analysts to execute their FL training pipelines over differentially-protected data. Due to the intrinsic properties of differential privacy, the enforced privacy level on data blocks can be viewed as a privacy budget that requires careful scheduling to cater to diverse training pipelines. Existing privacy budget scheduling studies prioritize either efficiency or fairness individually. In this paper, we propose DPBalance, a novel privacy budget scheduling mechanism that jointly optimizes both efficiency and fairness. We first develop a comprehensive utility function incorporating data analyst-level dominant shares and FL-specific performance metrics. A sequential allocation mechanism is then designed using the Lagrange multiplier method and effective greedy heuristics. We theoretically prove that DPBalance satisfies Pareto Efficiency, Sharing Incentive, Envy-Freeness, and Weak Strategy Proofness. We also theoretically prove the existence of a fairness-efficiency tradeoff in privacy budgeting. Extensive experiments demonstrate that DPBalance outperforms state-of-the-art solutions, achieving an average efficiency improvement of $1.44\times \sim 3.49 \times$, and an average fairness improvement of $1.37\times \sim 24.32 \times$.

cs.DC

Federated Analytics-Empowered Frequent Pattern Mining for Decentralized Web 3.0 Applications

The emerging Web 3.0 paradigm aims to decentralize existing web services, enabling desirable properties such as transparency, incentives, and privacy preservation. However, current Web 3.0 applications supported by blockchain infrastructure still cannot support complex data analytics tasks in a scalable and privacy-preserving way. This paper introduces the emerging federated analytics (FA) paradigm into the realm of Web 3.0 services, enabling data to stay local while still contributing to complex web analytics tasks in a privacy-preserving way. We propose FedWeb, a tailored FA design for important frequent pattern mining tasks in Web 3.0. FedWeb remarkably reduces the number of required participating data owners to support privacy-preserving Web 3.0 data analytics based on a novel distributed differential privacy technique. The correctness of mining results is guaranteed by a theoretically rigid candidate filtering scheme based on Hoeffding's inequality and Chebychev's inequality. Two response budget saving solutions are proposed to further reduce participating data owners. Experiments on three representative Web 3.0 scenarios show that FedWeb can improve data utility by ~25.3% and reduce the participating data owners by ~98.4%.

cs.DC

Weak averaging principle for multiscale stochastic dynamical systems driven by stable processes

We study the averaging principle for a family of multiscale stochastic dynamical systems. The fast and slow components of the systems are driven by two independent stable Lévy noises, whose stable indexes may be different. The homogenizing index $r_0$ of slow components has a relation with the stable index $α_1$ of the noise of fast components given by $0<r_0<2-2/{α_1}$. By first studying a nonlocal Poisson equation and then constructing suitable correctors, we obtain that the slow components weakly converge to a Lévy process as the scale parameter goes to zero.

math.DS

Non-Markovianity in photosynthetic reaction centers: A noise-induced quantum coherence perspective

The long-standing problem of nearly perfect photosynthetic yield in some types of bacteria and nearly all kinds of plants despite the interaction with a hot and noisy environment has witnessed quantum optical explanations in the last decade or so. Typically in these explanations, photosynthetic reaction centers are modeled as five-level quantum heat engines where the generation of Fano-type interference due to the coupling of discrete state transitions with a common Markovian reservoir is held responsible for the enhancement of the photosynthetic efficiency. In this work, we go beyond the Born-Markov approximation used in the earlier works and study the impact of non-Markovian environments with Lorentzian spectral densities on the dynamics of light-harvesting complexes.

quant-ph

Simultaneously Enhanced Tenacity, Rupture Work, and Thermal Conductivity of Carbon Nanotubes Fibers by Increasing the Effective Tube Contribution

Although individual carbon nanotubes (CNTs) are superior as constituents to polymer chains, the mechanical and thermal properties of CNT fibers (CNTFs) remain inferior to commercial synthetic fibers due to the lack of synthesis methods to embed CNTs effectively in superstructures. The application of conventional techniques for mechanical enhancement resulted in a mild improvement of target properties while achieving parity at best on others. In this work, a Double-Drawing technique is developed to deform continuously grown CNTFs and rearrange the constituent CNTs in both mesoscale and nanoscale morphology. Consequently, the mechanical and thermal properties of the resulting CNTFs can be jointly improved, and simultaneously reach their highest performances with specific strength (tenacity) $\rm\sim3.30\,N\,tex^{-1}$, work of rupture $\rm\sim70\,J\,g^{-1}$, and thermal conductivity $\rm\sim354\,W\,m^{-1}\,K^{-1}$, despite starting from commercial low-crystallinity materials ($I{\rm_G}:I{\rm_D}\sim5$). The processed CNTFs are more versatile than comparable carbon fiber, Zylon, Dyneema, and Kevlar. Furthermore, based on evidence of load transfer efficiency on individual CNTs measured with In-Situ Stretching Raman, we find the main contributors to property enhancements are (1) the increased proportion of load-bearing CNT bundles and (2) the extension of effective length of tubes attached on these bundles.

cond-mat.mtrl-sci

Bifurcation and chaotic behaviour in stochastic Rosenzweig-MacArthur prey-predator model with non-Gaussian stable Lévy noise

We perform dynamical analysis on a stochastic Rosenzweig-MacArthur model driven by α-stable Lévy motion. We analyze the existence of the equilibrium points, and provide a clear illustration of their stability. It is shown that the nonlinear model has at most three equilibrium points. If the coexistence equilibrium exists, it is asymptotically stable attracting all nearby trajectories. The phase portraits are drawn to gain useful insights into the dynamical underpinnings of prey-predator interaction. Specifically, we present a transcritical bifurcation curve at which system bifurcates. The stationary probability density is characterized by the non-local Fokker-Planck equation and confirmed by some numerical simulations. By applying Monte Carlo method and using statistical data, we plot a substantial number of simulated trajectories for stochastic system as parameter varies. For initial conditions that are arbitrarily close to the origin, parameter changes in noise terms can lead to significantly different future paths or trajectories with variations, which reflect chaotic behaviour in mutualistically interacting two-species prey-predator system subject to stochastic influence.

math.DS

Coherent Perfect Absorption in Tavis-Cummings Models

We theoretically study the conditions under which two laser fields can undergo Coherent Perfect Absorption (CPA) when shined on a single-mode bi-directional optical cavity coupled with two two- level quantum emitters (natural atoms, artificial atoms, quantum dots, qubits, etc.). In addition to being indirectly coupled through the cavity-mediated field, in our Tavis-Cummings model the two quantum emitters (QEs) are allowed to interact directly via the dipole-dipole interaction (DDI). Under the mean-field approximation and low-excitation assumption, in this work, we particularly focus on the impact of DDI on the existence of CPA in the presence of decoherence mechanisms (spontaneous emission from the QEs and the leakage of photons from the cavity walls). We also present a dressed-state analysis of the problem to discuss the underlying physics related to the allowed polariton state transitions in the Jaynes-Tavis-Cummings ladder. As a key result, we find that in the strong-coupling regime of cavity quantum electrodynamics, the strong DDI and the emitter-cavity detuning can act together to achieve the CPA at two laser frequencies tunable by the inter-atomic separation which are not possible to attain with a single QE in the presence of detuning. Our CPA results are potentially applicable in building quantum memories that are an essential component in long-distance quantum networking.

quant-ph

Homogenization of Dissipative Hamiltonian Systems under Lévy Fluctuations

This work is devoted to deriving small mass limiting equation for a class of Hamiltonian systems with multiplicative Lévy noise. Derivation of the limiting equation depends on the structure of the stochastic Hamiltonian systems, in which a noise-induced drift term arises. We prove convergence to the limiting equation in probability under appropriate assumptions on smoothness and boundedness. Furthermore, we demonstrate convergence in moment under stronger assumptions. A Lévy type Smoluchowski-Kramers approximation result is presented as an illustrative example.

math.PR