SearcharxivSearch

arXiv subjects

Yinan Ni

Publications and source records attributed to Yinan Ni.

5 recordsLinked to original sources

Graph-Structured Deep Learning Framework for Multi-task Contention Identification with High-dimensional Metrics

This study addresses the challenge of accurately identifying multi-task contention types in high-dimensional system environments and proposes a unified contention classification framework that integrates representation transformation, structural modeling, and a task decoupling mechanism. The method first constructs system state representations from high-dimensional metric sequences, applies nonlinear transformations to extract cross-dimensional dynamic features, and integrates multiple source information such as resource utilization, scheduling behavior, and task load variations within a shared representation space. It then introduces a graph-based modeling mechanism to capture latent dependencies among metrics, allowing the model to learn competitive propagation patterns and structural interference across resource links. On this basis, task-specific mapping structures are designed to model the differences among contention types and enhance the classifier's ability to distinguish multiple contention patterns. To achieve stable performance, the method employs an adaptive multi-task loss weighting strategy that balances shared feature learning with task-specific feature extraction and generates final contention predictions through a standardized inference process. Experiments conducted on a public system trace dataset demonstrate advantages in accuracy, recall, precision, and F1, and sensitivity analyses on batch size, training sample scale, and metric dimensionality further confirm the model's stability and applicability. The study shows that structured representations and multi-task classification based on high-dimensional metrics can significantly improve contention pattern recognition and offer a reliable technical approach for performance management in complex computing environments.

cs.DC

Predictive-LoRA: A Proactive and Fragmentation-Aware Serverless Inference System for LLMs

The serverless computing paradigm offers compelling advantages for deploying Large Language Model (LLM) inference services, including elastic scaling and pay-per-use billing. However, serving multiple fine-tuned LLMs via Low-Rank Adaptation (LoRA) in serverless environments faces critical challenges: reactive adapter loading causes significant cold start latency, and frequent adapter swapping leads to severe GPU memory fragmentation. In this paper, we present Predictive-LoRA (P-LoRA), a proactive and fragmentation-aware serverless inference system for LoRA-based LLMs. P-LoRA introduces two key innovations: (1) a lightweight LSTM-based traffic predictor that forecasts adapter demand and proactively prefetches hot adapters from host memory to GPU, reducing cold start latency by up to 68%; and (2) a page-based adapter memory management mechanism inspired by operating system virtual memory, which keeps GPU memory utilization above 87% even under heterogeneous adapter ranks. We evaluate P-LoRA using production-like workloads derived from the Azure Functions trace. Experimental results demonstrate that P-LoRA achieves 1.52x higher throughput than S-LoRA while reducing the average Time-To-First-Token (TTFT) by 35% under high concurrency scenarios.

cs.DC

Time-changed Stochastic Control Problem and its Maximum Principle Theory

This paper studies a time-changed stochastic control problem, where the underlying stochastic process is a Lévy noise time-changed by an inverse subordinator. We establish a maximum principle theory for the time-changed stochastic control problem. We also prove the existence and uniqueness of the corresponding time-changed backward stochastic differential equation involved in the stochastic control problem. Some examples are provided for illustration.

math.PR

Path stability of the solution of stochastic differential equation driven by time-changed Lévy noises

This paper studies path stabilities of the solution to stochastic differential equations (SDE) driven by time-changed Lévy noise. The conditions for the solution of time-changed SDE to be path stable and exponentially path stable are given. Moreover, we reveal the important role of the time drift in determining the path stability properties of the solution. Related examples are provided.

math.PR

Stability of stochastic differential equation driven by time-changed Lévy noise

This paper studies stabilities of stochastic differential equation (SDE) driven by time-changed Lévy noise in both probability and moment sense. This provides more flexibility in modeling schemes in application areas including physics, biology, engineering, finance and hydrology. Necessary conditions for solution of time-changed SDE to be stable in different senses will be established. Connection between stability of solution to time-changed SDE and that to corresponding original SDE will be disclosed. Examples related to different stabilities will be given. We study SDEs with time-changed Lévy noise, where the time-change processes are inverse of general Lévy subordinators. These results are important improvements of the results in "Q. Wu, Stability of stochastic differential equation with respect to time-changed Brownian motion, 2016.".

math.PR