<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>D-Separation on Aayush Bajaj's Augmenting Infrastructure</title><link>https://abaj.ai/tags/d-separation/</link><description>Recent content in D-Separation on Aayush Bajaj's Augmenting Infrastructure</description><generator>Hugo</generator><language>en</language><copyright>© 2026 Aayush Bajaj</copyright><lastBuildDate>Mon, 31 Aug 2026 00:29:54 +1000</lastBuildDate><atom:link href="https://abaj.ai/tags/d-separation/index.xml" rel="self" type="application/rss+xml"/><item><title>Bayesian Networks</title><link>https://abaj.ai/wiki/ml/pgm/bayesian-networks/</link><pubDate>Mon, 31 Aug 2026 00:29:54 +1000</pubDate><guid>https://abaj.ai/wiki/ml/pgm/bayesian-networks/</guid><description>&lt;p>a joint probability distribution over \(n\) binary variables is a table with \(2^n - 1\) free numbers. at \(n = 30\) that is a billion parameters for a toy problem — nobody can elicit them, store them, or estimate them from data. the bayesian network is the classical answer: encode the &lt;em>independencies&lt;/em> of the distribution in a directed acyclic graph, and the joint collapses into a product of small local tables.&lt;span class="margin-note" data-note="the treatment here follows darwiche&amp;#39;s book and unsw&amp;#39;s comp9418, which is taught from it">
 &lt;span class="margin-note-indicator">𐃏&lt;/span>
&lt;/span>
the graph is simultaneously a data structure for storage, a calculus for reading off independence, and the substrate on which every &lt;a
 href="https://abaj.ai/wiki/ml/pgm/inference/"
 
 
>inference algorithm&lt;/a> runs.&lt;/p></description></item></channel></rss>