{"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-swag-algorithm-a-mathematical-approach","title":"The SWAG Algorithm; a Mathematical Approach that Outperforms Traditional Deep Learning. Theory and Implementation","arxiv_id":"1811.11813","date":"2018-11-28","proceeding":null,"authors":["Saeid Safaei","Vahid Safaei","Solmazi Safaei","Zerotti Woods","Hamid R. Arabnia","Juan B. Gutierrez"],"abstract":"The performance of artificial neural networks (ANNs) is influenced by weight\ninitialization, the nature of activation functions, and their architecture.\nThere is a wide range of activation functions that are traditionally used to\ntrain a neural network, e.g. sigmoid, tanh, and Rectified Linear Unit (ReLU). A\nwidespread practice is to use the same type of activation function in all\nneurons in a given layer. In this manuscript, we present a type of neural\nnetwork in which the activation functions in every layer form a polynomial\nbasis; we name this method SWAG after the initials of the last names of the\nauthors. We tested SWAG on three complex highly non-linear functions as well as\nthe MNIST handwriting data set. SWAG outperforms and converges faster than the\nstate of the art performance in fully connected neural networks. Given the low\ncomputational complexity of SWAG, and the fact that it was capable of solving\nproblems current architectures cannot, it has the potential to change the way\nthat we approach deep learning.","url_abs":"http://arxiv.org/abs/1811.11813v1","url_pdf":"http://arxiv.org/pdf/1811.11813v1.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":"the-swag-algorithm-a-mathematical-approach","repo_url":"https://github.com/DeepLearningSaeid/New-Type-of-Deep-Learning","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"learning-theory","task_name":"Learning Theory"}],"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":"DeepLearningSaeid/New-Type-of-Deep-Learning","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":"32f6c4a7f9c2500740e50d842adfba08fc97a030943eb05b5d1fbc0eef6d84d5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}