{"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/a-minimax-approach-to-supervised-learning","title":"A Minimax Approach to Supervised Learning","arxiv_id":"1606.02206","date":"2016-06-07","proceeding":"NeurIPS 2016 12","authors":["Farzan Farnia","David Tse"],"abstract":"Given a task of predicting $Y$ from $X$, a loss function $L$, and a set of\nprobability distributions $\\Gamma$ on $(X,Y)$, what is the optimal decision\nrule minimizing the worst-case expected loss over $\\Gamma$? In this paper, we\naddress this question by introducing a generalization of the principle of\nmaximum entropy. Applying this principle to sets of distributions with marginal\non $X$ constrained to be the empirical marginal from the data, we develop a\ngeneral minimax approach for supervised learning problems. While for some loss\nfunctions such as squared-error and log loss, the minimax approach rederives\nwell-knwon regression models, for the 0-1 loss it results in a new linear\nclassifier which we call the maximum entropy machine. The maximum entropy\nmachine minimizes the worst-case 0-1 loss over the structured set of\ndistribution, and by our numerical experiments can outperform other well-known\nlinear classifiers such as SVM. We also prove a bound on the generalization\nworst-case error in the minimax approach.","url_abs":"http://arxiv.org/abs/1606.02206v5","url_pdf":"http://arxiv.org/pdf/1606.02206v5.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":"a-minimax-approach-to-supervised-learning","repo_url":"https://github.com/KaloshinPE/MEM_detector","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[],"methods":[{"method_slug":"svm","method_name":"SVM"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1606.02206","atlas_url":"https://app.syntology.ai/?focus=1606.02206","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":"1606.02206"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1606.02206\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1606.02206"},"call":"get_concepts_for_paper(arxiv_id=\"1606.02206\")"}],"by_repo":[{"repo":"KaloshinPE/MEM_detector","kind":"listed","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":"87c9b7ecb5f0de35c8fa4ff99e1eb72d36d068c3dc715373407089d60c24b743","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}