← Search

Mattes Mollenhauer

5 accepted papers

2026

Float8@2bits: Entropy Coding Enables Data-Free Model Compression

ICML 2026poster

Post-training compression is currently divided into two contrasting regimes. On the one hand, fast, data-free, and model-agnostic methods (e.g., NF4 or HQQ) offer maximum accessibility but suffer from functional collapse at extreme bit-rates below 4 bits. On the other hand, techniques leveraging cal…

Cited by 0Source ↗Scholar ↗
2025

Regularized least squares learning with heavy-tailed noise is minimax optimal

NeurIPS 2025spotlight

This paper examines the performance of ridge regression in reproducing kernel Hilbert spaces in the presence of noise that exhibits a finite number of higher moments. We establish excess risk bounds consisting of subgaussian and polynomial terms based on the well known integral operator framework.…

Cited by 5Source ↗Scholar ↗
2024

Optimal Rates for Vector-Valued Spectral Regularization Learning Algorithms

NeurIPS 2024poster

We study theoretical properties of a broad class of regularized algorithms with vector-valued output. These spectral algorithms include kernel ridge regression, kernel principal component regression and various implementations of gradient descent. Our contributions are twofold. First, we rigorously…

Cited by 5Source ↗PDF ↗Scholar ↗
2022

Optimal Rates for Regularized Conditional Mean Embedding Learning

NeurIPS 2022accept

We address the consistency of a kernel ridge regression estimate of the conditional mean embedding (CME), which is an embedding of the conditional distribution of $Y$ given $X$ into a target reproducing kernel Hilbert space $\mathcal{H}_Y$. The CME allows us to take conditional expectations of targ…

Cited by 72Source ↗PDF ↗Scholar ↗