{"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/autoparsimony","slug":"autoparsimony","name":"AutoParsimony","full_name":"Automatic Search for Parsimonious Models","full_name_withheld":false,"description_markdown":"The principle of parsimony, also known as Occam's razor, elucidates the preference for the simplest explanation that provides optimal results when faced with multiple options. Thus, we can assert that the principle of parsimony is justified by \"the assumption that is both the simplest and contains all the necessary information required to comprehend the experiment at hand.\" This principle finds application in various scenarios or events in our daily lives, including predictions in Data Science models.\r\n\r\nIt is widely recognized that a less complex model will produce more stable predictions, exhibit greater resilience to noise and disturbances, and be more manageable for maintenance and analysis. Additionally, reducing the number of features can lead to further cost savings by diminishing the use of sensors, lowering energy consumption, minimizing information acquisition costs, reducing maintenance requirements, and mitigating the necessity to retrain models due to feature fluctuations caused by noise, outliers, data drift, etc.\r\n\r\nThe concurrent optimization of hyperparameters (HO) and feature selection (FS) for achieving Parsimonious Model Selection (PMS) is an ongoing area of active research. Nonetheless, the effective selection of appropriate hyperparameters and feature subsets presents a challenging combinatorial problem, frequently requiring the application of efficient heuristic methods.","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":"General","area_id":"general","collection":"AutoML","url":"/methods/category/automl","pwc_aliases":[]}],"n_papers_tagged":13,"archive_num_papers":13,"papers_newest_first":[{"paper":"/paper/hyb-parsimony-a-hybrid-approach-combining","slug":"hyb-parsimony-a-hybrid-approach-combining","title":"HYB-PARSIMONY: A hybrid approach combining Particle Swarm Optimization and Genetic Algorithms to find parsimonious models in high-dimensional datasets","date":"2023-12-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/pso-parsimony-a-method-for-finding","slug":"pso-parsimony-a-method-for-finding","title":"PSO-PARSIMONY: A method for finding parsimonious and accurate machine learning models with particle swarm optimization. Application for predicting force–displacement curves in T-stub steel connections","date":"2023-09-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"artificial-intelligence-models-for-assessing","title":"Artificial Intelligence Models for Assessing the Evaluation Process of Complex Student Projects","date":"2023-02-20","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"an-advanced-methodology-to-enhance-energy","title":"An advanced methodology to enhance energy efficiency in a hospital cooling-water system","date":"2021-11-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"a-comparative-study-of-six-model-complexity","title":"A comparative study of six model complexity metrics to search for parsimonious models with GAparsimony R Package","date":"2021-09-10","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"parsimonious-modelling-for-estimating","title":"Parsimonious Modelling for Estimating Hospital Cooling Demand to Improve Energy Efficiency","date":"2021-02-17","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"hybrid-methodology-based-on-bayesian","title":"Hybrid methodology based on Bayesian optimization and GA-PARSIMONY to search for parsimony models by combining hyperparameter optimization and feature selection","date":"2019-08-18","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"stacking-ensemble-with-parsimonious-base","title":"Stacking ensemble with parsimonious base models to improve generalization capability in the characterization of steel bolted components","date":"2018-09-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/evaluation-of-a-novel-ga-based-methodology","slug":"evaluation-of-a-novel-ga-based-methodology","title":"Evaluation of a novel GA-based methodology for model structure selection: The GA-PARSIMONY","date":"2018-01-03","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"improving-hotel-room-demand-forecasting-with","title":"Improving hotel room demand forecasting with a hybrid GA-SVR methodology based on skewed data transformation, feature selection and parsimony tuning","date":"2017-09-06","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"searching-parsimonious-solutions-with-ga","title":"Searching parsimonious solutions with GA-PARSIMONY and XGboost in high-dimensional databases","date":"2016-10-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/ga-parsimony-a-ga-svr-approach-with-feature","slug":"ga-parsimony-a-ga-svr-approach-with-feature","title":"GA-PARSIMONY: A GA-SVR approach with feature selection and parameter optimization to obtain parsimonious solutions for predicting temperature settings in a continuous annealing furnace","date":"2015-10-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"a-numerical-informational-approach-for","title":"A numerical-informational approach for characterising the ductile behaviour of the T-stub component. Part 2: Parsimonious soft-computing-based metamodel","date":"2015-01-01","arxiv_id":null,"n_code_links":0,"syntology":null}],"papers_shown":13,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":13,"with_a_code_link":4,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":13,"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/feature-selection","name":"feature selection","papers":10},{"task":"/task/model-selection","name":"Model Selection","papers":5},{"task":"/task/hyperparameter-optimization","name":"Hyperparameter Optimization","papers":4},{"task":"/task/bayesian-optimization","name":"Bayesian Optimization","papers":1},{"task":"/task/demand-forecasting","name":"Demand Forecasting","papers":1},{"task":"/task/diversity","name":"Diversity","papers":1},{"task":"/task/feature-engineering","name":"Feature Engineering","papers":1},{"task":"/task/scheduling","name":"Scheduling","papers":1},{"task":"/task/regression-1","name":"regression","papers":1}],"tasks_shown":9,"n_tasks":9,"usage_by_year":[{"year":"2015","papers":2},{"year":"2016","papers":1},{"year":"2017","papers":1},{"year":"2018","papers":2},{"year":"2019","papers":1},{"year":"2021","papers":3},{"year":"2023","papers":3}],"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/autoparsimony"},"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=AutoParsimony","read_at":"2026-10-05T00:52:54+00:00","query":"AutoParsimony","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":null,"repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'AutoParsimony' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":[],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"500e6104e7721d41d8c5bb55148ef874f74ba08d86304a42af9439656f9c7bc7","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}