<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>emre şahin's digital garden 🍃 - ml</title>
    <link>https://emresahin.net/tags/ml/</link>
    <description>Posts in the ml tag</description>
    <language>en</language>
    <managingEditor>contact@emresahin.net (Emre Şahin)</managingEditor>
    <lastBuildDate>Tue, 15 Sep 2026 19:46:32 +0000</lastBuildDate>
    <atom:link href="https://emresahin.net/tags/ml/rss.xml" rel="self" type="application/rss+xml"/>
    <item>
      <title>bits 2</title>
      <published>2023-03-14T10:58:00+00:00</published>
      <updated>2023-03-14T10:58:00+00:00</updated>
      <author>Emre Şahin</author>
      <pubDate>Tue, 14 Mar 2023 10:58:00 +0000</pubDate>
      <link>https://emresahin.net/bits-2/</link>
      <guid isPermaLink="true">https://emresahin.net/bits-2/</guid>
      <description>We are using a vector database for semantic search. Currently, we employ Pinecone for vector search. I noticed there is an open-source vector database called Qdrant (pronounced quadrant) that can replace it. There are other options like pgvector for PostgreSQL.</description>
      <category>bits</category>
      <category>search</category>
      <category>vector database</category>
      <category>qdrant</category>
      <category>pinecone</category>
      <category>ml</category>
      <category>semantic search</category>
      <content:encoded><![CDATA[<p>We are using a vector database for semantic search. Currently, we employ <a href="https://www.pinecone.io">Pinecone</a> for vector search.</p>
<p>I noticed there is an open-source vector database called <a href="https://github.com/qdrant/qdrant">Qdrant</a> (pronounced quadrant) that can replace it.</p>
<p>There are other options like <a href="https://github.com/pgvector/pgvector">pgvector</a> for PostgreSQL.</p>]]></content:encoded>
    </item>
    <item>
      <title>Types of regularization in ML</title>
      <published>2020-12-26T01:07:49+00:00</published>
      <updated>2020-12-26T01:07:49+00:00</updated>
      <author>Emre Şahin</author>
      <pubDate>Sat, 26 Dec 2020 01:07:49 +0000</pubDate>
      <link>https://emresahin.net/regularization-types/</link>
      <guid isPermaLink="true">https://emresahin.net/regularization-types/</guid>
      <description>What is regularization? Regularization is a technique used to reduce the complexity of a model, thereby preventing overfitting. There are three common types of regularization used in Deep Neural Networks (DNN): L2 Regularization: We define the complexity of a model by the sum of the squares of it...</description>
      <category>AI</category>
      <category>Machine Learning</category>
      <category>deep learning</category>
      <category>regularization</category>
      <category>ml</category>
      <category>neural networks</category>
      <category>l1 regularization</category>
      <category>l2 regularization</category>
      <category>dropout</category>
      <content:encoded><![CDATA[<p>What is regularization?</p>
<p>Regularization is a technique used to reduce the complexity of a model, thereby preventing overfitting. There are three common types of regularization used in Deep Neural Networks (DNN):</p>
<p><strong>L2 Regularization:</strong> We define the complexity of a model by the sum of the squares of its weights: $W = w_0^2 + w_1^2 + … + w_n^2$. We add this term to the loss function to obtain:</p>
<p>$L(\text{data}, \text{model}) = \text{loss}(\text{data}, \text{model}) + \lambda \sum w_i^2$</p>
<p>We then aim to minimize this total loss. As the derivative of $W$ with respect to each weight $w_i$ is $2w_i$, backpropagation reduces the weights by penalizing larger values, effectively “decaying” them.</p>
<p><strong>L1 Regularization:</strong> This is similar to L2 regularization, but $W$ is defined as the sum of the absolute values of the weights:</p>
<p>$W = \sum |w_i|$</p>
<p>The derivative of $W$ with respect to $w_i$ is a constant ($\pm 1$) this time, so weights can be reduced exactly to zero, unlike in L2 regularization. This often leads to sparse models.</p>
<p><strong>Dropout:</strong> Unlike the previous two methods, dropout is implemented as a layer within the neural network rather than a modification to the loss function.</p>
<p>A dropout layer randomly sets a subset of activations to zero during training. For example, a dropout layer with a rate of 0.3 will randomly deactivate 30% of the neurons in that layer for each training step.</p>]]></content:encoded>
    </item>
  </channel>
</rss>
