Pessimistic Minimax Learning for Public-Private Information Games under Unilateral Coverage
cs.LG
Submitted: 2026-10-04
Updated: 2026-10-04
Sources
- Fast Rates in $\alpha$-Potential Games via Regularized Mirror Descent
- Pessimism-Free Offline Learning in General-Sum Games via KL Regularization
- Robust Data-Collection Policy Learning for Low-Variance Online Policy Evaluation
- Off-the-Grid MARL: Datasets with Baselines for Offline Multi-Agent Reinforcement Learning
- Learning to Sell: Reinforcement Learning for Strategic Large Language Model Agents in Multi-Product Markets
- Strategic Bargaining in Multi-Buyer Markets: Reinforcement Learning from Verifiable Rewards for LLM Negotiations
- OR-Transformer: Scaling Real-Time Decision-Making to 1,000 Items
- Contrasting Centralized and Decentralized Critics in Multi-Agent Reinforcement Learning
- Pessimistic Model-based Offline Reinforcement Learning under Partial Coverage
- Behavior Regularized Offline Reinforcement Learning
- Beyond Linear Attention: Softmax Transformers Implement In-Context Reinforcement Learning
- Near-optimal Offline Reinforcement Learning with Linear Representation: Leveraging Variance Information with Pessimism
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks