Convergence Rate Analysis of MAP Coordinate Minimization Algorithms
Finding maximum a posteriori (MAP) assignments in graphical models is an important task in many applications. Since the problem is generally hard, linear programming (LP) relaxations are often used. Solving these relaxations efficiently is thus an important practical problem. In recent years, severa...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
2022-01-03T16:31:51Z.
|
| Subjects: | |
| Online Access: | Get fulltext |