Progressive Generalization Augmentation with Deeply Coupled RND-PPO and Domain-Prioritized Noise Injection for Robust Crop Management Reinforcement Learning

• URL: http://arxiv.org/abs/2605.17428v1
• Date: Sun, 17 May 2026 12:48:47 GMT
• Title: Progressive Generalization Augmentation with Deeply Coupled RND-PPO and Domain-Prioritized Noise Injection for Robust Crop Management Reinforcement Learning
• Abstract summary: This paper tackles three limitations impeding practical deployment of agricultural RL systems.<n>We introduce three systematic innovations: Progressive Generalization Augmentation (PGA) implementing a three-phase curriculum; a deeply coupled RND-PPO architecture with dual-channel GAE normalization, progress-decayed intrinsic coefficients, and semantic discretization; and domain-prioritized noise injection with hierarchical activation.
• Score: 3.0094301461257476
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Our preliminary experiments on gym-DSSAT maize irrigation tasks revealed that +/-2 degrees C temperature noise causes an 11.9% reduction in economic returns for PPO policies trained under clean conditions - a systematic robustness deficit that existing research has not adequately addressed. This paper tackles three interconnected limitations impeding practical deployment of agricultural RL systems: the trade-off between early-stage learning efficiency and late-stage generalization capability; the naive additive combination of intrinsic and extrinsic rewards in exploration-augmented PPO; and uniform measurement noise injection strategies that disregard empirically validated differential sensitivity across agricultural state variables. We introduce three systematic innovations: Progressive Generalization Augmentation (PGA) implementing a three-phase curriculum (clean training 0-800 episodes, progressive 800-1200, full augmentation 1200-2000); a deeply coupled RND-PPO architecture with dual-channel GAE normalization, progress-decayed intrinsic coefficients, and semantic discretization; and domain-prioritized noise injection with hierarchical activation. Our experimental evaluation demonstrates: 8.43% yield improvement and 16.42% nitrogen use efficiency improvement over SOTA BERT-DQN in Florida; 5.61% yield improvement in Zaragoza (though 3.67% lower economic score due to challenging Mediterranean climate); and 94.4% vs 80.0% performance retention under combined perturbations. All experiments used 5 random seeds on NVIDIA A100 GPUs with 4.2+/-0.3 hours per run (2000 episodes, 2048-step buffer, 64 mini-batch size).

Related papers

• Simulating the Marginal Green Contribution of AI Modules in a Smart-Agriculture Platform: Evidence from Two Monte Carlo Experiments [12.93848838655257]
  This paper makes the components explicit and runs two controlled simulation experiments.<n>Experiment 1 follows the chain from AI capability to farmer behavior to agrochemical input reduction.<n>Experiment 2 compares current practice (P0), IoT engineering retrofit (P1), and P1 plus AI irrigation scheduling.
  arXiv  Detail & Related papers  (2026-09-06T17:25:33Z)
• NeuroSynth: A Biologically Inspired Continual Reinforcement Learning Architecture for Mitigating Catastrophic Forgetting [0.0]
  Artificial Intelligence (AI) systems often perform well on isolated tasks but struggle under continual learning conditions.<n>This study introduces Neuro Synth, a brain-inspired continual reinforcement learning architecture designed to mitigate catastrophic forgetting.
  arXiv  Detail & Related papers  (2026-07-24T05:56:07Z)
• Hallucination Mitigation with Agentic AI, Nested Learning, and AI Sustainability via Semantic Caching [0.42970700836450487]
  This paper adapts a HOPE-inspired Nested Learning architecture with Continuum Memory Systems (CMS)<n>A three-stage agentic pipeline is evaluated with fiveaug -- FCDFactual Claim Density, FGR, THS (Total Hallucination Score) and OSR (Observability Score Ratio)<n>Semantic caching achieves 440 cache hits over 930 potential calls (47.3% hit rate), reducing LLM invocations to 490, lowering energy and CO2e footprint, and making multi-stage review pipelines operationally viable at production scale.
  arXiv  Detail & Related papers  (2026-05-27T20:01:08Z)
• MPCS: Neuroplastic Continual Learning via Multi-Component Plasticity and Topology-Aware EWC [0.0]
  We introduce MPCS, a neuroplastic architecture that integrates eleven complementary mechanisms.<n>We evaluate MPCS on MEP-BENCH, a benchmark spanning 31 tasks across regression, classification, logic, and mixed domains.
  arXiv  Detail & Related papers  (2026-05-04T12:04:09Z)
• Unifying Group-Relative and Self-Distillation Policy Optimization via Sample Routing [79.88256756334327]
  Self-Distillation Policy Optimization (SDPO) addresses this by providing denser, more targeted logit-level supervision.<n>We propose Sample-Routed Policy Optimization (SRPO)<n>SRPO routes correct samples to GRPO's reward-aligned reinforcement and failed samples to SDPO's targeted logit-level correction.
  arXiv  Detail & Related papers  (2026-04-02T17:29:18Z)
