arXiv (All)
open access
Descent-Guided Policy Gradient for Scalable Cooperative Multi-Agent Learning
Scaling cooperative multi-agent reinforcement learning (MARL) is fundamentally limited by cross-agent noise. When agents share a common reward, each agent's learning signal is computed from a shared return that depends on all agents, so the stochasticity of the other agents enters the signal as cros
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
- Gradient-Only Online Convex Optimization with a Single Quadratic Leader#1154813
- Cooperative Coevolution for Resource-Constrained Agentic LLM Post-Training#423982
- GradMAP: Gradient-Based Multi-Agent Proximal Learning for Grid-Edge Flexibility#138931
- Global Convergence of Wasserstein Policy Gradient for Entropy-Regularized Reinforcement Learning#224500
- Adaptive Social Spider Algorithm for Training Neural Networks#1149066
Record · ID 1116214
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