Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Convergence Rates of Smooth Message Passing with Rounding in
  Entropy-Regularized MAP Inference   Maximum a posteriori (MAP) inference is a fundamental computational paradigm
for statistical inference. In the setting of graphical models, MAP inference
entails solving a combinatorial optimization problem to find the most likely
configuration of the discrete-valued model. Linear programming (LP) relaxations
in the Sherali-Adams hierarchy are widely used to attempt to solve this
problem, and smooth message passing algorithms have been proposed to solve
regularized versions of these LPs with great success. This paper leverages
recent work in entropy-regularized LPs to analyze convergence rates of a class
of edge-based smooth message passing algorithms to $\epsilon$-optimality in the
relaxation. With an appropriately chosen regularization constant, we present a
theoretical guarantee on the number of iterations sufficient to recover the
true integral MAP solution when the LP is tight and the solution is unique.

10
The categories of this paper are: q-bio
15
The categories of this paper are: nucl-ex
11
The categories of this paper are: hep-lat
7
The categories of this paper are: hep-th
4
The categories of this paper are: cond-mat
18
The categories of this paper are: econ
12
The categories of this paper are: nucl-th
9
The categories of this paper are: nlin
17
The categories of this paper are: q-fin
21
The categories of this paper are: adap-org
30
The categories of this paper are: q-alg
19
The categories of this paper are: eess
36
The categories of this paper are: cmp-lg
8
The categories of this paper are: hep-ex
13
The categories of this paper are: quant-ph
29
The categories of this paper are: funct-an