No article text was recorded for this version.
occupancy measure optimization
Version 2 of 279 papers90 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Online Stochastic Shortest Path with Bandit Feedback and Unknown Transition Function
- Blog: Online learning in episodic Markovian decision processes by relative entropy policy search
- Blog: Near-Optimal Regret for Adversarial MDP with Delayed Bandit Feedback
- Blog: Dynamic Regret of Online Markov Decision Processes
- Blog: Simultaneously Learning Stochastic and Adversarial Episodic MDPs with Known Transition
- Blog: Dynamic Regret of Adversarial MDPs with Unknown Transition and Linear Function Approximation
- Blog: Provably Efficient Generalized Lagrangian Policy Optimization for Safe Multi-Agent Reinforcement Learning
- Blog: Online Reinforcement Learning in Markov Decision Process Using Linear Programming
- Blog: Learning Adversarial Linear Mixture Markov Decision Processes with Bandit Feedback and Unknown Transition
- Blog: Online Episodic Convex Reinforcement Learning
- Blog: MetaCURL: Non-stationary Concave Utility Reinforcement Learning
- Blog: Improved Bounds for Reward-Agnostic and Reward-Free Exploration
- Blog: Constrained Multi-Objective Reinforcement Learning with Max-Min Criterion
- Blog: Dynamic Regret of Online Markov Decision Processes
- Blog: Horizon-free Reinforcement Learning in Adversarial Linear Mixture MDPs
- Blog: Active Exploration via Experiment Design in Markov Chains
- Blog: Learning Infinite-Horizon Average-Reward Markov Decision Processes with Constraints
- Blog: Dynamic Regret of Online Markov Decision Processes
- Blog: A Reinforcement Learning Based Approach for Joint Multi-Agent Decision Making
- Blog: Solving Zero-Sum Convex Markov Games
- Blog: Convex Markov Games: A New Frontier for Multi-Agent Reinforcement Learning
- Blog: Apprenticeship learning using linear programming
- Blog: Optimistic Regret Bounds for Online Learning in Adversarial Markov Decision Processes
- Blog: Efficient Rate Optimal Regret for Adversarial Contextual MDPs Using Online Function Approximation
- Blog: Optimizing over a Restricted Policy Class in MDPs
- Blog: Linear Programming for Large-Scale Markov Decision Problems
- Blog: Multi-Step Alignment as Markov Games: An Optimistic Online Gradient Descent Approach with Convergence Guarantees
- Blog: Provably Efficient Reinforcement Learning for Adversarial Restless Multi-Armed Bandits with Unknown Transitions and Bandit Feedback
- Blog: Large-Scale Markov Decision Problems via the Linear Programming Dual
- Blog: Provably Efficient Long-Horizon Exploration in Monte Carlo Tree Search through State Occupancy Regularization
- Blog: Achieving Zero Constraint Violation for Constrained Reinforcement Learning via Primal-Dual Approach
- Blog: Private Online Learning in Adversarial MDPs: Full-Information and Bandit
- Blog: Constrained Reinforcement Learning via Dissipative Saddle Flow Dynamics
- Blog: Optimizing over a Restricted Policy Class in Markov Decision Processes
- Blog: Horizon-free Reinforcement Learning in Adversarial Linear Mixture MDPs
- Blog: On the Convergence and Sample Efficiency of Variance-Reduced Policy Gradient Method
- Blog: Learning Adversarial MDPs with Bandit Feedback and Unknown Transition
- Blog: Active Model Estimation in Markov Decision Processes
- Blog: Efficient Rate Optimal Regret for Adversarial Contextual MDPs Using Online Function Approximation
- Blog: Generate or Re-Weight? A Mutual-Guidance Method for Class-Imbalanced Graphs
- Blog: A Sample-Efficient Algorithm for Episodic Finite-Horizon MDP with Constraints
- Blog: Active Exploration via Experiment Design in Markov Chains
- Blog: Adversarial Stochastic Shortest Path
- Blog: Large Scale Markov Decision Processes with Changing Rewards
- Blog: Bootstrapping Apprenticeship Learning
- Blog: Variational Policy Gradient Method for Reinforcement Learning with General Utilities
- Blog: Finding the Stochastic Shortest Path with Low Regret: the Adversarial Cost and Unknown Transition Case
- Blog: Algebraic optimization of sequential decision problems
- Blog: Polynomial Time Reinforcement Learning in Factored State MDPs with Linear Value Functions
- Blog: Online Reinforcement Learning with Passive Memory
- Blog: Deception in Supervisory Control
- Blog: Reinforcement Learning with Stepwise Fairness Constraints
- Blog: Learning Infinite-horizon Average-reward Markov Decision Process with Constraints
- Blog: Offline RL via Feature-Occupancy Gradient Ascent
- Blog: Revisiting the Linear-Programming Framework for Offline RL with General Function Approximation
- Blog: Online Convex Optimization in Adversarial Markov Decision Processes
- Blog: Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition
- Blog: No-regret learning with high-probability in adversarial Markov decision processes
- Blog: Reinforcement Learning for Joint Optimization of Multiple Rewards
- Blog: Learning Adversarial Markov Decision Processes with Bandit Feedback and Unknown Transition
Showing 60 of 79 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_occupancy_measure_optimization_38633d03,
title = {occupancy measure optimization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/occupancy-measure-optimization/rdr_38633d03de6f4294abffcf635f85f9e2},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_occupancy_measure_optimization_38633d03_v2,
title = {occupancy measure optimization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/occupancy-measure-optimization/rdr_38633d03de6f4294abffcf635f85f9e2/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}