Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

265278104 · May 202619922001200920172026
48 results for Coordinated Workload Scheduling

Proposes a framework for energy-efficient AIGC workload scheduling in cloud data centers.

problem Challenges of scheduling AIGC workloads for energy efficiency and quality control.
method Joint energy management and coordinated AIGC workload scheduling framework with diffusion model-aided reward shaping.
result Effective learning of scheduling policies under sparse environmental feedback.

Efficiently scheduling data processing jobs on distributed compute clusters requires complex algorithms. Current systems, however, use simple generalized heuristics and ignore workload characteristics, since developing and tuning a scheduling policy for each workload is infeasible. In this paper, we show that modern ma…

2018-10-03abs ↗pdf ↗

We improve private training accuracy with learning rate schedules and matrix factorizations.

problem Private training with learning rate schedules and correlated noise.
method General upper and lower bounds for learning rate schedules, memory-efficient constructions, and schedule-aware factorizations.
result Schedule-aware factorizations improve accuracy in private training.

Sequence-to-sequence models predict resource usage for co-scheduled jobs in data centers.

problem Challenges in co-scheduling jobs due to resource interference and inefficiencies.
method Sequence-to-sequence models based on recurrent neural networks for workload interference prediction.
result Models accurately forecast resource usage trends from job profiles, improving scheduling decisions.

Training large machine learning (ML) models with many variables or parameters can take a long time if one employs sequential procedures even with stochastic updates. A natural solution is to turn to distributed computing on a cluster; however, naive, unstructured parallelization of ML algorithms does not usually lead t…

2013-12-19abs ↗pdf ↗

More and more companies have deployed machine learning (ML) clusters, where deep learning (DL) models are trained for providing various AI-driven services. Efficient resource scheduling is essential for maximal utilization of expensive DL clusters. Existing cluster schedulers either are agnostic to ML workload characte…

2019-09-13abs ↗pdf ↗

SOOTT framework optimizes target tracking with robust and learning-augmented algorithms.

problem Optimizing target tracking in dynamic environments with adversarial perturbations.
method Integrates robust and learning-augmented algorithms for online decision-making.
result CoRT learning-augmented algorithm strictly improves over robust BEST when predictions are accurate.

AlgoPerf competition evaluates neural network training speed-ups.

problem Improving neural network training speed using better algorithms.
method Compared 18 diverse submissions from 10 teams on multiple workloads.
result Schedule Free AdamW algorithm achieved best results in self-tuning ruleset.

FLAME auto-labels mobile data efficiently on diverse processors.

problem Accurately and efficiently labeling mobile data with unknown labels on heterogeneous processors.
method Self-adaptive auto-labeling system Flame that schedules and executes workloads on mobile processors.
result Flame achieves high labeling accuracy and performance on heterogeneous mobile processors.

The paper optimizes LLM inference systems through queueing theory.

problem Efficient LLM inference for AI agents under various routing topologies.
method Developed a fluid-limit framework for multi-class batched processing networks under K-FCFS scheduling.
result Proved that work-conserving scheduling algorithms maximize throughput for LLM inference.

Service-induced congestion in memory-constrained LLM serving

problem Service-induced congestion in memory-constrained large language model (LLM) serving
method Developing a discrete-time dynamical model of memory-constrained LLM inference
result The system converges to a unique worst-case limit cycle that is asymptotically stable outside a Lebesgue-measure-zero exact-capture set, with throughput losses as large as 50%.

This paper tackles computational bottlenecks in federated learning on mobile devices.

problem Computationally heterogeneous mobile devices hinder federated learning efficiency.
method Proposes efficient algorithms to schedule mobile devices based on data heterogeneity.
result Achieves up to 100x speedup and 7% accuracy gain in federated learning.

GPA improves LLM training speed by 8.71% for Llama-160M models.

problem Training Large Language Models (LLMs) with high memory overhead and slow convergence.
method Generalized Primal Averaging (GPA) extends Nesterov's method to eliminate memory-intensive two-loop structure.
result GPA achieves up to 10.13% speedup over AdamW in training Llama-1B model.

Developing reliable workload predictive models can affect many aspects of clinical decision making procedure. The primary challenge in healthcare systems is handling the demand uncertainty over the time. This issue becomes more critical for the healthcare facilities that provide service for chronic disease treatment be…

2018-12-27abs ↗pdf ↗

AI agents on social networks rarely engage in extended conversations.

problem Understanding the persistence of interactions in AI-agent social networks.
method Analysis of Moltbook, a social network of AI agents, using interaction half-life and spectral tests.
result Most comments on Moltbook receive a direct reply within seconds, indicating a ``fast response or silence'' regime.

