<?xml version="1.0" encoding="utf-8"?><feed xmlns="http://www.w3.org/2005/Atom" ><generator uri="https://jekyllrb.com/" version="3.10.0">Jekyll</generator><link href="https://alhaad.github.io//feed.xml" rel="self" type="application/atom+xml" /><link href="https://alhaad.github.io//" rel="alternate" type="text/html" /><updated>2026-07-14T10:27:30+00:00</updated><id>https://alhaad.github.io//feed.xml</id><title type="html">Alhaad Gokhale</title><subtitle>Personal website</subtitle><entry><title type="html">Portfoliotools.in: Portfolio anlaysis and bechmarking tools for smart investing in India.</title><link href="https://alhaad.github.io//2024/09/21/portfoliotools.html" rel="alternate" type="text/html" title="Portfoliotools.in: Portfolio anlaysis and bechmarking tools for smart investing in India." /><published>2024-09-21T00:00:00+00:00</published><updated>2024-09-21T00:00:00+00:00</updated><id>https://alhaad.github.io//2024/09/21/portfoliotools</id><content type="html" xml:base="https://alhaad.github.io//2024/09/21/portfoliotools.html"><![CDATA[]]></content><author><name></name></author><category term="portfoliotools portfolio analysis benchmarking investing india" /></entry><entry><title type="html">Multi-layer perceptron (MLP) is a universal classifier</title><link href="https://alhaad.github.io//2024/05/01/mlp-universal-classifier.html" rel="alternate" type="text/html" title="Multi-layer perceptron (MLP) is a universal classifier" /><published>2024-05-01T00:00:00+00:00</published><updated>2024-05-01T00:00:00+00:00</updated><id>https://alhaad.github.io//2024/05/01/mlp-universal-classifier</id><content type="html" xml:base="https://alhaad.github.io//2024/05/01/mlp-universal-classifier.html"><![CDATA[<html>
  <head>
    <script type="text/x-mathjax-config">
      MathJax.Hub.Config({
      TeX: { equationNumbers: { autoNumber: "AMS" } }
      });
    </script>
    <script type="text/javascript" async="" src="http://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script>
  &lt;/script&gt;
</head>
<body>

Notes from CMU 11-785. Lecture #1

## Perceptron is a linear classifier
A single perceptron (or neuron) acts as a linear classifier. `W` are weights, `X` is the input vector, `b` is the bias and `f` is the activation function - step function for binary classification.
$$
Y = f(W^T X + b)
$$

In two dimensions it will represent a line.
$$
\begin{bmatrix} y \\ \end{bmatrix} = \begin{bmatrix} w1 &amp; w2 \\ \end{bmatrix} \begin{bmatrix} x1 \\ x2 \end{bmatrix} + \begin{bmatrix} b \end{bmatrix}
$$

## Logic AND is a linear classification problem
There exists atleast one linear decision boudnary that can separate the two outputs (0 and 1). An example is 
$$
f(x1 + x2 - 1.5)
$$

| x1 | x2 | x1 + x2 - 1.5 | f(x1 + x2 - 1.5) |
|----|----|---------------|------------------|
| 0  | 0  | -1.5          | 0                |
| 0  | 1  | -0.5          | 0                |
| 1  | 0  | -0.5          | 0                |
| 1  | 1  | 0.5           | 1                |

Here is a way to visualize
```plaintext

   y
   |
 1 +        (1,1)
   |        
   |        
 0 +   (0,0)      (0,1)
   |        (1,0)
   +----------------------&gt; x
        0       1
```
Tangentially, individual perceptrons can act as boolean gates (e.g AND, OR), network of perceptrons are boolean functions (eg. XOR) and MLPs are universal boolean functions.

## Perceptron(s) can create an arbitrary bounding box
We can use multiple perceptrons to create an arbitrary bounding box.
Let's create a triangle. Everything within the triangle belongs to class A, everything outside is class B. 
$$
\begin{bmatrix} y1 \\ y2 \\ y3 \end{bmatrix} = \begin{bmatrix} 1 &amp; 1 \\ 1 &amp; -1 \\ 1 &amp; 0 \end{bmatrix} \begin{bmatrix} x1 \\ x2 \end{bmatrix} + \begin{bmatrix} 1 \\ 1 \\ -1 \end{bmatrix}
$$

The output of the above perceptrons can then be used by an AND layer. For examle,
```plaintext
Input Layer:       First Layer (Bounding Box):          Second Layer (AND):
(x1, x2)  ----&gt;  [Perceptron 1: x ≥ 0.5]  -----------&gt;  [AND Perceptron]  ----&gt; Output
               \                                   /
                \                                 /
                 \-&gt;  [Perceptron 2: x ≤ 1.5]  -/
                 /-&gt;  [Perceptron 3: y ≥ 0.5]  -\
                /                                 \
               /                                   \
(x1, x2)  ----&gt;  [Perceptron 4: y ≤ 1.5]  -----------&gt;
```
A universal classifier can then be a tree of such linear classifers + AND layers and could be used to model any classification problem with arbitary precision.
</body>
</html>]]></content><author><name></name></author><category term="MLP universal classifier" /><summary type="html"><![CDATA[&lt;/script&gt;]]></summary></entry><entry><title type="html">Wordle Next: Suggestions for your next Wordle</title><link href="https://alhaad.github.io//2024/04/24/wordle-next.html" rel="alternate" type="text/html" title="Wordle Next: Suggestions for your next Wordle" /><published>2024-04-24T00:00:00+00:00</published><updated>2024-04-24T00:00:00+00:00</updated><id>https://alhaad.github.io//2024/04/24/wordle-next</id><content type="html" xml:base="https://alhaad.github.io//2024/04/24/wordle-next.html"><![CDATA[]]></content><author><name></name></author><category term="wordle next suggestion app" /></entry><entry><title type="html">Countries visited</title><link href="https://alhaad.github.io//2020/01/01/countries-visited.html" rel="alternate" type="text/html" title="Countries visited" /><published>2020-01-01T00:00:00+00:00</published><updated>2020-01-01T00:00:00+00:00</updated><id>https://alhaad.github.io//2020/01/01/countries-visited</id><content type="html" xml:base="https://alhaad.github.io//2020/01/01/countries-visited.html"><![CDATA[<html>
<head>
  <!-- Scripts for GeoCharts. Copied from https://developers.google.com/chart/interactive/docs/gallery/geochart -->
  <script type="text/javascript" src="https://www.gstatic.com/charts/loader.js"></script>
  <script type="text/javascript">
    google.charts.load('current', {'packages':['geochart']});
    google.charts.setOnLoadCallback(drawRegionsMap);
    
    function drawRegionsMap() {
      
      var data = google.visualization.arrayToDataTable([
        ['Country'],
        ['India'],
        ['United States'],
        ['Sri Lanka'],
        ['Singapore'],
        ['Malaysia'],
        ['Switzerland'],
        ['Mexico'],
        ['France'],
        ['Italy'],
        ['Spain'],
        ['Iceland'],
        ['Austria'],
        ['Germany'],
        ['Czech Republic'],
        ['Israel'],
        ['United Kingdom'],
        ['Turkey'],
        ['Maldives'],
        ['Portugal'],
        ['Thailand'],
        ['Indonesia'],
        ['South Korea'],
      ]);
      
      var options = {
        defaultColor: 'blue',
        domain: 'IN'
      };
      
      var chart = new google.visualization.GeoChart(document.getElementById('regions_div'));
      
      chart.draw(data, options);
    }
  </script>
</head>
<body>
    <div id="regions_div" style="width: 100%;"></div>
</body>
</html>]]></content><author><name></name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">How to build your network</title><link href="https://alhaad.github.io//2019/09/15/how-to-build-your-network.html" rel="alternate" type="text/html" title="How to build your network" /><published>2019-09-15T00:00:00+00:00</published><updated>2019-09-15T00:00:00+00:00</updated><id>https://alhaad.github.io//2019/09/15/how-to-build-your-network</id><content type="html" xml:base="https://alhaad.github.io//2019/09/15/how-to-build-your-network.html"><![CDATA[<p>Notes based on my reading of
<a href="https://hbr.org/2005/12/how-to-build-your-network">this HBR article</a> by Brian
Uzzi and Shannon Dunlap.</p>

<ul>
  <li>
    <p><strong>Correlation between strong networks and success.</strong> For e.g., Bill Gates
