{"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/l2m","slug":"l2m","name":"L2M","full_name":"Learning to Match","full_name_withheld":false,"description_markdown":"**L2M** is a learning algorithm that can work for most cross-domain distribution matching tasks. It automatically learns the cross-domain distribution matching without relying on hand-crafted priors on the matching loss. Instead, L2M reduces the inductive bias by using a meta-network to learn the distribution matching loss in a data-driven way.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Learning to Match Distributions for Domain Adaptation","paper":"/paper/learning-to-match-distributions-for-domain","first_author":"Chaohui Yu","n_authors":8,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/learning-to-match-distributions-for-domain"},"source":{"url":"https://arxiv.org/abs/2007.10791v3","title":"Learning to Match Distributions for Domain Adaptation","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Domain Adaptation","url":"/methods/category/domain-adaptation","pwc_aliases":[]}],"n_papers_tagged":2,"archive_num_papers":2,"papers_newest_first":[{"paper":"/paper/lifelong-dp-consistently-bounded-differential","slug":"lifelong-dp-consistently-bounded-differential","title":"Lifelong DP: Consistently Bounded Differential Privacy in Lifelong Machine Learning","date":"2022-07-26","arxiv_id":"2207.12831","n_code_links":1,"syntology":null},{"paper":"/paper/learning-to-match-distributions-for-domain","slug":"learning-to-match-distributions-for-domain","title":"Learning to Match Distributions for Domain Adaptation","date":"2020-07-17","arxiv_id":"2007.10791","n_code_links":1,"syntology":null}],"papers_shown":2,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":2,"with_a_code_link":2,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":2,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":0,"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":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[],"tasks":[{"task":"/task/machine-learning","name":"BIG-bench Machine Learning","papers":1},{"task":"/task/domain-adaptation","name":"Domain Adaptation","papers":1},{"task":"/task/inductive-bias","name":"Inductive Bias","papers":1}],"tasks_shown":3,"n_tasks":3,"usage_by_year":[{"year":"2020","papers":1},{"year":"2022","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/l2m"},"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=L2M","read_at":"2026-10-05T00:58:21+00:00","query":"L2M","kind":"paper","have":"no_code","tier":"paper_only","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"2107.04695"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":"for_this_paper_only","absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"different_paper","archive_paper_arxiv_id":"2007.10791","repositories":{"listed":null,"in_graph":0,"list_truncated":null,"strongest_link":null},"retrieve_with":null,"name_competition":{"verdict":"outranked","may_be_wrong_sense":false,"bearers_found":3,"served":{"arxiv_id":"2107.04695","citations":3},"leading_other_bearer":{"arxiv_id":"2507.00392","title":"Learning Dense Feature Matching via Lifting Single 2D Image to 3D Space","citations":4,"named_by":["acronym_expansion"],"bearer_name":"Lift to Match (L2M)","ask_with":"have('2507.00392')"},"n_other_bearers_listed":2,"note":"'L2M' is ALSO the name of 'Lift to Match (L2M)', a method in 'Learning Dense Feature Matching via Lifting Single 2D Image to 3D Space' (arXiv:2507.00392, 4 citations), which is cited more than the paper this answer is about (3). The margin is narrow, so this is not a claim that the other one is what you meant -- check `served.arxiv_id` against the paper you had in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2107.04695","page":null,"syntology_url":"https://syntology.ai/paper/2107.04695","in_graph_layer":false,"samples":0},"line":"about another paper, arXiv:2107.04695: the paper matched by title held, no code (no_code; paper_only). The lookup matched a paper by its title, arXiv:2107.04695, not a method entry. About another paper: this answer is about arXiv:2107.04695, while the archive credits arXiv:2007.10791, so it does not say whether this method has code.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"160b0fb584479c536ca503413c01aabe5823026bf733739719b3b76154c269f4","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}