{"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/dropmax-adaptive-variational-softmax","title":"DropMax: Adaptive Variational Softmax","arxiv_id":"1712.07834","date":"2017-12-21","proceeding":"NeurIPS 2018 12","authors":["Hae Beom Lee","Juho Lee","Saehoon Kim","Eunho Yang","Sung Ju Hwang"],"abstract":"We propose DropMax, a stochastic version of softmax classifier which at each\niteration drops non-target classes according to dropout probabilities\nadaptively decided for each instance. Specifically, we overlay binary masking\nvariables over class output probabilities, which are input-adaptively learned\nvia variational inference. This stochastic regularization has an effect of\nbuilding an ensemble classifier out of exponentially many classifiers with\ndifferent decision boundaries. Moreover, the learning of dropout rates for\nnon-target classes on each instance allows the classifier to focus more on\nclassification against the most confusing classes. We validate our model on\nmultiple public datasets for classification, on which it obtains significantly\nimproved accuracy over the regular softmax classifier and other baselines.\nFurther analysis of the learned dropout probabilities shows that our model\nindeed selects confusing classes more often when it performs classification.","url_abs":"http://arxiv.org/abs/1712.07834v5","url_pdf":"http://arxiv.org/pdf/1712.07834v5.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":"dropmax-adaptive-variational-softmax","repo_url":"https://github.com/haebeom-lee/dropmax","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"dropmax-adaptive-variational-softmax","repo_url":"https://github.com/OpenXAIProject/UncertintyAttention_DropMax","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"dropmax-adaptive-variational-softmax","repo_url":"https://github.com/yamad07/DropMax","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"dropmax-adaptive-variational-softmax","repo_url":"https://github.com/zsef123/DropMax-pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"variational-inference","task_name":"Variational Inference"}],"methods":[{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"softmax","method_name":"Softmax"}],"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":"haebeom-lee/dropmax","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"OpenXAIProject/UncertintyAttention_DropMax","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"yamad07/DropMax","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"zsef123/DropMax-pytorch","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":"e27b1334e175590cca3f6c5d1be734ecc87e8f23ab4af3851f7e87174be456eb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}