Smarter Preloading Cuts Wasted Data in Short Video Streaming

Short video platforms have become one of the most data-hungry services on the modern internet, with billions of clips swiped through every day on apps that autoplay one video after another in an endless recommended queue. Behind that seemingly effortless scrolling experience lies a difficult engineering problem: the application must decide, moment by moment, which upcoming videos to download in advance and at what quality, without knowing what the user will do next or how much network bandwidth will be available. A new study published in Mobile Networks and Applications by Zhicheng Zhao and Weihua Cao of the China University of Geosciences in Wuhan tackles this problem head-on, proposing a preload framework built on multi-stage stochastic programming that promises to improve streaming quality while dramatically cutting the amount of mobile data that is downloaded and then thrown away.

The core tension the researchers identify is familiar to anyone who has designed a streaming system. To keep viewers from staring at a spinning loading icon, short video apps maintain a playback buffer and preload videos from the recommended queue whenever bandwidth is plentiful. If the network suddenly slows, the buffer saves the session, allowing playback to continue seamlessly while the connection recovers. But short video viewing has a peculiar characteristic that the authors call early departure behavior: users frequently swipe away after watching only a few seconds of a clip, often long before the preloaded content has been consumed. Every megabyte downloaded for a video the user abandons is pure waste, and on metered mobile connections that waste translates directly into cost for users and unnecessary load for networks.

Existing approaches struggle to balance these competing demands. Aggressive preloading strategies maximize Quality of Experience, commonly abbreviated QoE, by ensuring that the next video is always ready to play at high quality, but they suffer high wastage rates when users depart early. Conservative strategies conserve data but risk rebuffering, the momentary freeze that research has repeatedly shown to be one of the strongest drivers of viewer frustration and abandonment. Prior methods, including adaptive bitrate algorithms such as BOLA, FESTIVE and Pensieve, and probability-driven or reinforcement-learning-based preload schemes developed specifically for short video services, have each addressed parts of this trade-off, yet the authors argue that none fully accounts for the layered uncertainty of the problem: bandwidth fluctuates unpredictably, user watch duration is stochastic, and decisions made now shape the options available later.

The key insight of the new framework is to treat preloading not as a sequence of independent choices but as a multi-stage stochastic optimization problem, a class of decision-making models long used in fields such as energy planning where today’s commitments must be made under uncertainty about tomorrow’s conditions. In this formulation, each stage corresponds to a decision point during the streaming session, and the uncertain quantities are the available bandwidth and the user’s behavior, including how long they are likely to keep watching the current clip and whether they will proceed to the next one. The framework decomposes into three cooperating components: a bandwidth prediction module, a buffer threshold mechanism, and the preload decision engine itself.

What distinguishes the approach mathematically is how it values a decision. The revenue of any preload action is split into two parts: an immediate decision revenue, which captures the QoE benefit of having the right content in the buffer right now, and a future state value, which estimates how the current choice will affect the system’s position in later stages. The immediate component is estimated by predicting user behavior, drawing on the observation that watch duration distributions in short video apps can be learned from viewing patterns. The future component is the harder part, because it requires knowing the expected value of being in a particular buffer and bandwidth state at the next stage, a quantity that is generally intractable to compute exactly for realistic problems.

To make the future state value tractable, the authors turn to techniques from stochastic dual dynamic programming, a family of methods developed for high-dimensional multistage stochastic programs. Rather than representing the value function exactly, the method solves a series of subproblems, one at each stage, and each solution contributes a fitted hyperplane, an affine function that approximates the value function in the neighborhood of the state visited. As the session progresses and more subproblems are solved, these affine functions accumulate into a piecewise-linear approximation of the expected future value. When a preload decision must be made, the framework evaluates the expected state value by solving these affine functions, and the combination of immediate revenue and approximated future value determines the optimal loading sequence and the bitrate at which each candidate video should be fetched.

This architecture has a natural interpretation: the system essentially asks, for each video in the recommended queue, whether downloading it now at a given quality yields enough immediate benefit and preserves enough future flexibility to justify the bandwidth it consumes. A clip that the user is very likely to watch in full deserves a high-bitrate preload when bandwidth is abundant, while a clip that will probably be swiped past in three seconds may be worth fetching only at low quality, or not at all, with the saved capacity reserved for content the user is more likely to enjoy. The buffer threshold component modulates this behavior, triggering more aggressive preloading only when the playback buffer falls below levels that would endanger smooth playback.

The experimental evaluation compared the proposed framework against several common baseline algorithms drawn from the adaptive streaming and short video preload literature, using established methodologies in the field, including datasets and challenge settings associated with short video streaming research such as the ACM Multimedia 2022 Short-Video Streaming Challenge and the fully observed KuaiRec recommendation dataset. The reported results show that the framework significantly reduces bandwidth waste while simultaneously improving QoE, a combination that previous methods had found difficult to achieve because the two objectives tend to pull in opposite directions. By explicitly modeling the future consequences of present decisions, the stochastic programming approach avoids the myopic over-downloading that inflates wastage in greedy strategies and the excessive caution that produces rebuffering in conservative ones.

The significance of the work extends beyond the immediate application. Short video traffic now constitutes a dominant share of mobile network load in many markets, and operators as well as platform providers have strong incentives to trim redundant transfers. A framework that quantifies the expected value of every megabyte, conditional on predicted user behavior and forecast bandwidth, offers a principled alternative to heuristic rules of thumb. The underlying machinery, multistage stochastic programming with fitted value function approximations, is also modular: better bandwidth predictors or richer user behavior models can be plugged in to sharpen the immediate revenue estimates, and the affine approximation scheme can scale to longer recommendation queues.

There remain practical questions that the study’s scope does not fully resolve, including how the framework performs under highly volatile network conditions, how sensitive its predictions are to shifts in user behavior over time, and what computational overhead the repeated subproblem solving adds on resource-constrained mobile devices. The authors declare no competing interests, and the work was carried out at the School of Automation and affiliated laboratories of the China University of Geosciences in Wuhan. Still, the study marks a notable convergence of two research traditions that rarely meet: the operations research toolkit of stochastic optimization, refined over decades in energy and logistics planning, and the fast-moving world of mobile multimedia systems, where user attention is fleeting and every wasted byte counts. If the approach proves robust in deployment, the invisible mathematics of affine value functions may soon be quietly deciding what your phone downloads the instant your thumb begins its next swipe.

Subject of Research: QoE-aware short video preloading using multi-stage stochastic programming

Article Title: A QoE-Aware Short Video Preload Framework Based on Multi-Stage Stochastic Programming

Article References: Zhao, Z., & Cao, W. (2026). A QoE-Aware Short Video Preload Framework Based on Multi-Stage Stochastic Programming. Mobile Networks and Applications. https://doi.org/10.1007/s11036-026-02527-3

Image Credits: AI Generated

DOI: 10.1007/s11036-026-02527-3

Keywords: short video streaming, Quality of Experience, preloading, multi-stage stochastic programming, stochastic dual dynamic programming, bandwidth prediction, adaptive bitrate, rebuffering, mobile networks, data wastage, optimization, user behavior prediction