Search arXivSearch

arXiv · 2512.20177

NeuralCrop: Combining physics and machine learning for improved crop yield projections

Abstract

Global gridded crop models (GGCMs) are crucial to project the impacts of climate change on agricultural productivity and assess associated risks for food security. Despite decades of development, state-of-the-art GGCMs retain substantial uncertainties stemming from process representations. Recently, machine learning approaches trained on observational data provide alternatives in crop yield projections. However, these models have not demonstrated improved performance over traditional GGCMs and are not suitable for projecting crop yields under a changing climate due to their poor out-of-distribution generalization. Here we introduce NeuralCrop, a differentiable hybrid GGCM that combines the strengths of an advanced process-based GGCM, resolving important processes explicitly, with data-driven machine learning components. NeuralCrop is first trained to emulate a competitive GGCM before it is fine-tuned on observational data. We show that NeuralCrop produces projections with accuracy comparable to state-of-the-art GGCMs across site-level and large-scale crop simulations. NeuralCrop can accurately project the interannual yield variability in European wheat regions and the US Corn Belt. Capturing yield anomalies is essential for developing adaptation strategies in the context of climate change. NeuralCrop can more accurately reproduce yield anomalies across various climatic conditions, with particularly notable improvements under drought extremes. For large-scale, long-term simulations, our approach is orders of magnitude more computationally efficient. Our results show that end-to-end hybrid crop modelling offers more reliable yield projections that are essential for food risk assessments under climate change and intensifying extreme weather events.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yunan Lin, Sebastian Bathiany, Maha Badri, Maximilian Gelbrecht, Philipp Hess, Brian Groenke, Jens Heinke, Christoph Müller, Niklas Boers. 2026-03-30. NeuralCrop: Combining physics and machine learning for improved crop yield projections. https://arxiv.org/abs/2512.20177

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data

We study recursive regularized learning algorithms in the reproducing kernel Hilbert space (RKHS) with non-stationary online data streams. We introduce the concept of a random Tikhonov regularization path and decompose the tracking error of the algorithm's output for the regularization path into random difference equations in RKHS. We show that the tracking error vanishes in mean square and almost surely if the regularization path is slowly time-varying. Then, leveraging the monotonicity of inverse operators and the spectral decomposition of compact operators, and introducing the RKHS persistence of excitation condition, we develop a dominated convergence method to prove the mean square and almost sure consistency between the regularization path and the unknown function to be learned. Especially, for independent and non-identically distributed data streams, the mean square and almost sure consistency between the algorithm's output and the unknown function is achieved if the input data's marginal probability measures are slowly time-varying and the average measure over each fixed-length time period is uniformly above a strictly positive finite Borel measure.

cs.LG

Reflective Policy Optimization

On-policy reinforcement learning methods, like Trust Region Policy Optimization (TRPO) and Proximal Policy Optimization (PPO), often demand extensive data per update, leading to sample inefficiency. This paper introduces Reflective Policy Optimization (RPO), a novel on-policy extension that amalgamates past and future state-action information for policy optimization. This approach empowers the agent for introspection, allowing modifications to its actions within the current state. Theoretical analysis confirms that policy performance is monotonically improved and contracts the solution space, consequently expediting the convergence procedure. Empirical results demonstrate RPO's feasibility and efficacy in two reinforcement learning benchmarks, culminating in superior sample efficiency. The source code of this work is available at https://github.com/Edgargan/RPO.

cs.LG

Transductive Off-policy Proximal Policy Optimization

Proximal Policy Optimization (PPO) is a popular model-free reinforcement learning algorithm, esteemed for its simplicity and efficacy. However, due to its inherent on-policy nature, its proficiency in harnessing data from disparate policies is constrained. This paper introduces a novel off-policy extension to the original PPO method, christened Transductive Off-policy PPO (ToPPO). Herein, we provide theoretical justification for incorporating off-policy data in PPO training and prudent guidelines for its safe application. Our contribution includes a novel formulation of the policy improvement lower bound for prospective policies derived from off-policy data, accompanied by a computationally efficient mechanism to optimize this bound, underpinned by assurances of monotonic improvement. Comprehensive experimental results across six representative tasks underscore ToPPO's promising performance.

cs.LG