Skip to content
Book Open access

PINCH: Predictive Importance-Sampling-Informed Cache for I/O-Bound DNN Training

Sep 2026 · Proceedings of the International Conference on Parallel Processing · 0 citations · 30 references

TL;DR

Pinch, a cache middleware that decouples clairvoyant and importance sampling at the granularity of a planning horizon, enabling planned cache retention and bounded prefetch on DNN training on large datasets.

Abstract

DNN training on large datasets is often bottlenecked by data I/O rather than GPU computation. Shuffled SGD destroys temporal locality, rendering conventional caching and prefetching ineffective. Two classes of system address this: clairvoyant caches that exploit the deterministic access trace of seeded shuffling to plan storage proactively, and importance-aware caches that direct resources toward high-value samples. No system combines both because they impose contradictory requirements: clairvoyant planning needs a fixed training set for trace predictability, while importance sampling needs a dynamic subset that adapts to evolving sample scores. We propose PINCH, a cache middleware that decouples the two at the granularity of a planning horizon. At each horizon boundary PINCH re-selects the training subset using importance and stability signals; within the horizon the subset is fixed and the trace is deterministic, enabling planned cache retention and bounded prefetch. Evaluation shows that PINCH achieves up to 12.2 × training speedup over a no-cache baseline, outperforming both clairvoyant-only and importance-only baselines at every operating point.

Read PDF

Similar papers

#machine learning Preprint Sep 2026

Mira: Memory-Efficient MoE Inference Using Adaptive Caching and Predictive Expert Staging

Mixture-of-Experts (MoE) models are a compelling architecture for scaling model capacity, making them especially attractive for deployment on resource-constrained, single-GPU systems. However, this benefit is difficult to realize because expert parameters dominate memory, and token-level routing is dynamic, unpredictab...

Sanjali Yadav, Bahar Asgari · 0 citations
Book Open access Sep 2026

BASIC-Prefetcher: Bin-based Address and Size-Informed Caching for AI-Driven SSD Workloads

The BASIC Prefetcher is proposed, which recovers application-level I/O patterns by classifying requests into size-based bins and modeling temporal bin transitions with a lightweight Markov-chain framework and achieves up to 89% prediction accuracy on sequential workloads and 70% on highly random workloads, including AI...

Han Jang, Dongjun Lee, Youngbin Jin et al. · 0 citations
#large language models Book Open access Aug 2026

NeuroPrefetcher: Storage-Aware Sparse LLM Inference via Delta Prefetching

NeuroPrefetcher is presented, a storage-backed LLM inference system that exploits that MLP activity during autoregressive decoding has strong temporal locality, and achieves 7.9-12.0x speedup over llama.cpp across constrained memory budgets.

Nobel Dhar, Md Romyull Islam, Xue-Chen Zhang et al. · 0 citations
#artificial intelligence Preprint Sep 2026

SeqMoE: Toward Full-Load Performance via Predictive and Graph-Compatible MoE Offloading

This work is the first to recast expert activation prediction as sequence modeling, enabling accurate multi-step, multi-layer forecasts that provide a long and reliable window for downstream decisions, and derives general runtime principles encompassing compute-transparent expert placement and synchronization-free orch...

Zi-Han Wang, Yu-Qi Wang, Lei Gong et al. · 0 citations
#machine learning Preprint Sep 2026

TierKV: Long-Context On-Device LLMs via Predictive Multi-Tier KV Caching

TierKV is presented, a mobile LLM inference framework built on Predictive Multi-Tier Cache Optimization (PMCO), which improves prefill throughput by up to 17.6x over existing mobile LLM frameworks, reduces RAM-resident KV cache by 12.5-34%, thereby enabling substantially longer contexts under the same memory budget, wh...

Zhi-Hao Shu, Md Musfiqur Rahman Sanim, Jie Hu et al. · 0 citations
#artificial intelligence Preprint Sep 2026

KV-Kaizen: Learning Context-Adaptive Cache Compression Choices

This work learns a selector that is able to produce, based on context, a per-layer cache configuration towards an overall compression budget, and achieves the Pareto frontier of accuracy against cache size, against learning-free and post-hoc baselines.

João Monteiro, Louis Béthune, A. Filippova et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.