Smart grid uses deep learning to optimize household energy use.

problem Optimizing household energy use under real-time pricing schemes.
method Multi-agent deep actor-critic learning for decentralized agents with partial observability.
result Deep reinforcement learning reduces peak-to-average energy consumption and costs.

Critical task and cognition-based environments, such as in military and defense operations, aviation user-technology interaction evaluation on UI, understanding intuitiveness of a hardware model or software toolkit, etc. require an assessment of how much a particular task is generating mental workload on a user. This i…

2019-11-07abs ↗pdf ↗

Paper proposes a human-algorithm approach to reduce medical device recall risk and workload.

problem High recall rate and regulatory workload in FDA's 510(k) pathway.
method Developed machine learning models to estimate recall risk and proposed a data-driven clearance policy.
result Conservative evaluation of policy shows a 32.9% improvement in recall rate and 40.5% reduction in workload.

Risk management in dynamic decision problems is a primary concern in many fields, including financial investment, autonomous driving, and healthcare. The mean-variance function is one of the most widely used objective functions in risk management due to its simplicity and interpretability. Existing algorithms for mean-…

2018-09-07abs ↗pdf ↗

This paper proposes a method to select project schedules with the lowest risk.

problem Selecting schedules that meet project deadlines while minimizing risk.
method Integrating aleatory uncertainty into project scheduling to quantify and compare risks.
result Proposes a method to select schedules with the lowest risk.

ScheduleFree+ improves large language model training without schedules or learning rates.

problem Scaling up Schedule-Free Learning to large language models.
method Learning-rate-free and schedule-free method for training large language models.
result ScheduleFree+ outperforms SOTA schedules by 31% at 1000 tokens per parameter.

The paper optimizes interpolation schedules in generative models to improve sampling accuracy.

problem Improving sampling accuracy in generative models with fewer resources.
method Minimizing the averaged squared Lipschitzness of the drift field, using transfer formulas.
result Designed schedules yield more accurate fine-scale statistics at fixed integrator budget.

New method converts and optimizes sampling schedules for generative models.

problem Optimizing sampling schedules for generative models like flows and diffusions.
method Unified framework for stochastic interpolants, including point mass schedules.
result Demonstrated efficient generation of images with fewer steps.

AIHT improves online high-dimensional quantile regression by separating support discovery and refinement.

problem Online high-dimensional quantile regression with structural sparsity.
method Adaptive Iterative Hard Thresholding (AIHT) alternates stochastic updates with adaptive hard-thresholding steps.
result AIHT achieves logarithmic regret for the sliding-window objective in high-dimensional settings.

This paper proposes a system-agnostic policy for dynamic scheduling.

problem Dynamic scheduling in changing systems is challenging due to system-specific optimal policies.
method Descriptive policy that learns a system-agnostic scheduling principle.
result System-agnostic meta-learning enables adaptation to unseen system characteristics.

The paper presents a multi-power law for predicting loss curves across different learning rate schedules.

problem Understanding and optimizing the relationship between model performance and hyperparameters, especially learning rates.
method Proposes a multi-power law that combines power laws based on the sum of learning rates and additional laws for loss reduction due to decay.
result The multi-power law accurately predicts loss curves for unseen learning rate schedules and finds a schedule that outperforms cosine learning rate.

Preserving the privacy of individuals by protecting their sensitive attributes is an important consideration during microdata release. However, it is equally important to preserve the quality or utility of the data for at least some targeted workloads. We propose a novel framework for privacy preservation based on the …

2017-11-05abs ↗pdf ↗

Optimal learning rate schedules for SGD in changing data distributions.

problem Minimizing regret in online learning with changing data distributions.
method Characterized optimal schedules for linear regression, proposed schedules for general convex and non-convex losses, and defined a notion of regret for non-convex losses.
result Upper and lower bounds for regret with constants for convex losses, and an upper bound on total expected regret for non-convex losses.

Simple policy outperforms complex ones in cloud auto-scaling.

problem Predicting resource scaling for large-scale cloud applications with limited deployment throughput.
method Probabilistic workload forecast for auto-scaling decisions based on risk aversion.
result The proposed policy outperforms sophisticated and simple benchmark policies in real-world and synthetic data.

The virtualization of compute and network resources enables an unseen flexibility for deploying network services. A wide spectrum of emerging technologies allows an ever-growing range of orchestration possibilities in cloud-based environments. But in this context it remains challenging to rhyme dynamic cloud configurat…

2019-11-18abs ↗pdf ↗