• DeFRiS: Silo-Cooperative IoT Applications Scheduling via Decentralized Federated Reinforcement Learning [62.347535250646196]
  This paper proposes DeFRiS, a Decentralized Federated Reinforcement Learning framework for robust and scalable Silo-cooperative IoT application scheduling.<n>DeFRiS integrates three innovations: (i) an action-space-agnostic policy utilizing candidate resource scoring to enable seamless knowledge transfer across heterogeneous silos; (ii) a silo-optimized local learning mechanism combining Generalized Advantage Estimation with clipped policy updates to resolve sparse delayed reward challenges; and (iii) a Dual-Track Non-IID robust decentralized aggregation protocol leveraging gradient fingerprints for similarity-aware knowledge transfer and anomaly detection.
  arXiv  Detail & Related papers  (2026-03-16T02:02:38Z)
• GDA-YOLO11: Amodal Instance Segmentation for Occlusion-Robust Robotic Fruit Harvesting [3.088218970976369]
  We propose a harvesting framework using a new amodal segmentation model, GDA-YOLO11, which incorporates architectural improvements and an updated asymmetric mask loss.<n>The framework attains harvesting success rates of 92.59%, 85.18%, 48.14%, and 22.22% at zero to high occlusion levels.
  arXiv  Detail & Related papers  (2026-02-27T11:56:33Z)
• NDRL: Cotton Irrigation and Nitrogen Application with Nested Dual-Agent Reinforcement Learning [30.1462125315719]
  We propose a Nested Dual-Agent Reinforcement Learning (NDRL) method to improve yield optimization.<n>The child agent's reward function incorporates quantified Water Stress Factor (WSF) and Nitrogen Stress Factor (NSF)<n> Experimental results demonstrate that, compared to the best baseline, the simulated yield increased by 4.7% in both 2023 and 2024.
  arXiv  Detail & Related papers  (2025-12-18T11:07:35Z)
• Step-E: A Differentiable Data Cleaning Framework for Robust Learning with Noisy Labels [0.0]
  We propose Step-E, a framework that integrates sample selection and model learning into a single optimization process.<n>Step-E ranks samples by loss and gradually increases the fraction of high-loss examples that are excluded from updates.<n>On CIFAR-100N, Step-E improves the test accuracy of a ResNet-18 model from 43.3% to 50.4%.
  arXiv  Detail & Related papers  (2025-11-21T08:31:43Z)
• FSC-Net: Fast-Slow Consolidation Networks for Continual Learning [0.0]
  We propose a dual-network architecture that separates rapid task learning from gradual knowledge consolidation.<n>Our method employs a fast network (NN1) for immediate adaptation to new tasks and a slow network (NN2) that consolidates knowledge through distillation and replay.<n>Our results provide empirical evidence that the dual-scale consolidation mechanism, rather than architectural complexity, is central to mitigating catastrophic forgetting.
  arXiv  Detail & Related papers  (2025-11-12T15:42:33Z)
• Agentic Entropy-Balanced Policy Optimization [114.90524574220764]
  Agentic Reinforcement Learning (Agentic RL) has made significant progress in incentivizing the multi-turn, long-horizon tool-use capabilities of web agents.<n>While RL algorithms autonomously explore high-uncertainty tool-call steps under the guidance of entropy, excessive reliance on entropy signals can impose further constraints.<n>We propose the Agentic Entropy-Balanced Policy Optimization (AEPO), an agentic RL algorithm designed to balance entropy in both the rollout and policy update phases.
  arXiv  Detail & Related papers  (2025-10-16T10:40:52Z)
• EEPO: Exploration-Enhanced Policy Optimization via Sample-Then-Forget [48.98166525828929]
  Exploration-Enhanced Policy Optimization (EEPO) is a framework that promotes exploration via two-stage rollouts with adaptive unlearning.<n>Across five reasoning benchmarks, EEPO outperforms GRPO, achieving average relative gains of 24.3% on Qwen2.5-3B, 33.0% on Llama3.2-3B-Instruct, and 10.4% on Qwen3-8B-Base.
  arXiv  Detail & Related papers  (2025-10-07T12:02:03Z)
• Squeeze the Soaked Sponge: Efficient Off-policy Reinforcement Finetuning for Large Language Model [56.92219181993453]
  We propose Reincarnating Mix-policy Proximal Policy Gradient (ReMix) to enable on-policyRFT methods like PPO and GRPO to leverage off-policy data.<n>ReMix consists of three major components: (1) Mix-policy proximal policy gradient with an increased Update-To-Data (UTD) ratio for efficient training; (2) KL-Convex policy constraint to balance the trade-off between stability and flexibility; (3) Policy reincarnation to achieve a seamless transition from efficient early-stage learning to steady improvement.
  arXiv  Detail & Related papers  (2025-07-09T14:29:45Z)
• ERNIE-SPARSE: Learning Hierarchical Efficient Transformer Through Regularized Self-Attention [48.697458429460184]
  Two factors, information bottleneck sensitivity and inconsistency between different attention topologies, could affect the performance of the Sparse Transformer. This paper proposes a well-designed model named ERNIE-Sparse. It consists of two distinctive parts: (i) Hierarchical Sparse Transformer (HST) to sequentially unify local and global information, and (ii) Self-Attention Regularization (SAR) to minimize the distance for transformers with different attention topologies.
  arXiv  Detail & Related papers  (2022-03-23T08:47:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.