arXiv (All)
open access
Rate-Optimal Algorithm for Adversarial Linear CMDPs
We study episodic adversarial linear constrained Markov decision processes (CMDPs) with unknown transitions, where both the loss and constraint functions may vary adversarially across episodes. The best previous algorithm achieves $\widetilde{\mathcal{O}}(K^{3/4})$ regret and cumulative constraint v
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
- Formal Bayesian Transfer Learning via the Total Risk Prior#986136
- Second-Order Actor-Critic Methods for Discounted MDPs via Policy Hessian Decomposition#187326
- Unfair Inequality in Education: A Benchmark for AI-Fairness Research.#791
- Cross-Generational Transfer of Adversarial Attacks Reveals Non-Monotonic Safety Alignment in LLMs#246459
- A Parameter-Free Zeroth-Order Method with Covariance Matrix Adaptation and Effective Dimension#1143162
Record · ID 1155862
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