{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/smac-1/papers/2","list_of":"/task/smac-1","task":"SMAC+","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,126],"of":126,"counts":{"archive_papers_tagged":126,"with_a_code_link":58,"where_syntology_ran_a_sample":16,"not_listed_spam_title":0,"listed":126,"listed_where_code_ran":16,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":13,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":13,"listed_every_run_a_failure_of_syntologys_instrument":3,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/smac-1","prev":"/task/smac-1","next":null,"papers":[{"url":null,"slug":"state-based-episodic-memory-for-multi-agent","title":"State-based Episodic Memory for Multi-Agent Reinforcement Learning","date":"2021-10-19","arxiv_id":"2110.09817","repositories_listed":0,"syntology":null},{"url":"/paper/disentangling-sources-of-risk-for","slug":"disentangling-sources-of-risk-for","title":"Disentangling Sources of Risk for Distributional Multi-Agent Reinforcement Learning","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"marnet-backdoor-attacks-against-value","title":"MARNET: Backdoor Attacks against Value-Decomposition Multi-Agent Reinforcement Learning","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-the-monotonicity-constraint-in","title":"Revisiting the Monotonicity Constraint in Cooperative Multi-Agent Reinforcement Learning","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"role-diversity-matters-a-study-of-cooperative","title":"Role Diversity Matters: A Study of Cooperative Training Strategies for Multi-Agent RL","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"smac-seg-lidar-panoptic-segmentation-via","title":"SMAC-Seg: LiDAR Panoptic Segmentation via Sparse Multi-directional Attention Clustering","date":"2021-08-31","arxiv_id":"2108.13588","repositories_listed":0,"syntology":null},{"url":null,"slug":"cooperative-exploration-for-multi-agent-deep","title":"Cooperative Exploration for Multi-Agent Deep Reinforcement Learning","date":"2021-07-23","arxiv_id":"2107.11444","repositories_listed":0,"syntology":null},{"url":null,"slug":"mmd-mix-value-function-factorisation-with","title":"MMD-MIX: Value Function Factorisation with Maximum Mean Discrepancy for Cooperative Multi-Agent Reinforcement Learning","date":"2021-06-22","arxiv_id":"2106.11652","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-on-policy-training-for-sample-efficient","title":"Semi-On-Policy Training for Sample Efficient Multi-Agent Policy Gradients","date":"2021-04-27","arxiv_id":"2104.13446","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-monotonic-value-function-factorization","title":"NQMIX: Non-monotonic Value Function Factorization for Deep Multi-Agent Reinforcement Learning","date":"2021-04-05","arxiv_id":"2104.01939","repositories_listed":0,"syntology":null},{"url":null,"slug":"coordinated-multi-agent-exploration-using","title":"Coordinated Multi-Agent Exploration Using Shared Goals","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-multi-agent-reinforcement-learning","title":"Robust Multi-Agent Reinforcement Learning Driven by Correlated Equilibrium","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"updet-universal-multi-agent-rl-via-policy","title":"UPDeT: Universal Multi-agent RL via Policy Decoupling with Transformers","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"black-box-optimization-of-object-detector","title":"Black-Box Optimization of Object Detector Scales","date":"2020-10-29","arxiv_id":"2010.15823","repositories_listed":0,"syntology":null},{"url":null,"slug":"smac-symbiotic-multi-agent-construction","title":"SMAC: Symbiotic Multi-Agent Construction","date":"2020-10-16","arxiv_id":"2010.08473","repositories_listed":0,"syntology":null},{"url":null,"slug":"qr-mix-distributional-value-function","title":"QR-MIX: Distributional Value Function Factorisation for Cooperative Multi-Agent Reinforcement Learning","date":"2020-09-09","arxiv_id":"2009.04197","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-agent-reinforcement-learning-with-graph","title":"BGC: Multi-Agent Group Belief with Graph Clustering","date":"2020-08-20","arxiv_id":"2008.08808","repositories_listed":0,"syntology":null},{"url":null,"slug":"qopt-optimistic-value-function","title":"QTRAN++: Improved Value Transformation for Cooperative Multi-Agent Reinforcement Learning","date":"2020-06-22","arxiv_id":"2006.12010","repositories_listed":0,"syntology":null},{"url":null,"slug":"additive-tree-structured-covariance-function","title":"Additive Tree-Structured Covariance Function for Conditional Parameter Spaces in Bayesian Optimization","date":"2020-06-21","arxiv_id":"2006.11771","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-makes-a-top-performing-precision","title":"What Makes a Top-Performing Precision Medicine Search Engine? Tracing Main System Features in a Systematic Way","date":"2020-06-04","arxiv_id":"2006.02785","repositories_listed":0,"syntology":null},{"url":null,"slug":"social-cost-of-carbon-what-do-the-numbers","title":"Social Cost of Carbon: What Do the Numbers Really Mean?","date":"2020-01-24","arxiv_id":"2001.08935","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-known-information-to-accelerate","title":"Using Known Information to Accelerate HyperParameters Optimization Based on SMBO","date":"2018-11-08","arxiv_id":"1811.03322","repositories_listed":0,"syntology":null},{"url":null,"slug":"speeding-up-the-hyperparameter-optimization","title":"Speeding up the Hyperparameter Optimization of Deep Convolutional Neural Networks","date":"2018-07-19","arxiv_id":"1807.07362","repositories_listed":0,"syntology":null},{"url":null,"slug":"smac-simultaneous-mapping-and-clustering","title":"SMAC: Simultaneous Mapping and Clustering Using Spectral Decompositions","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-optimization-of-wildfire-suppression","title":"Fast Optimization of Wildfire Suppression Policies with SMAC","date":"2017-03-28","arxiv_id":"1703.09391","repositories_listed":0,"syntology":null},{"url":null,"slug":"characterization-of-neighborhood-behaviours","title":"Characterization of neighborhood behaviours in a multi-neighborhood local search algorithm","date":"2016-03-12","arxiv_id":"1603.06459","repositories_listed":0,"syntology":null}],"record_sha256":"f4a3531363842037ae3ea2cfde47ccc242abbd38db84c4100a032b68383ea95e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}