<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Trivial or Wrong</title>
    <description>Machine Learning, Data Science, Programming, Mathematics and Algorithms.
</description>
    <link>http://omersha.github.io//</link>
    <atom:link href="http://omersha.github.io//feed.xml" rel="self" type="application/rss+xml"/>
    <pubDate>Sun, 17 Jun 2018 06:05:34 +0000</pubDate>
    <lastBuildDate>Sun, 17 Jun 2018 06:05:34 +0000</lastBuildDate>
    <generator>Jekyll v3.7.3</generator>
    
      <item>
        <title>A Whole New Dimension of Optimization</title>
        <description>&lt;h1 id=&quot;a-whole-new-dimension-of-optimization&quot;&gt;A Whole New Dimension of Optimization&lt;/h1&gt;

</description>
        <pubDate>Tue, 10 Jan 2017 00:00:00 +0000</pubDate>
        <link>http://omersha.github.io//2017/01/10/a-whole-new-dimension-of-optimization.html</link>
        <guid isPermaLink="true">http://omersha.github.io//2017/01/10/a-whole-new-dimension-of-optimization.html</guid>
        
        
      </item>
    
      <item>
        <title>Take the Rough With the Smooth</title>
        <description>&lt;div&gt;&lt;p&gt;
The starting point of the &lt;a href=&quot;http://www.trivialorwrong.com/2016/11/15/the-
roots-of-no-evil.html&quot;&gt;previous post&lt;/a&gt; was optimization of differentiable
functions, but trying to utilize Fermat's theorem led us eventually to
bracketing algorithms, which make no use of the derivative and are applicable for
non-differentiable functions.
&lt;/p&gt;&lt;/div&gt;

</description>
        <pubDate>Mon, 28 Nov 2016 00:00:00 +0000</pubDate>
        <link>http://omersha.github.io//2016/11/28/take-the-rough-with-the-smooth.html</link>
        <guid isPermaLink="true">http://omersha.github.io//2016/11/28/take-the-rough-with-the-smooth.html</guid>
        
        
      </item>
    
      <item>
        <title>The Roots of No Evil</title>
        <description>&lt;blockquote&gt;
  &lt;p&gt;“…nothing at all takes place in the universe in which some rule of maximum
or minimum does not appear…”  -Leonhard Euler&lt;/p&gt;
&lt;/blockquote&gt;

</description>
        <pubDate>Tue, 15 Nov 2016 00:00:00 +0000</pubDate>
        <link>http://omersha.github.io//2016/11/15/the-roots-of-no-evil.html</link>
        <guid isPermaLink="true">http://omersha.github.io//2016/11/15/the-roots-of-no-evil.html</guid>
        
        
      </item>
    
      <item>
        <title>Random Integers</title>
        <description>&lt;div&gt;&lt;p&gt;
The need to sample from a discrete distribution given by a probability vector
$\vec{p}=(p_1,p_2,...,p_n)$ comes up very often. For example, when taking a
bootstrapped sample from a weighted dataset, or when selecting parents from a
population based on their realtive fitness in genetic algorithms, or when
implementing an agent that applies a mixed strategy, or... well, I made my
point: often.
&lt;/p&gt;&lt;/div&gt;

</description>
        <pubDate>Mon, 26 Sep 2016 00:00:00 +0000</pubDate>
        <link>http://omersha.github.io//2016/09/26/random-integers.html</link>
        <guid isPermaLink="true">http://omersha.github.io//2016/09/26/random-integers.html</guid>
        
        
      </item>
    
      <item>
        <title>Machine Learning. Literally.</title>
        <description>&lt;p&gt;What’s the most successful application of machine learning?&lt;/p&gt;

</description>
        <pubDate>Wed, 08 Jun 2016 00:00:00 +0000</pubDate>
        <link>http://omersha.github.io//2016/06/08/machine-learning-literally.html</link>
        <guid isPermaLink="true">http://omersha.github.io//2016/06/08/machine-learning-literally.html</guid>
        
        
      </item>
    
      <item>
        <title>Laws, Sausages and ConvNets</title>
        <description>&lt;blockquote&gt;
  &lt;p&gt;Laws, like sausages, cease to inspire respect in proportion as we know how
they are made.&lt;/p&gt;
&lt;/blockquote&gt;

</description>
        <pubDate>Wed, 01 Jun 2016 00:00:00 +0000</pubDate>
        <link>http://omersha.github.io//2016/06/01/laws-sausages-and-convnets.html</link>
        <guid isPermaLink="true">http://omersha.github.io//2016/06/01/laws-sausages-and-convnets.html</guid>
        
        
      </item>
    
      <item>
        <title>The Generative-Discriminative Fallacy</title>
        <description>&lt;h3 id=&quot;1-the-generative-discriminative-dichotomy&quot;&gt;1. The Generative-Discriminative Dichotomy&lt;/h3&gt;
&lt;div&gt;&lt;p&gt;
It is customary to categorize predictive algorithms as either &lt;a href=&quot;https://en.wikipedia.org/wiki/Generative_model&quot;&gt;&quot;generative&quot;&lt;/a&gt;
or &lt;a href=&quot;https://en.wikipedia.org/wiki/Discriminative_model&quot;&gt;&quot;discriminative&quot;&lt;/a&gt;.
Denoting by $Y$ the target and by $X$ the observable, discriminative algorithms are those
that model the conditional distribution $P(Y|X;\theta)$ and generative
algorithms are those that model the joint distribution $P(X,Y|\theta)$) (note
that this entire discussion presumes a probabilistic perspective on predictive
tasks).
&lt;/p&gt;&lt;/div&gt;

</description>
        <pubDate>Sun, 22 May 2016 00:00:00 +0000</pubDate>
        <link>http://omersha.github.io//2016/05/22/the-generative-discriminative-fallacy.html</link>
        <guid isPermaLink="true">http://omersha.github.io//2016/05/22/the-generative-discriminative-fallacy.html</guid>
        
        
      </item>
    
      <item>
        <title>Learning Dynamical Systems</title>
        <description>&lt;h3 id=&quot;1-motivational-speech&quot;&gt;1. Motivational Speech&lt;/h3&gt;

</description>
        <pubDate>Sat, 14 May 2016 00:00:00 +0000</pubDate>
        <link>http://omersha.github.io//2016/05/14/learning-dynamical-systems.html</link>
        <guid isPermaLink="true">http://omersha.github.io//2016/05/14/learning-dynamical-systems.html</guid>
        
        
      </item>
    
      <item>
        <title>The Name of The Rose</title>
        <description>&lt;div&gt;&lt;p&gt;
Many ideas in machine learning came up independently in different contexts, and
it's not uncommon to have multiple terms for the same concept. Those instances
are usually dismissed as nuisance; after all, a rose by any other name, et
cetera. Indeed, often this is just a matter of nomenclature, and with time
conventions form, and some terms disappear while others acquire universal
meaning. But sometimes the distinction is not as superficial as it may seem.
&lt;/p&gt;&lt;/div&gt;

</description>
        <pubDate>Tue, 22 Dec 2015 00:00:00 +0000</pubDate>
        <link>http://omersha.github.io//2015/12/22/the-name-of-the-rose.html</link>
        <guid isPermaLink="true">http://omersha.github.io//2015/12/22/the-name-of-the-rose.html</guid>
        
        
      </item>
    
      <item>
        <title>Pointless Topology via Abstract Nonsense</title>
        <description>&lt;div&gt;&lt;p&gt;
In 1940. G.H. Hardy published his essay &quot;A Mathematician's Apology&quot; in which he
used number theory as a prominent example for pure and inapplicable mathematics.
He meant it seriously, not as a joke. To the defense of his apology (pun a bit
intended), at the time only a handful of programmers thought about hash-tables,
cryptosystems were yet to be widely implemented in E-commerce platforms, and not
many people used FFT before 1965 (no one but Gauss, I think). Indeed, computers
forced mathematicians to work harder and harder in order to keep annoying
engineers away from their offices.
&lt;/p&gt;&lt;/div&gt;

</description>
        <pubDate>Tue, 15 Dec 2015 00:00:00 +0000</pubDate>
        <link>http://omersha.github.io//2015/12/15/pointless-topology-via-abstract-nonsense.html</link>
        <guid isPermaLink="true">http://omersha.github.io//2015/12/15/pointless-topology-via-abstract-nonsense.html</guid>
        
        
      </item>
    
  </channel>
</rss>
