pith. sign in

arxiv: 2202.06626 · v1 · pith:J47I57JGnew · submitted 2022-02-14 · 📡 eess.IV · cs.CV· cs.LG

MuZero with Self-competition for Rate Control in VP9 Video Compression

classification 📡 eess.IV cs.CVcs.LG
keywords videocompressioncontrolrateconstraintqualityconstrainedlibvpx
0
0 comments X
read the original abstract

Video streaming usage has seen a significant rise as entertainment, education, and business increasingly rely on online video. Optimizing video compression has the potential to increase access and quality of content to users, and reduce energy use and costs overall. In this paper, we present an application of the MuZero algorithm to the challenge of video compression. Specifically, we target the problem of learning a rate control policy to select the quantization parameters (QP) in the encoding process of libvpx, an open source VP9 video compression library widely used by popular video-on-demand (VOD) services. We treat this as a sequential decision making problem to maximize the video quality with an episodic constraint imposed by the target bitrate. Notably, we introduce a novel self-competition based reward mechanism to solve constrained RL with variable constraint satisfaction difficulty, which is challenging for existing constrained RL methods. We demonstrate that the MuZero-based rate control achieves an average 6.28% reduction in size of the compressed videos for the same delivered video quality level (measured as PSNR BD-rate) compared to libvpx's two-pass VBR rate control policy, while having better constraint satisfaction behavior.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. PMCTS: Particle Monte Carlo Tree Search for Principled Parallelized Inference Time Scaling

    cs.LG 2026-05 unverdicted novelty 7.0

    PMCTS is the first principled parallel MCTS algorithm that preserves formal policy improvement guarantees and scales with parallel compute.

  2. PMCTS: Particle Monte Carlo Tree Search for Principled Parallelized Inference Time Scaling

    cs.LG 2026-05 unverdicted novelty 7.0

    PMCTS is a new parallel MCTS variant that preserves formal policy improvement guarantees and scales with parallel compute, outperforming heuristic baselines in tested domains.