4 papers
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…
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…
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…
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,…