<?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://ruban-vp.github.io/feed.xml" rel="self" type="application/atom+xml" /><link href="https://ruban-vp.github.io/" rel="alternate" type="text/html" /><updated>2026-05-10T16:36:30+00:00</updated><id>https://ruban-vp.github.io/feed.xml</id><title type="html">Ruban Vishnu Pandian</title><subtitle>Academic Portfolio</subtitle><author><name>Ruban Vishnu Pandian</name><email>rubanvp@utexas.edu</email></author><entry><title type="html">Proof attempt of Hoeffding inequality for sampling without replacement</title><link href="https://ruban-vp.github.io/blog-post-1/" rel="alternate" type="text/html" title="Proof attempt of Hoeffding inequality for sampling without replacement" /><published>2026-03-16T00:00:00+00:00</published><updated>2026-03-16T00:00:00+00:00</updated><id>https://ruban-vp.github.io/blog-post-1</id><content type="html" xml:base="https://ruban-vp.github.io/blog-post-1/"><![CDATA[<p>Hoeffding’s inequality is a classic result in concentration theory which bounds the deviation error of sums of bounded, independent random variables. Hence, it can be applied to RVs which are sampled uniformly with replacement from a finite dataset. But does the inequality work even if the samples are obtained without replacement? The answer is <strong>Yes</strong> and Hoeffding even proved this in his original paper by constructing an auxillary function. This is my attempt at going through his proof rigorously and understand the key combinatorial concepts needed in this proof.</p>

<p>The detailed proof sketch can be found here: <a href="/files/HL_proof.pdf">Proof</a></p>]]></content><author><name>Ruban Vishnu Pandian</name><email>rubanvp@utexas.edu</email></author><category term="math" /><summary type="html"><![CDATA[Hoeffding’s inequality is a classic result in concentration theory which bounds the deviation error of sums of bounded, independent random variables. Hence, it can be applied to RVs which are sampled uniformly with replacement from a finite dataset. But does the inequality work even if the samples are obtained without replacement? The answer is Yes and Hoeffding even proved this in his original paper by constructing an auxillary function. This is my attempt at going through his proof rigorously and understand the key combinatorial concepts needed in this proof.]]></summary></entry></feed>