3 papers
cs.LG2026
A Compositional Theory of Curvature in Probabilistic Circuits
Hrithik Suresh, Sahil Sidheekh, Shelar Parth Vijay +3
Probabilistic Circuits (PCs) are generative models that support exact inference and, unlike deep neural networks, admit an exact and tractable measure of loss-surface curvature: th…
cs.LG2026
Diverse and Plausible Algorithmic Recourse via Tractable Recourse Distributions
Anagha Sabu, Hrithik Suresh, Narayanan C. Krishnan
Algorithmic recourse seeks to help individuals reverse unfavorable automated decisions by recommending actionable changes that achieve a desired outcome. As an individual usually h…
cs.LG2025
Tractable Sharpness-Aware Learning of Probabilistic Circuits
Hrithik Suresh, Sahil Sidheekh, Vishnu Shreeram M. P +2
Probabilistic Circuits (PCs) are a class of generative models that allow exact and tractable inference for a wide range of queries. While recent developments have enabled the learn…