Conference item icon

Conference item

Learning to round for discrete labeling problems

Abstract:

Discrete labeling problems are often solved by formulating them as an integer program, and relaxing the integrality constraint to a continuous domain. While the continuous relaxation is closely related to the original integer program, its optimal solution is often fractional. Thus, the success of a relaxation depends crucially on the availability of an accurate rounding procedure. The problem of identifying an accurate rounding procedure has mainly been tackled in the theoretical computer sci...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted Manuscript

Actions


Access Document


Files:

Authors


Mohapatra, P More by this author
Jawahar, CV More by this author
More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Engineering Science
Oxford college:
Lady Margaret Hall
Publisher:
PMLR Publisher's website
Volume:
84
Pages:
1047-1056
Series:
Proceedings of Machine Learning Research
Publication date:
2018-03-31
Acceptance date:
2017-12-22
ISSN:
1938-7228
Pubs id:
pubs:826797
URN:
uri:a92ece28-d8b1-4498-b7e6-c67f6301756e
UUID:
uuid:a92ece28-d8b1-4498-b7e6-c67f6301756e
Local pid:
pubs:826797

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP