Methods › General › Activation Functions › Hard Sigmoid
Hard Sigmoid
Introduced by Matthieu Courbariaux et al. in BinaryConnect: Training Deep Neural Networks with binary weights during propagations
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
The Hard Sigmoid is an activation function used for neural networks of the form:
f(x) = max(0, min(1,(x+1)/2))
Image Source: Rinat Maksutov
In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.
Near matches the lookup lists, each a different name: HARD; DG-Hard; HARD-KV; Hard ASH; Hard-Gen; Sigmoid Loss; Sigmoid Head; OCO-PAoI-Hard.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 4 · with a code link: 2 · where Syntology ran a sample: 1 (0 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (1 of 4 tagged: 0 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 4 of 4, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
K-textures, a self-supervised hard clustering deep learning algorithm for satellite image segmentation 18 May 2022 · 0 repositories · arXiv:2205.08671
-
MaskConvNet: Training Efficient ConvNets from Scratch via Budget-constrained Filter Pruning 1 Jan 2020 · 0 repositories
-
L₀-ARM: Network Sparsification via Stochastic Binary Optimization 9 Apr 2019 · 1 repository · arXiv:1904.04432
-
BinaryConnect: Training Deep Neural Networks with binary weights during propagations 2 Nov 2015 · 5 repositories · arXiv:1511.00363Syntology community repositories only · 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 (of 3 harvested samples) · 3 pointer-only (licence)
Tasks archive 2025-07-28
4 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
| Task | Papers |
|---|---|
| Clustering | 1 |
| Image Segmentation | 1 |
| Network Pruning | 1 |
| Semantic Segmentation | 1 |
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections