{"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/high-dimensional-regularized-discriminant","title":"High-Dimensional Regularized Discriminant Analysis","arxiv_id":"1602.01182","date":"2016-02-03","proceeding":null,"authors":["John A. Ramey","Caleb K. Stein","Phil D. Young","Dean M. Young"],"abstract":"Regularized discriminant analysis (RDA), proposed by Friedman (1989), is a\nwidely popular classifier that lacks interpretability and is impractical for\nhigh-dimensional data sets. Here, we present an interpretable and\ncomputationally efficient classifier called high-dimensional RDA (HDRDA),\ndesigned for the small-sample, high-dimensional setting. For HDRDA, we show\nthat each training observation, regardless of class, contributes to the class\ncovariance matrix, resulting in an interpretable estimator that borrows from\nthe pooled sample covariance matrix. Moreover, we show that HDRDA is equivalent\nto a classifier in a reduced-feature space with dimension approximately equal\nto the training sample size. As a result, the matrix operations employed by\nHDRDA are computationally linear in the number of features, making the\nclassifier well-suited for high-dimensional classification in practice. We\ndemonstrate that HDRDA is often superior to several sparse and regularized\nclassifiers in terms of classification accuracy with three artificial and six\nreal high-dimensional data sets. Also, timing comparisons between our HDRDA\nimplementation in the sparsediscrim R package and the standard RDA formulation\nin the klaR R package demonstrate that as the number of features increases, the\ncomputational runtime of HDRDA is drastically smaller than that of RDA.","url_abs":"http://arxiv.org/abs/1602.01182v2","url_pdf":"http://arxiv.org/pdf/1602.01182v2.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":"high-dimensional-regularized-discriminant","repo_url":"https://github.com/ramhiser/paper-hdrda","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"high","task_name":"Vocal Bursts Intensity Prediction"}],"methods":[{"method_slug":"interpretability","method_name":"Interpretability"}],"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":"ramhiser/paper-hdrda","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":"d003d100fcd0a44e899f8f3a0e418a2197ff7a4264596066177f527eb584b981","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}