Enric Boix-Adserà

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 33

Top Topics

Suboptimal Solutions

Hierarchically Structured

Top Venues

SIAM J. Math. Data Sci.

Publications

Enric Boix-Adserà
Towards a theory of model distillation. CoRR (2024)
Enric Boix-Adserà, Omid Saremi, Emmanuel Abbe, Samy Bengio, Etai Littwin, Joshua M. Susskind
When can transformers reason with abstract symbols? ICLR (2024)
Emmanuel Abbe, Enric Boix-Adserà, Theodor Misiakiewicz
SGD learning on neural networks: leap complexity and saddle-to-saddle dynamics. CoRR (2023)
Enric Boix-Adserà, Etai Littwin
The NTK approximation is valid for longer than you think. CoRR (2023)
Enric Boix-Adserà, Omid Saremi, Emmanuel Abbe, Samy Bengio, Etai Littwin, Joshua M. Susskind
When can transformers reason with abstract symbols? CoRR (2023)
Jason M. Altschuler, Enric Boix-Adserà
Polynomial-time algorithms for multimarginal optimal transport problems with structure. Math. Program. 199 (1) (2023)
Enric Boix-Adserà, Etai Littwin, Emmanuel Abbe, Samy Bengio, Joshua M. Susskind
Transformers learn through gradual rank increase. CoRR (2023)
Emmanuel Abbe, Samy Bengio, Enric Boix-Adserà, Etai Littwin, Joshua M. Susskind
Transformers learn through gradual rank increase. NeurIPS (2023)
Enric Boix-Adserà, Etai Littwin
Tight conditions for when the NTK approximation is valid. Trans. Mach. Learn. Res. 2023 (2023)
Rimon Melamed, Lucas H. McCabe, Tanay Wakhare, Yejin Kim, H. Howie Huang, Enric Boix-Adserà
PROPANE: Prompt design as an inverse problem. CoRR (2023)
Emmanuel Abbe, Enric Boix-Adserà
On the non-universality of deep learning: quantifying the cost of symmetry. NeurIPS (2022)
Enric Boix-Adserà, Guy Bresler, Frederic Koehler
Chow-Liu++: Optimal Prediction-Centric Learning of Tree Ising Models. FOCS (2022)
Jason M. Altschuler, Enric Boix-Adserà
Wasserstein Barycenters Are NP-Hard to Compute. SIAM J. Math. Data Sci. 4 (1) (2022)
Emmanuel Abbe, Enric Boix-Adserà
On the non-universality of deep learning: quantifying the cost of symmetry. CoRR (2022)
Enric Boix-Adserà, Hannah Lawrence, George Stepaniants, Philippe Rigollet
GULP: a prediction-based metric between representations. NeurIPS (2022)
Emmanuel Abbe, Enric Boix-Adserà, Theodor Misiakiewicz
The merged-staircase property: a necessary and nearly sufficient condition for SGD learning of sparse functions on two-layer neural networks. CoRR (2022)
Enric Boix-Adserà, Benjamin L. Edelman, Siddhartha Jayanti
The multiplayer Colonel Blotto game. Games Econ. Behav. 129 (2021)
Enric Boix-Adserà, Guy Bresler, Frederic Koehler
Chow-Liu++: Optimal Prediction-Centric Learning of Tree Ising Models. CoRR (2021)
Jason M. Altschuler, Enric Boix-Adserà
Wasserstein barycenters are NP-hard to compute. CoRR (2021)
Jason M. Altschuler, Enric Boix-Adserà
Hardness results for Multimarginal Optimal Transport problems. Discret. Optim. 42 (2021)
Emmanuel Abbe, Enric Boix-Adserà, Matthew S. Brennan, Guy Bresler, Dheeraj Nagaraj
The staircase property: How hierarchical structure can guide deep learning. NeurIPS (2021)
Enric Boix-Adserà, Guy Bresler, Frederic Koehler
Chow-Liu++: Optimal Prediction-Centric Learning of Tree Ising Models. FOCS (2021)
Jason M. Altschuler, Enric Boix-Adserà
Wasserstein barycenters can be computed in polynomial time in fixed dimension. J. Mach. Learn. Res. 22 (2021)
Emmanuel Abbe, Enric Boix-Adserà, Matthew S. Brennan, Guy Bresler, Dheeraj Nagaraj
The staircase property: How hierarchical structure can guide deep learning. CoRR (2021)
Jason M. Altschuler, Enric Boix-Adserà
Polynomial-time algorithms for Multimarginal Optimal Transport problems with structure. CoRR (2020)
Jason M. Altschuler, Enric Boix-Adserà
Hardness results for Multimarginal Optimal Transport problems. CoRR (2020)
Enric Boix-Adserà, Benjamin L. Edelman, Siddhartha Jayanti
The Multiplayer Colonel Blotto Game. EC (2020)
Enric Boix-Adserà, Benjamin L. Edelman, Siddhartha Jayanti
The Multiplayer Colonel Blotto Game. CoRR (2020)
Emmanuel Abbe, Enric Boix-Adserà, Peter Ralli, Colin Sandon
Graph Powering and Spectral Robustness. SIAM J. Math. Data Sci. 2 (1) (2020)
Jason M. Altschuler, Enric Boix-Adserà
High-precision Wasserstein barycenters in polynomial time. CoRR (2020)
Siddhartha V. Jayanti, Robert E. Tarjan, Enric Boix-Adserà
Randomized Concurrent Set Union and Generalized Wake-Up. PODC (2019)
Enric Boix-Adserà, Matthew S. Brennan, Guy Bresler
The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs. FOCS (2019)
Enric Boix-Adserà, Lior Eldar, Saeed Mehraban
Approximating the Determinant of Well-Conditioned Matrices by Shallow Circuits. CoRR (2019)