paper-with-me

홈 › Papers

Value-Based Deep RL Scales Predictably

2025-02-06 · Oleh Rybkin, Michal Nauman, Preston Fu, Charlie Snell, Pieter Abbeel, Sergey Levine, Aviral Kumar

Scaling data and compute is critical to the success of machine learning. However, scaling demands predictability: we want methods to not only perform well with more compute or data, but also have their performance be predictable from small-scale runs, without running the large-scale experiment. In this paper, we show that value-based off-policy RL methods are predictable despite community lore regarding their pathological behavior. First, we show that data and compute requirements to attain a given performance level lie on a Pareto frontier, controlled by the updates-to-data (UTD) ratio. By estimating this frontier, we can predict this data requirement when given more compute, and this compute requirement when given more data. Second, we determine the optimal allocation of a total resource budget across data and compute for a given performance and use it to determine hyperparameters that maximize performance for a given budget. Third, this scaling behavior is enabled by first estimating predictable relationships between hyperparameters, which is used to manage effects of overfitting and plasticity loss unique to RL. We validate our approach using three algorithms: SAC, BRO, and PQL on DeepMind Control, OpenAI gym, and IsaacGym, when extrapolating to higher levels of data, compute, budget, or performance.

📄 PDF Abstract BibTeX arXiv:2502.04327

Code (0)

등록된 구현이 없습니다.

Tasks

OpenAI Gym

Methods 이 논문이 사용한 방법론

Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
1x1 Convolution A 1 x 1 Convolution is a convolution with some special properties in that it can be used for dimensionality reduction,…
Global Average Pooling Global Average Pooling is a pooling operation designed to replace fully connected layers in classical CNNs. The idea is to generate one feature map for each corresponding…
Average Pooling 설명 없음
Dilated Convolution 설명 없음
SAC 설명 없음

Similar Papers 제목 키워드 기반

Evaluation Awareness Scales Predictably in Open-Weights Large Language Models

2025-09-10 · Maheep Chaudhary, Ian Su, Nikhil Hooda, Nishith Shankar 외 arxiv

Large language models (LLMs) can internally distinguish between evaluation and deployment contexts, a behaviour known as \emph{evaluation awareness}. This undermines AI safety evaluations, as models may conceal dangerous…

Eight Things to Know about Large Language Models

2023-04-02 · Samuel R. Bowman

The widespread public deployment of large language models (LLMs) in recent months has prompted a wave of new attention and engagement from advocates, policymakers, and scholars from many fields. This attention is a timel…

Retrieval Capabilities of Large Language Models Scale with Pretraining FLOPs

2025-08-24 · Jacob Portes, Connor Jennings, Erica Ji Yuen, Sasha Doubov 외 arxiv

How does retrieval performance scale with pretraining FLOPs? We benchmark retrieval performance across LLM model sizes from 125 million parameters to 7 billion parameters pretrained on datasets ranging from 1 billion tok…

Communication-Efficient Language Model Training Scales Reliably and Robustly: Scaling Laws for DiLoCo

2025-03-12 · Zachary Charles, Gabriel Teston, Lucio Dery, Keith Rush 외

As we scale to more massive machine learning models, the frequent synchronization demands inherent in data-parallel approaches create significant slowdowns, posing a critical challenge to further scaling. Recent work dev…

Language ModelingLanguage Modelling

Scaling Laws and Compute-Optimal Training Beyond Fixed Training Durations

2024-05-28 · Alexander Hägele, Elie Bakouch, Atli Kosson, Loubna Ben allal 외

Scale has become a main ingredient in obtaining strong machine learning models. As a result, understanding a model's scaling properties is key to effectively designing both the right training setup as well as future gene…

GPU