Search Results for author: Simon Weber

Found 10 papers, 2 papers with code

Finsler-Laplace-Beltrami Operators with Application to Shape Analysis

no code implementations5 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.

Flattening the Parent Bias: Hierarchical Semantic Segmentation in the Poincaré Ball

1 code implementation4 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.

Image Segmentation Segmentation +1

Matching under Imperfectly Transferable Utility

no code implementations8 Mar 2024 Alfred Galichon, Simon Weber

In this paper, we examine matching models with imperfectly transferable utility (ITU).

Existence of a Competitive Equilibrium with Substitutes, with Applications to Matching and Discrete Choice Models

no code implementations20 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.

Discrete Choice Models

Reducing Nearest Neighbor Training Sets Optimally and Exactly

no code implementations4 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.

Classification Position

Collective models and the marriage market

no code implementations14 Nov 2022 Simon Weber

In this paper, I develop an integrated approach to collective models and matching models of the marriage market.

counterfactual

Power Bundle Adjustment for Large-Scale 3D Reconstruction

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.

3D Reconstruction Distributed Optimization

Training Fully Connected Neural Networks is $\exists\mathbb{R}$-Complete

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.

Multidirectional Conjugate Gradients for Scalable Bundle Adjustment

no code implementations8 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%.

Matching Function Equilibria with Partial Assignment: Existence, Uniqueness and Estimation

no code implementations3 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.

counterfactual Discrete Choice Models

Cannot find the paper you are looking for? You can Submit a new open access paper.