default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClayton Sanford
Person information
- affiliation: Columbia University, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Clayton Sanford, Daniel Hsu, Matus Telgarsky:
Transformers, parallel computation, and logarithmic depth. ICML 2024- [i12]Clayton Sanford, Daniel Hsu, Matus Telgarsky:
Transformers, parallel computation, and logarithmic depth. CoRR abs/2402.09268 (2024) - [i11]Clayton Sanford, Bahare Fatemi, Ethan Hall, Anton Tsitsulin, Seyed Mehran Kazemi, Jonathan Halcrow, Bryan Perozzi, Vahab Mirrokni:
Understanding Transformer Reasoning Capabilities via Graph Algorithms. CoRR abs/2405.18512 (2024) - [i10]Clayton Sanford, Daniel Hsu, Matus Telgarsky:
One-layer transformers fail to solve the induction heads task. CoRR abs/2408.14332 (2024) - 2023
- [c8]Navid Ardeshir, Daniel J. Hsu, Clayton Hendrick Sanford:
Intrinsic dimensionality and generalization properties of the R-norm inductive bias. COLT 2023: 3264-3303 - [c7]Clayton Sanford, Daniel J. Hsu, Matus Telgarsky:
Representational Strengths and Limitations of Transformers. NeurIPS 2023 - [i9]Clayton Sanford, Daniel Hsu, Matus Telgarsky:
Representational Strengths and Limitations of Transformers. CoRR abs/2306.02896 (2023) - 2022
- [c6]Clayton Hendrick Sanford, Vaggos Chatziafratis:
Expressivity of Neural Networks via Chaotic Itineraries beyond Sharkovsky's Theorem. AISTATS 2022: 9505-9549 - [c5]Daniel J. Hsu, Clayton Hendrick Sanford, Rocco A. Servedio, Emmanouil-Vasileios Vlatakis-Gkaragkounis
:
Near-Optimal Statistical Query Lower Bounds for Agnostically Learning Intersections of Halfspaces with Gaussian Marginals. COLT 2022: 283-312 - [c4]Alberto Bietti, Joan Bruna, Clayton Sanford, Min Jae Song:
Learning single-index models with shallow neural networks. NeurIPS 2022 - [c3]Vaggos Chatziafratis, Ioannis Panageas, Clayton Sanford, Stelios Stavroulakis:
On Scrambling Phenomena for Randomly Initialized Recurrent Networks. NeurIPS 2022 - [i8]Daniel Hsu, Clayton Sanford, Rocco A. Servedio, Emmanouil V. Vlatakis-Gkaragkounis:
Near-Optimal Statistical Query Lower Bounds for Agnostically Learning Intersections of Halfspaces with Gaussian Marginals. CoRR abs/2202.05096 (2022) - [i7]Clayton Sanford, Navid Ardeshir, Daniel Hsu:
Intrinsic dimensionality and generalization properties of the R-norm inductive bias. CoRR abs/2206.05317 (2022) - [i6]Vaggos Chatziafratis, Ioannis Panageas, Clayton Sanford, Stelios Andrew Stavroulakis:
On Scrambling Phenomena for Randomly Initialized Recurrent Networks. CoRR abs/2210.05212 (2022) - [i5]Alberto Bietti, Joan Bruna, Clayton Sanford, Min Jae Song:
Learning Single-Index Models with Shallow Neural Networks. CoRR abs/2210.15651 (2022) - 2021
- [c2]Daniel Hsu, Clayton Sanford, Rocco A. Servedio, Emmanouil V. Vlatakis-Gkaragkounis:
On the Approximation Power of Two-Layer Networks of Random ReLUs. COLT 2021: 2423-2461 - [c1]Navid Ardeshir, Clayton Sanford, Daniel J. Hsu:
Support vector machines and linear regression coincide with very high-dimensional features. NeurIPS 2021: 4907-4918 - [i4]Daniel Hsu, Clayton Sanford, Rocco A. Servedio, Emmanouil V. Vlatakis-Gkaragkounis:
On the Approximation Power of Two-Layer Networks of Random ReLUs. CoRR abs/2102.02336 (2021) - [i3]Navid Ardeshir, Clayton Sanford, Daniel Hsu:
Support vector machines and linear regression coincide with very high-dimensional features. CoRR abs/2105.14084 (2021) - [i2]Clayton Sanford, Vaggos Chatziafratis:
Expressivity of Neural Networks via Chaotic Itineraries beyond Sharkovsky's Theorem. CoRR abs/2110.10295 (2021)
2010 – 2019
- 2018
- [i1]Clayton Sanford, Cyrus Cousins, Eli Upfal:
Uniform Convergence Bounds for Codec Selection. CoRR abs/1812.07568 (2018) - 2017
- [j1]Kamil Jan Cygan, Clayton Hendrick Sanford, William G. Fairbrother:
Spliceman2: a computational web server that predicts defects in pre-mRNA splicing. Bioinform. 33(18): 2943-2945 (2017)
Coauthor Index
aka: Daniel J. Hsu
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-09-30 00:04 CEST 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:
