<?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://linhthi.github.io/feed.xml" rel="self" type="application/atom+xml" /><link href="https://linhthi.github.io/" rel="alternate" type="text/html" /><updated>2026-02-02T01:39:31-08:00</updated><id>https://linhthi.github.io/feed.xml</id><title type="html">Thi Linh Hoang</title><subtitle>personal description</subtitle><author><name>Thi Linh Hoang</name><email>htlinh83@gmail.com</email></author><entry><title type="html">Review of Graph Transformer</title><link href="https://linhthi.github.io/posts/2024/11/blog-post-1/" rel="alternate" type="text/html" title="Review of Graph Transformer" /><published>2023-11-30T00:00:00-08:00</published><updated>2023-11-30T00:00:00-08:00</updated><id>https://linhthi.github.io/posts/2024/11/blog-post-1</id><content type="html" xml:base="https://linhthi.github.io/posts/2024/11/blog-post-1/"><![CDATA[<p>In last few years, Graph Transformers models become a promising direction for graph learning model due to the successful of Transformers in other tasks like NLP or CV. This note reviews about the recent works adapt Transformer for graph data for more a scaleable, expressive tool include improving positional encoding, attention mechanism, etc.</p>

<p>You can check my note at <a href="https://spot-power-205.notion.site/Notes-of-Graph-Transformers-model-8153f6af2f6f4fde81ad8dee93dc3a68?pvs=4">notion</a>.</p>]]></content><author><name>Thi Linh Hoang</name><email>htlinh83@gmail.com</email></author><category term="graph learning" /><summary type="html"><![CDATA[In last few years, Graph Transformers models become a promising direction for graph learning model due to the successful of Transformers in other tasks like NLP or CV. This note reviews about the recent works adapt Transformer for graph data for more a scaleable, expressive tool include improving positional encoding, attention mechanism, etc.]]></summary></entry><entry><title type="html">Note in Probability basis</title><link href="https://linhthi.github.io/posts/2024/01/24/blog-post-1/" rel="alternate" type="text/html" title="Note in Probability basis" /><published>2023-08-24T00:00:00-07:00</published><updated>2023-08-24T00:00:00-07:00</updated><id>https://linhthi.github.io/posts/2024/01/24/blog-post-1</id><content type="html" xml:base="https://linhthi.github.io/posts/2024/01/24/blog-post-1/"><![CDATA[<p>Some of the concepts of probability I think we will use frequently.</p>

<p><strong>Expectations.</strong></p>

<p>Some useful properties:</p>

<ol>
  <li><em>Linearity</em>. $\mathbb{E}[\sum_i c_jg_j(X)] = \sum_j c_j \mathbb{E}[g_j(X)]$, where $c_j$’s are not random variables.</li>
  <li><em>Independence</em>. If $X, Y$ are independent random variables $P(X \in A, Y \in B) = P(X \in A) P(X\in B)$ for all $A, B$, then $\mathbb{E}[X, Y] = \mathbb{E}[X] \mathbb{E}[Y]$.</li>
  <li><em>Iterated Expectation</em>.
\(\mathbb{E}[Y] = \mathbb{E}[\mathbb{E}[Y |X] = \int{\mathbb{E}[y |X = x]p(x)dx}\)</li>
</ol>

<p><strong>Variance</strong>.
The variance of a random variale is:
\(Var[X] = \mathbb{E}[(X - \mathbb{E}[X])^2 = \mathbb{E}[X^2] - {\mathbb{E}[X]}^2\)</p>

<p>Some useful properties:</p>
<ol>
  <li><em>Independence</em>. If $X_1, …, X_n$ are independent, then $Var[\sum_i a_iX_i] = \sum_i a_i^2 Var[X_i]$.</li>
  <li><em>Law of total variance</em>. 
$Var[y] = Var[\mathbb{E}[Y|X]] + \mathbb{E}[Var[Y|X]]$.</li>
</ol>

<p><strong>Markov’s inequality</strong>. If $X$ is a non-negative random variable, then for any $\epsilon &gt; 0$: 
\(P[X \geq \epsilon] \leq \frac{\mathbb{E}[X]}{\epsilon}\)</p>]]></content><author><name>Thi Linh Hoang</name><email>htlinh83@gmail.com</email></author><category term="math" /><summary type="html"><![CDATA[Some of the concepts of probability I think we will use frequently.]]></summary></entry><entry><title type="html">Snails climb up the well</title><link href="https://linhthi.github.io/posts/2023/08/blog-post-1/" rel="alternate" type="text/html" title="Snails climb up the well" /><published>2023-08-17T00:00:00-07:00</published><updated>2023-08-17T00:00:00-07:00</updated><id>https://linhthi.github.io/posts/2023/08/blog-post-1</id><content type="html" xml:base="https://linhthi.github.io/posts/2023/08/blog-post-1/"><![CDATA[<p>A snail climbs a well $x$ feet during the day, and during night, it slips $y$ feet. If the well is $h$ feet deep, how long will it take for the snail to climb?</p>

<p>Solution:</p>

<p>Let $k$ denotes the number of days for the snail climb up the well, $k \in \mathbb{N}$.</p>

<p>If $n \leq x$, $k = 1$.</p>

<p>If $n &gt; x$,</p>
<ul>
  <li>If $ x \leq y$, $k = \infty$,</li>
  <li>If $ x &gt; y$ : k is the minimum value satisfies this inequality:</li>
</ul>

\[(k -1)(x-y) + x \geq h,\]

\[\implies k - 1 \geq \frac{h - x}{x - y},\]

\[\implies k \geq \frac{h - x}{x - y} + 1,\]

\[\implies k = \lceil \frac{h - x}{x - y} + 1 \rceil\]]]></content><author><name>Thi Linh Hoang</name><email>htlinh83@gmail.com</email></author><category term="math" /><summary type="html"><![CDATA[A snail climbs a well $x$ feet during the day, and during night, it slips $y$ feet. If the well is $h$ feet deep, how long will it take for the snail to climb?]]></summary></entry></feed>