{"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/discontinuous-piecewise-polynomial-neural","title":"Discontinuous Piecewise Polynomial Neural Networks","arxiv_id":"1505.04211","date":"2015-05-15","proceeding":null,"authors":["John Loverich"],"abstract":"An artificial neural network is presented based on the idea of connections\nbetween units that are only active for a specific range of input values and\nzero outside that range (and so are not evaluated outside the active range).\nThe connection function is represented by a polynomial with compact support.\nThe finite range of activation allows for great activation sparsity in the\nnetwork and means that theoretically you are able to add computational power to\nthe network without increasing the computational time required to evaluate the\nnetwork for a given input. The polynomial order ranges from first to fifth\norder. Unit dropout is used for regularization and a parameter free weight\nupdate is used. Better performance is obtained by moving from piecewise linear\nconnections to piecewise quadratic, even better performance can be obtained by\nmoving to higher order polynomials. The algorithm is tested on the MAGIC Gamma\nray data set as well as the MNIST data set.","url_abs":"http://arxiv.org/abs/1505.04211v2","url_pdf":"http://arxiv.org/pdf/1505.04211v2.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":"discontinuous-piecewise-polynomial-neural","repo_url":"https://github.com/jloveric/high-order-layers-torch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"polynomial-neural-networks","task_name":"Polynomial Neural Networks"}],"methods":[{"method_slug":"dropout","method_name":"Dropout"}],"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":"jloveric/high-order-layers-torch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2404.19756"],"harvested_for_calls":[{"arxiv_id":"2404.19756","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2404.19756"},"call":"get_harvested_code_for_paper(arxiv_id=\"2404.19756\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"f829fa012e67a49fffcaf7821c11ad6c4118bed503beb499bdd089a55d347895","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}