← Search

Holger Rauhut

7 accepted papers

2026

Flatland: The Adventures of Gradient Descent with Large Step Sizes

ICML 2026poster

The training of neural networks often entails objective functions that are not globally $L$-smooth. For these functions, it is both theoretically and practically difficult to reply to the question: what is the largest possible step size that ensures the convergence of gradient descent (GD)? We addre…

Cited by 0Source ↗Scholar ↗
2024

Imaging with Confidence: Uncertainty Quantification for High-dimensional Undersampled MR Images

ECCV 2024poster

"Establishing certified uncertainty quantification (UQ) in imaging processing applications continues to pose a significant challenge. In particular, such a goal is crucial for accurate and reliable medical imaging if one aims for precise diagnostics and appropriate intervention. In the case of magne…

2024

Non-Asymptotic Uncertainty Quantification in High-Dimensional Learning

NeurIPS 2024spotlight

Uncertainty quantification (UQ) is a crucial but challenging task in many high-dimensional learning problems to increase the confidence of a given predictor. We develop a new data-driven approach for UQ in regression that applies both to classical optimization approaches such as the LASSO as well as…

2023

Don't be so Monotone: Relaxing Stochastic Line Search in Over-Parameterized Models

NeurIPS 2023poster

Recent works have shown that line search methods can speed up Stochastic Gradient Descent (SGD) and Adam in modern over-parameterized settings. However, existing line searches may take steps that are smaller than necessary since they require a monotone decrease of the (mini-)batch objective function…

Cited by 10Source ↗PDF ↗Scholar ↗
2023

High-Dimensional Confidence Regions in Sparse MRI

ICASSP 2023accepted

One of the most promising solutions for uncertainty quantification in high-dimensional statistics is the debiased LASSO that relies on unconstrained ℓ <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</inf> -minimization. The initial works focused on re…

Cited by 0Source ↗Scholar ↗
2022

ADMM-DAD Net: A Deep Unfolding Network for Analysis Compressed Sensing

ICASSP 2022accepted

In this paper, we propose a new deep unfolding neural network based on the ADMM algorithm for analysis Compressed Sensing. The proposed network jointly learns a redundant analysis operator for sparsification and reconstructs the signal of interest. We compare our proposed network with a state-of-the…

Cited by 0Source ↗Scholar ↗
2020

Unfolding recurrence by Green’s functions for optimized reservoir computing

NeurIPS 2020poster

Cortical networks are strongly recurrent, and neurons have intrinsic temporal dynamics. This sets them apart from deep feed-forward networks. Despite the tremendous progress in the application of deep feed-forward networks and their theoretical understanding, it remains unclear how the interplay of…

Cited by 5Source ↗PDF ↗Scholar ↗