Papers › Harnessing Structures for Value-Based Planning and Reinforcement Learning

Harnessing Structures for Value-Based Planning and Reinforcement Learning

26 Sep 2019ICLR 2020 1arXiv:1909.12255archive 2025-07-28

Yuzhe Yang, Guo Zhang, Zhi Xu, Dina Katabi

Value-based methods constitute a fundamental methodology in planning and deep reinforcement learning (RL). In this paper, we propose to exploit the underlying structures of the state-action value function, i.e., Q function, for both planning and deep RL. In particular, if the underlying system dynamics lead to some global structures of the Q function, one should be capable of inferring the function better by leveraging such structures. Specifically, we investigate the low-rank structure, which widely exists for big data matrices. We verify empirically the existence of low-rank Q functions in the context of control and deep RL tasks. As our key contribution, by leveraging Matrix Estimation (ME) techniques, we propose a general framework to exploit the underlying low-rank structure in Q functions. This leads to a more efficient planning procedure for classical control, and additionally, a simple scheme that can be applied to any value-based RL techniques to consistently achieve better performance on "low-rank" tasks. Extensive experiments on control tasks and Atari games confirm the efficacy of our approach. Code is available at https://github.com/YyzHarry/SV-RL.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 10 code samples harvested from 1 repository linked to this paper: 10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 10 samples from 1 repository, 10 ran (9 with no instrument failure; 1 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

YyzHarry/SV-RL officialmentioned in papermentioned on GitHubpytorchMITSyntology: 10 samples, 10 ran (1 instrument-failed) · 0 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

10 samples harvested: 10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · our draft was wrong
9ran

Licence: 0 of the 10 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from YyzHarry/SV-RL. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. For 1 sample that ran, the graph records a signature this page does not show: an argument's recorded type or element kind is a printout of an object in Syntology's harness (such as a mock object, a class or a pandas printout), not the type of an input, so it does not describe the call's shape. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

YyzHarry/SV-RL official repository 10 samples, 10 ran (1 instrument-failed) · 0 unverified
collect_nested_keys sv_rl/fancyimpute/dictionary_helpers.py ran MIT (permissive) · 0457a36c5ca50c76 · report fixture: signature nested_dict:dict/0/? · returned tuple · level recorded 2026-09-25
colorize in 60 papers sv_rl/logz.py ran · our draft was wrong MIT (permissive) · ef68ec24f19edb58 · report fixture: signature string:str/0/str, color:str/0/str, bold:bool/0/bool, highlight:bool/0/bool · returned str · level recorded 2026-09-22
dense_nan_matrix sv_rl/fancyimpute/dictionary_helpers.py ran MIT (permissive) · 379596d5350fd15a · report fixture: returned ndarray · level recorded 2026-09-25
get_datasets in 49 papers sv_rl/plot.py ran MIT (permissive) · 8f379c7706eb8801 · report fixture: signature fpath:str/0/str, condition:str/0/str · returned list · level recorded 2026-09-25
import_from in 5 papers sv_rl/fancyimpute/common.py ran MIT (permissive) · 032bba589fcdf0ae · report fixture: signature module:str/0/str, name:str/0/str · returned ABCMeta · level recorded 2026-09-25
is_scalar_nan sv_rl/fancyimpute/iterative_imputer.py ran fingerprinted MIT (permissive) · ae5cf9af3d5b68bb · report fixture: signature x:float/0/float · returned bool · level recorded 2026-09-25
masked_mae in 14 papers sv_rl/fancyimpute/common.py ran MIT (permissive) · 3972c653e57ad9cb · report fixture: signature X_true:ndarray/2/float, X_pred:ndarray/2/float, mask:ndarray/2/bool · returned float64 · level recorded 2026-09-25
masked_mse in 15 papers sv_rl/fancyimpute/common.py ran MIT (permissive) · 929e949663af4838 · report fixture: signature X_true:ndarray/2/float, X_pred:ndarray/2/float, mask:ndarray/2/bool · returned float64 · level recorded 2026-09-25
nested_key_indices sv_rl/fancyimpute/dictionary_helpers.py ran MIT (permissive) · 5bf5891587594969 · report fixture: signature nested_dict:dict/0/? · returned tuple · level recorded 2026-09-25
read_result in 7 papers sv_rl/plot_single.py ran MIT (permissive) · 2d283028094ba6d7 · report fixture: signature exp_name:str/0/str · returned DataFrame · level recorded 2026-09-25

Tasks

Atari GamesDeep Reinforcement LearningReinforcement LearningReinforcement Learning (RL)reinforcement-learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections