default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnkit Pensia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Ankit Pensia
, Varun S. Jog, Po-Ling Loh:
Communication-Constrained Hypothesis Testing: Optimality, Robustness, and Reverse Data Processing Inequalities. IEEE Trans. Inf. Theory 70(1): 389-414 (2024)- [c22]Pranjal Awasthi, Satyen Kale, Ankit Pensia:
Semi-supervised Group DRO: Combating Sparsity with Unlabeled Data. ALT 2024: 125-160 - [c21]Arun Jambulapati, Syamantak Kumar, Jerry Li, Shourya Pandey, Ankit Pensia, Kevin Tian:
Black-Box k-to-1-PCA Reductions: Theory and Applications. COLT 2024: 2564-2607 - [c20]Ankit Pensia, Varun S. Jog, Po-Ling Loh:
The Sample Complexity of Simple Binary Hypothesis Testing. COLT 2024: 4205-4206 - [c19]Ilias Diakonikolas, Daniel Kane, Sushrut Karmalkar, Ankit Pensia, Thanasis Pittas:
Robust Sparse Estimation for Gaussians with Optimal Error under Huber Contamination. ICML 2024 - [c18]Ankit Pensia:
A Subquadratic Time Algorithm for Robust Sparse Mean Estimation. ICML 2024 - [i22]Arun Jambulapati, Syamantak Kumar, Jerry Li, Shourya Pandey, Ankit Pensia, Kevin Tian:
Black-Box k-to-1-PCA Reductions: Theory and Applications. CoRR abs/2403.03905 (2024) - [i21]Ankit Pensia:
A Sub-Quadratic Time Algorithm for Robust Sparse Mean Estimation. CoRR abs/2403.04726 (2024) - [i20]Ilias Diakonikolas, Daniel M. Kane, Sushrut Karmalkar, Ankit Pensia, Thanasis Pittas:
Robust Sparse Estimation for Gaussians with Optimal Error under Huber Contamination. CoRR abs/2403.10416 (2024) - [i19]Ankit Pensia, Varun S. Jog, Po-Ling Loh:
The Sample Complexity of Simple Binary Hypothesis Testing. CoRR abs/2403.16981 (2024) - 2023
- [c17]Ankit Pensia, Amir-Reza Asadi, Varun S. Jog, Po-Ling Loh:
Simple Binary Hypothesis Testing under Local Differential Privacy and Communication Constraints. COLT 2023: 3229-3230 - [c16]Ilias Diakonikolas, Daniel Kane, Ankit Pensia, Thanasis Pittas:
Nearly-Linear Time and Streaming Algorithms for Outlier-Robust PCA. ICML 2023: 7886-7921 - [c15]Ilias Diakonikolas, Daniel Kane, Jasper C. H. Lee, Ankit Pensia, Thanasis Pittas:
A Spectral Algorithm for List-Decodable Covariance Estimation in Relative Frobenius Norm. NeurIPS 2023 - [c14]Ilias Diakonikolas, Daniel Kane, Ankit Pensia, Thanasis Pittas:
Near-Optimal Algorithms for Gaussians with Huber Contamination: Mean Estimation and Linear Regression. NeurIPS 2023 - [c13]Ilias Diakonikolas, Daniel M. Kane, Ankit Pensia:
Gaussian Mean Testing Made Simple. SOSA 2023: 348-352 - [i18]Ankit Pensia, Amir-Reza Asadi, Varun S. Jog, Po-Ling Loh:
Simple Binary Hypothesis Testing under Local Differential Privacy and Communication Constraints. CoRR abs/2301.03566 (2023) - [i17]Ilias Diakonikolas, Daniel M. Kane, Jasper C. H. Lee, Ankit Pensia, Thanasis Pittas:
A Spectral Algorithm for List-Decodable Covariance Estimation in Relative Frobenius Norm. CoRR abs/2305.00966 (2023) - [i16]Ilias Diakonikolas, Daniel M. Kane, Ankit Pensia, Thanasis Pittas:
Nearly-Linear Time and Streaming Algorithms for Outlier-Robust PCA. CoRR abs/2305.02544 (2023) - [i15]Ilias Diakonikolas, Daniel M. Kane, Ankit Pensia, Thanasis Pittas:
Near-Optimal Algorithms for Gaussians with Huber Contamination: Mean Estimation and Linear Regression. CoRR abs/2312.01547 (2023) - 2022
- [c12]Ilias Diakonikolas, Daniel M. Kane, Sushrut Karmalkar, Ankit Pensia, Thanasis Pittas:
Robust Sparse Mean Estimation via Sum of Squares. COLT 2022: 4703-4763 - [c11]Ilias Diakonikolas, Daniel M. Kane, Ankit Pensia, Thanasis Pittas:
Streaming Algorithms for High-Dimensional Robust Statistics. ICML 2022: 5061-5117 - [c10]Ankit Pensia, Po-Ling Loh, Varun S. Jog:
Simple Binary Hypothesis Testing under Communication Constraints. ISIT 2022: 3297-3302 - [c9]Ilias Diakonikolas, Daniel Kane, Sushrut Karmalkar, Ankit Pensia, Thanasis Pittas:
List-Decodable Sparse Mean Estimation via Difference-of-Pairs Filtering. NeurIPS 2022 - [c8]Ilias Diakonikolas, Daniel Kane, Jasper C. H. Lee, Ankit Pensia:
Outlier-Robust Sparse Mean Estimation for Heavy-Tailed Distributions. NeurIPS 2022 - [i14]Ilias Diakonikolas, Daniel M. Kane, Ankit Pensia, Thanasis Pittas:
Streaming Algorithms for High-Dimensional Robust Statistics. CoRR abs/2204.12399 (2022) - [i13]Ankit Pensia, Varun S. Jog, Po-Ling Loh:
Communication-constrained hypothesis testing: Optimality, robustness, and reverse data processing inequalities. CoRR abs/2206.02765 (2022) - [i12]Ilias Diakonikolas, Daniel M. Kane, Sushrut Karmalkar, Ankit Pensia, Thanasis Pittas:
Robust Sparse Mean Estimation via Sum of Squares. CoRR abs/2206.03441 (2022) - [i11]Ilias Diakonikolas, Daniel M. Kane, Sushrut Karmalkar, Ankit Pensia, Thanasis Pittas:
List-Decodable Sparse Mean Estimation via Difference-of-Pairs Filtering. CoRR abs/2206.05245 (2022) - [i10]Ilias Diakonikolas, Daniel M. Kane, Ankit Pensia:
Gaussian Mean Testing Made Simple. CoRR abs/2210.13706 (2022) - [i9]Ilias Diakonikolas, Daniel M. Kane, Jasper C. H. Lee, Ankit Pensia:
Outlier-Robust Sparse Mean Estimation for Heavy-Tailed Distributions. CoRR abs/2211.16333 (2022) - 2021
- [c7]Ilias Diakonikolas, Daniel Kane, Ankit Pensia, Thanasis Pittas, Alistair Stewart:
Statistical Query Lower Bounds for List-Decodable Linear Regression. NeurIPS 2021: 3191-3204 - [i8]Ilias Diakonikolas, Daniel M. Kane, Ankit Pensia, Thanasis Pittas, Alistair Stewart:
Statistical Query Lower Bounds for List-Decodable Linear Regression. CoRR abs/2106.09689 (2021) - [i7]Alankrita Bhatt, Ankit Pensia:
Sharp Concentration Inequalities for the Centered Relative Entropy. CoRR abs/2109.09028 (2021) - 2020
- [j1]Ankit Pensia, Varun S. Jog, Po-Ling Loh:
Extracting Robust and Accurate Features via a Robust Information Bottleneck. IEEE J. Sel. Areas Inf. Theory 1(1): 131-144 (2020) - [c6]Ilias Diakonikolas, Daniel M. Kane, Ankit Pensia:
Outlier Robust Mean Estimation with Subgaussian Rates via Stability. NeurIPS 2020 - [c5]Ankit Pensia, Shashank Rajput, Alliot Nagle, Harit Vishwakarma, Dimitris S. Papailiopoulos:
Optimal Lottery Tickets via Subset Sum: Logarithmic Over-Parameterization is Sufficient. NeurIPS 2020 - [i6]Ankit Pensia, Shashank Rajput, Alliot Nagle, Harit Vishwakarma, Dimitris S. Papailiopoulos:
Optimal Lottery Tickets via SubsetSum: Logarithmic Over-Parameterization is Sufficient. CoRR abs/2006.07990 (2020) - [i5]Ilias Diakonikolas, Daniel M. Kane, Ankit Pensia:
Outlier Robust Mean Estimation with Subgaussian Rates via Stability. CoRR abs/2007.15618 (2020) - [i4]Ankit Pensia, Varun S. Jog, Po-Ling Loh:
Robust regression with covariate filtering: Heavy tails and adversarial contamination. CoRR abs/2009.12976 (2020)
2010 – 2019
- 2019
- [c4]Rajat Panda, Ankit Pensia, Nikhil Mehta, Mingyuan Zhou, Piyush Rai:
Deep Topic Models for Multi-label Learning. AISTATS 2019: 2849-2857 - [c3]Ankit Pensia, Varun S. Jog, Po-Ling Loh:
Mean estimation for entangled single-sample distributions. ISIT 2019: 3052-3056 - [i3]Ankit Pensia, Varun S. Jog, Po-Ling Loh:
Estimating location parameters in entangled single-sample distributions. CoRR abs/1907.03087 (2019) - [i2]Ankit Pensia, Varun S. Jog, Po-Ling Loh:
Extracting robust and accurate features via a robust information bottleneck. CoRR abs/1910.06893 (2019) - 2018
- [c2]Ankit Pensia, Varun S. Jog, Po-Ling Loh:
Generalization Error Bounds for Noisy, Iterative Algorithms. ISIT 2018: 546-550 - [i1]Ankit Pensia, Varun S. Jog, Po-Ling Loh:
Generalization Error Bounds for Noisy, Iterative Algorithms. CoRR abs/1801.04295 (2018) - 2017
- [c1]Ankit Pensia, Gaurav Sharma, Gaurav Pandey, James R. McBride:
Fast Localization of Autonomous Vehicles Using Discriminative Metric Learning. CRV 2017: 176-182
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-09-04 00:29 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:
