Pith. sign in

RAIN: Reinforcement Algorithms for Improving Numerical Weather and Climate Models

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

This study explores integrating reinforcement learning (RL) with idealised climate models to address key parameterisation challenges in climate science. Current climate models rely on complex mathematical parameterisations to represent sub-grid scale processes, which can introduce substantial uncertainties. RL offers capabilities to enhance these parameterisation schemes, including direct interaction, handling sparse or delayed feedback, continuous online learning, and long-term optimisation. We evaluate the performance of eight RL algorithms on two idealised environments: one for temperature bias correction, another for radiative-convective equilibrium (RCE) imitating real-world computational constraints. Results show different RL approaches excel in different climate scenarios with exploration algorithms performing better in bias correction, while exploitation algorithms proving more effective for RCE. These findings support the potential of RL-based parameterisation schemes to be integrated into global climate models, improving accuracy and efficiency in capturing complex climate dynamics. Overall, this work represents an important first step towards leveraging RL to enhance climate model accuracy, critical for improving climate understanding and predictions. Code accessible at https://github.com/p3jitnath/climate-rl.

citation-role summary

other 1

citation-polarity summary

fields

cs.LG 1

years

2025 1

verdicts

CONDITIONAL 1

roles

other 1

polarities

unclear 1

representative citing papers

Mistake-bounded online learning with operation caps

cs.LG · 2025-09-04 · conditional · novelty 7.0

The paper proves opt_ag,weak(F, eta) = O((k ln k) opt_std(F) + k eta), matching the known lower bound, and develops a new operation-caps model for mistake-bounded online learning.

citing papers explorer

Showing 1 of 1 citing paper.

  • Mistake-bounded online learning with operation caps cs.LG · 2025-09-04 · conditional · none · ref 28 · internal anchor

    The paper proves opt_ag,weak(F, eta) = O((k ln k) opt_std(F) + k eta), matching the known lower bound, and develops a new operation-caps model for mistake-bounded online learning.