{"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/the-extreme-value-machine","title":"The Extreme Value Machine","arxiv_id":"1506.06112","date":"2015-06-19","proceeding":null,"authors":["Ethan M. Rudd","Lalit P. Jain","Walter J. Scheirer","Terrance E. Boult"],"abstract":"It is often desirable to be able to recognize when inputs to a recognition\nfunction learned in a supervised manner correspond to classes unseen at\ntraining time. With this ability, new class labels could be assigned to these\ninputs by a human operator, allowing them to be incorporated into the\nrecognition function --- ideally under an efficient incremental update\nmechanism. While good algorithms that assume inputs from a fixed set of classes\nexist, e.g., artificial neural networks and kernel machines, it is not\nimmediately obvious how to extend them to perform incremental learning in the\npresence of unknown query classes. Existing algorithms take little to no\ndistributional information into account when learning recognition functions and\nlack a strong theoretical foundation. We address this gap by formulating a\nnovel, theoretically sound classifier --- the Extreme Value Machine (EVM). The\nEVM has a well-grounded interpretation derived from statistical Extreme Value\nTheory (EVT), and is the first classifier to be able to perform nonlinear\nkernel-free variable bandwidth incremental learning. Compared to other\nclassifiers in the same deep network derived feature space, the EVM is accurate\nand efficient on an established benchmark partition of the ImageNet dataset.","url_abs":"http://arxiv.org/abs/1506.06112v4","url_pdf":"http://arxiv.org/pdf/1506.06112v4.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":[],"tasks":[{"task_slug":"incremental-learning","task_name":"Incremental Learning"}],"methods":[{"method_slug":"evm","method_name":"EVM"}],"datasets_introduced":[],"methods_introduced":[{"slug":"evm","name":"EVM","full_name":"Extreme Value Machine"}],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1506.06112","atlas_url":"https://app.syntology.ai/?focus=1506.06112","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1506.06112"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1506.06112\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1506.06112"},"call":"get_concepts_for_paper(arxiv_id=\"1506.06112\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"7e4ef84ae77ce66e18d1220c71b47e0ac465d5a6e35611b47ccf20e9f25d149f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}