activity
20192026
most citedThe merged-staircase property: a necessary and nearly sufficient condition for SGD learning of sparse functions on two-layer neural networks

8 citations · 24 across the 16 of their papers we have counts for

collaborators

19 papers

cs.LG2026

MoRE: Scaling mixture of experts with hardware-aware low-rank routing

Honam Wong, Surbhi Goel, Enric Boix-Adserà

Mixture-of-Experts (MoE) layers are central to frontier language models, and recent architectures push toward more and smaller experts. In this regime, the standard linear router b…

cs.AI2026

Logical subspace in LLMs

Hope Kean, Enric Boix-Adsera

Recent work has identified a human brain network specialized for abstract formal reasoning (Kean et al., 2025). Does the same hold true in language models? To answer this question,…

cs.LG2026

Revenge of Monosemanticity: Neuron Specialization as a New Form of Feature Learning in MLPs

Amirhesam Abedsoltan, Enric Boix-Adsera, Fivos Kalogiannis +1

Understanding how neural networks learn and organize features is central to understanding their behavior. Much existing theory of feature learning has focused on the emergence of a…

cs.CL2026

Model Hypnosis: Strong control of AI via additive subliminal effects

Enric Boix-Adsera, Benedict Tessler

We demonstrate that AI models are broadly susceptible to a phenomenon we call model hypnosis, in which individually weak and seemingly irrelevant cues in the prompt can be systemat…

stat.ML2026

There Will Be a Scientific Theory of Deep Learning

Jamie Simon, Daniel Kunin, Alexander Atanasov +11

In this paper, we make the case that a scientific theory of deep learning is emerging. By this we mean a theory which characterizes important properties and statistics of the train…

cs.LG2025

The Features at Convergence Theorem: a first-principles alternative to the Neural Feature Ansatz for how networks learn representations

Enric Boix-Adsera, Neil Mallinar, James B. Simon +1

It is a central challenge in deep learning to understand how neural networks learn representations. A leading approach is the Neural Feature Ansatz (NFA) (Radhakrishnan et al. 2024…

cs.LG2025

Let Me Think! A Long Chain-of-Thought Can Be Worth Exponentially Many Short Ones

Parsa Mirtaheri, Ezra Edelman, Samy Jelassi +2

Inference-time computation has emerged as a promising scaling axis for improving large language model reasoning. However, despite yielding impressive performance, the optimal alloc…

cs.CL2025

Toward universal steering and monitoring of AI models

Daniel Beaglehole, Adityanarayanan Radhakrishnan, Enric Boix-Adserà +1

Modern AI models contain much of human knowledge, yet understanding of their internal representation of this knowledge remains elusive. Characterizing the structure and properties…

cs.LG2025

On the inductive bias of infinite-depth ResNets and the bottleneck rank

Enric Boix-Adsera

We compute the minimum-norm weights of a deep linear ResNet, and find that the inductive bias of this architecture lies between minimizing nuclear norm and rank. This implies that,…

cs.LG2024★ 4 cited

Towards a theory of model distillation

Enric Boix-Adsera

Distillation is the task of replacing a complicated machine learning model with a simpler model that approximates the original [BCNM06,HVD15]. Despite many practical applications,…

cs.CL2023★ 1 cited

Prompts have evil twins

Rimon Melamed, Lucas H. McCabe, Tanay Wakhare +3

We discover that many natural-language prompts can be replaced by corresponding prompts that are unintelligible to humans but that provably elicit similar behavior in language mode…

cs.CL2023★ 2 cited

When can transformers reason with abstract symbols?

Enric Boix-Adsera, Omid Saremi, Emmanuel Abbe +3

We investigate the capabilities of transformer models on relational reasoning tasks. In these tasks, models are trained on a set of strings encoding abstract relations, and are the…

cs.LG2023★ 5 cited

Transformers learn through gradual rank increase

Enric Boix-Adsera, Etai Littwin, Emmanuel Abbe +2

We identify incremental learning dynamics in transformers, where the difference between trained and initial weights progressively increases in rank. We rigorously prove this occurs…

cs.LG2023

Tight conditions for when the NTK approximation is valid

Enric Boix-Adsera, Etai Littwin

We study when the neural tangent kernel (NTK) approximation is valid for training a model with the square loss. In the lazy training setting of Chizat et al. 2019, we show that res…

cs.LG2023★ 3 cited

SGD learning on neural networks: leap complexity and saddle-to-saddle dynamics

Emmanuel Abbe, Enric Boix-Adsera, Theodor Misiakiewicz

We investigate the time complexity of SGD learning on fully-connected neural networks with isotropic data. We put forward a complexity measure -- the leap -- which measures how "hi…

cs.LG2022

On the non-universality of deep learning: quantifying the cost of symmetry

Emmanuel Abbe, Enric Boix-Adsera

We prove limitations on what neural networks trained by noisy gradient descent (GD) can efficiently learn. Our results apply whenever GD training is equivariant, which holds for ma…

cs.LG2022★ 8 cited

The merged-staircase property: a necessary and nearly sufficient condition for SGD learning of sparse functions on two-layer neural networks

Emmanuel Abbe, Enric Boix-Adsera, Theodor Misiakiewicz

It is currently known how to characterize functions that neural networks can learn with SGD for two extremal parameterizations: neural networks in the linear regime, and neural net…

cs.LG2021

The staircase property: How hierarchical structure can guide deep learning

Emmanuel Abbe, Enric Boix-Adsera, Matthew Brennan +2

This paper identifies a structural property of data distributions that enables deep neural networks to learn hierarchically. We define the "staircase" property for functions over t…

cs.DS2019★ 1 cited

Approximating the Determinant of Well-Conditioned Matrices by Shallow Circuits

Enric Boix-Adserà, Lior Eldar, Saeed Mehraban

The determinant can be computed by classical circuits of depth , and therefore it can also be computed in classical space . Recent progress by Ta-Shma [Ta…