← Search

Sebastian Lehner

7 accepted papers

2026

xLSTM Scaling Laws: Competitive Performance with Linear Time-Complexity

ICLR 2026poster

Scaling laws play a central role in the success of Large Language Models (LLMs), enabling the prediction of model performance relative to compute budgets prior to training. While Transformers have been the dominant architecture, recent alternatives such as xLSTM offer linear complexity with respe…

Cited by 0SourcecodeScholar
2025

Rethinking Losses for Diffusion Bridge Samplers

NeurIPS 2025poster

Diffusion bridges are a promising class of deep-learning methods for sampling from unnormalized distributions. Recent works show that the Log Variance (LV) loss consistently outperforms the reverse Kullback-Leibler (rKL) loss when using the reparametrization trick to compute rKL-gradients. While th…

Cited by 7SourceScholar
2025

Scalable Discrete Diffusion Samplers: Combinatorial Optimization and Statistical Physics

ICLR 2025poster

Learning to sample from complex unnormalized distributions over discrete domains emerged as a promising research direction with applications in statistical physics, variational inference, and combinatorial optimization. Recent work has demonstrated the potential of diffusion models in this domain. H…

Cited by 2SourcePDFScholar
2024

A Diffusion Model Framework for Unsupervised Neural Combinatorial Optimization

ICML 2024poster

Learning to sample from intractable distributions over discrete sets without relying on corresponding training data is a central problem in a wide range of fields, including Combinatorial Optimization. Currently, popular deep learning-based approaches rely primarily on generative models that yield e…

2023

Boundary Graph Neural Networks for 3D Simulations

AAAI 2023technical

The abundance of data has given machine learning considerable momentum in natural sciences and engineering, though modeling of physical processes is often difficult. A particularly tough problem is the efficient representation of geometric boundaries. Triangularized geometric boundaries are well und…

Cited by 40SourcePDFScholar
2023

Variational Annealing on Graphs for Combinatorial Optimization

NeurIPS 2023poster

Several recent unsupervised learning methods use probabilistic approaches to solve combinatorial optimization (CO) problems based on the assumption of statistically independent solution variables. We demonstrate that this assumption imposes performance limitations in particular on difficult problem…

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…