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:
-
-
(pdf, 578.6KB)
-
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Funding
+ Engineering and Physical Sciences Research Council
More from this funder
Grant:
EP/P020658/1 and TU/B/000048
Bibliographic Details
- 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
- Copyright holder:
- Mohapatra et al.
- Copyright date:
- 2018
- Notes:
-
Copyright 2018 by the
authors. This is the accepted manuscript version of the article. The final version is available online from PMLR at: http://proceedings.mlr.press/v84/mohapatra18a.html
If you are the owner of this record, you can report an update to it here: Report update to this record