Pith. sign in

REVIEW 1 cited by

Learning Invariances for Policy Generalization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1809.02591 v2 pith:LBFETPEN submitted 2018-09-07 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords learninggeneralizationadversarialaugmentationdatainvariancesmeta-learningpolicy
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

While recent progress has spawned very powerful machine learning systems, those agents remain extremely specialized and fail to transfer the knowledge they gain to similar yet unseen tasks. In this paper, we study a simple reinforcement learning problem and focus on learning policies that encode the proper invariances for generalization to different settings. We evaluate three potential methods for policy generalization: data augmentation, meta-learning and adversarial training. We find our data augmentation method to be effective, and study the potential of meta-learning and adversarial learning as alternative task-agnostic approaches.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. LLM Bandit: Cost-Efficient LLM Generation via Preference-Conditioned Dynamic Routing

    cs.LG 2025-02 conditional novelty 5.0 of 10

    A preference-conditioned PPO routing policy with IRT-based model identity vectors selects cost-effective LLMs per query and generalizes to unseen models from a handful of evaluation prompts.

Pith tools