mlsanityData to 7 Oct 2026

Structured Prediction Problem Archive

arXiv 2202.03574 ↗First posted 4 Feb 2022cs.LG cs.CVcited by 4

Not on the map. Why?

Abstract (arXiv)

Structured prediction problems are one of the fundamental tools in machine learning. In order to facilitate algorithm development for their numerical solution, we collect in one place a large number of datasets in easy to read formats for a diverse set of problem classes. We provide archival links to datasets, description of the considered problems and problem formats, and a short summary of problem characteristics including size, number of instances etc. For reference we also give a non-exhaustive selection of algorithms proposed in the literature for their solution. We hope that this central repository will make benchmarking and comparison to established works easier. We welcome submission of interesting new datasets and algorithms for inclusion in our archive.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 37 of its 207 references that are in the map. First posted on arXiv 4 Feb 2022.

Builds on

37 of 207 references.

References · 37

  1. 2014Microsoft COCO: Common Objects in Contextcited by 17,498
  2. 2016The Cityscapes Dataset for Semantic Urban Scene Understandingcited by 4,427
  3. 2016MOT16: A Benchmark for Multi-Object Trackingcited by 531
  4. 2020MOT20: A benchmark for multi object tracking in crowded scenescited by 355
  5. 20163D Menagerie: Modeling the 3D shape and pose of animalscited by 310
  6. 2020Deep Geometric Functional Maps: Robust Feature Learning for Shape Correspondencecited by 125
  7. 2018Continuous and Orientation-preserving Correspondences via Functional Mapscited by 77
  8. 2020Lifted Disjoint Paths with Application in Multiple Object Trackingcited by 55
  9. 2015Multi-Image Matching via Fast Alternating Minimizationcited by 33
  10. 2015Efficient Decomposition of Image and Mesh Graphs by Lifted Multicutscited by 26
  11. 2016A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matchingcited by 26
  12. 2018Higher-order Projected Power Iterations for Scalable Multi-Matchingcited by 24
25 more
  1. 2017DS*: Tighter Lifting-Free Convex Relaxations for Quadratic Matching Problemscited by 20
  2. 2021Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint Pathscited by 19
  3. 2016Global Hypothesis Generation for 6D Object Pose Estimationcited by 17
  4. 2014A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problemscited by 16
  5. 2021Fusion Moves for Graph Matchingcited by 16
  6. 2018Synchronisation of Partial Multi-Matchings via Non-negative Factorisationscited by 15
  7. 2017Multi-Image Semantic Matching by Mining Consistent Featurescited by 13
  8. 2015A General Multi-Graph Matching Approach via Graduated Consistency-regularized Boostingcited by 12
  9. 2016A Message Passing Algorithm for the Minimum Cost Multicut Problemcited by 11
  10. 2020MPLP++: Fast, Parallel Dual Block-Coordinate Ascent for Dense Graphical Modelscited by 10
  11. 2021Combinatorial Optimization for Panoptic Segmentation: A Fully Differentiable Approachcited by 10
  12. 2013A new look at reweighted message passingcited by 9
  13. 2020Discrete graphical models -- an optimization perspectivecited by 8
  14. 2020Taxonomy of Dual Block-Coordinate Ascent Methods for Discrete Energy Minimizationcited by 8
  15. 2020Efficient Message Passing for 0-1 ILPs with Binary Decision Diagramscited by 8
  16. 2021FastDOG: Fast Discrete Optimization on GPUcited by 8
  17. 2018Combinatorial persistency criteria for multicut and max-cutcited by 6
  18. 2016Solving Dense Image Matching in Real-Time using Discrete-Continuous Optimizationcited by 4
  19. 2020A Primal-Dual Solver for Large-Scale Tracking-by-Assignmentcited by 3
  20. 2014Partial Optimality by Pruning for MAP-Inference with General Graphical Modelscited by 2
  21. 2018MAP inference via Block-Coordinate Frank-Wolfe Algorithmcited by 2
  22. 2020Exact MAP-Inference by Confining Combinatorial Search with LP Relaxationcited by 2
  23. 2015Higher Order Maximum Persistency and Comparison Theoremscited by 1
  24. 2017A Novel Convex Relaxation for Non-Binary Discrete Tomographycited by 1
  25. 2019Bottleneck potentials in Markov Random Fieldscited by 1

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 1; 2024: 2.

4 papers.

  1. 2022DOGE-Train: Discrete Optimization on GPU with End-to-end Trainingcited by 6
  2. 2023ClusterFuG: Clustering Fully connected Graphs by Multicutcited by 5
  3. 2024Optimizing Incomplete, Large-Scale and Sparse Multi-Graph Matching in Bioimagingcited by 2
  4. 2024Correlation Clustering of Organoid Imagescited by 0