<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Bayesian Inference on Kalyaan Rao</title><link>https://kalyaannnn.github.io/tags/bayesian-inference/</link><description>Recent content in Bayesian Inference on Kalyaan Rao</description><generator>Hugo -- 0.160.1</generator><language>en-us</language><lastBuildDate>Sun, 04 Jan 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://kalyaannnn.github.io/tags/bayesian-inference/index.xml" rel="self" type="application/rss+xml"/><item><title>rethinking model complexity in overparameterized models</title><link>https://kalyaannnn.github.io/posts/rethinking-model-complexity/</link><pubDate>Sun, 04 Jan 2026 00:00:00 +0000</pubDate><guid>https://kalyaannnn.github.io/posts/rethinking-model-complexity/</guid><description>&lt;h2 id="1-why-model-complexity-is-not-the-number-of-parameters"&gt;1. why model complexity is not the number of parameters&lt;/h2&gt;
&lt;p&gt;model selection criteria often penalize models according to the number of parameters they use. this is reasonable when every parameter direction independently affects predictions. but many modern models violate this assumption: different parameter values can represent the same function. low-rank regression, overcomplete models, and neural networks with symmetries all have redundant coordinates.&lt;/p&gt;
&lt;p&gt;a simple thought experiment makes this issue clear. consider two models that represent the same family of functions:&lt;/p&gt;</description></item></channel></rss>