no code implementations • 5 Apr 2024 • Simon Weber, Thomas Dagès, Maolin Gao, Daniel Cremers
In experimental evaluations we demonstrate that the proposed FLBO is a valuable alternative to the traditional Riemannian-based LBO and ALBOs for spatial filtering and shape correspondence estimation.
1 code implementation • 4 Apr 2024 • Simon Weber, Barış Zöngür, Nikita Araslanov, Daniel Cremers
Hierarchy is a natural representation of semantic taxonomies, including the ones routinely used in image segmentation.
no code implementations • 8 Mar 2024 • Alfred Galichon, Simon Weber
In this paper, we examine matching models with imperfectly transferable utility (ITU).
no code implementations • 20 Sep 2023 • Liang Chen, Eugene Choo, Alfred Galichon, Simon Weber
We propose new results for the existence and uniqueness of a general nonparametric and nonseparable competitive equilibrium with substitutes.
no code implementations • 4 Feb 2023 • Josiah Rohrer, Simon Weber
We investigate the problem of finding the minimum cardinality reduced training set $P'\subseteq P$ such that $P$ and $P'$ induce the same classification.
no code implementations • 14 Nov 2022 • Simon Weber
In this paper, I develop an integrated approach to collective models and matching models of the marriage market.
2 code implementations • CVPR 2023 • Simon Weber, Nikolaus Demmel, Tin Chon Chan, Daniel Cremers
We demonstrate that employing the proposed Power Bundle Adjustment as a sub-problem solver significantly improves speed and accuracy of the distributed optimization.
no code implementations • NeurIPS 2023 • Daniel Bertschinger, Christoph Hertrich, Paul Jungeblut, Tillmann Miltzow, Simon Weber
We consider the problem of finding weights and biases for a two-layer fully connected neural network to fit a given set of data points as well as possible, also known as EmpiricalRiskMinimization.
no code implementations • 8 Oct 2021 • Simon Weber, Nikolaus Demmel, Daniel Cremers
We revisit the problem of large-scale bundle adjustment and propose a technique called Multidirectional Conjugate Gradients that accelerates the solution of the normal equation by up to 61%.
no code implementations • 3 Feb 2021 • Liang Chen, Eugene Choo, Alfred Galichon, Simon Weber
We argue that models coming from a variety of fields, such as matching models and discrete choice models among others, share a common structure that we call matching function equilibria with partial assignment.