{"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/ensemble-pruning","name":"Ensemble Pruning","slug":"ensemble-pruning","description_markdown":null,"categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":27,"papers_with_code":11,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":27,"of":27,"of_with_code":11,"tagged_in_all":27,"counts":{"archive_papers_tagged":27,"with_a_code_link":11,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":27,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"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"},"items":[{"url":"/paper/the-shapley-value-in-machine-learning","slug":"the-shapley-value-in-machine-learning","title":"The Shapley Value in Machine Learning","date":"2022-02-11","arxiv_id":"2202.05594","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-shapley-value-in-machine-learning#ran","syntology_url":"https://syntology.ai/paper/2202.05594","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.05594"}},"official":{"repos":["benedekrozemberczki/shapley"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/the-shapley-value-of-classifiers-in-ensemble","slug":"the-shapley-value-of-classifiers-in-ensemble","title":"The Shapley Value of Classifiers in Ensemble Games","date":"2021-01-06","arxiv_id":"2101.02153","repositories_listed":2,"syntology":null},{"url":"/paper/llm-topla-efficient-llm-ensemble-by","slug":"llm-topla-efficient-llm-ensemble-by","title":"LLM-TOPLA: Efficient LLM Ensemble by Maximising Diversity","date":"2024-10-04","arxiv_id":"2410.03953","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/llm-topla-efficient-llm-ensemble-by#ran","syntology_url":"https://syntology.ai/paper/2410.03953","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.03953"}},"official":{"repos":["git-disl/llm-topla"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/hierarchical-pruning-of-deep-ensembles-with","slug":"hierarchical-pruning-of-deep-ensembles-with","title":"Hierarchical Pruning of Deep Ensembles with Focal Diversity","date":"2023-11-17","arxiv_id":"2311.10293","repositories_listed":1,"syntology":null},{"url":"/paper/autoselection-of-the-ensemble-of","slug":"autoselection-of-the-ensemble-of","title":"Autoselection of the Ensemble of Convolutional Neural Networks with Second-Order Cone Programming","date":"2023-02-12","arxiv_id":"2302.05950","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-deep-ensemble-performance-with","slug":"boosting-deep-ensemble-performance-with","title":"Boosting Deep Ensemble Performance with Hierarchical Pruning","date":"2021-12-07","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/conceptually-diverse-base-model-selection-for","slug":"conceptually-diverse-base-model-selection-for","title":"Conceptually Diverse Base Model Selection for Meta-Learners in Concept Drifting Data Streams","date":"2021-11-29","arxiv_id":"2111.14520","repositories_listed":1,"syntology":null},{"url":"/paper/improving-the-accuracy-memory-trade-off-of","slug":"improving-the-accuracy-memory-trade-off-of","title":"Improving the Accuracy-Memory Trade-Off of Random Forests Via Leaf-Refinement","date":"2021-10-19","arxiv_id":"2110.10075","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-ensemble-accuracy-by-revisiting","slug":"boosting-ensemble-accuracy-by-revisiting","title":"Boosting Ensemble Accuracy by Revisiting Ensemble Diversity Metrics","date":"2021-06-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/sub-architecture-ensemble-pruning-in-neural","slug":"sub-architecture-ensemble-pruning-in-neural","title":"Sub-Architecture Ensemble Pruning in Neural Architecture Search","date":"2019-10-01","arxiv_id":"1910.00370","repositories_listed":1,"syntology":null},{"url":"/paper/ensemble-pruning-based-on-objection","slug":"ensemble-pruning-based-on-objection","title":"Ensemble Pruning based on Objection Maximization with a General Distributed Framework","date":"2018-06-13","arxiv_id":"1806.04899","repositories_listed":1,"syntology":null},{"url":null,"slug":"robust-few-shot-ensemble-learning-with-focal","title":"Robust Few-Shot Ensemble Learning with Focal Diversity-Based Pruning","date":"2024-04-05","arxiv_id":"2404.04434","repositories_listed":0,"syntology":null},{"url":null,"slug":"liquid-democracy-for-low-cost-ensemble","title":"Liquid Democracy for Low-Cost Ensemble Pruning","date":"2024-01-30","arxiv_id":"2401.17443","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-robust-hypothesis-test-for-tree-ensemble","title":"A Robust Hypothesis Test for Tree Ensemble Pruning","date":"2023-01-24","arxiv_id":"2301.10115","repositories_listed":0,"syntology":null},{"url":null,"slug":"ensemble-pruning-via-an-integer-programming","title":"Ensemble pruning via an integer programming approach with diversity constraints","date":"2022-05-02","arxiv_id":"2205.01088","repositories_listed":0,"syntology":null},{"url":null,"slug":"learn-together-stop-apart-a-novel-approach-to","title":"Learn Together, Stop Apart: a Novel Approach to Ensemble Pruning","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-fly-ensemble-pruning-in-evolving-data","title":"On-the-Fly Ensemble Pruning in Evolving Data Streams","date":"2021-09-15","arxiv_id":"2109.07611","repositories_listed":0,"syntology":null},{"url":null,"slug":"when-does-diversity-help-generalization-in","title":"When does Diversity Help Generalization in Classification Ensembles?","date":"2019-10-30","arxiv_id":"1910.13631","repositories_listed":0,"syntology":null},{"url":null,"slug":"ensemble-pruning-via-margin-maximization","title":"Ensemble Pruning via Margin Maximization","date":"2019-06-07","arxiv_id":"1906.03247","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-mbpep-a-deep-ensemble-pruning-algorithm","title":"The MBPEP: a deep ensemble pruning algorithm providing high quality uncertainty prediction","date":"2019-02-25","arxiv_id":"1902.09238","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolving-ensemble-fuzzy-classifier","title":"Evolving Ensemble Fuzzy Classifier","date":"2017-05-18","arxiv_id":"1705.06460","repositories_listed":0,"syntology":null},{"url":null,"slug":"personalized-classifier-ensemble-pruning","title":"Personalized Classifier Ensemble Pruning Framework for Mobile Crowdsourcing","date":"2017-01-25","arxiv_id":"1701.07166","repositories_listed":0,"syntology":null},{"url":null,"slug":"random-forest-based-approach-for-concept","title":"Random Forest Based Approach for Concept Drift Handling","date":"2016-02-14","arxiv_id":"1602.04435","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimally-pruning-decision-tree-ensembles","title":"Optimally Pruning Decision Tree Ensembles With Feature Cost","date":"2016-01-05","arxiv_id":"1601.00955","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-outlier-detection-based-tree-selection","title":"An Outlier Detection-based Tree Selection Approach to Extreme Pruning of Random Forests","date":"2015-03-17","arxiv_id":"1503.05187","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-extreme-pruning-of-random-forest-ensembles","title":"On Extreme Pruning of Random Forest Ensembles for Real-time Predictive Applications","date":"2015-03-17","arxiv_id":"1503.04996","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-diversify-via-weighted-kernels","title":"Learning to Diversify via Weighted Kernels for Classifier Ensemble","date":"2014-06-04","arxiv_id":"1406.1167","repositories_listed":0,"syntology":null}],"syntology_records":2,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"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; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":2,"papers_where_code_ran_first_page":"/task/ensemble-pruning/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/ensemble-pruning/papers/ran/1","json":"/task/ensemble-pruning/papers/ran/1.json","rows":2}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper 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"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"40fd35e39c84c6615fff8cd0ea87f28a0ef6a8dc81a76b1dd65a63c735fbde48","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}