default search action
Benjamin L. Edelman
Person information
- affiliation: Harvard University, Cambridge, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Depen Morwani, Benjamin L. Edelman, Costin-Andrei Oncescu, Rosie Zhao, Sham M. Kakade:
Feature emergence via margin maximization: case studies in algebraic tasks. ICLR 2024 - [c8]Gustaf Ahdritz, Tian Qin, Nikhil Vyas, Boaz Barak, Benjamin L. Edelman:
Distinguishing the Knowable from the Unknowable with Language Models. ICML 2024 - [c7]Hanlin Zhang, Benjamin L. Edelman, Danilo Francati, Daniele Venturi, Giuseppe Ateniese, Boaz Barak:
Watermarks in the Sand: Impossibility of Strong Watermarking for Language Models. ICML 2024 - [i14]Gustaf Ahdritz, Tian Qin, Nikhil Vyas, Boaz Barak, Benjamin L. Edelman:
Distinguishing the Knowable from the Unknowable with Language Models. CoRR abs/2402.03563 (2024) - [i13]Benjamin L. Edelman, Ezra Edelman, Surbhi Goel, Eran Malach, Nikolaos Tsilivis:
The Evolution of Statistical Induction Heads: In-Context Learning Markov Chains. CoRR abs/2402.11004 (2024) - [i12]Usman Anwar, Abulhair Saparov, Javier Rando, Daniel Paleka, Miles Turpin, Peter Hase, Ekdeep Singh Lubana, Erik Jenner, Stephen Casper, Oliver Sourbut, Benjamin L. Edelman, Zhaowei Zhang, Mario Günther, Anton Korinek, José Hernández-Orallo, Lewis Hammond, Eric J. Bigelow, Alexander Pan, Lauro Langosco, Tomasz Korbak, Heidi Zhang, Ruiqi Zhong, Seán Ó hÉigeartaigh, Gabriel Recchia, Giulio Corsi, Alan Chan, Markus Anderljung, Lilian Edwards, Yoshua Bengio, Danqi Chen, Samuel Albanie, Tegan Maharaj, Jakob N. Foerster, Florian Tramèr, He He, Atoosa Kasirzadeh, Yejin Choi, David Krueger:
Foundational Challenges in Assuring Alignment and Safety of Large Language Models. CoRR abs/2404.09932 (2024) - [i11]Edwin Zhang, Vincent Zhu, Naomi Saphra, Anat Kleiman, Benjamin L. Edelman, Milind Tambe, Sham M. Kakade, Eran Malach:
Transcendence: Generative Models Can Outperform The Experts That Train Them. CoRR abs/2406.11741 (2024) - 2023
- [c6]Benjamin L. Edelman, Surbhi Goel, Sham M. Kakade, Eran Malach, Cyril Zhang:
Pareto Frontiers in Deep Feature Learning: Data, Compute, Width, and Luck. NeurIPS 2023 - [i10]Benjamin L. Edelman, Surbhi Goel, Sham M. Kakade, Eran Malach, Cyril Zhang:
Pareto Frontiers in Neural Feature Learning: Data, Compute, Width, and Luck. CoRR abs/2309.03800 (2023) - [i9]Hanlin Zhang, Benjamin L. Edelman, Danilo Francati, Daniele Venturi, Giuseppe Ateniese, Boaz Barak:
Watermarks in the Sand: Impossibility of Strong Watermarking for Generative Models. CoRR abs/2311.04378 (2023) - [i8]Depen Morwani, Benjamin L. Edelman, Costin-Andrei Oncescu, Rosie Zhao, Sham M. Kakade:
Feature emergence via margin maximization: case studies in algebraic tasks. CoRR abs/2311.07568 (2023) - [i7]Hanlin Zhang, Benjamin L. Edelman, Danilo Francati, Daniele Venturi, Giuseppe Ateniese, Boaz Barak:
Watermarks in the Sand: Impossibility of Strong Watermarking for Generative Models. IACR Cryptol. ePrint Arch. 2023: 1776 (2023) - 2022
- [c5]Benjamin L. Edelman
, Surbhi Goel, Sham M. Kakade, Cyril Zhang:
Inductive Biases and Variable Creation in Self-Attention Mechanisms. ICML 2022: 5793-5831 - [c4]Boaz Barak, Benjamin L. Edelman, Surbhi Goel, Sham M. Kakade, Eran Malach, Cyril Zhang:
Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limit. NeurIPS 2022 - [i6]Boaz Barak, Benjamin L. Edelman, Surbhi Goel, Sham M. Kakade, Eran Malach, Cyril Zhang:
Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limit. CoRR abs/2207.08799 (2022) - 2021
- [j2]Enric Boix-Adserà, Benjamin L. Edelman
The multiplayer Colonel Blotto game. Games Econ. Behav. 129: 15-31 (2021) - [i5]Benjamin L. Edelman, Surbhi Goel, Sham M. Kakade, Cyril Zhang:
Inductive Biases and Variable Creation in Self-Attention Mechanisms. CoRR abs/2110.10090 (2021) - 2020
- [c3]Yonadav Shavit, Benjamin L. Edelman, Brian Axelrod:
Causal Strategic Linear Regression. ICML 2020: 8676-8686 - [c2]Enric Boix-Adserà, Benjamin L. Edelman, Siddhartha Jayanti:
The Multiplayer Colonel Blotto Game. EC 2020: 47-48 - [i4]Enric Boix-Adserà, Benjamin L. Edelman, Siddhartha Jayanti:
The Multiplayer Colonel Blotto Game. CoRR abs/2002.05240 (2020) - [i3]Yonadav Shavit, Benjamin L. Edelman, Brian Axelrod:
Learning From Strategic Agents: Accuracy, Improvement, and Causality. CoRR abs/2002.10066 (2020)
2010 – 2019
- 2019
- [j1]Zeev Dvir, Benjamin L. Edelman:
Matrix Rigidity and the Croot-Lev-Pach Lemma. Theory Comput. 15: 1-7 (2019) - [c1]Preetum Nakkiran, Gal Kaplun, Dimitris Kalimeris, Tristan Yang, Benjamin L. Edelman, Fred Zhang, Boaz Barak:
SGD on Neural Networks Learns Functions of Increasing Complexity. NeurIPS 2019: 3491-3501 - [i2]Preetum Nakkiran, Gal Kaplun, Dimitris Kalimeris, Tristan Yang, Benjamin L. Edelman
SGD on Neural Networks Learns Functions of Increasing Complexity. CoRR abs/1905.11604 (2019) - 2017
- [i1]Zeev Dvir, Benjamin L. Edelman
Matrix rigidity and the Croot-Lev-Pach lemma. CoRR abs/1708.01646 (2017)
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-19 21:45 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: