Pith. sign in

REVIEW 3 cited by

Symmetric Replay Training: Enhancing Sample Efficiency in Deep Reinforcement Learning for Combinatorial Optimization

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 2306.01276 v4 pith:WB2RUFIP submitted 2023-06-02 cs.LG

classification cs.LG
keywords symmetricefficiencymethodoptimizationreplaysampletrainingcombinatorial
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Deep reinforcement learning (DRL) has significantly advanced the field of combinatorial optimization (CO). However, its practicality is hindered by the necessity for a large number of reward evaluations, especially in scenarios involving computationally intensive function assessments. To enhance the sample efficiency, we propose a simple but effective method, called symmetric replay training (SRT), which can be easily integrated into various DRL methods. Our method leverages high-reward samples to encourage exploration of the under-explored symmetric regions without additional online interactions - free. Through replay training, the policy is trained to maximize the likelihood of the symmetric trajectories of discovered high-rewarded samples. Experimental results demonstrate the consistent improvement of our method in sample efficiency across diverse DRL methods applied to real-world tasks, such as molecular optimization and hardware design.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. DGA$_2$D: Directed Graph-Guided Automated Algorithm Design with Large Language Models

    cs.AI 2026-08 conditional novelty 6.0 of 10

    DGA2D evolves LLM-generated algorithm pipelines as directed walks in an operator graph with first-order transition credit, outperforming LLM-based heuristic design baselines on 12 combinatorial optimization benchmarks.

  2. Preference Optimization for Combinatorial Optimization Problems

    cs.LG 2025-05 conditional novelty 6.0 of 10

    Preference Optimization, a DPO-style training loss that ranks sampled solutions by their objective value, speeds up and improves RL-based neural solvers for combinatorial problems.

  3. Control Synthesis with Reinforcement Learning: A Modeling Perspective

    eess.SY 2025-10 conditional novelty 4.0 of 10

    A simplified linear training model yields an RL cart-pole controller that fails in physical deployment, while a high-fidelity nonlinear model yields a deployable, disturbance-robust controller.

Pith tools