<feed xmlns="http://www.w3.org/2005/Atom"> <id>https://kino204.github.io/</id><title>kINo's Blogs</title><subtitle>Notes &amp; ideas.</subtitle> <updated>2026-09-27T17:33:55+08:00</updated> <author> <name>kino</name> <uri>https://kino204.github.io/</uri> </author><link rel="self" type="application/atom+xml" href="https://kino204.github.io/feed.xml"/><link rel="alternate" type="text/html" hreflang="en" href="https://kino204.github.io/"/> <generator uri="https://jekyllrb.com/" version="4.4.1">Jekyll</generator> <rights> © 2026 kino </rights> <icon>/assets/img/favicons/favicon.ico</icon> <logo>/assets/img/favicons/favicon-96x96.png</logo> <entry><title>Automatic Differentiation</title><link href="https://kino204.github.io/posts/autodiff/" rel="alternate" type="text/html" title="Automatic Differentiation" /><published>2026-09-27T00:00:00+08:00</published> <updated>2026-09-27T17:33:29+08:00</updated> <id>https://kino204.github.io/posts/autodiff/</id> <content type="text/html" src="https://kino204.github.io/posts/autodiff/" /> <author> <name>kino</name> </author> <summary>Automatic differentiation(AD) is one of the core techniques in modern deep learning frameworks. There are two main methods: forward &amp;amp; reverse mode AD. The Chain Rule Chain rule is the core principle for both forward &amp;amp; reverse AD. The working environment for AD is a calculation DAG, with each node being a tensor $\mathbb{R}^{n}$. Take two node $x$ &amp;amp; $y$, given that there exists a p...</summary> </entry> <entry><title>Conditional Probability as a Fully-connected Probability Model</title><link href="https://kino204.github.io/posts/conditional-probability-as-a-fully-connected-probability-model/" rel="alternate" type="text/html" title="Conditional Probability as a Fully-connected Probability Model" /><published>2026-09-07T10:51:00+08:00</published> <updated>2026-09-14T14:27:56+08:00</updated> <id>https://kino204.github.io/posts/conditional-probability-as-a-fully-connected-probability-model/</id> <content type="text/html" src="https://kino204.github.io/posts/conditional-probability-as-a-fully-connected-probability-model/" /> <author> <name>kino</name> </author> <summary>Markov condition [p(x_{i} \Omega \backslash \mathbf{de}(x_{i})) = p(x_{i} \mathbf{pa}(x_{i}))] provides prior belief about “relevancy” between events.</summary> </entry> </feed>