got introduced to an IBM executive through his mother - which led to Microsoft
getting the DOS contract.</p>
  </li>
  <li>
    <p>Study by sociologist Randall Collins of the University of Pennsylvania showed
that breakthroughs were consequence of a particular type of personal network
with very few exceptions.</p>
  </li>
  <li>Advantages
    <ul>
      <li><strong>Private Information.</strong> Provides information arbitrage but reliability may
be an issue.</li>
      <li><strong>Diverse set of skills.</strong> Increases diversity and exposure to ideas that’ll
help with creativity.</li>
      <li><strong>Power.</strong> Traditional executive power moved from hierarchy to information
brokers. <em>I don’t understand this point.</em></li>
    </ul>
  </li>
  <li>Advantages might work against each other. <strong>Diagnose network.</strong> Does your
network fall in either catergory?
    <ul>
      <li><strong>Self-similarity principle.</strong> People who are similar to you.</li>
      <li><strong>Proximity principle.</strong> People who you spend most time with.</li>
    </ul>
  </li>
  <li>
    <p>Create your network based on <strong>SHARED ACTIVITIES.</strong> For e.g., non-profits, 
running group.</p>
  </li>
  <li>Cultivate powerful <strong>brokers who aren’t in position of formal authority.</strong></li>
</ul>]]></content><author><name></name></author><summary type="html"><![CDATA[Notes based on my reading of this HBR article by Brian Uzzi and Shannon Dunlap.]]></summary></entry><entry><title type="html">‘The quick &amp;amp; easy way to effective speaking’ by Dale Carnagie</title><link href="https://alhaad.github.io//2019/09/09/effective-speaking-dale-carnagie-notes.html" rel="alternate" type="text/html" title="‘The quick &amp;amp; easy way to effective speaking’ by Dale Carnagie" /><published>2019-09-09T00:00:00+00:00</published><updated>2019-09-09T00:00:00+00:00</updated><id>https://alhaad.github.io//2019/09/09/effective-speaking-dale-carnagie-notes</id><content type="html" xml:base="https://alhaad.github.io//2019/09/09/effective-speaking-dale-carnagie-notes.html"><![CDATA[<p><a target="_blank" href="https://www.amazon.in/gp/product/9386108704/ref=as_li_tl?ie=UTF8&amp;camp=3638&amp;creative=24630&amp;creativeASIN=9386108704&amp;linkCode=as2&amp;tag=alhaad-21&amp;linkId=919336c86c16db662e2dfb251da47421"><img border="0" src="//ws-in.amazon-adsystem.com/widgets/q?_encoding=UTF8&amp;MarketPlace=IN&amp;ASIN=9386108704&amp;ServiceVersion=20070822&amp;ID=AsinImage&amp;WS=1&amp;Format=_SL160_&amp;tag=alhaad-21" /></a><img src="//ir-in.amazon-adsystem.com/e/ir?t=alhaad-21&amp;l=am2&amp;o=31&amp;a=9386108704" width="1" height="1" border="0" alt="" style="border:none !important; margin:0px !important;" /></p>

<h2 id="basic-principles-of-effective-speaking">Basic principles of effective speaking</h2>

<h3 id="take-heart-from-others-experience">Take heart from others’ experience</h3>

<p>Nobody is born a public speaker, but a lot of people have acquired this skill by
following Dale Carnagie’s method.</p>

<h3 id="keep-sight-of-your-goal">Keep sight of your goal</h3>

<p>Project yourself in the future and work towards making it a reality. Imagine
yourself before an audience you might be called upon to address.</p>

<h3 id="predetermine-your-mind-to-success">Predetermine your mind to success</h3>

<p>Have the self-assurance to believe that you’ll succeed.</p>

<h3 id="seize-every-opportunity-to-practice">Seize every opportunity to practice</h3>

<p>Grab all possible speaking opportunities like business meetings, public
meetings, teach sunday class, become scout leader.</p>

<h3 id="facts-about-fear-of-speaking-in-public">Facts about fear of speaking in public</h3>

<p>Almost everyone is afraid of speaking in public. Professional speakers never
completely get rid of their stage fright. But, a certain amoaunt of stage fright
is useful and can be used to your advantage.</p>]]></content><author><name></name></author><summary type="html"><![CDATA[]]></summary></entry></feed>