activity
20192026
most citedInfoNCE: Identifying the Gap Between Theory and Practice

5 citations · 16 across the 17 of their papers we have counts for

collaborators
Showing cs.LGShow all

13 papers · 1 filter

cs.LG2026

When Do Learned Blocks Preserve Causal Meaning? Block Identifiability and Constructive Causal Abstractions

Karim Zaghw, Wieland Brendel, Patrik Reizinger

Standard identifiability theory assumes one-dimensional latent factors, but learned representations can encode latent information across multidimensional blocks whose internal coor…

cs.LG2026

Stabilizing Extrapolation in Looped Transformers via Learned Stochastic Stopping

Hsun-Yu Kuo, El Mahdi Chayti, Patrik Reizinger +2

Looped Transformers, which repeatedly apply a shared transformer block, are an architecturally natural fit for variable-length algorithmic tasks. Although they can exhibit strong l…

cs.LG2026

Causality is Key for Interpretability Claims to Generalise

Shruti Joshi, Aaron Mueller, David Klindt +3

Interpretability research on large language models (LLMs) has yielded important insights into model behaviour, yet recurring pitfalls persist: findings that do not generalise, and…

cs.LG2026

Who Guards the Guardians? The Challenges of Evaluating Identifiability of Learned Representations

Shruti Joshi, Théo Saulus, Wieland Brendel +3

Identifiability in representation learning is commonly evaluated using standard metrics (e.g., MCC, DCI, R^2) on synthetic benchmarks with known ground-truth factors. These metrics…

cs.LG2025

From Isolation to Entanglement: When Do Interpretability Methods Identify and Disentangle Known Concepts?

Aaron Mueller, Andrew Lee, Shruti Joshi +3

A goal of interpretability is to recover disentangled representations of latent concepts (features) from the activations of neural networks. The quality of features is typically ev…

cs.LG2025

Out-of-distribution Tests Reveal Compositionality in Chess Transformers

Anna Mészáros, Patrik Reizinger, Ferenc Huszár

Chess is a canonical example of a task that requires rigorous reasoning and long-term planning. Modern decision Transformers - trained similarly to LLMs - are able to learn compete…

cs.LG2025

Skill Learning via Policy Diversity Yields Identifiable Representations for Reinforcement Learning

Patrik Reizinger, Bálint Mucsányi, Siyuan Guo +3

Self-supervised feature learning and pretraining methods in reinforcement learning (RL) often rely on information-theoretic principles, termed mutual information skill learning (MI…

cs.LG2025

Position: An Empirically Grounded Identifiability Theory Will Accelerate Self-Supervised Learning Research

Patrik Reizinger, Randall Balestriero, David Klindt +1

Self-Supervised Learning (SSL) powers many current AI systems. As research interest and investment grow, the SSL design space continues to expand. The Platonic view of SSL, followi…

cs.LG2025

From superposition to sparse codes: interpretable representations in neural networks

David Klindt, Charles O'Neill, Patrik Reizinger +2

Understanding how information is represented in neural networks is a fundamental challenge in both neuroscience and artificial intelligence. Despite their nonlinear architectures,…

cs.LG2024★ 1 cited

Cross-Entropy Is All You Need To Invert the Data Generating Process

Patrik Reizinger, Alice Bizeul, Attila Juhos +4

Supervised learning has become a cornerstone of modern machine learning, yet a comprehensive theory explaining its effectiveness remains elusive. Empirical phenomena, such as neura…

cs.LG2024★ 5 cited

InfoNCE: Identifying the Gap Between Theory and Practice

Evgenia Rusak, Patrik Reizinger, Attila Juhos +3

Prior theory work on Contrastive Learning via the InfoNCE loss showed that, under certain assumptions, the learned representations recover the ground-truth latent factors. We argue…

cs.LG2023★ 1 cited

An Interventional Perspective on Identifiability in Gaussian LTI Systems with Independent Component Analysis

Goutham Rajendran, Patrik Reizinger, Wieland Brendel +1

We investigate the relationship between system identification and intervention design in dynamical systems. While previous research demonstrated how identifiable representation lea…

cs.LG2019★ 2 cited

Stochastic Weight Matrix-based Regularization Methods for Deep Neural Networks

Patrik Reizinger, Bálint Gyires-Tóth

The aim of this paper is to introduce two widely applicable regularization methods based on the direct modification of weight matrices. The first method, Weight Reinitialization, u…