activity
20202025
most citedNeural Networks and the Chomsky Hierarchy

45 citations · 121 across the 15 of their papers we have counts for

collaborators
Showing cs.LGShow all

12 papers · 1 filter

cs.LG2025★ 2 cited

Understanding Prompt Tuning and In-Context Learning via Meta-Learning

Tim Genewein, Li Kevin Wenliang, Jordi Grau-Moya +3

Prompting is one of the main ways to adapt a pretrained model to target tasks. Besides manually constructing prompts, many prompt optimization methods have been proposed in the lit…

cs.LG2024

Compression via Pre-trained Transformers: A Study on Byte-Level Multimodal Data

David Heurtel-Depeiges, Anian Ruoss, Joel Veness +1

Foundation models are strong data compressors, but when accounting for their parameter size, their compression ratios are inferior to standard compression algorithms. Naively reduc…

cs.LG2024★ 8 cited

Amortized Planning with Large-Scale Transformers: A Case Study on Chess

Anian Ruoss, Grégoire Delétang, Sourabh Medapati +7

This paper uses chess, a landmark planning problem in AI, to assess transformers' performance on a planning task where memorization is futile $\unicode{x2013}$ even at a large scal…

cs.LG2024★ 1 cited

Learning Universal Predictors

Jordi Grau-Moya, Tim Genewein, Marcus Hutter +8

Meta-learning has emerged as a powerful approach to train neural networks to learn new tasks quickly from limited data. Broad exposure to different tasks leads to versatile represe…

cs.LG2023★ 28 cited

Language Modeling Is Compression

Grégoire Delétang, Anian Ruoss, Paul-Ambroise Duquenne +9

It has long been established that predictive models can be transformed into lossless compressors and vice versa. Incidentally, in recent years, the machine learning community has f…

cs.LG2023★ 1 cited

Randomized Positional Encodings Boost Length Generalization of Transformers

Anian Ruoss, Grégoire Delétang, Tim Genewein +5

Transformers have impressive generalization capabilities on tasks with a fixed context length. However, they fail to generalize to sequences of arbitrary length, even for seemingly…

cs.LG2023★ 1 cited

Memory-Based Meta-Learning on Non-Stationary Distributions

Tim Genewein, Grégoire Delétang, Anian Ruoss +7

Memory-based meta-learning is a technique for approximating Bayes-optimal predictors. Under fairly general conditions, minimizing sequential prediction error, measured by the log l…

cs.LG2022★ 45 cited

Neural Networks and the Chomsky Hierarchy

Grégoire Delétang, Anian Ruoss, Jordi Grau-Moya +8

Reliable generalization lies at the heart of safe ML and AI. However, understanding when and how neural networks generalize remains one of the most important unsolved problems in t…

cs.LG2021★ 2 cited

Fair Normalizing Flows

Mislav Balunović, Anian Ruoss, Martin Vechev

Fair representation learning is an attractive approach that promises fairness of downstream predictors by encoding sensitive data. Unfortunately, recent work has shown that strong…

cs.LG2021

Robustness Certification for Point Cloud Models

Tobias Lorenz, Anian Ruoss, Mislav Balunović +2

The use of deep 3D point cloud models in safety-critical applications, such as autonomous driving, dictates the need to certify the robustness of these models to real-world transfo…

cs.LG2020★ 4 cited

Efficient Certification of Spatial Robustness

Anian Ruoss, Maximilian Baader, Mislav Balunović +1

Recent work has exposed the vulnerability of computer vision models to vector field attacks. Due to the widespread usage of such models in safety-critical applications, it is cruci…

cs.LG2020★ 28 cited

Learning Certified Individually Fair Representations

Anian Ruoss, Mislav Balunović, Marc Fischer +1

Fair representation learning provides an effective way of enforcing fairness constraints without compromising utility for downstream users. A desirable family of such fairness cons…