{"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":"/method/iq-learn","slug":"iq-learn","name":"IQ-Learn","full_name":"Inverse Q-Learning","full_name_withheld":false,"description_markdown":"**Inverse Q-Learning (IQ-Learn)** is a a simple, stable & data-efficient framework for Imitation Learning (IL), that directly learns *soft Q-functions* from expert data. IQ-Learn enables **non-adverserial** imitation learning, working on both offline and online IL settings. It is performant even with very sparse expert data, and scales to complex image-based environments, surpassing prior methods by more than **3x**. \r\n\r\nIt is very simple to implement requiring ~15 lines of code on top of existing RL methods.\r\n\r\n<span class=\"description-source\">Source: [IQ-Learn: Inverse soft Q-Learning for Imitation](https://arxiv.org/abs/2106.12142)</span>","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":null,"title":null,"url_on_a_paper_host":false},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Reinforcement Learning","area_id":"reinforcement-learning","collection":"Imitation Learning Methods","url":"/methods/category/imitation-learning-methods","pwc_aliases":[]}],"n_papers_tagged":4,"archive_num_papers":4,"papers_newest_first":[{"paper":"/paper/on-learning-informative-trajectory-embeddings","slug":"on-learning-informative-trajectory-embeddings","title":"On Learning Informative Trajectory Embeddings for Imitation, Classification and Regression","date":"2025-01-16","arxiv_id":"2501.09327","n_code_links":1,"syntology":null},{"paper":null,"slug":"adversarial-imitation-learning-via-boosting","title":"Adversarial Imitation Learning via Boosting","date":"2024-04-12","arxiv_id":"2404.08513","n_code_links":0,"syntology":null},{"paper":null,"slug":"maximum-likelihood-inverse-reinforcement","title":"Maximum-Likelihood Inverse Reinforcement Learning with Finite-Time Guarantees","date":"2022-10-04","arxiv_id":"2210.01808","n_code_links":0,"syntology":null},{"paper":"/paper/iq-learn-inverse-soft-q-learning-for","slug":"iq-learn-inverse-soft-q-learning-for","title":"IQ-Learn: Inverse soft-Q Learning for Imitation","date":"2021-06-23","arxiv_id":"2106.12142","n_code_links":5,"syntology":{"ran":2,"of":3,"n_ran_checked":0,"n_instrument":2,"unverified":1,"pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["Div99/IQ-Learn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"papers_shown":4,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":4,"with_a_code_link":2,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":4,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":1,"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"},"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/method/iq-learn/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/iq-learn/papers/ran/1","json":"/method/iq-learn/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/imitation-learning","name":"Imitation Learning","papers":3},{"task":"/task/decision-making","name":"Decision Making","papers":2},{"task":"/task/sequential-decision-making","name":"Sequential Decision Making","papers":2},{"task":"/task/atari-games","name":"Atari Games","papers":1},{"task":"/task/autonomous-driving","name":"Autonomous Driving","papers":1},{"task":"/task/clustering","name":"Clustering","papers":1},{"task":"/task/continuous-control","name":"Continuous Control","papers":1},{"task":"/task/mujoco","name":"MuJoCo","papers":1},{"task":"/task/mujoco-games","name":"MuJoCo Games","papers":1},{"task":"/task/q-learning","name":"Q-Learning","papers":1},{"task":"/task/reinforcement-learning","name":"Reinforcement Learning","papers":1},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":1},{"task":"/task/self-driving-cars","name":"Self-Driving Cars","papers":1},{"task":null,"name":"counterfactual","papers":1},{"task":"/task/regression-1","name":"regression","papers":1},{"task":"/task/reinforcement-learning-2","name":"reinforcement-learning","papers":1}],"tasks_shown":16,"n_tasks":16,"usage_by_year":[{"year":"2021","papers":1},{"year":"2022","papers":1},{"year":"2024","papers":1},{"year":"2025","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/iq-learn"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=IQ-Learn","read_at":"2026-10-05T00:58:11+00:00","query":"IQ-Learn","kind":"method","have":"verified_code","tier":null,"verified_implementation":true,"level":3,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"IQ-Learn","origin_arxiv_id":"2106.12142"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"unknown","archive_paper_arxiv_id":null,"repositories":{"listed":null,"in_graph":5,"list_truncated":null,"strongest_link":null},"retrieve_with":"get_reference_implementation(name='IQ-Learn')","name_competition":{"verdict":"contested","may_be_wrong_sense":false,"bearers_found":2,"served":{"arxiv_id":"2106.12142","citations":267},"leading_other_bearer":{"arxiv_id":"2607.17003","title":"Scalable Causal Imitation Learning Scalable Causal Imitation Learning","citations":0,"named_by":["acronym_expansion"],"bearer_name":"Causal Inverse soft-Q Learning (IQ-Learn)","ask_with":"have('2607.17003')"},"n_other_bearers_listed":1,"note":"1 other thing(s) here are also called 'IQ-Learn', and none of them is cited more than the paper this answer is about. They are listed in `also_named` -- check `served.arxiv_id` is the paper you meant."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2106.12142","page":"/paper/iq-learn-inverse-soft-q-learning-for","syntology_url":"https://syntology.ai/paper/2106.12142","in_graph_layer":true,"samples":3,"ran":2,"n_ran_checked":0,"n_instrument":2,"unverified":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"verified reference implementation at level V3. The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:2106.12142) is about this method is not checked.","level_legend":{"state":"quoted","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","note":"Syntology's served verification levels, quoted verbatim from its MCP server card; a row is split where the card separates clauses with a double hyphen, and the separator is not reproduced","levels":[{"level":"V0","quoted":["imports"]},{"level":"V1","quoted":["executes against a synthesized fixture and returns a value of the recorded type"]},{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"no_rung":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results."}},"syntology_have_state":"loaded","record_sha256":"8d229a370c1ae34f0212db79d113b8c5b3ab3909be05b80d383b70f57efc047e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}