{"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":"/paper/computing-aic-for-black-box-models-using","title":"Computing AIC for black-box models using Generalised Degrees of Freedom: a comparison with cross-validation","arxiv_id":"1603.02743","date":"2016-03-09","proceeding":null,"authors":["Severin Hauenstein","Carsten F. Dormann","Simon N. Wood"],"abstract":"Generalised Degrees of Freedom (GDF), as defined by Ye (1998 JASA\n93:120-131), represent the sensitivity of model fits to perturbations of the\ndata. As such they can be computed for any statistical model, making it\npossible, in principle, to derive the number of parameters in machine-learning\napproaches. Defined originally for normally distributed data only, we here\ninvestigate the potential of this approach for Bernoulli-data. GDF-values for\nmodels of simulated and real data are compared to model complexity-estimates\nfrom cross-validation. Similarly, we computed GDF-based AICc for randomForest,\nneural networks and boosted regression trees and demonstrated its similarity to\ncross-validation. GDF-estimates for binary data were unstable and\ninconsistently sensitive to the number of data points perturbed simultaneously,\nwhile at the same time being extremely computer-intensive in their calculation.\nRepeated 10-fold cross-validation was more robust, based on fewer assumptions\nand faster to compute. Our findings suggest that the GDF-approach does not\nreadily transfer to Bernoulli data and a wider range of regression approaches.","url_abs":"http://arxiv.org/abs/1603.02743v1","url_pdf":"http://arxiv.org/pdf/1603.02743v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"computing-aic-for-black-box-models-using","repo_url":"https://github.com/biometry/GDF","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"regression-1","task_name":"regression"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"biometry/GDF","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"65ef86174c102da521bcd16030c437c684843c27fa38a56524bf83fd35efae31","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}