SGPO prunes trajectory states via a submodularity graph, then runs a policy gradient update, but its claimed constant-factor guarantee is not proven and conflicts with the paper's inapproximability theorem.
Advances in Neural Information Processing Systems 30 (2017)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
REJECT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Scalable Submodular Policy Optimization via Pruned Submodularity Graph
SGPO prunes trajectory states via a submodularity graph, then runs a policy gradient update, but its claimed constant-factor guarantee is not proven and conflicts with the paper's inapproximability theorem.