arXiv (All)
open access
ANO: Robust Policy Optimization via Bounded, Redescending Gain Fields
Proximal Policy Optimization (PPO) dominates reinforcement learning and LLM alignment, yet its hard-clipping mechanism and unconstrained alternatives (e.g., SPO) sit at two extremes of a stability-efficiency dilemma. We argue that this dilemma is best understood dynamically: a surrogate objective is
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Learning Chance-Constrained MDPs with Bellman Distributional Certificates#1105415
- RLVR$^{2}$: Reinforcement Learning with Verifiable Rubric-based Ranking#1049198
- Strategic Inference in Stackelberg Games: Optimal Control for Revealing Adversary Intent#1052029
- Statistical Convergence of Transformer Encoder-Accelerated Robust Reinforcement Learning#1049510
- Input convex neural networks as surrogates in mathematical optimisation#441801
Record · ID 1062899
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive