Thomas Möllenhoff

Orcid: 0000-0001-7730-0843

According to our database1, Thomas Möllenhoff authored at least 25 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Variational Learning is Effective for Large Deep Networks.
CoRR, 2024

2023
A Cutting-Plane Method for Sublabel-Accurate Relaxation of Problems with Product Label Spaces.
Int. J. Comput. Vis., 2023

Model Merging by Uncertainty-Based Gradient Matching.
CoRR, 2023

The Memory-Perturbation Equation: Understanding Model's Sensitivity to Data.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

SAM as an Optimal Relaxation of Bayes.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

The Lie-Group Bayesian Learning Rule.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields.
SIAM J. Imaging Sci., September, 2022

Non-Smooth Energy Dissipating Networks.
Proceedings of the 2022 IEEE International Conference on Image Processing, 2022

2021
Sublabel-Accurate Multilabeling Meets Product Label Spaces.
Proceedings of the Pattern Recognition - 43rd DAGM German Conference, DAGM GCPR 2021, Bonn, Germany, September 28, 2021

2020
Efficient Lifting Methods for Variational Problems.
PhD thesis, 2020

Optimization of Graph Total Variation via Active-Set-based Combinatorial Reconditioning.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Informative GANs via Structured Regularization of Optimal Transport.
CoRR, 2019

Flat Metric Minimization with Applications in Generative Modeling.
Proceedings of the 36th International Conference on Machine Learning, 2019

Controlling Neural Networks via Energy Dissipation.
Proceedings of the 2019 IEEE/CVF International Conference on Computer Vision, 2019

Lifting Vectorial Variational Problems: A Natural Formulation Based on Geometric Measure Theory and Discrete Exterior Calculus.
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2019

2018
Proximal Backpropagation.
Proceedings of the 6th International Conference on Learning Representations, 2018

Fight Ill-Posedness With Ill-Posedness: Single-Shot Variational Depth Super-Resolution From Shading.
Proceedings of the 2018 IEEE Conference on Computer Vision and Pattern Recognition, 2018

Combinatorial Preconditioners for Proximal Algorithms on Graphs.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017
Sublabel-Accurate Discretization of Nonconvex Free-Discontinuity Problems.
Proceedings of the IEEE International Conference on Computer Vision, 2017

2016
Precise Relaxation of the Mumford-Shah Functional.
CoRR, 2016

Sublabel-Accurate Convex Relaxation of Vectorial Multilabel Energies.
Proceedings of the Computer Vision - ECCV 2016, 2016

Sublabel-Accurate Relaxation of Nonconvex Energies.
Proceedings of the 2016 IEEE Conference on Computer Vision and Pattern Recognition, 2016

2015
The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings.
SIAM J. Imaging Sci., 2015

2014
Low Rank Priors for Color Image Regularization.
Proceedings of the Energy Minimization Methods in Computer Vision and Pattern Recognition, 2014

2013
Efficient Convex Optimization for Minimal Partition Problems with Volume Constraints.
Proceedings of the Energy Minimization Methods in Computer Vision and Pattern Recognition, 2013


  Loading...