Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnkit Gupta 0001
Person information
- affiliation: IBM Research, New York, USA
- affiliation (former): Tel-Aviv University, Israel
- affiliation (former, PhD 2015): Chennai Mathematical Institute, Department of Computer Science, India
Other persons with the same name
- Ankit Gupta — disambiguation page
- Ankit Gupta 0002 — University of Washington, Department of Computer Science and Engineering, Seattle, Washington, USA
- Ankit Gupta 0003 — Samsung (and 1 more)
- Ankit Gupta 0004
![[0000-0002-1483-1409]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-1483-1409")
— Chandigarh College of Engineering and Technology, India (and 1 more) - Ankit Gupta 0005 — Chalmers University of Technology, Gothenburg, Sweden
- Ankit Gupta 0006 — Shoolini University, School of Electrical and Computer Science Engineering, Solan, India (and 2 more)
- Ankit Gupta 0007 — University of Illinois at Chicago, Department of Electrical and Computer Engineering, IL, USA
- Ankit Gupta 0008 — Heriot Watt University, Edinburgh, UK
- Ankit Gupta 0009 — Indian Institute of Technology (Banaras Hindu University) Varanasi, India (and 1 more)
- Ankit Gupta 0010 — Samsung Semiconductor India Research and Development
- Ankit Gupta 0011 — Intel, Bangalore, India
- Ankit Gupta 0012 — Simon Fraser University, School of Interactive Arts and Technology, Surrey, BC, Canada
- Ankit Gupta 0013 — ETH Zürich, Department of Biosystems Science and Engineering, Basel, Switzerland (and 1 more)
- Ankit Gupta 0014 — Thomas Jefferson High School for Science and Technology, Department of Computer Science, Alexandria, VI, USA
- Ankit Gupta 0015 — Yale University, New Haven, CT, USA
- Ankit Gupta 0016 — Worcester Polytechnic Institute, Worcester, MA, USA
- Ankit Gupta 0017 — Amazon Web Services, Seattle, WA, USA
- Ankit Gupta 0018 — Uppsala University, Department of Information Technology, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i19]Ankit Gupta, George Saon, Brian Kingsbury:
Exploring the limits of decoder-only models trained on public speech recognition corpora. CoRR abs/2402.00235 (2024)- 2023
- [c14]Guy Dar, Mor Geva, Ankit Gupta, Jonathan Berant:
Analyzing Transformers in Embedding Space. ACL (1) 2023: 16124-16170 - [c13]George Saon, Ankit Gupta, Xiaodong Cui:
Diagonal State Space Augmented Transformers for Speech Recognition. ICASSP 2023: 1-5 - [c12]Harsh Mehta, Ankit Gupta, Ashok Cutkosky, Behnam Neyshabur:
Long Range Language Modeling via Gated State Spaces. ICLR 2023 - [i18]George Saon, Ankit Gupta, Xiaodong Cui:
Diagonal State Space Augmented Transformers for Speech Recognition. CoRR abs/2302.14120 (2023) - [i17]Ido Amos, Jonathan Berant, Ankit Gupta:
Never Train from Scratch: Fair Comparison of Long-Sequence Models Requires Data-Driven Priors. CoRR abs/2310.02980 (2023) - 2022
- [c11]Uri Shaham, Elad Segal, Maor Ivgi, Avia Efrat, Ori Yoran, Adi Haviv, Ankit Gupta, Wenhan Xiong, Mor Geva, Jonathan Berant, Omer Levy:
SCROLLS: Standardized CompaRison Over Long Language Sequences. EMNLP 2022: 12007-12021 - [c10]Ankit Gupta, Albert Gu, Jonathan Berant:
Diagonal State Spaces are as Effective as Structured State Spaces. NeurIPS 2022 - [c9]Albert Gu, Karan Goel, Ankit Gupta, Christopher Ré:
On the Parameterization and Initialization of Diagonal State Space Models. NeurIPS 2022 - [i16]Uri Shaham, Elad Segal, Maor Ivgi, Avia Efrat, Ori Yoran, Adi Haviv, Ankit Gupta, Wenhan Xiong, Mor Geva, Jonathan Berant, Omer Levy:
SCROLLS: Standardized CompaRison Over Long Language Sequences. CoRR abs/2201.03533 (2022) - [i15]Ankit Gupta:
Diagonal State Spaces are as Effective as Structured State Spaces. CoRR abs/2203.14343 (2022) - [i14]Albert Gu, Ankit Gupta, Karan Goel, Christopher Ré:
On the Parameterization and Initialization of Diagonal State Space Models. CoRR abs/2206.11893 (2022) - [i13]Harsh Mehta, Ankit Gupta, Ashok Cutkosky, Behnam Neyshabur:
Long Range Language Modeling via Gated State Spaces. CoRR abs/2206.13947 (2022) - [i12]Guy Dar, Mor Geva, Ankit Gupta, Jonathan Berant:
Analyzing Transformers in Embedding Space. CoRR abs/2209.02535 (2022) - [i11]Ankit Gupta, Harsh Mehta, Jonathan Berant:
Simplifying and Understanding State Space Models with Diagonal Linear RNNs. CoRR abs/2212.00768 (2022) - 2021
- [c8]Ankit Gupta, Guy Dar, Shaya Goodman, David Ciprut, Jonathan Berant:
Memory-efficient Transformers via Top-k Attention. SustaiNLP@EMNLP 2021: 39-52 - [c7]Ankit Gupta, Jonathan Berant:
Value-aware Approximate Attention. EMNLP (1) 2021: 9567-9574 - [i10]Ankit Gupta, Jonathan Berant:
Value-aware Approximate Attention. CoRR abs/2103.09857 (2021) - [i9]Ankit Gupta, Guy Dar, Shaya Goodman, David Ciprut, Jonathan Berant:
Memory-efficient Transformers via Top-k Attention. CoRR abs/2106.06899 (2021) - 2020
- [j5]Tomer Wolfson, Mor Geva, Ankit Gupta, Yoav Goldberg, Matt Gardner, Daniel Deutch, Jonathan Berant:
Break It Down: A Question Understanding Benchmark. Trans. Assoc. Comput. Linguistics 8: 183-198 (2020) - [c6]Mor Geva, Ankit Gupta, Jonathan Berant:
Injecting Numerical Reasoning Skills into Language Models. ACL 2020: 946-958 - [i8]Tomer Wolfson, Mor Geva, Ankit Gupta, Matt Gardner, Yoav Goldberg, Daniel Deutch, Jonathan Berant:
Break It Down: A Question Understanding Benchmark. CoRR abs/2001.11770 (2020) - [i7]Mor Geva, Ankit Gupta, Jonathan Berant:
Injecting Numerical Reasoning Skills into Language Models. CoRR abs/2004.04487 (2020) - [i6]Ankit Gupta, Jonathan Berant:
GMAT: Global Memory Augmentation for Transformers. CoRR abs/2006.03274 (2020)
2010 – 2019
- 2017
- [j4]Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi:
Unexpected power of low-depth arithmetic circuits. Commun. ACM 60(6): 93-100 (2017) - 2016
- [j3]Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi:
Arithmetic Circuits: A Chasm at Depth 3. SIAM J. Comput. 45(3): 1064-1079 (2016) - 2014
- [j2]Ankit Gupta, Neeraj Kayal, Youming Qiao:
Random arithmetic formulas can be reconstructed efficiently. Comput. Complex. 23(2): 207-303 (2014) - [j1]Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi:
Approaching the Chasm at Depth Four. J. ACM 61(6): 33:1-33:16 (2014) - [i5]Ankit Gupta:
Algebraic Geometric Techniques for Depth-4 PIT & Sylvester-Gallai Conjectures for Varieties. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c5]Ankit Gupta, Neeraj Kayal, Youming Qiao:
Random Arithmetic Formulas Can Be Reconstructed Efficiently. CCC 2013: 1-9 - [c4]Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi:
Approaching the Chasm at Depth Four. CCC 2013: 65-73 - [c3]Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi:
Arithmetic Circuits: A Chasm at Depth Three. FOCS 2013: 578-587 - [i4]Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi:
Arithmetic circuits: A chasm at depth three. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c2]Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam:
Reconstruction of depth-4 multilinear circuits with top fan-in 2. STOC 2012: 625-642 - [i3]Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi:
An exponential lower bound for homogeneous depth four arithmetic circuits with bounded bottom fanin. Electron. Colloquium Comput. Complex. TR12 (2012) - [i2]Ankit Gupta, Neeraj Kayal, Youming Qiao:
Random Arithmetic Formulas can be Reconstructed Efficiently. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c1]Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam:
Efficient Reconstruction of Random Multilinear Formulas. FOCS 2011: 778-787 - [i1]Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam:
Reconstruction of Depth-4 Multilinear Circuits with Top fanin 2. Electron. Colloquium Comput. Complex. TR11 (2011)
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-06-20 23:17 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:
