{"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/surrogate-loss","entry":"surrogate_loss","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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":5,"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":5,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":5},"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":"2303.14443","paper":"/paper/no-more-reviewer-2-subverting-automatic-paper","title":"No more Reviewer #2: Subverting Automatic Paper-Reviewer Assignment using Adversarial Learning","date":"2023-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rub-syssec/adversarial-papers","path":"src/featurespace/attack.py","file_url":"https://github.com/rub-syssec/adversarial-papers/blob/HEAD/src/featurespace/attack.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0277b131c214088f","mcp_get_code":{"code_sha256":"0277b131c214088f"}},{"arxiv_id":"1905.12019","paper":"/paper/unified-probabilistic-deep-continual-learning","title":"Unified Probabilistic Deep Continual Learning through Generative Replay and Open Set Recognition","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TimmHess/OCDVAEContinualLearning","path":"lib/Models/si.py","file_url":"https://github.com/TimmHess/OCDVAEContinualLearning/blob/HEAD/lib/Models/si.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"41cc1bfa6d07666f","mcp_get_code":{"code_sha256":"41cc1bfa6d07666f"}},{"arxiv_id":"1810.00821","paper":"/paper/variational-discriminator-bottleneck","title":"Variational Discriminator Bottleneck: Improving Imitation Learning, Inverse RL, and GANs by Constraining Information Flow","date":"2018-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"reinforcement-learning-kr/lets-do-irl","path":"mujoco/vail/train_model.py","file_url":"https://github.com/reinforcement-learning-kr/lets-do-irl/blob/HEAD/mujoco/vail/train_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"372226043ee94c22","mcp_get_code":{"code_sha256":"372226043ee94c22"}},{"arxiv_id":"1707.06347","paper":"/paper/proximal-policy-optimization-algorithms","title":"Proximal Policy Optimization Algorithms","date":"2017-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"reinforcement-learning-kr/pg_travel","path":"mujoco/agent/ppo_gae.py","file_url":"https://github.com/reinforcement-learning-kr/pg_travel/blob/HEAD/mujoco/agent/ppo_gae.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6647017115e92ee7","mcp_get_code":{"code_sha256":"6647017115e92ee7"}},{"arxiv_id":"1703.03400","paper":"/paper/model-agnostic-meta-learning-for-fast","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","date":"2017-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Octavio-Pappalardo/MAML_for_RL_pytorch","path":"FO-MAML_distributed/TRPO_and_adapt_loss.py","file_url":"https://github.com/Octavio-Pappalardo/MAML_for_RL_pytorch/blob/HEAD/FO-MAML_distributed/TRPO_and_adapt_loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"654f52e17f8d3cea","mcp_get_code":{"code_sha256":"654f52e17f8d3cea"}}]}