<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Linear-Classifier on Aayush Bajaj's Augmenting Infrastructure</title><link>https://abaj.ai/tags/linear-classifier/</link><description>Recent content in Linear-Classifier on Aayush Bajaj's Augmenting Infrastructure</description><generator>Hugo</generator><language>en</language><copyright>© 2026 Aayush Bajaj</copyright><lastBuildDate>Thu, 09 Jul 2026 21:02:28 +1000</lastBuildDate><atom:link href="https://abaj.ai/tags/linear-classifier/index.xml" rel="self" type="application/rss+xml"/><item><title>Perceptrons (Augmented with Gradient Descent)</title><link>https://abaj.ai/wiki/ml/dl/perceptron/</link><pubDate>Thu, 09 Jul 2026 21:02:56 +1000</pubDate><guid>https://abaj.ai/wiki/ml/dl/perceptron/</guid><description>&lt;p>the perceptron is the hydrogen atom of neural networks: one neuron, one weight vector, one threshold — and yet it already exhibits the two behaviours that define the whole field.&lt;span class="margin-note" data-note="rosenblatt&amp;#39;s 1958 demo ran in software on an ibm 704; the mark i hardware — motorised potentiometers for weights — was assembled in 1959 and demonstrated in 1960">
 &lt;span class="margin-note-indicator">𐃏&lt;/span>
&lt;/span>

it &lt;em>learns&lt;/em> from mistakes with a provable convergence guarantee, and it &lt;em>fails&lt;/em> on problems its geometry cannot express. this page covers both, then swaps the hard threshold for a sigmoid so that gradient descent can take over — a companion to the &lt;a
 href="https://abaj.ai/wiki/ml/supervised/classification/perceptron/"
 
 
>sign-loss perceptron&lt;/a> page, which treats the classical algorithm on its own.&lt;/p></description></item></channel></rss>