Demo Data from EDBT 2026 / reviewers in the wild / expert
Patrick M. Blies
dblp:275/3543
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
2 papers |
Language models and text generation · 40% Reinforcement learning · 26% Efficient and distributed learning · 20% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
inference efficiency |
0.9 | 1 | 2025 | xLSTM 7B: A Recurrent LLM for Fast and Efficient Inference · ICML 2025 |
Natural language and speech › Language models and text generation
large language model |
0.9 | 1 | 2025 | xLSTM 7B: A Recurrent LLM for Fast and Efficient Inference · ICML 2025 |
Natural language and speech › Language models and text generation › neural language model
recurrent neural network language model |
0.9 | 1 | 2025 | xLSTM 7B: A Recurrent LLM for Fast and Efficient Inference · ICML 2025 |
Robotics › Robot manipulation
learning from demonstration |
0.6 | 1 | 2022 | Align-RUDDER: Learning From Few Demonstrations by Reward Redistribution · ICML 2022 |
Machine learning › Reinforcement learning › reward design › reward shaping
reward redistribution |
0.6 | 1 | 2022 | Align-RUDDER: Learning From Few Demonstrations by Reward Redistribution · ICML 2022 |
Machine learning › Reinforcement learning › reward design
reward shaping |
0.6 | 1 | 2022 | Align-RUDDER: Learning From Few Demonstrations by Reward Redistribution · ICML 2022 |
Methods — techniques the papers use, named apart from their topics
xLSTM architecture · 0.9profile model · 0.6multiple sequence alignment · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | xLSTM 7B: A Recurrent LLM for Fast and Efficient InferenceabstractRecent breakthroughs in solving reasoning, math and coding problems with Large Language Models (LLMs) have been enabled by investing substantial computation budgets at inference time. Therefore, inference speed is one of the most critical properties of LLM architectures, and there is a growing need for LLMs that are efficient and fast at inference. Recently, LLMs built on the xLSTM architecture have emerged as a powerful alternative to Transformers, offering linear compute scaling with sequence length and constant memory usage, both highly desirable properties for efficient inference. However, such xLSTM-based LLMs have yet to be scaled to larger models and assessed and compared with respect to inference speed and efficiency. In this work, we introduce xLSTM 7B, a 7-billion-parameter LLM that combines xLSTM’s architectural benefits with targeted optimizations for fast and efficient inference. Our experiments demonstrate that xLSTM 7B achieves performance on downstream tasks comparable to other similar-sized LLMs, while providing significantly faster inference speeds and greater efficiency compared to Llama- and Mamba-based LLMs. These results establish xLSTM 7B as the fastest and most efficient 7B LLM, offering a solution for tasks that require large amounts of test-time computation. Our work highlights xLSTM’s potential as a foundational architecture for methods building on heavy use of LLM inference. Our model weights, model code and training code are open-source. Model: https://huggingface.co/NX-AI/xLSTM-7b Code: https://github.com/NX-AI/xlstm and https://github.com/NX-AI/xlstm-jax. Maximilian Beck, Korbinian Pöppel, Phillip Lippe, Richard Kurle, Patrick M. Blies, Günter Klambauer, Sebastian Böck, Sepp Hochreiter |
ICML | 5 |
| 2022 | Align-RUDDER: Learning From Few Demonstrations by Reward RedistributionabstractReinforcement learning algorithms require many samples when solving complex hierarchical tasks with sparse and delayed rewards. For such complex tasks, the recently proposed RUDDER uses reward redistribution to leverage steps in the Q-function that are associated with accomplishing sub-tasks. However, often only few episodes with high rewards are available as demonstrations since current exploration strategies cannot discover them in reasonable time. In this work, we introduce Align-RUDDER, which utilizes a profile model for reward redistribution that is obtained from multiple sequence alignment of demonstrations. Consequently, Align-RUDDER employs reward redistribution effectively and, thereby, drastically improves learning on few demonstrations. Align-RUDDER outperforms competitors on complex artificial tasks with delayed rewards and few demonstrations. On the Minecraft ObtainDiamond task, Align-RUDDER is able to mine a diamond, though not frequently. Code is available at github.com/ml-jku/align-rudder. Vihang Patil, Markus Hofmarcher, Marius-Constantin Dinu, Matthias Dorfer, Patrick M. Blies, Johannes Brandstetter, Jose A. Arjona-Medina, Sepp Hochreiter |
ICML | 5 |