← Search

Markus Holzleitner

8 accepted papers

2026

Minimax-Optimal Aggregation for Density Ratio Estimation

ICLR 2026poster

Density ratio estimation (DRE) is fundamental in machine learning and statistics, with applications in domain adaptation and two-sample testing. However, DRE methods are highly sensitive to hyperparameter selection, with suboptimal choices often resulting in poor convergence rates and empirical perf…

Cited by 0SourceScholar
2024

Overcoming Saturation in Density Ratio Estimation by Iterated Regularization

ICML 2024poster

Estimating the ratio of two probability densities from finitely many samples, is a central task in machine learning and statistics. In this work, we show that a large class of kernel methods for density ratio estimation suffers from error saturation, which prevents algorithms from achieving fast err…

2024

Universal Physics Transformers: A Framework For Efficiently Scaling Neural Operators

NeurIPS 2024poster

Neural operators, serving as physics surrogate models, have recently gained increased interest. With ever increasing problem complexity, the natural question arises: what is an efficient way to scale neural operators to larger and more complex simulations - most importantly by taking into account di…

2023

Addressing Parameter Choice Issues in Unsupervised Domain Adaptation by Aggregation

ICLR 2023top-5%

We study the problem of choosing algorithm hyper-parameters in unsupervised domain adaptation, i.e., with labeled data in a source domain and unlabeled data in a target domain, drawn from a different input distribution. We follow the strategy to compute several models using different hyper-parameter…

2022

History Compression via Language Models in Reinforcement Learning

ICML 2022spotlight

In a partially observable Markov decision process (POMDP), an agent typically uses a representation of the past to approximate the underlying MDP. We propose to utilize a frozen Pretrained Language Transformer (PLT) for history representation and compression to improve sample efficiency. To avoid tr…

2021

Hopfield Networks is All You Need

ICLR 2021poster

We introduce a modern Hopfield network with continuous states and a corresponding update rule. The new Hopfield network can store exponentially (with the dimension of the associative space) many patterns, retrieves the pattern with one update, and has exponentially small retrieval errors. It has thr…

2021

MC-LSTM: Mass-Conserving LSTM

ICML 2021spotlight

The success of Convolutional Neural Networks (CNNs) in computer vision is mainly driven by their strong inductive bias, which is strong enough to allow CNNs to solve vision-related tasks with random weights, meaning without learning. Similarly, Long Short-Term Memory (LSTM) has a strong inductive bi…

2020

Modern Hopfield Networks and Attention for Immune Repertoire Classification

NeurIPS 2020spotlight

A central mechanism in machine learning is to identify, store, and recognize patterns. How to learn, access, and retrieve such patterns is crucial in Hopfield networks and the more recent transformer architectures. We show that the attention mechanism of transformer architectures is actually the upd…