Sign inGet started
Paper · arXiv

Kernel Dynamics under Path Entropy Maximization

We propose a variational framework in which the kernel function k : X x X -> R, interpreted as the foundational object encoding what distinctions an agent can represent, is treated as a dynamical variable subject to path entropy maximization (Maximum Caliber, MaxCal). Each kernel defines a representational structure over which an information geometry on probability space may be analyzed; a trajectory through kernel space therefore corresponds to a trajectory through a family of effective geometries, making the optimization landscape endogenous to its own traversal. We formulate fixed-point conditions for self-consistent kernels, propose renormalization group (RG) flow as a structured spec...

AuthorsJnaneshwar Das
Primary categorycs.LG
Published29 March 2026
Last updated at source29 March 2026
cs.LGcs.AIcs.ROmath.DS
Embed this entry
<iframe src="https://silytics.si/embed/item/d5fb7c8a-0bd7-4a14-9216-3c3f31f10f00" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.