<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Robustness on Aayush Bajaj's Augmenting Infrastructure</title><link>https://abaj.ai/tags/robustness/</link><description>Recent content in Robustness on Aayush Bajaj's Augmenting Infrastructure</description><generator>Hugo</generator><language>en</language><copyright>© 2026 Aayush Bajaj</copyright><lastBuildDate>Fri, 10 Jul 2026 08:20:15 +1000</lastBuildDate><atom:link href="https://abaj.ai/tags/robustness/index.xml" rel="self" type="application/rss+xml"/><item><title>A Catalogue of Loss Functions</title><link>https://abaj.ai/wiki/ml/theory/loss-fns/</link><pubDate>Thu, 09 Jul 2026 21:02:56 +1000</pubDate><guid>https://abaj.ai/wiki/ml/theory/loss-fns/</guid><description>&lt;p>a loss function is not a detail of training — it is the &lt;em>definition of the problem&lt;/em>. choose squared error and you have asked for the conditional mean; choose absolute error and you have asked for the median; choose hinge and you have asked only for the decision boundary; choose cross-entropy and you have asked for the whole probability.&lt;span class="margin-note" data-note="corollary: two teams &amp;#39;solving the same problem&amp;#39; with different losses are solving different problems">
 &lt;span class="margin-note-indicator">𐃏&lt;/span>
&lt;/span>

this page catalogues the standard losses, proves what each one&amp;rsquo;s minimiser actually is, and draws the classic picture that unifies the classification zoo: every one of them is a bribe paid to make the 0–1 loss differentiable.&lt;/p></description></item></channel></rss>