Search Results for author: M. P. Kumar

Found 3 papers, 0 papers with code

Learning a Small Mixture of Trees

no code implementations NeurIPS 2009 M. P. Kumar, Daphne Koller

The problem of approximating a given probability distribution using a simpler distribution plays an important role in several areas of machine learning, e. g. variational inference and classification.

Face Recognition Variational Inference

Improved Moves for Truncated Convex Models

no code implementations NeurIPS 2008 Philip Torr, M. P. Kumar

Compared to previous approaches based on the LP relaxation, e. g. interior-point algorithms or tree-reweighted message passing (TRW), our method is faster as it uses only the efficient st-mincut algorithm in its design.

Cannot find the paper you are looking for? You can Submit a new open access paper.