{"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/disjunctive-normal-networks","title":"Disjunctive Normal Networks","arxiv_id":"1412.8534","date":"2014-12-30","proceeding":null,"authors":["Mehdi Sajjadi","Mojtaba Seyedhosseini","Tolga Tasdizen"],"abstract":"Artificial neural networks are powerful pattern classifiers; however, they\nhave been surpassed in accuracy by methods such as support vector machines and\nrandom forests that are also easier to use and faster to train.\nBackpropagation, which is used to train artificial neural networks, suffers\nfrom the herd effect problem which leads to long training times and limit\nclassification accuracy. We use the disjunctive normal form and approximate the\nboolean conjunction operations with products to construct a novel network\narchitecture. The proposed model can be trained by minimizing an error function\nand it allows an effective and intuitive initialization which solves the\nherd-effect problem associated with backpropagation. This leads to state-of-the\nart classification accuracy and fast training times. In addition, our model can\nbe jointly optimized with convolutional features in an unified structure\nleading to state-of-the-art results on computer vision problems with fast\nconvergence rates. A GPU implementation of LDNN with optional convolutional\nfeatures is also available","url_abs":"http://arxiv.org/abs/1412.8534v1","url_pdf":"http://arxiv.org/pdf/1412.8534v1.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":"disjunctive-normal-networks","repo_url":"https://github.com/tsitsimis/neural-disjunctive-normal-networks","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":null,"task_name":"GPU"},{"task_slug":"classification","task_name":"General Classification"}],"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":"tsitsimis/neural-disjunctive-normal-networks","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":"41e368ebb1313fdcd6d57fb264b420016724dcbe986391694e0077a04720aae8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}