Остановите войну!
for scientists:
default search action
Ankur Moitra
- > Home > Persons > Ankur Moitra
Publications
- 2022
- [c61]Sitan Chen, Frederic Koehler, Ankur Moitra, Morris Yau:
Kalman filtering with adversarial corruptions. STOC 2022: 832-845 - 2021
- [c59]Sitan Chen, Frederic Koehler, Ankur Moitra, Morris Yau:
Online and Distribution-Free Robustness: Regression and Contextual Bandits with Huber Contamination. FOCS 2021: 684-695 - [i55]Sitan Chen, Frederic Koehler, Ankur Moitra, Morris Yau:
Kalman Filtering with Adversarial Corruptions. CoRR abs/2111.06395 (2021) - 2020
- [j13]Younhun Kim, Frederic Koehler, Ankur Moitra, Elchanan Mossel, Govind Ramnarayan:
How Many Subpopulations Is Too Many? Exponential Lower Bounds for Inferring Population Histories. J. Comput. Biol. 27(4): 613-625 (2020) - [c51]Sitan Chen, Frederic Koehler, Ankur Moitra, Morris Yau:
Classification Under Misspecification: Halfspaces, Generalized Linear Models, and Evolvability. NeurIPS 2020 - [c50]Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Ankur Moitra:
Learning Some Popular Gaussian Graphical Models without Condition Number Bounds. NeurIPS 2020 - [i48]Sitan Chen, Frederic Koehler, Ankur Moitra, Morris Yau:
Classification Under Misspecification: Halfspaces, Generalized Linear Models, and Connections to Evolvability. CoRR abs/2006.04787 (2020) - [i47]Sitan Chen, Frederic Koehler, Ankur Moitra, Morris Yau:
Online and Distribution-Free Robustness: Regression and Contextual Bandits with Huber Contamination. CoRR abs/2010.04157 (2020) - 2019
- [c46]Younhun Kim, Frederic Koehler, Ankur Moitra, Elchanan Mossel, Govind Ramnarayan:
How Many Subpopulations Is Too Many? Exponential Lower Bounds for Inferring Population Histories. RECOMB 2019: 136-157 - [c44]Guy Bresler, Frederic Koehler, Ankur Moitra:
Learning restricted Boltzmann machines via influence maximization. STOC 2019: 828-839 - [i44]Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Ankur Moitra:
Learning Some Popular Gaussian Graphical Models without Condition Number Bounds. CoRR abs/1905.01282 (2019) - 2018
- [i40]Guy Bresler, Frederic Koehler, Ankur Moitra, Elchanan Mossel:
Learning Restricted Boltzmann Machines via Influence Maximization. CoRR abs/1805.10262 (2018) - 2017
- [c35]Linus Hamilton, Frederic Koehler, Ankur Moitra:
Information Theoretic Properties of Markov Random Fields, and their Algorithmic Applications. NIPS 2017: 2463-2472 - [i32]Linus Hamilton, Frederic Koehler, Ankur Moitra:
Information Theoretic Properties of Markov Random Fields, and their Algorithmic Applications. CoRR abs/1705.11107 (2017) - 2016
- [c30]Sanjeev Arora, Rong Ge, Frederic Koehler, Tengyu Ma, Ankur Moitra:
Provable Algorithms for Inference in Topic Models. ICML 2016: 2859-2867 - [i29]Sanjeev Arora, Rong Ge, Frederic Koehler, Tengyu Ma, Ankur Moitra:
Provable Algorithms for Inference in Topic Models. CoRR abs/1605.08491 (2016)
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-04-12 18:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint