3 citations · 11 across the 17 of their papers we have counts for
4 papers · 1 filter
Finite Sample Bounds for Learning with Score Matching
Devin Smedira, Abhijith Jayakumar, Sidhant Misra +2
Learning of continuous exponential family distributions with unbounded support remains an important area of research for both theory and applications in high-dimensional statistics…
Computationally sufficient statistics for Ising models
Abhijith Jayakumar, Shreya Shukla, Marc Vuffray +2
Learning Gibbs distributions using only sufficient statistics has long been recognized as a computationally hard problem. On the other hand, computationally efficient algorithms fo…
Discrete Diffusion with Sample-Efficient Estimators for Conditionals
Karthik Elamvazhuthi, Abhijith Jayakumar, Andrey Y. Lokhov
We study a discrete denoising diffusion framework that integrates a sample-efficient estimator of single-site conditionals with round-robin noising and denoising dynamics for gener…
Learning of Discrete Graphical Models with Neural Networks
Abhijith J., Andrey Y. Lokhov, Sidhant Misra +1
Graphical models are widely used in science to represent joint probability distributions with an underlying conditional dependence structure. The inverse problem of learning a disc…