{"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":"/method/hard-sigmoid","slug":"hard-sigmoid","name":"Hard Sigmoid","full_name":"Hard Sigmoid","full_name_withheld":false,"description_markdown":"The **Hard Sigmoid** is an activation function used for neural networks of the form:\r\n\r\n$$f\\left(x\\right) = \\max\\left(0, \\min\\left(1,\\frac{\\left(x+1\\right)}{2}\\right)\\right)$$\r\n\r\nImage Source: [Rinat Maksutov](https://towardsdatascience.com/deep-study-of-a-not-very-deep-neural-network-part-2-activation-functions-fd9bd8d406fc)","description_state":"present","introduced_year":null,"introduced_by":{"title":"BinaryConnect: Training Deep Neural Networks with binary weights during propagations","paper":"/paper/binaryconnect-training-deep-neural-networks","first_author":"Matthieu Courbariaux","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/binaryconnect-training-deep-neural-networks"},"source":{"url":"http://arxiv.org/abs/1511.00363v3","title":"BinaryConnect: Training Deep Neural Networks with binary weights during propagations","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/tensorflow/tensorflow/blob/2b96f3662bd776e277f86997659e61046b56c315/tensorflow/python/keras/backend.py#L4716","code_snippet_url_on_a_code_host":true,"categories":[{"area":"General","area_id":"general","collection":"Activation Functions","url":"/methods/category/activation-functions","pwc_aliases":[]}],"n_papers_tagged":4,"archive_num_papers":4,"papers_newest_first":[{"paper":null,"slug":"k-textures-a-self-supervised-hard-clustering","title":"K-textures, a self-supervised hard clustering deep learning algorithm for satellite image segmentation","date":"2022-05-18","arxiv_id":"2205.08671","n_code_links":0,"syntology":null},{"paper":null,"slug":"maskconvnet-training-efficient-convnets-from","title":"MaskConvNet: Training Efficient ConvNets from Scratch via Budget-constrained Filter Pruning","date":"2020-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/l_0-arm-network-sparsification-via-stochastic","slug":"l_0-arm-network-sparsification-via-stochastic","title":"$L_0$-ARM: Network Sparsification via Stochastic Binary Optimization","date":"2019-04-09","arxiv_id":"1904.04432","n_code_links":1,"syntology":null},{"paper":"/paper/binaryconnect-training-deep-neural-networks","slug":"binaryconnect-training-deep-neural-networks","title":"BinaryConnect: Training Deep Neural Networks with binary weights during propagations","date":"2015-11-02","arxiv_id":"1511.00363","n_code_links":5,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["MatthieuCourbariaux/BinaryConnect"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"papers_shown":4,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":4,"with_a_code_link":2,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":4,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/method/hard-sigmoid/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/hard-sigmoid/papers/ran/1","json":"/method/hard-sigmoid/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/clustering","name":"Clustering","papers":1},{"task":"/task/image-segmentation","name":"Image Segmentation","papers":1},{"task":"/task/network-pruning","name":"Network Pruning","papers":1},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":1}],"tasks_shown":4,"n_tasks":4,"usage_by_year":[{"year":"2015","papers":1},{"year":"2019","papers":1},{"year":"2020","papers":1},{"year":"2022","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/hard-sigmoid"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Hard%20Sigmoid","read_at":"2026-10-05T00:57:25+00:00","query":"Hard Sigmoid","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"1511.00363","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'Hard Sigmoid' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["HARD","DG-Hard","HARD-KV","Hard ASH","Hard-Gen","Sigmoid Loss","Sigmoid Head","OCO-PAoI-Hard"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"fcc0d3630be5fd08b936341b540bdba3e3434f7720cd09ed7f98f702a9c00b70","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}