<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Continuous Optimisation on Arshad Siddiqui</title><link>https://arshadhs.github.io/docs/ai/010-maths/020-calculus/05-optimisation/</link><description>Recent content in Continuous Optimisation on Arshad Siddiqui</description><generator>Hugo</generator><language>en-us</language><atom:link href="https://arshadhs.github.io/docs/ai/010-maths/020-calculus/05-optimisation/index.xml" rel="self" type="application/rss+xml"/><item><title>Optimisation using Gradient Descent</title><link>https://arshadhs.github.io/docs/ai/010-maths/020-calculus/05-optimisation/gradient-descent/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://arshadhs.github.io/docs/ai/010-maths/020-calculus/05-optimisation/gradient-descent/</guid><description>&lt;h1 id="optimisation-using-gradient-descent">
 Optimisation using Gradient Descent
 
 &lt;a class="anchor" href="#optimisation-using-gradient-descent">#&lt;/a>
 
&lt;/h1>
&lt;p>Gradient descent is an optimisation algorithm used to train ML and neural networks.&lt;/p>
&lt;ul>
&lt;li>Gradient descent updates parameters by moving opposite the gradient.&lt;/li>
&lt;/ul>
&lt;p>Trains ML models by minimising errors:&lt;/p>
&lt;ul>
&lt;li>between predicted and actual results&lt;/li>
&lt;li>by iteratively adjusting its parameters&lt;/li>
&lt;li>moves step‑by‑step in the direction of the steepest decrease in the loss function, it helps ML models learn the best possible weights for better predictions&lt;/li>
&lt;/ul>
&lt;hr>
&lt;h2 id="types-of-gradient-gescent-learning-algorithms">
 Types of Gradient Gescent learning algorithms
 
 &lt;a class="anchor" href="#types-of-gradient-gescent-learning-algorithms">#&lt;/a>
 
&lt;/h2>
&lt;ol>
&lt;li>Batch gradient descent&lt;/li>
&lt;li>Stochastic gradient descent&lt;/li>
&lt;li>Mini-batch gradient descent&lt;/li>
&lt;/ol>
&lt;hr>
&lt;p>&lt;a href="https://arshadhs.github.io/">Home&lt;/a> | &lt;a href="https://arshadhs.github.io/docs/ai/010-maths/020-calculus/05-optimisation/">
 Continuous Optimisation
&lt;/a>&lt;/p></description></item><item><title>Constrained Optimisation</title><link>https://arshadhs.github.io/docs/ai/010-maths/020-calculus/05-optimisation/constrained-optimisation/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://arshadhs.github.io/docs/ai/010-maths/020-calculus/05-optimisation/constrained-optimisation/</guid><description>&lt;h1 id="constrained-optimisation">
 Constrained Optimisation
 
 &lt;a class="anchor" href="#constrained-optimisation">#&lt;/a>
 
&lt;/h1>
&lt;p>Optimisation with constraints (equalities/inequalities).&lt;/p>
&lt;hr>
&lt;p>&lt;a href="https://arshadhs.github.io/">Home&lt;/a> | &lt;a href="https://arshadhs.github.io/docs/ai/010-maths/020-calculus/05-optimisation/">
 Continuous Optimisation
&lt;/a>&lt;/p></description></item><item><title>Lagrange Multipliers</title><link>https://arshadhs.github.io/docs/ai/010-maths/020-calculus/05-optimisation/lagrange-multipliers/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://arshadhs.github.io/docs/ai/010-maths/020-calculus/05-optimisation/lagrange-multipliers/</guid><description>&lt;h1 id="lagrange-multipliers">
 Lagrange Multipliers
 
 &lt;a class="anchor" href="#lagrange-multipliers">#&lt;/a>
 
&lt;/h1>
&lt;p>Transforms constrained problems into unconstrained ones using Lagrangians.&lt;/p>
&lt;hr>
&lt;p>&lt;a href="https://arshadhs.github.io/">Home&lt;/a> | &lt;a href="https://arshadhs.github.io/docs/ai/010-maths/020-calculus/05-optimisation/">
 Continuous Optimisation
&lt;/a>&lt;/p></description></item><item><title>Convex Optimisation</title><link>https://arshadhs.github.io/docs/ai/010-maths/020-calculus/05-optimisation/convex-optimisation/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://arshadhs.github.io/docs/ai/010-maths/020-calculus/05-optimisation/convex-optimisation/</guid><description>&lt;h1 id="convex-optimisation">
 Convex Optimisation
 
 &lt;a class="anchor" href="#convex-optimisation">#&lt;/a>
 
&lt;/h1>
&lt;p>Convex objectives have a single global minimum, making optimisation reliable.&lt;/p>
&lt;hr>
&lt;p>&lt;a href="https://arshadhs.github.io/">Home&lt;/a> | &lt;a href="https://arshadhs.github.io/docs/ai/010-maths/020-calculus/05-optimisation/">
 Continuous Optimisation
&lt;/a>&lt;/p></description></item></channel></rss>