default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEnric Boix-Adserà
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[b1]Enric Boix-Adserà:
Characterizations of how neural networks learn. MIT, USA, 2024- [c14]Rimon Melamed, Lucas H. McCabe, Tanay Wakhare, Yejin Kim, H. Howie Huang, Enric Boix-Adserà:
Prompts have evil twins. EMNLP 2024: 46-74 - [c13]Enric Boix-Adserà, Omid Saremi, Emmanuel Abbe, Samy Bengio, Etai Littwin, Joshua M. Susskind:
When can transformers reason with abstract symbols? ICLR 2024 - [i21]Enric Boix-Adserà:
Towards a theory of model distillation. CoRR abs/2403.09053 (2024) - 2023
- [j7]Jason M. Altschuler
, Enric Boix-Adserà:
Polynomial-time algorithms for multimarginal optimal transport problems with structure. Math. Program. 199(1): 1107-1178 (2023) - [j6]Enric Boix-Adserà, Etai Littwin:
Tight conditions for when the NTK approximation is valid. Trans. Mach. Learn. Res. 2023 (2023) - [c12]Emmanuel Abbe, Enric Boix Adserà, Theodor Misiakiewicz:
SGD learning on neural networks: leap complexity and saddle-to-saddle dynamics. COLT 2023: 2552-2623 - [c11]Emmanuel Abbe, Samy Bengio, Enric Boix-Adserà, Etai Littwin, Joshua M. Susskind:
Transformers learn through gradual rank increase. NeurIPS 2023 - [i20]Emmanuel Abbe, Enric Boix-Adserà, Theodor Misiakiewicz:
SGD learning on neural networks: leap complexity and saddle-to-saddle dynamics. CoRR abs/2302.11055 (2023) - [i19]Enric Boix-Adserà, Etai Littwin:
The NTK approximation is valid for longer than you think. CoRR abs/2305.13141 (2023) - [i18]Enric Boix-Adserà, Etai Littwin, Emmanuel Abbe, Samy Bengio, Joshua M. Susskind:
Transformers learn through gradual rank increase. CoRR abs/2306.07042 (2023) - [i17]Enric Boix-Adserà, Omid Saremi, Emmanuel Abbe, Samy Bengio, Etai Littwin, Joshua M. Susskind:
When can transformers reason with abstract symbols? CoRR abs/2310.09753 (2023) - [i16]Rimon Melamed, Lucas H. McCabe, Tanay Wakhare, Yejin Kim, H. Howie Huang, Enric Boix-Adserà:
PROPANE: Prompt design as an inverse problem. CoRR abs/2311.07064 (2023) - 2022
- [j5]Jason M. Altschuler, Enric Boix-Adserà:
Wasserstein Barycenters Are NP-Hard to Compute. SIAM J. Math. Data Sci. 4(1): 179-203 (2022) - [c10]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. COLT 2022: 4782-4887 - [c9]Emmanuel Abbe, Enric Boix-Adserà:
On the non-universality of deep learning: quantifying the cost of symmetry. NeurIPS 2022 - [c8]Enric Boix-Adserà, Hannah Lawrence, George Stepaniants, Philippe Rigollet:
GULP: a prediction-based metric between representations. NeurIPS 2022 - [i15]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 abs/2202.08658 (2022) - [i14]Emmanuel Abbe, Enric Boix-Adserà:
On the non-universality of deep learning: quantifying the cost of symmetry. CoRR abs/2208.03113 (2022) - [i13]Enric Boix Adserà, Hannah Lawrence, George Stepaniants, Philippe Rigollet:
GULP: a prediction-based metric between representations. CoRR abs/2210.06545 (2022) - 2021
- [j4]Jason M. Altschuler, Enric Boix-Adserà:
Hardness results for Multimarginal Optimal Transport problems. Discret. Optim. 42: 100669 (2021) - [j3]Enric Boix-Adserà, Benjamin L. Edelman, Siddhartha Jayanti:
The multiplayer Colonel Blotto game. Games Econ. Behav. 129: 15-31 (2021) - [j2]Jason M. Altschuler, Enric Boix-Adserà:
Wasserstein barycenters can be computed in polynomial time in fixed dimension. J. Mach. Learn. Res. 22: 44:1-44:19 (2021) - [c7]Enric Boix-Adserà, Guy Bresler, Frederic Koehler:
Chow-Liu++: Optimal Prediction-Centric Learning of Tree Ising Models. FOCS 2021: 417-426 - [c6]Emmanuel Abbe, Enric Boix-Adserà, Matthew S. Brennan, Guy Bresler, Dheeraj Nagaraj:
The staircase property: How hierarchical structure can guide deep learning. NeurIPS 2021: 26989-27002 - [i12]Jason M. Altschuler, Enric Boix-Adserà:
Wasserstein barycenters are NP-hard to compute. CoRR abs/2101.01100 (2021) - [i11]Enric Boix-Adserà, Guy Bresler, Frederic Koehler:
Chow-Liu++: Optimal Prediction-Centric Learning of Tree Ising Models. CoRR abs/2106.03969 (2021) - [i10]Emmanuel Abbe, Enric Boix-Adserà, Matthew S. Brennan, Guy Bresler, Dheeraj Nagaraj:
The staircase property: How hierarchical structure can guide deep learning. CoRR abs/2108.10573 (2021) - 2020
- [j1]Emmanuel Abbe, Enric Boix-Adserà, Peter Ralli, Colin Sandon:
Graph Powering and Spectral Robustness. SIAM J. Math. Data Sci. 2(1): 132-157 (2020) - [c5]Enric Boix-Adserà, Benjamin L. Edelman, Siddhartha Jayanti:
The Multiplayer Colonel Blotto Game. EC 2020: 47-48 - [i9]Enric Boix-Adserà, Benjamin L. Edelman, Siddhartha Jayanti:
The Multiplayer Colonel Blotto Game. CoRR abs/2002.05240 (2020) - [i8]Jason M. Altschuler, Enric Boix-Adserà:
High-precision Wasserstein barycenters in polynomial time. CoRR abs/2006.08012 (2020) - [i7]Jason M. Altschuler, Enric Boix-Adserà:
Polynomial-time algorithms for Multimarginal Optimal Transport problems with structure. CoRR abs/2008.03006 (2020) - [i6]Jason M. Altschuler, Enric Boix-Adserà:
Hardness results for Multimarginal Optimal Transport problems. CoRR abs/2012.05398 (2020)
2010 – 2019
- 2019
- [c4]Enric Boix-Adserà, Matthew S. Brennan, Guy Bresler:
The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs. FOCS 2019: 1256-1280 - [c3]Emmanuel Abbe, Enric Boix Adserà:
Subadditivity Beyond Trees and the Chi-Squared Mutual Information. ISIT 2019: 697-701 - [c2]Kristjan H. Greenewald, Dmitriy Katz, Karthikeyan Shanmugam, Sara Magliacane, Murat Kocaoglu, Enric Boix Adserà, Guy Bresler:
Sample Efficient Active Learning of Causal Trees. NeurIPS 2019: 14279-14289 - [c1]Siddhartha V. Jayanti, Robert E. Tarjan, Enric Boix-Adserà:
Randomized Concurrent Set Union and Generalized Wake-Up. PODC 2019: 187-196 - [i5]Emmanuel Abbe, Enric Boix:
Subadditivity Beyond Trees and the Chi-Squared Mutual Information. CoRR abs/1902.02431 (2019) - [i4]Enric Boix Adserà, Matthew S. Brennan, Guy Bresler:
The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs. CoRR abs/1903.08247 (2019) - [i3]Enric Boix-Adserà, Lior Eldar, Saeed Mehraban:
Approximating the Determinant of Well-Conditioned Matrices by Shallow Circuits. CoRR abs/1912.03824 (2019) - 2018
- [i2]Emmanuel Abbe, Enric Boix:
An Information-Percolation Bound for Spin Synchronization on General Graphs. CoRR abs/1806.03227 (2018) - [i1]Emmanuel Abbe, Enric Boix, Peter Ralli, Colin Sandon:
Graph powering and spectral robustness. CoRR abs/1809.04818 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-15 19:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
