Michael Baur

dblp:08/6882 · DBLP profile ↗
← Back
11ranked-venue papers
7as first author
6since 2021 · last 2025
0000-0002-3697-6828ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 6 · 5 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-author · 4 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021
YearPublicationVenuePosition
2025 On the Asymptotic Mean Square Error Optimality of Diffusion Models
abstract
Diffusion models (DMs) as generative priors have recently shown great potential for denoising tasks but lack theoretical understanding with respect to their mean square error (MSE) optimality. This paper proposes a novel denoising strategy inspired by the structure of the MSE-optimal conditional mean estimator (CME). The resulting DM-based denoiser can be conveniently employed using a pre-trained DM, being particularly fast by truncating reverse diffusion steps and not requiring stochastic re-sampling. We present a comprehensive (non-)asymptotic optimality analysis of the proposed diffusion-based denoiser, demonstrating polynomial-time convergence to the CME under mild conditions. Our analysis also derives a novel Lipschitz constant that depends solely on the DM’s hyperparameters. Further, we offer a new perspective on DMs, showing that they inherently combine an asymptotically optimal denoiser with a powerful generator, modifiable by switching re-sampling in the reverse process on or off. The theoretical findings are thoroughly validated with experiments based on various benchmark datasets.
Benedikt Fesl, Benedikt Böck, Florian Strasser, Michael Baur, Michael Joham, Wolfgang Utschick
AISTATS4
2025 Addressing Pilot Contamination in Channel Estimation with Variational Autoencoders
abstract
Pilot contamination (PC) is a well-known problem that affects massive multiple-input multiple-output (MIMO) systems. When frequency and pilots are reused between different cells, PC constitutes one of the main bottlenecks of the system's performance. In this paper, we propose a method based on the variational autoencoder (VAE), capable of reducing the impact of PC-related interference during channel estimation (CE). We obtain the first and second-order statistics of the conditionally Gaussian (CG) channels for both the user equipments (UEs) in a cell of interest and those in interfering cells, and we then use these moments to compute conditional linear minimum mean square error estimates. We show that the proposed estimator is capable of exploiting the interferers’ additional statistical knowledge, outperforming other classical approaches. Moreover, we highlight how the achievable performance is tied to the chosen setup, making the setup selection crucial in the study of multi-cell CE.
Amar Kasibovic, Benedikt Fesl, Michael Baur, Wolfgang Utschick
ICASSP3
2024 Channel Estimation in Underdetermined Systems Utilizing Variational Autoencoders
abstract
In this work, we propose to utilize a variational autoencoder (VAE) for channel estimation (CE) in underdetermined (UD) systems. The basis of the method forms a recently proposed concept in which a VAE is trained on channel state information (CSI) data and used to parameterize an approximation to the mean squared error (MSE)-optimal estimator. The contributions in this work extend the existing framework from fully-determined (FD) to UD systems, which are of high practical relevance. Particularly noteworthy is the extension of the estimator variant, which does not require perfect CSI during its offline training phase. This is a significant advantage compared to most other deep learning (DL)-based CE methods, where perfect CSI during the training phase is a crucial prerequisite. Numerical simulations for hybrid and wideband systems demonstrate the excellent performance of the proposed methods compared to related estimators.
Michael Baur, Nurettin Turan, Benedikt Fesl, Wolfgang Utschick
ICASSP1
2023 Variational Inference Aided Estimation of Time Varying Channels
abstract
One way to improve the estimation of time varying channels is to incorporate knowledge of previous observations. In this context, Dynamical VAEs (DVAEs) build a promising deep learning (DL) framework which is well suited to learn the distribution of time series data. We introduce a new DVAE architecture, called k-MemoryMarkovVAE (k-MMVAE), whose sparsity can be controlled by an additional memory parameter. Following the approach in [1] we derive a k-MMVAE aided channel estimator which takes temporal correlations of successive observations into account. The results are evaluated on simulated channels by QuaDRiGa and show that the k-MMVAE aided channel estimator clearly outperforms other machine learning (ML) aided estimators which are either memoryless or naively extended to time varying channels without major adaptions.
Benedikt Böck, Michael Baur, Valentina Rizzello, Wolfgang Utschick
ICASSP2
2022 CSI Clustering with Variational Autoencoding
abstract
The model order of a wireless channel plays an important role for a variety of applications in communications engineering, e.g., it represents the number of resolvable incident wave-fronts with non-negligible power incident from a transmitter to a receiver. Areas such as direction of arrival estimation leverage the model order to analyze the multipath components of channel state information. In this work, we propose to use a variational autoencoder to group unlabeled channel state information with respect to the model order in the variational autoencoder latent space in an unsupervised manner. We validate our approach with simulated 3GPP channel data. Our results suggest that, in order to learn an appropriate clustering, it is crucial to use a more flexible likelihood model for the variational autoencoder decoder than it is usually the case in standard applications.
Michael Baur, Michael Würth, Michael Koller 0001, Vlad-Costin Andrei, Wolfgang Utschick
ICASSP1
2021 Semirings of Evidence
abstract
Abstract In traditional justification logic, evidence terms have the syntactic form of polynomials, but they are not equipped with the corresponding algebraic structure. We present a novel semantic approach to justification logic that models evidence by a semiring. Hence justification terms can be interpreted as polynomial functions on that semiring. This provides an adequate semantics for evidence terms and clarifies the role of variables in justification logic. Moreover, the algebraic structure makes it possible to compute with evidence. Depending on the chosen semiring this can be used to model trust, probabilities, cost, etc. Last but not least the semiring approach seems promising for obtaining a realization procedure for modal fixed point logics.
Michael Baur, Thomas Studer
J. Log. Comput.1
2009 Leftist Canonical Ordering
Melanie Baur, Michael Baur, Ulrik Brandes, Sabine Cornelsen
GD2
2007 Multi-circular Layout of Micro/Macro Graphs
Michael Baur, Ulrik Brandes
GD1
2004 Drawing the AS Graph in 2.5 Dimensions
Michael Baur, Ulrik Brandes, Marco Gärtler, Dorothea Wagner
GD1
2004 Crossing Reduction in Circular Layouts
Michael Baur, Ulrik Brandes
WG1
2001 Visone
Michael Baur, Marc Benkert, Ulrik Brandes, Sabine Cornelsen, Marco Gärtler, Boris Köpf, Jürgen Lerner, Dorothea Wagner
GD1