Learning efficient random maximum a-posteriori predictors with non-decomposable loss functions
In this work we develop efficient methods for learning random MAP predictors for structured label problems. In particular, we construct posterior distributions over perturbations that can be adjusted via stochastic gradient methods. We show that every smooth posterior distribution would suffice to d...
Main Authors: | Hazan, Tamir, Maji, Subhransu, Keshet, Joseph, Jaakkola, Tommi S. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Neural Information Processing Systems
2015
|
Online Access: | http://hdl.handle.net/1721.1/100402 https://orcid.org/0000-0002-2199-0379 |
Similar Items
-
On sampling from the Gibbs distribution with random maximum a-posteriori perturbations
by: Hazan, Tamir, et al.
Published: (2015) -
High Dimensional Inference with Random Maximum A-Posteriori Perturbations
by: Maji, Subhransu, et al.
Published: (2021) -
On the Partition Function and Random Maximum A-Posteriori Perturbations
by: Hazan, Tamir, et al.
Published: (2021) -
On the Partition Function and Random Maximum A-Posteriori Perturbations
by: Hazan, Tamir, et al.
Published: (2021) -
On measure concentration of random maximum a-posteriori perturbations
by: Orabona, Francesco, et al.
Published: (2015)