Christoph Brauer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Christoph Brauer has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Dirk A. Lorenz
Center for Industrial Mathematics Fachbereich 3 University of Bremen Postfach 33 04 40 28334 Bremen Germany
9 shared publications - Andreas M. Tillmann
Institute of Mathematics Clausthal University of Technology Clausthal‐Zellerfeld Germany
2 shared publications - Timo de Wolff
Institute of Analysis and Algebra Technical University of Braunschweig Braunschweig Germany
2 shared publications - Arne Hindersmann
DLR, Institute of Lightweight Systems, Ottenbecker Damm 12, 21684 Stade, Germany
1 shared publication - Jan Lorenz
Constructor University
1 shared publication - Lionel Tondji
Center for Industrial Mathematics, University of Bremen, Postfach 330440, 28334 Bremen, Germany
1 shared publication
Latest Publications
- Open Access
- 22 October 2026
- Published by Elsevier in Composites Part A: Applied Science and Manufacturing
- Vol. 213
Voronoi-based vacuum leakage detection in composite manufacturing
- 22 October 2026
- Published by Elsevier in Composites Part A: Applied Science and Manufacturing
- Vol. 213
Open AccessVoronoi-based vacuum leakage detection in composite manufacturing
- 29 January 2026
- Published by IOP Publishing in Inverse Problems
- Vol. 42 (2)
Why the noise model matters: a performance gap in learned regularization
This article addresses the challenge of learning effective regularizers for linear inverse problems. We analyze and compare several types of learned variational regularization against the theoretical benchmark of the optimal affine reconstruction, i.e., the best possible affine linear map for minimizing the mean squared error. It is known that this optimal reconstruction can be achieved using Tikhonov regularization, but this requires precise knowledge of the noise covariance to properly weight the data fidelity term. However, in many practical applications, noise statistics are unknown. We therefore investigate the performance of regularization methods learned without access to this noise information, focusing on Tikhonov, Lavrentiev, and quadratic regularization. Our theoretical analysis and numerical experiments demonstrate that for non-white noise, a performance gap emerges between these methods and the optimal affine reconstruction. Furthermore, we show that these different types of regularization yield distinct results, highlighting that the choice of regularizer structure is critical when the noise model is not explicitly learned. Our findings underscore the significant value of accurately modeling or co-learning noise statistics in data-driven regularization.
- 29 January 2026
- Published by IOP Publishing in Inverse Problems
- Vol. 42 (2)
Why the noise model matters: a performance gap in learned regularization
This article addresses the challenge of learning effective regularizers for linear inverse problems. We analyze and compare several types of learned variational regularization against the theoretical benchmark of the optimal affine reconstruction, i.e., the best possible affine linear map for minimizing the mean squared error. It is known that this optimal reconstruction can be achieved using Tikhonov regularization, but this requires precise knowledge of the noise covariance to properly weight the data fidelity term. However, in many practical applications, noise statistics are unknown. We therefore investigate the performance of regularization methods learned without access to this noise information, focusing on Tikhonov, Lavrentiev, and quadratic regularization. Our theoretical analysis and numerical experiments demonstrate that for non-white noise, a performance gap emerges between these methods and the optimal affine reconstruction. Furthermore, we show that these different types of regularization yield distinct results, highlighting that the choice of regularizer structure is critical when the noise model is not explicitly learned. Our findings underscore the significant value of accurately modeling or co-learning noise statistics in data-driven regularization.
- 3 April 2024
- Published by World Scientific Pub Co Pte Ltd in Analysis and Applications
- Vol. 22 (03) , 569-617
Learning variational models with unrolling and bilevel optimization
In this paper, we consider the problem of learning variational models in the context of supervised learning via risk minimization. Our goal is to provide a deeper understanding of the two approaches of learning of variational models via bilevel optimization and via algorithm unrolling. The former considers the variational model as a lower level optimization problem below the risk minimization problem, while the latter replaces the lower level optimization problem by an algorithm that solves said problem approximately. Both approaches are used in practice, but unrolling is much simpler from a computational point of view. To analyze and compare the two approaches, we consider a simple toy model, and compute all risks and the respective estimators explicitly. We show that unrolling can be better than the bilevel optimization approach, but also that the performance of unrolling can depend significantly on further parameters, sometimes in unexpected ways: While the stepsize of the unrolled algorithm matters a lot (and learning the stepsize gives a significant improvement), the number of unrolled iterations plays a minor role.
- 3 April 2024
- Published by World Scientific Pub Co Pte Ltd in Analysis and Applications
- Vol. 22 (03) , 569-617
Learning variational models with unrolling and bilevel optimization
In this paper, we consider the problem of learning variational models in the context of supervised learning via risk minimization. Our goal is to provide a deeper understanding of the two approaches of learning of variational models via bilevel optimization and via algorithm unrolling. The former considers the variational model as a lower level optimization problem below the risk minimization problem, while the latter replaces the lower level optimization problem by an algorithm that solves said problem approximately. Both approaches are used in practice, but unrolling is much simpler from a computational point of view. To analyze and compare the two approaches, we consider a simple toy model, and compute all risks and the respective estimators explicitly. We show that unrolling can be better than the bilevel optimization approach, but also that the performance of unrolling can depend significantly on further parameters, sometimes in unexpected ways: While the stepsize of the unrolled algorithm matters a lot (and learning the stepsize gives a significant improvement), the number of unrolled iterations plays a minor role.
- 13 April 2019
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 82 (3) , 983-1016
Complexity and Applications of the Homotopy Principle for Uniformly Constrained Sparse Minimization
- 13 April 2019
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 82 (3) , 983-1016
Complexity and Applications of the Homotopy Principle for Uniformly Constrained Sparse Minimization
- Open Access
Primal-dual residual networks
In this work, we propose a deep neural network architecture motivated by primal-dual splitting methods from convex optimization. We show theoretically that there exists a close relation between the derived architecture and residual networks, and further investigate this connection in numerical experiments. Moreover, we demonstrate how our approach can be used to unroll optimization algorithms for certain problems with hard constraints. Using the example of speech dequantization, we show that our method can outperform classical splitting methods when both are applied to the same task.
Open AccessPrimal-dual residual networks
In this work, we propose a deep neural network architecture motivated by primal-dual splitting methods from convex optimization. We show theoretically that there exists a close relation between the derived architecture and residual networks, and further investigate this connection in numerical experiments. Moreover, we demonstrate how our approach can be used to unroll optimization algorithms for certain problems with hard constraints. Using the example of speech dequantization, we show that our method can outperform classical splitting methods when both are applied to the same task.
- 15 February 2018
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 70 (2) , 443-478
A primal-dual homotopy algorithm for $\ell _{1}$-minimization with $\ell _{\infty }$-constraints- 15 February 2018
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 70 (2) , 443-478
A primal-dual homotopy algorithm for $\ell _{1}$-minimization with $\ell _{\infty }$-constraints- Open Access
A Primal-Dual Homotopy Algorithm for $\ell_{1}$-Minimization with $\ell_{\infty}$-Constraints
In this paper we propose a primal-dual homotopy method for $\ell_1$-minimization problems with infinity norm constraints in the context of sparse reconstruction. The natural homotopy parameter is the value of the bound for the constraints and we show that there exists a piecewise linear solution path with finitely many break points for the primal problem and a respective piecewise constant path for the dual problem. We show that by solving a small linear program, one can jump to the next primal break point and then, solving another small linear program, a new optimal dual solution is calculated which enables the next such jump in the subsequent iteration. Using a theorem of the alternative, we show that the method never gets stuck and indeed calculates the whole path in a finite number of steps. Numerical experiments demonstrate the effectiveness of our algorithm. In many cases, our method significantly outperforms commercial LP solvers; this is possible since our approach employs a sequence of considerably simpler auxiliary linear programs that can be solved efficiently with specialized active-set strategies.
Open AccessA Primal-Dual Homotopy Algorithm for $\ell_{1}$-Minimization with $\ell_{\infty}$-Constraints
In this paper we propose a primal-dual homotopy method for $\ell_1$-minimization problems with infinity norm constraints in the context of sparse reconstruction. The natural homotopy parameter is the value of the bound for the constraints and we show that there exists a piecewise linear solution path with finitely many break points for the primal problem and a respective piecewise constant path for the dual problem. We show that by solving a small linear program, one can jump to the next primal break point and then, solving another small linear program, a new optimal dual solution is calculated which enables the next such jump in the subsequent iteration. Using a theorem of the alternative, we show that the method never gets stuck and indeed calculates the whole path in a finite number of steps. Numerical experiments demonstrate the effectiveness of our algorithm. In many cases, our method significantly outperforms commercial LP solvers; this is possible since our approach employs a sequence of considerably simpler auxiliary linear programs that can be solved efficiently with specialized active-set strategies.
- 26 August 2016
- Published by Springer Nature in Social Indicators Research
- Vol. 134 (1) , 75-92
Rank-Optimal Weighting or “How to be Best in the OECD Better Life Index?”
- 26 August 2016
- Published by Springer Nature in Social Indicators Research
- Vol. 134 (1) , 75-92
Rank-Optimal Weighting or “How to be Best in the OECD Better Life Index?”
- 1 March 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5940-5944
Sparse reconstruction of quantized speech signals
We propose sparse reconstruction techniques to improve the quality and/or reduce the bit-rate of standard speech coders. To that end, we assume signal sparsity in some transform domain and formulate the problem of reconstructing the original signal in terms of constrained ℓ 1 -norm minimization. We use modern primal-dual methods in order to solve the resulting non-smooth convex optimization problem. Experiments show that with the proposed sparse reconstruction method the instrumentally predicted speech quality can be largely improved.
- 1 March 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5940-5944
Sparse reconstruction of quantized speech signals
We propose sparse reconstruction techniques to improve the quality and/or reduce the bit-rate of standard speech coders. To that end, we assume signal sparsity in some transform domain and formulate the problem of reconstructing the original signal in terms of constrained ℓ 1 -norm minimization. We use modern primal-dual methods in order to solve the resulting non-smooth convex optimization problem. Experiments show that with the proposed sparse reconstruction method the instrumentally predicted speech quality can be largely improved.
- 28 April 2015
- Published by Springer Nature
- p. 142-153
Cartoon-Texture-Noise Decomposition with Transport Norms
- 28 April 2015
- Published by Springer Nature
- p. 142-153
Cartoon-Texture-Noise Decomposition with Transport Norms