{"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":"/sota/roomenv-v0-on-roomenv-v0","task":{"name":"RoomEnv-v0","url":"/task/roomenv-v0","note":null},"dataset":{"name":"RoomEnv-v0","url":"/dataset/roomenv"},"category":"Computer Vision","categories":["Computer Code","Computer Vision","Knowledge Base","Methodology"],"category_note":null,"description":"# The Room environment - v0\r\n\r\n[![DOI](https://img.shields.io/badge/Paper-PDF-red.svg)](https://arxiv.org/abs/2204.01611)\r\n\r\nWe have released a challenging [Gymnasium](https://www.gymlibrary.dev/) compatible\r\nenvironment. The best strategy for this environment is to have both episodic and semantic\r\nmemory systems. See the paper for more information.\r\n\r\n## Prerequisites\r\n\r\n1. A unix or unix-like x86 machine\r\n1. python 3.10 or higher.\r\n1. Running in a virtual environment (e.g., conda, virtualenv, etc.) is highly recommended so that you don't mess up with the system python.\r\n1. This env is added to the PyPI server. Just run: `pip install room-env`\r\n\r\n## Data collection\r\n\r\nData is collected from querying ConceptNet APIs. For simplicity, we only collect triples\r\nwhose format is (`head`, `atlocation`, `tail`). Here `head` is one of the 80 MS COCO\r\ndataset categories. This was kept in mind so that later on we can use images as well.\r\n\r\nIf you want to collect the data manually, then run below:\r\n\r\n```\r\npython collect_data.py\r\n```\r\n\r\n## How does this environment work?\r\n\r\nThe Gymnasium-compatible Room environment is one big room with\r\n_N_<sub>_people_</sub> number of people who can freely move\r\naround. Each of them selects one object, among\r\n_N_<sub>_objects_</sub>, and places it in one of the\r\n_N_<sub>_locations_</sub> locations.\r\n_N_<sub>_agents_</sub> number of agent(s) are also in this\r\nroom. They can only observe one human placing an object, one at a time;\r\n**x**<sup>(_t_)</sup>. At the same time, they are given one question\r\nabout the location of an object; **q**<sup>(_t_)</sup>.\r\n**x**<sup>(_t_)</sup> is given as a quadruple,\r\n(**h**<sup>(_t_)</sup>,**r**<sup>(_t_)</sup>,**t**<sup>(_t_)</sup>,_t_),\r\nFor example, `<James’s laptop, atlocation, James’s desk, 42>` accounts\r\nfor an observation where an agent sees James placing his laptop on his\r\ndesk at *t* = 42. **q**<sup>(_t_)</sup> is given as a double,\r\n(**h**,**r**). For example, `<Karen’s cat, atlocation>` is asking where\r\nKaren’s cat is located. If the agent answers the question correctly, it\r\ngets a reward of  + 1, and if not, it gets 0.\r\n\r\nThe reason why the observations and questions are given as\r\nRDF-triple-like format is two folds. One is that this structured format\r\nis easily readable / writable by both humans and machines. Second is\r\nthat we can use existing knowledge graphs, such as ConceptNet .\r\n\r\nTo simplify the environment, the agents themselves are not actually\r\nmoving, but the room is continuously changing. There are several random\r\nfactors in this environment to be considered:\r\n\r\n1. With the chance of _p_<sub>commonsense</sub>,\r\n   a human places an object in a commonsense location (e.g., a laptop\r\n   on a desk). The commonsense knowledge we use is from ConceptNet.\r\n   With the chance of\r\n   1 − *p*<sub>_commonsense_</sub>, an object is\r\n   placed at a non-commonsense random location (e.g., a laptop on the\r\n   tree).\r\n\r\n1. With the chance of\r\n   _p_<sub>_new_\\__location_</sub>, a human changes\r\n   object location.\r\n\r\n1. With the chance of _p_<sub>_new_\\__object_</sub>, a\r\n   human changes his/her object to another one.\r\n\r\n1. With the chance of\r\n   _p_<sub>_switch_\\__person_</sub>, two people\r\n   switch their locations. This is done to mimic an agent moving around\r\n   the room.\r\n\r\nAll of the four probabilities account for the Bernoulli distributions.\r\n\r\nConsider there is only one agent. Then this is a POMDP, where _S_<sub>_t_</sub> = (**x**<sup>(_t_)</sup>, **q**<sup>(_t_)</sup>), _A_<sub>_t_</sub> = (do something with **x**<sup>(_t_)</sup>, answer **q**<sup>(_t_)</sup>), and _R_<sub>_t_</sub> ∈ *{0, 1}*.\r\n\r\nCurrently there is no RL trained for this. We only have some heuristics. Take a look at the paper for more details.\r\n\r\n## RoomEnv-v0\r\n\r\n```python\r\nimport gymnasium as gym\r\n\r\nenv = gym.make(\"room_env:RoomEnv-v0\")\r\n(observation, question), info = env.reset()\r\nrewards = 0\r\n\r\nwhile True:\r\n    (observation, question), reward, done, truncated, info = env.step(\"This is my answer!\")\r\n    rewards += reward\r\n    if done:\r\n        break\r\n\r\nprint(rewards)\r\n```\r\n\r\nEvery time when an agent takes an action, the environment will give you an observation\r\nand a question to answer. You can try directly answering the question,\r\nsuch as `env.step(\"This is my answer!\")`, but a better strategy is to keep the\r\nobservations in memory systems and take advantage of the current observation and the\r\nhistory of them in the memory systems.\r\n\r\nTake a look at [this repo](https://github.com/humemai/humemai) for an actual\r\ninteraction with this environment to learn a policy.\r\n\r\n## Contributing\r\n\r\nContributions are what make the open source community such an amazing place to be learn,\r\ninspire, and create. Any contributions you make are **greatly appreciated**.\r\n\r\n1. Fork the Project\r\n1. Create your Feature Branch (`git checkout -b feature/AmazingFeature`)\r\n1. Run `make test && make style && make quality` in the root repo directory,\r\n   to ensure code quality.\r\n1. Commit your Changes (`git commit -m 'Add some AmazingFeature'`)\r\n1. Push to the Branch (`git push origin feature/AmazingFeature`)\r\n1. Open a Pull Request\r\n\r\n## [Cite our paper](https://arxiv.org/abs/2204.01611)\r\n\r\n```bibtex\r\n@misc{https://doi.org/10.48550/arxiv.2204.01611,\r\n  doi = {10.48550/ARXIV.2204.01611},\r\n  url = {https://arxiv.org/abs/2204.01611},\r\n  author = {Kim, Taewoon and Cochez, Michael and Francois-Lavet, Vincent and Neerincx,\r\n  Mark and Vossen, Piek},\r\n  keywords = {Artificial Intelligence (cs.AI), FOS: Computer and information sciences,\r\n  FOS: Computer and information sciences},\r\n  title = {A Machine With Human-Like Memory Systems},\r\n  publisher = {arXiv},\r\n  year = {2022},\r\n  copyright = {Creative Commons Attribution 4.0 International}\r\n}\r\n```\r\n\r\n## Authors\r\n\r\n- [Taewoon Kim](https://taewoon.kim/)\r\n- [Michael Cochez](https://www.cochez.nl/)\r\n- [Vincent Francois-Lavet](http://vincent.francois-l.be/)\r\n- [Mark Neerincx](https://ocw.tudelft.nl/teachers/m_a_neerincx/)\r\n- [Piek Vossen](https://vossen.info/)\r\n\r\n## License\r\n\r\n[MIT](https://choosealicense.com/licenses/mit/)","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["final agent reward"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction; the tokens 'score' and 'time' are not used on this page); null = not inferred, chart draws points only","by_metric":{"final agent reward":null}},"counts":{"rows":1,"rows_with_code":1,"rows_with_paper_page":1,"rows_dated":1,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"HumemAI-v0-handcrafted-capacity=32","metrics":{"final agent reward":"700"},"uses_additional_data":false,"paper_date":"2022-04-04","paper":"/paper/a-machine-with-human-like-memory-systems","paper_url":"https://arxiv.org/abs/2204.01611v2","paper_title":"A Machine With Human-Like Memory Systems","code":"https://github.com/humemai/agent-room-env-v0","n_code_links":1,"official":null,"syntology":null}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"adjudicator":"Claude Opus 5.5","adjudicator_from":"groundwork/59_code_with_papers/LB_EXTRACTOR_PREREG.md (not recorded in lb_measurement.json; the file's frozen_commit, measured_on and counts equal the run the pre-registration records)","adjudicator_sensitivity":[69,70],"adjudicator_specificity":[101,103],"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication by a model (adjudicator) of accepted entries on a held-out split of archive papers, rules frozen before the test; adjudicator_sensitivity and adjudicator_specificity are its own controls as [judged right, of]; it was not measured on the newer papers placed here","measurement_sentence":"Measured before publishing, on held-out archive papers: the extractor was given 883 of them and produced output for 881 (the other 2 had no title and were excluded before any model call, so they are not part of this measurement). A model adjudicator (Claude Opus 5.5), blind to which entries were real, judged 108 of 110 accepted entries correct on those held-out archive papers; its own controls: 69 of 70 archive-confirmed entries judged true, 101 of 103 corrupted copies judged false. It was not measured on the newer papers whose results are placed on this site.","coverage":{"sentence":"Syntology has checked 8,886 of the 18,637 papers on this site that are newer than the archive (for 3,717 of them no archive leaderboard matched the paper's tables, so there was nothing further to check); 733 were read and have nothing to place (arXiv has no HTML version of the paper, or that version has no tables), 41 could not be read (the extractor's reply could not be parsed), and results from the other 8,977 appear after they are checked.","complete":false,"papers_newer_than_archive":18637,"papers_checked":8886,"papers_checked_no_leaderboard_matched":3717,"papers_read_nothing_to_place":733,"papers_could_not_be_read":41,"papers_could_not_be_read_by_status":{"unparseable":41},"papers_extracted_not_yet_verified":0,"boards_without_verdict":3,"papers_not_yet_extracted":8975},"board_status":{"sentence":"Of the 8,888 newer papers whose tables Syntology has read (8,886 checked in full and 2 with a leaderboard still awaiting a verdict), none had this board among the leaderboards the extractor considered for their tables yet (it keeps at most 10 boards per paper and 4 per dataset; the lists of 1,596 of the 8,888 were already full without this board, so if it was crowded out of them it is not counted), so none await a verdict here.","note":"papers, from the extractor's own records, over the newer papers whose tables were read; proposed = no_cell_passed_checks + rejected_by_independent_check + accepted_not_placed + awaiting_verdict + placed; counts, never a rate","eligible":true,"eligible_note":"false when the extractor never considers this board: it loads only boards with archive rows and at least one metric column (lb_extract.py Boards), so no newer paper can be proposed here; archive_rows and metric_columns say which","archive_rows":1,"metric_columns":1,"papers_read":8888,"papers_read_checked":8886,"papers_read_awaiting_verdict":2,"papers_read_verified":8888,"papers_read_not_yet_verified":0,"papers_read_at_candidate_cap":1596,"papers_read_list_full_without_this_board":1596,"candidates":0,"candidates_capped_note":"candidates = papers that had this board among the leaderboards the extractor considered for their tables; the extractor keeps at most 10 per paper and 4 per dataset, so a board crowded out of a paper's list is not counted and candidates is a floor; papers_read_list_full_without_this_board counts the read papers whose list did not hold this board and had reached 10, or held 4 boards of this board's dataset (the only papers that could have crowded it out); papers_read_at_candidate_cap counts, over every board, the papers whose list reached 10","proposed":0,"no_cell_passed_checks":0,"rejected_by_independent_check":0,"accepted_not_placed":0,"awaiting_verdict":0,"placed":0,"placed_entries_listed":0,"file_lines_unreadable_as_read":0,"since_line":"Since the archive (Syntology): none placed; no newer paper judged to report on this board so far"},"judged_to_report":{"heading":"Newer papers whose tables a model judged to report on this benchmark (a model's judgement, not a result; newest first by arXiv id)","judged_by":{"model":"a model","models_as_recorded":[],"a_record_without_a_model":false,"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here","order":"newest first by arXiv id (the identifier's order, not a rank)","outcomes":{"placed":"placed","no_cell_passed_checks":"no cell passed the extractor's checks","refused_by_rule":"refused by a rule","rejected":"rejected by the independent check","accepted_not_placed":"accepted by the independent check but not placed by this site","awaiting":"awaiting a verdict"},"reason_note":"for refused_by_rule, the rules' plain words for the reason codes the record gives (never the quoted or the actual cell text); null for every other outcome","total":0,"shown_on_page":0,"no_cell_split":{"no_cell_passed_checks_in_ledger":0,"rows_refused_by_rule":0,"rows_no_cell_passed_checks":0},"rows":[]},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per row: of M harvested code samples from that row's paper, n_ran executed on a synthesized fixture (n_ran = n_ran_checked + n_instrument; n_instrument counts failures of Syntology's instrument, not of the code); the other M - n_ran are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","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)"},"rows_with_graph_line":0,"rows_with_any_sample_ran":0,"rows_with_a_run_with_no_instrument_failure":0,"official":{"state_rule":"the archive's official repositories have samples for this paper that ran: 'official (archive's flag): N ran' (N counts them, instrument failures included); they have samples, none ran: 'official: harvested, nothing ran'; they have no sample for this paper and another sample ran: 'community repositories only' when every sample that ran came from a repository the archive lists for the paper but neither marks official nor records as mentioned in it, or one Syntology harvested outside the archive's links, else 'official: no sample here; runs from other or unrecorded repositories' (a repository named in the paper or found in its text by Syntology, or no repository recorded); otherwise 'official: harvested for another paper' or 'official: not harvested'. Absent when the archive marks no repository official. Official is the archive's is_official flag, not an authorship verdict","flag":"the archive's is_official flag for the paper's code link; not a verdict on who wrote the code","rows_with_an_archive_official_repository":0,"rows_whose_official_repository_has_a_sample_that_ran":0,"rows_whose_official_repository_has_a_run_with_no_instrument_failure":0,"rows_community_repositories_only":0,"rows_runs_from_other_or_unrecorded_repositories":0,"note":"rows[].official, per row with a graph line: repos (marked official in the archive), state, n_ran and n_unverified (samples from those repositories), and ran_from_kinds (the kinds of repository the paper's samples that ran came from; 'unlocated' is no repository recorded)"},"filters":{"ran_modes":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"the page's filters hide rows and never renumber them; they read the Ran cell's counts, the same figures rows[].syntology and rows[].official carry"},"row_route":"rows[].syntology carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","distinct_papers_with_graph_line":0,"distinct_papers_with_any_sample_ran":0,"distinct_papers_with_a_run_with_no_instrument_failure":0,"samples_over_distinct_papers":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":0,"n_samples":0,"n_pointer_only_licence":0,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":0,"n_samples":0,"n_pointer_only_licence":0,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}},"record_sha256":"5c3e33ffc39cf6586d153005c967dc7c06a14aff82b088b4b3f72fe669fcbbc5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}