Rajiv Khanna

Information Projection and Approximate Inference for Structured Sparse Variables

2017 · International Conference on Artificial Intelligence and Statistics

Approximate inference via information projection has been recently introduced as a general-purpose approach for efficient probabilistic inference given sparse variables. This manuscript goes beyond classical sparsity by proposing efficient algorithms for approximate inference via information …

Generalization Guarantees via Algorithm-dependent Rademacher Complexity

2023 · arXiv (Cornell University)

Algorithm- and data-dependent generalization bounds are required to explain the generalization behavior of modern machine learning algorithms. In this context, there exists information theoretic generalization bounds that involve (various forms of) mutual information, as well …