mlsanityData to 7 Oct 2026

Co-training for Policy Learning

arXiv 1907.04484 ↗First posted 3 Jul 2019cs.LG cs.AI stat.MLcited by 6

Not on the map. Why?

Abstract (arXiv)

We study the problem of learning sequential decision-making policies in settings with multiple state-action representations. Such settings naturally arise in many domains, such as planning (e.g., multiple integer programming formulations) and various combinatorial optimization problems (e.g., those with both integer programming and graph-based formulations). Inspired by the classical co-training framework for classification, we study the problem of co-training for policy learning. We present sufficient conditions under which learning from two views can improve upon learning from a single view alone. Motivated by these theoretical insights, we present a meta-algorithm for co-training for sequential decision making. Our framework is compatible with both reinforcement learning and imitation learning. We validate the effectiveness of our approach across a wide range of tasks, including discrete/continuous control and combinatorial optimization.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 3 Jul 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 1; 2023: 1; 2024: 1; 2025: 1.

6 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2023DIRECT: Learning from Sparse and Shifting Rewards using Discriminative Reward Co-Training
  2. 2026CHDP: Cooperative Hybrid Diffusion Policies for Reinforcement Learning in Parameterized Action Space
  3. 2019Imitation-Projected Programmatic Reinforcement Learning ↗
  4. 2018Fast Policy Learning through Imitation and Reinforcement
  5. 2021Representation Matters: Offline Pretraining for Sequential Decision Making
  6. 2019Relay Policy Learning: Solving Long-Horizon Tasks via Imitation and Reinforcement Learning
  7. 2018Hierarchical Imitation and Reinforcement Learning
  8. 2025Reinforcement Learning with Discrete Diffusion Policies for Combinatorial Action Spaces