atlas

Research map / Learning theory and algorithms / Prediction and decision losses

Learning Maximum-A-Posteriori Perturbation Models for Structured Prediction in Polynomial Time

ICML 2018 · Learning theory and algorithms › Prediction and decision losses · approach: Probabilistic calibration · 2 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use CRF_RAND instead of the other evaluated methodsStructured prediction on synthetic DAGs, trees, and sets · Synthetic DAGs, trees, and setstest set CRF lossHelped
Use CRF_RAND instead of the other evaluated methodsStructured prediction on synthetic DAGs, trees, and sets · Synthetic DAGs, trees, and setstest set Hamming lossHelped
Use CRF_RAND instead of CRF_ALLStructured prediction on synthetic DAGs · Synthetic DAGstraining time: ≈ 6 times fasterHelped
Use CRF_RAND instead of CRF_ALLStructured prediction on synthetic trees · Synthetic treestraining time: ≈ 20 times fasterHelped
Use CRF_RAND instead of CRF_ALLStructured prediction on synthetic sets · Synthetic setstraining time: ≈ 3 times fasterHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy