{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/code/compute-cov-a","entry":"compute_cov_a","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-25T09:33:49+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":9,"n_papers_ran":0,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":1,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":1},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2210.03104","paper":"/paper/distributionally-adaptive-meta-reinforcement","title":"Distributionally Adaptive Meta Reinforcement Learning","date":"2022-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ikostrikov/pytorch-a2c-ppo-acktr-gail","path":"a2c_ppo_acktr/algo/kfac.py","file_url":"https://github.com/ikostrikov/pytorch-a2c-ppo-acktr-gail/blob/HEAD/a2c_ppo_acktr/algo/kfac.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6aff48ec0d1463e1","mcp_get_code":{"code_sha256":"6aff48ec0d1463e1"}},{"arxiv_id":"2010.01207","paper":"/paper/f-gail-learning-f-divergence-for-generative","title":"$f$-GAIL: Learning $f$-Divergence for Generative Adversarial Imitation Learning","date":"2020-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fGAIL3456/fGAIL","path":"a2c_ppo_acktr/algo/kfac.py","file_url":"https://github.com/fGAIL3456/fGAIL/blob/HEAD/a2c_ppo_acktr/algo/kfac.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6aff48ec0d1463e1","mcp_get_code":{"code_sha256":"6aff48ec0d1463e1"}},{"arxiv_id":"2009.01439","paper":"/paper/dexterous-robotic-grasping-with-object","title":"Learning Dexterous Grasping with Object-Centric Visual Affordances","date":"2020-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"priyankamandikal/graff","path":"a2c_ppo_acktr/algo/kfac.py","file_url":"https://github.com/priyankamandikal/graff/blob/HEAD/a2c_ppo_acktr/algo/kfac.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6aff48ec0d1463e1","mcp_get_code":{"code_sha256":"6aff48ec0d1463e1"}},{"arxiv_id":"1906.08226","paper":"/paper/unsupervised-state-representation-learning-in","title":"Unsupervised State Representation Learning in Atari","date":"2019-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mengli11235/mst_dim","path":"a2c_ppo_acktr/algo/kfac.py","file_url":"https://github.com/mengli11235/mst_dim/blob/HEAD/a2c_ppo_acktr/algo/kfac.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6aff48ec0d1463e1","mcp_get_code":{"code_sha256":"6aff48ec0d1463e1"}},{"arxiv_id":"1905.04640","paper":"/paper/mega-reward-achieving-human-level-play","title":"Mega-Reward: Achieving Human-Level Play without Extrinsic Rewards","date":"2019-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YuhangSong/Mega-Reward","path":"a2c_ppo_acktr/algo/kfac.py","file_url":"https://github.com/YuhangSong/Mega-Reward/blob/HEAD/a2c_ppo_acktr/algo/kfac.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6aff48ec0d1463e1","mcp_get_code":{"code_sha256":"6aff48ec0d1463e1"}},{"arxiv_id":"1903.04110","paper":"/paper/hybrid-reinforcement-learning-with-expert","title":"Hybrid Reinforcement Learning with Expert State Sequences","date":"2019-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XiaoxiaoGuo/tensor4rl","path":"algo/kfac.py","file_url":"https://github.com/XiaoxiaoGuo/tensor4rl/blob/HEAD/algo/kfac.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6aff48ec0d1463e1","mcp_get_code":{"code_sha256":"6aff48ec0d1463e1"}},{"arxiv_id":"1806.05635","paper":"/paper/self-imitation-learning","title":"Self-Imitation Learning","date":"2018-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rwightman/pytorch-opensim-rl","path":"algo/kfac.py","file_url":"https://github.com/rwightman/pytorch-opensim-rl/blob/HEAD/algo/kfac.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6aff48ec0d1463e1","mcp_get_code":{"code_sha256":"6aff48ec0d1463e1"}},{"arxiv_id":"1803.01273","paper":"/paper/accelerating-natural-gradient-with-higher","title":"Accelerating Natural Gradient with Higher-Order Invariance","date":"2018-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ferrine/torch_anatgrad","path":"torch_anatgrad/kfac.py","file_url":"https://github.com/ferrine/torch_anatgrad/blob/HEAD/torch_anatgrad/kfac.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6aff48ec0d1463e1","mcp_get_code":{"code_sha256":"6aff48ec0d1463e1"}},{"arxiv_id":"aaai_20694","paper":null,"title":"arXiv:aaai_20694","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"thaihungle/EPGT","path":"a2c_ppo_acktr/algo/kfac.py","file_url":"https://github.com/thaihungle/EPGT/blob/HEAD/a2c_ppo_acktr/algo/kfac.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6aff48ec0d1463e1","mcp_get_code":{"code_sha256":"6aff48ec0d1463e1"}}]}