<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Representation Learning on Nalar</title>
    <link>https://nalar.dev/tags/representation-learning/</link>
    <description>Recent content in Representation Learning on Nalar</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Fri, 04 Sep 2026 00:00:00 +0700</lastBuildDate>
    <atom:link href="https://nalar.dev/tags/representation-learning/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Understand Negative Sampling for Representation Learning</title>
      <link>https://nalar.dev/understand-negative-sampling-for-representation-learning/</link>
      <pubDate>Fri, 04 Sep 2026 00:00:00 +0700</pubDate>
      <guid>https://nalar.dev/understand-negative-sampling-for-representation-learning/</guid>
      <description>&lt;p&gt;Some representation-learning problems have an awkward shape: each training example has one observed target, but the model could choose from thousands or millions of alternatives. Computing a score and normalization term for every alternative on every update can become a major training cost.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Negative sampling&lt;/strong&gt; changes the training problem. Instead of comparing the observed target with every possible alternative, the model learns from the observed &lt;strong&gt;positive pair&lt;/strong&gt; and a small set of deliberately sampled &lt;strong&gt;negative pairs&lt;/strong&gt;. The update becomes much cheaper, but it also optimizes a sampled discrimination objective rather than the exact full-class objective.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
