Optimization in Machine Learning and Computer Vision

Dr. Bogdan Savchynskyy, WiSe 2022/23

This seminar belongs to the Master in Physics (specialisation Computational Physics, code "MVJC"), Master of Applied Informatics (code "IS") as well as Master Mathematics (code "MS") programs, but is also open for students of Scientific Computing and anyone interested.


Machine learning techniques are tightly coupled with optimization methods. Many techniques become practical only if there exists a supporting optimization tool.

In the seminar we will discuss a number of recent articles on combinatorial optimization with applications in computer vision and machine learning.

The topic of this semester is the Multi-Graph Matching problem.

We will consider inference and learning techniques for this problem as well as its applications in computer vision.

General Information

Please register for the seminar in Müsli. The first seminar will take place on Wednesday, October 19 at 11:00. Please make sure to participate!

  • Seminar: Wed, 11:00 – 13:00 in Mathematikon B (Berliner Str. 43), SR B128
    Entrance through the door at the side of Berlinerstrasse. Ring the door bell labelled "HCI am IWR" to be let in. The seminar room is on the 3rd floor.
  • Credits: 2 / 4 CP depending on course of study, see LSF

Seminar Repository:

Slides and schedule of the seminar will be placed in HeiBox .

Papers to Choose from:

  • Synchronization technique:
    • Spectral methods:
    • [1] Shen, Y., Huang, Q., Srebro, N., Sanghavi, S., 2016. Normalized Spectral Map Synchronization
      [2] Pachauri et al. 2013 - Solving the multi-way matching problem by permutation synchronization
      [3] Arrigoni, F., Maset, E., Fusiello, A., 2017. Synchronization in the Symmetric Inverse Semigroup
      [4] Maset et al. 2017 - Practical and Efficient Multi-View Matching
      [5] Fathian, K., Khosoussi, K., Tian, Y., Lusk, P., How, J.P., 2020. Clear: A consistent lifting, embedding, and alignment rectification algorithm for multiview data association.
      [6] Bernard et al. 2021 - Sparse Quadratic Optimisation over the Stiefel Manifold with Application to Permutation Synchronisation
    • Semidefinite programming relaxations:
    • [7] Chen, Y., Guibas, L.J., Huang, Q.X., 2014. Near-Optimal Joint Object Matching via Convex Relaxation
    • Alternating direction methods of multipliers:
    • [8] Zhou et al . 2015 - Multi-Image Matching via Fast Alternating Minimization
    • Clustering-based (no explicit matrix factorisation):
    • [9] Tron et al . 2017 - Fast Multi-Image Matching via Density-Based Clustering
    • Nonnegative matrix factorisation:
    • [10] Bernard, F., Thunberg, J., Goncalves, J., Theobalt, C., 2019a. Synchronisation of partial multi-matchings via non-negative factorisations.
    • Other:
    • [11] Chen, Candes 2017 - The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences
      [12] Birdal, Şimşekli 2019 - Probabilistic Permutation Synchronization using the Riemannian Structure of the Birkhoff Polytope
  • Other techniques:
    • Alternating optimization:
    • [13] Yan, J., Tian, Y., Zha, H., Yang, X., Zhang, Y., Chu, S.M., 2013. Joint Optimization for Consistent Multiple Graph Matching
    • Matrix decomposition:
    • [14] Yan, J., Xu, H., Zha, H., Yang, X., Liu, H., 2015. A matrix decomposition perspective to multiple graph matching
      [15] Wang, Q., Zhou, X., Daniilidis, K., 2018. Multi-Image Semantic Matching by Mining Consistent Features
    • Semidefinite programmming:
    • [16] Kezurer, I., Kovalsky, S.Z., Basri, R., Lipman, Y., 2015. Tight Relaxation of Quadratic Matching
      [17] Bernard, F., Theobalt, C., Moeller, M., 2018. DS*: Tighter Lifting-Free Convex Relaxations for Quadratic Matching Problems
    • LP relaxation:
    • [18] Swoboda et al . 2019 - A convex relaxation for multi-graph matching
    • Power iterations:
    • [19] Shi, X., Ling, H., Hu, W., Xing, J., 2016. Tensor power iteration for multi-graph matching
      [20] Bernard, F., Thunberg, J., Swoboda, P., Theobalt, C., 2019b. Hippi: Higher-order projected power iterations for scalable multi-matching
  • Uncategorized:
  • [21] Hu et al. 2018 - Distributable Consistent Multi-Object Matching
    [22] Jiang et al. 2021 - Unifying Offline and Online Multi-Graph Matching via Finding Shortest Paths on Supergraph
    [23] Yan et al. 2015 - Consistency-Driven Alternating Optimization for Multigraph Matching: A Unified Approach
    [24] Yan et al. 2016 - A constrained clustering based approach for matching a collection of feature sets
    [25] Cosmo, L., Rodolà, E., Albarelli, A., Mémoli, F., Cremers, D., 2017. Consistent partial matching of shape collections via sparse modeling
  • Learning-based:
  • [26] Chen et al. - 2020 - Deep Semantic Matching with Foreground Detection and Cycle-Consistency
    [27] Zhou et al. - 2016 - Learning Dense Correspondence via 3D-Guided Cycle Consistency
    [28] Ye et al . -2022 - Joint Deep Multi-Graph Matching and 3D Geometry Learning from Inhomogeneous 2D Image Collections

Presentation schedule



Dr. Bogdan Savchynskyy
In case you contact me via email, its subject should contain the tag [OfMLCV]. Emails without this tag have a very high chance to be lost and get ignored therefore!