default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdam R. Klivans
- > Home > Persons > Adam R. Klivans
Publications
- 2023
[c59]Aravind Gollakota, Adam R. Klivans, Pravesh K. Kothari:
A Moment-Matching Approach to Testable Learning and a New Characterization of Rademacher Complexity. STOC 2023: 1657-1670- 2022
- [i42]Aravind Gollakota, Adam R. Klivans, Pravesh K. Kothari:
A Moment-Matching Approach to Testable Learning and a New Characterization of Rademacher Complexity. CoRR abs/2211.13312 (2022) - 2019
- [c47]Sushrut Karmalkar, Adam R. Klivans, Pravesh Kothari:
List-decodable Linear Regression. NeurIPS 2019: 7423-7432 - [i31]Sushrut Karmalkar, Adam R. Klivans, Pravesh K. Kothari:
List-Decodable Linear Regression. CoRR abs/1905.05679 (2019) - 2018
- [c44]Adam R. Klivans, Pravesh K. Kothari, Raghu Meka:
Efficient Algorithms for Outlier-Robust Regression. COLT 2018: 1420-1430 - [i28]Adam R. Klivans, Pravesh K. Kothari, Raghu Meka:
Efficient Algorithms for Outlier-Robust Regression. CoRR abs/1803.03241 (2018) - 2014
- [c37]Adam R. Klivans, Pravesh Kothari:
Embedding Hard Learning Problems Into Gaussian Space. APPROX-RANDOM 2014: 793-809 - [i18]Adam R. Klivans, Pravesh Kothari:
Embedding Hard Learning Problems into Gaussian Space. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c35]Adam R. Klivans, Pravesh Kothari, Igor C. Oliveira:
Constructing Hard Functions Using Learning Algorithms. CCC 2013: 86-97 - [i16]Adam R. Klivans, Pravesh Kothari, Igor C. Oliveira:
Constructing Hard Functions from Learning Algorithms. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c33]Eshan Chattopadhyay, Adam R. Klivans, Pravesh Kothari:
An Explicit VC-Theorem for Low-Degree Polynomials. APPROX-RANDOM 2012: 495-504 - [c32]Mahdi Cheraghchi
, Adam R. Klivans, Pravesh Kothari, Homin K. Lee:
Submodular functions are noise stable. SODA 2012: 1586-1592 - [i14]Eshan Chattopadhyay, Adam R. Klivans, Pravesh Kothari:
An Explicit VC-Theorem for Low-Degree Polynomials. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [i13]Mahdi Cheraghchi, Adam R. Klivans, Pravesh Kothari, Homin K. Lee:
Submodular Functions Are Noise Stable. CoRR abs/1106.0518 (2011) - [i12]Mahdi Cheraghchi, Adam R. Klivans, Pravesh Kothari, Homin K. Lee:
Submodular Functions Are Noise Stable. Electron. Colloquium Comput. Complex. TR11 (2011)
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-13 01:41 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:
