default search action
Neha Gupta 0002
Person information
- affiliation: Stanford University, CA, USA
- affiliation (former): IIT Delhi, India
Other persons with the same name
- Neha Gupta — disambiguation page
- Neha Gupta 0001 — University of Maryland, College Park, MD, USA
- Neha Gupta 0003 — Delhi Technological University, Microelectronics Research Lab, India
- Neha Gupta 0004 — University of Nottingham, UK
- Neha Gupta 0005 — Indraprastha Institute of Information Technology, Delhi, India(IIIT-D)
- Neha Gupta 0006 — National Institute of Technology Rourkela, Department of Electronics and Communication Engineering, India
- Neha Gupta 0007 — SGT University, Faculty of Commerce & Management, Gurgaon, India (and 1 more)
- Neha Gupta 0008 — Indira Gandhi Delhi Technical University for Women, New Delhi, India
- Neha Gupta 0009 — University of Warwick, Warwick Institute for the Science of Cities, Coventry, UK
- Neha Gupta 0010 — Manav Rachna International Institute of Research and Studies, Faridabad, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [c7]Arturs Backurs, Avrim Blum, Neha Gupta:
Active Local Learning. COLT 2020: 363-390 - [c6]Guy Blanc, Neha Gupta, Gregory Valiant, Paul Valiant:
Implicit regularization for deep neural networks driven by an Ornstein-Uhlenbeck like process. COLT 2020: 483-513 - [c5]Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan:
Estimating decision tree learnability with polylogarithmic sample complexity. NeurIPS 2020 - [c4]Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan:
Universal guarantees for decision tree induction via a higher-order splitting criterion. NeurIPS 2020 - [i6]Arturs Backurs, Avrim Blum, Neha Gupta:
Active Local Learning. CoRR abs/2008.13374 (2020) - [i5]Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan:
Universal guarantees for decision tree induction via a higher-order splitting criterion. CoRR abs/2010.08633 (2020) - [i4]Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan:
Estimating decision tree learnability with polylogarithmic sample complexity. CoRR abs/2011.01584 (2020)
2010 – 2019
- 2019
- [i3]Guy Blanc, Neha Gupta, Gregory Valiant, Paul Valiant:
Implicit regularization for deep neural networks driven by an Ornstein-Uhlenbeck like process. CoRR abs/1904.09080 (2019) - 2018
- [c3]Neha Gupta, Aaron Sidford:
Exploiting Numerical Sparsity for Efficient Learning : Faster Eigenvector Computation and Regression. NeurIPS 2018: 5274-5283 - [i2]Neha Gupta, Aaron Sidford:
Exploiting Numerical Sparsity for Efficient Learning : Faster Eigenvector Computation and Regression. CoRR abs/1811.10866 (2018) - 2017
- [c2]Moses Charikar, Neha Gupta, Roy Schwartz:
Local Guarantees in Graph Cuts and Clustering. IPCO 2017: 136-147 - [i1]Moses Charikar, Neha Gupta, Roy Schwartz:
Local Guarantees in Graph Cuts and Clustering. CoRR abs/1704.00355 (2017) - 2014
- [c1]Shripad Nadgowda, Ravella C. Sreenivas, Sanchit Gupta, Neha Gupta, Akshat Verma:
C2P: Co-operative Caching in Distributed Storage Systems. ICSOC 2014: 214-229
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-12-02 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint