Marginal Weighted Maximum Log-likelihood for Efficient Learning of Perturb-and-Map models
We consider the structured-output prediction problem through probabilistic approaches and generalize the "perturb-and-MAP" framework to more challenging weighted Hamming losses, which are crucial in applications. While in principle our approach is a straightforward marginalization, it requires solving many related MAP inference problems. We show that for log-supermodular pairwise models these operations can be performed efficiently using the machinery of dynamic graph cuts. We also propose to use double stochastic gradient descent, both on the data and on the perturbations, for efficient learning. Our framework can naturally take weak supervision (e.g., partial labels) into account. We conduct a set of experiments on medium-scale character recognition and image segmentation, showing the benefits of our algorithms.
Code (0)
등록된 구현이 없습니다.
Tasks
Image SegmentationSemantic SegmentationSimilar Papers 제목 키워드 기반
Learning Latent Variable Models via Jarzynski-adjusted Langevin Algorithm
We utilise a sampler originating from nonequilibrium statistical mechanics, termed here Jarzynski-adjusted Langevin algorithm (JALA), to build statistical estimation methods in latent variable models. We achieve this by …
Computational EfficiencyModel SelectionOffline Preference Optimization via Maximum Marginal Likelihood Estimation
Aligning Large Language Models (LLMs) with human preferences is crucial, but standard methods like Reinforcement Learning from Human Feedback (RLHF) are often complex and unstable. In this work, we propose a new, simpler…
Reinforcement LearningReweighted Expectation Maximization
Training deep generative models with maximum likelihood remains a challenge. The typical workaround is to use variational inference (VI) and maximize a lower bound to the log marginal likelihood of the data. Variational …
Bayesian InferenceDensity EstimationVariational InferenceA local approach to estimation in discrete loglinear models
We consider two connected aspects of maximum likelihood estimation of the parameter for high-dimensional discrete graphical models: the existence of the maximum likelihood estimate (mle) and its computation. When the d…
Observational nonidentifiability, generalized likelihood and free energy
We study the parameter estimation problem in mixture models with observational nonidentifiability: the full model (also containing hidden variables) is identifiable, but the marginal (observed) model is not. Hence global…
parameter estimation