{"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/lfme","slug":"lfme","name":"LFME","full_name":"Learning From Multiple Experts","full_name_withheld":false,"description_markdown":"**Learning From Multiple Experts** is a self-paced knowledge distillation framework that aggregates the knowledge from multiple 'Experts' to learn a unified student model. Specifically, the proposed framework involves two levels of adaptive learning schedules: Self-paced Expert Selection and Curriculum Instance Selection, so that the knowledge is adaptively transferred to the 'Student'. The self-paced expert selection automatically controls the impact of knowledge distillation from each expert, so that the learned student model will gradually acquire the knowledge from the experts, and finally exceed the expert. The curriculum instance selection, on the other hand, designs a curriculum for the unified model where the training samples are organized from easy to hard, so that the unified student model will receive a less challenging learning schedule, and gradually learns from easy to hard samples.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Learning From Multiple Experts: Self-paced Knowledge Distillation for Long-tailed Classification","paper":"/paper/learning-from-multiple-experts-self-paced","first_author":"Liuyu Xiang","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/learning-from-multiple-experts-self-paced"},"source":{"url":"https://arxiv.org/abs/2001.01536v3","title":"Learning From Multiple Experts: Self-paced Knowledge Distillation for Long-tailed Classification","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":"Knowledge Distillation","url":"/methods/category/knowledge-distillation","pwc_aliases":[]}],"n_papers_tagged":2,"archive_num_papers":2,"papers_newest_first":[{"paper":"/paper/lfme-a-simple-framework-for-learning-from","slug":"lfme-a-simple-framework-for-learning-from","title":"LFME: A Simple Framework for Learning from Multiple Experts in Domain Generalization","date":"2024-10-22","arxiv_id":"2410.17020","n_code_links":1,"syntology":{"ran":5,"of":7,"n_ran_checked":1,"n_instrument":4,"unverified":2,"pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","official":{"repos":["liangchen527/lfme"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/learning-from-multiple-experts-self-paced","slug":"learning-from-multiple-experts-self-paced","title":"Learning From Multiple Experts: Self-paced Knowledge Distillation for Long-tailed Classification","date":"2020-01-06","arxiv_id":"2001.01536","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":1,"not_listed_spam_title":0,"listed":2,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"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":1,"papers_where_code_ran_first_page":"/method/lfme/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/lfme/papers/ran/1","json":"/method/lfme/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/domain-generalization","name":"Domain Generalization","papers":1},{"task":"/task/classification","name":"General Classification","papers":1},{"task":"/task/knowledge-distillation","name":"Knowledge Distillation","papers":1},{"task":"/task/long-tail-learning","name":"Long-tail Learning","papers":1}],"tasks_shown":4,"n_tasks":4,"usage_by_year":[{"year":"2020","papers":1},{"year":"2024","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/lfme"},"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=LFME","read_at":"2026-10-05T00:58:31+00:00","query":"LFME","kind":"paper","have":"unverified_code","tier":"harvested","verified_implementation":false,"level":1,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"2410.17020"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"different_paper","archive_paper_arxiv_id":"2001.01536","repositories":{"listed":2,"in_graph":2,"list_truncated":false,"strongest_link":"official"},"retrieve_with":"get_harvested_code_for_paper(arxiv_id='2410.17020')","name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2410.17020","citations":14},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'LFME'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2410.17020","page":"/paper/lfme-a-simple-framework-for-learning-from","syntology_url":"https://syntology.ai/paper/2410.17020","in_graph_layer":true,"samples":7,"ran":5,"n_ran_checked":1,"n_instrument":4,"unverified":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"about another paper, arXiv:2410.17020: harvested code stored, below machine verification (unverified_code; harvested), served level V1. Repositories: 2 listed of 2 in the graph, strongest link: official. The lookup matched a paper by its title, arXiv:2410.17020, not a method entry. About another paper: this answer is about arXiv:2410.17020, while the archive credits arXiv:2001.01536.","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":"2e654dd19a1e4ae68de200b4374e4c2fe3335b81ba581af6ae46f384016e1a65","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}