Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIlias Diakonikolas
Person information
- affiliation (2019-present): University of Wisconsin, Madison, WI, USA
- affiliation (2016-2019): University Southern California, CA, USA
- affiliation (2012-2015): University of Edinburgh, UK
- affiliation (2010-2012): University of California, Berkeley, CA, USA
- affiliation (2004-2010): Columbia University, New York City, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c129]Ilias Diakonikolas, Jelena Diakonikolas, Daniel M. Kane, Puqian Wang, Nikos Zarifis:
Information-Computation Tradeoffs for Learning Margin Halfspaces with Random Classification Noise. COLT 2023: 2211-2239- [c128]Ilias Diakonikolas, Daniel M. Kane, Thanasis Pittas, Nikos Zarifis:
SQ Lower Bounds for Learning Mixtures of Separated and Bounded Covariance Gaussians. COLT 2023: 2319-2349 - [c127]Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Self-Directed Linear Classification. COLT 2023: 2919-2947 - [c126]Daniel Kane, Ilias Diakonikolas:
A Nearly Tight Bound for Fitting an Ellipsoid to Gaussian Random Points. COLT 2023: 3014-3028 - [c125]Ilias Diakonikolas, Daniel M. Kane, Yuetian Luo, Anru Zhang:
Statistical and Computational Limits for Tensor-on-Tensor Association Detection. COLT 2023: 5260-5310 - [c124]Ilias Diakonikolas, Sushrut Karmalkar, Jong Ho Park, Christos Tzamos:
Distribution-Independent Regression for Generalized Linear Models with Oblivious Corruptions. COLT 2023: 5453-5475 - [c123]Ilias Diakonikolas, Daniel Kane, Ankit Pensia, Thanasis Pittas:
Nearly-Linear Time and Streaming Algorithms for Outlier-Robust PCA. ICML 2023: 7886-7921 - [c122]Ilias Diakonikolas, Daniel Kane, Lisheng Ren:
Near-Optimal Cryptographic Hardness of Agnostically Learning Halfspaces and ReLU Regression under Gaussian Marginals. ICML 2023: 7922-7938 - [c121]Puqian Wang, Nikos Zarifis, Ilias Diakonikolas, Jelena Diakonikolas:
Robustly Learning a Single Neuron via Sharpness. ICML 2023: 36541-36577 - [c120]Ilias Diakonikolas, Daniel M. Kane, Ankit Pensia:
Gaussian Mean Testing Made Simple. SOSA 2023: 348-352 - [c119]Ilias Diakonikolas, Christos Tzamos, Daniel M. Kane:
A Strongly Polynomial Algorithm for Approximate Forster Transforms and Its Application to Halfspace Learning. STOC 2023: 1741-1754 - [i143]Ilias Diakonikolas, Daniel M. Kane, Lisheng Ren:
Near-Optimal Cryptographic Hardness of Agnostically Learning Halfspaces and ReLU Regression under Gaussian Marginals. CoRR abs/2302.06512 (2023) - [i142]Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Sihan Liu, Nikos Zarifis:
Efficient Testable Learning of Halfspaces with Adversarial Label Noise. CoRR abs/2303.05485 (2023) - [i141]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) - [i140]Ilias Diakonikolas, Daniel M. Kane, Ankit Pensia, Thanasis Pittas:
Nearly-Linear Time and Streaming Algorithms for Outlier-Robust PCA. CoRR abs/2305.02544 (2023) - [i139]Puqian Wang, Nikos Zarifis, Ilias Diakonikolas, Jelena Diakonikolas:
Robustly Learning a Single Neuron via Sharpness. CoRR abs/2306.07892 (2023) - [i138]Ilias Diakonikolas, Daniel M. Kane, Thanasis Pittas, Nikos Zarifis:
SQ Lower Bounds for Learning Bounded Covariance GMMs. CoRR abs/2306.13057 (2023) - [i137]Ilias Diakonikolas, Jelena Diakonikolas, Daniel M. Kane, Puqian Wang, Nikos Zarifis:
Information-Computation Tradeoffs for Learning Margin Halfspaces with Random Classification Noise. CoRR abs/2306.16352 (2023) - [i136]Ilias Diakonikolas, Jelena Diakonikolas, Daniel M. Kane, Puqian Wang, Nikos Zarifis:
Near-Optimal Bounds for Learning Gaussian Halfspaces with Random Classification Noise. CoRR abs/2307.08438 (2023) - [i135]Ilias Diakonikolas, Daniel M. Kane:
Efficiently Learning One-Hidden-Layer ReLU Networks via Schur Polynomials. CoRR abs/2307.12840 (2023) - [i134]Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Self-Directed Linear Classification. CoRR abs/2308.03142 (2023) - 2022
- [j21]Xi Chen, Ilias Diakonikolas, Anthi Orfanou, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis:
On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer. SIAM J. Comput. 51(3): 492-548 (2022) - [c118]Ilias Diakonikolas, Daniel Kane, Pasin Manurangsi, Lisheng Ren:
Hardness of Learning a Single Neuron with Adversarial Label Noise. AISTATS 2022: 8199-8213 - [c117]Ilias Diakonikolas, Chrystalla Pavlou, John Peebles, Alistair Stewart:
Efficient Approximation Algorithms for the Inverse Semivalue Problem. AAMAS 2022: 354-362 - [c116]Ilias Diakonikolas, Daniel M. Kane, Yuxin Sun:
Optimal SQ Lower Bounds for Robustly Learning Discrete Product Distributions and Ising Models. COLT 2022: 3936-3978 - [c115]Ilias Diakonikolas, Daniel Kane:
Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise. COLT 2022: 4258-4282 - [c114]Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Learning a Single Neuron with Adversarial Label Noise via Gradient Descent. COLT 2022: 4313-4361 - [c113]Ilias Diakonikolas, Daniel Kane:
Non-Gaussian Component Analysis via Lattice Basis Reduction. COLT 2022: 4535-4547 - [c112]Ilias Diakonikolas, Daniel M. Kane, Sushrut Karmalkar, Ankit Pensia, Thanasis Pittas:
Robust Sparse Mean Estimation via Sum of Squares. COLT 2022: 4703-4763 - [c111]Ilias Diakonikolas, Daniel M. Kane, Ankit Pensia, Thanasis Pittas:
Streaming Algorithms for High-Dimensional Robust Statistics. ICML 2022: 5061-5117 - [c110]Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Learning General Halfspaces with Adversarial Label Noise via Online Gradient Descent. ICML 2022: 5118-5141 - [c109]Yu Cheng, Ilias Diakonikolas, Rong Ge, Shivam Gupta, Daniel Kane, Mahdi Soltanolkotabi:
Outlier-Robust Sparse Estimation via Non-Convex Optimization. NeurIPS 2022 - [c108]Clément L. Canonne, Ilias Diakonikolas, Daniel Kane, Sihan Liu:
Nearly-Tight Bounds for Testing Histogram Distributions. NeurIPS 2022 - [c107]Ilias Diakonikolas, Daniel Kane, Sushrut Karmalkar, Ankit Pensia, Thanasis Pittas:
List-Decodable Sparse Mean Estimation via Difference-of-Pairs Filtering. NeurIPS 2022 - [c106]Ilias Diakonikolas, Daniel Kane, Jasper C. H. Lee, Ankit Pensia:
Outlier-Robust Sparse Mean Estimation for Heavy-Tailed Distributions. NeurIPS 2022 - [c105]Ilias Diakonikolas, Daniel Kane, Pasin Manurangsi, Lisheng Ren:
Cryptographic Hardness of Learning Halfspaces with Massart Noise. NeurIPS 2022 - [c104]Ilias Diakonikolas, Daniel Kane, Lisheng Ren, Yuxin Sun:
SQ Lower Bounds for Learning Single Neurons with Massart Noise. NeurIPS 2022 - [c103]Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Learning general halfspaces with general Massart noise under the Gaussian distribution. STOC 2022: 874-885 - [c102]Ainesh Bakshi, Ilias Diakonikolas, He Jia, Daniel M. Kane, Pravesh K. Kothari, Santosh S. Vempala:
Robustly learning mixtures of k arbitrary Gaussians. STOC 2022: 1234-1247 - [c101]Ilias Diakonikolas, Daniel M. Kane, Daniel Kongsgaard, Jerry Li, Kevin Tian:
Clustering mixture models in almost-linear time via list-decodable mean estimation. STOC 2022: 1262-1275 - [i133]Ilias Diakonikolas, Daniel M. Kane, Ankit Pensia, Thanasis Pittas:
Streaming Algorithms for High-Dimensional Robust Statistics. CoRR abs/2204.12399 (2022) - [i132]Ilias Diakonikolas, Daniel M. Kane, Sushrut Karmalkar, Ankit Pensia, Thanasis Pittas:
Robust Sparse Mean Estimation via Sum of Squares. CoRR abs/2206.03441 (2022) - [i131]Ilias Diakonikolas, Daniel M. Kane, Yuxin Sun:
Optimal SQ Lower Bounds for Robustly Learning Discrete Product Distributions and Ising Models. CoRR abs/2206.04589 (2022) - [i130]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) - [i129]Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Learning a Single Neuron with Adversarial Label Noise via Gradient Descent. CoRR abs/2206.08918 (2022) - [i128]Clément L. Canonne, Ilias Diakonikolas, Daniel M. Kane, Sihan Liu:
Near-Optimal Bounds for Testing Histogram Distributions. CoRR abs/2207.06596 (2022) - [i127]Ilias Diakonikolas, Daniel M. Kane, Pasin Manurangsi, Lisheng Ren:
Cryptographic Hardness of Learning Halfspaces with Massart Noise. CoRR abs/2207.14266 (2022) - [i126]Ilias Diakonikolas, Daniel M. Kane, Lisheng Ren, Yuxin Sun:
SQ Lower Bounds for Learning Single Neurons with Massart Noise. CoRR abs/2210.09949 (2022) - [i125]Ilias Diakonikolas, Daniel M. Kane, Ankit Pensia:
Gaussian Mean Testing Made Simple. CoRR abs/2210.13706 (2022) - [i124]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) - [i123]Ilias Diakonikolas, Christos Tzamos, Daniel M. Kane:
A Strongly Polynomial Algorithm for Approximate Forster Transforms and its Application to Halfspace Learning. CoRR abs/2212.03008 (2022) - [i122]Daniel M. Kane, Ilias Diakonikolas:
A Nearly Tight Bound for Fitting an Ellipsoid to Gaussian Random Points. CoRR abs/2212.11221 (2022) - [i121]Ilias Diakonikolas, Christos Tzamos, Daniel Kane:
A Strongly Polynomial Algorithm for Approximate Forster Transforms and its Application to Halfspace Learning. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j20]Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Ankur Moitra, Alistair Stewart:
Robustness meets algorithms. Commun. ACM 64(5): 107-115 (2021) - [c100]Ilias Diakonikolas, Daniel M. Kane:
The Sample Complexity of Robust Covariance Testing. COLT 2021: 1511-1521 - [c99]Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Agnostic Proper Learning of Halfspaces under Gaussian Marginals. COLT 2021: 1522-1551 - [c98]Ilias Diakonikolas, Daniel M. Kane, Thanasis Pittas, Nikos Zarifis:
The Optimality of Polynomial Regression for Agnostic Learning under Gaussian Marginals in the SQ Model. COLT 2021: 1552-1584 - [c97]Ilias Diakonikolas, Russell Impagliazzo, Daniel M. Kane, Rex Lei, Jessica Sorrell, Christos Tzamos:
Boosting in the Presence of Massart Noise. COLT 2021: 1585-1644 - [c96]Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart, Yuxin Sun:
Outlier-Robust Learning of Ising Models Under Dobrushin's Condition. COLT 2021: 1645-1682 - [c95]Stephen Macke, Maryam Aliakbarpour, Ilias Diakonikolas, Aditya G. Parameswaran
, Ronitt Rubinfeld:
Rapid Approximate Aggregation with Distribution-Sensitive Interval Guarantees. ICDE 2021: 1703-1714 - [c94]Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Ali Vakilian, Nikos Zarifis:
Learning Online Algorithms with Distributional Advice. ICML 2021: 2687-2696 - [c93]Ilias Diakonikolas, Daniel Kane, Ankit Pensia, Thanasis Pittas, Alistair Stewart:
Statistical Query Lower Bounds for List-Decodable Linear Regression. NeurIPS 2021: 3191-3204 - [c92]Ilias Diakonikolas, Daniel Kane, Christos Tzamos:
Forster Decomposition and Learning Halfspaces with Noise. NeurIPS 2021: 7732-7744 - [c91]Ilias Diakonikolas, Daniel Kane, Daniel Kongsgaard, Jerry Li, Kevin Tian:
List-Decodable Mean Estimation in Nearly-PCA Time. NeurIPS 2021: 10195-10208 - [c90]Ilias Diakonikolas, Jong Ho Park, Christos Tzamos:
ReLU Regression with Massart Noise. NeurIPS 2021: 25891-25903 - [c89]Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Efficiently learning halfspaces with Tsybakov noise. STOC 2021: 88-101 - [c88]Ilias Diakonikolas, Themis Gouleakis, Daniel M. Kane, John Peebles, Eric Price:
Optimal testing of discrete distributions with high probability. STOC 2021: 542-555 - [i120]Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart, Yuxin Sun:
Outlier-Robust Learning of Ising Models Under Dobrushin's Condition. CoRR abs/2102.02171 (2021) - [i119]Ilias Diakonikolas, Daniel M. Kane, Thanasis Pittas, Nikos Zarifis:
The Optimality of Polynomial Regression for Agnostic Learning under Gaussian Marginals. CoRR abs/2102.04401 (2021) - [i118]Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Agnostic Proper Learning of Halfspaces under Gaussian Marginals. CoRR abs/2102.05629 (2021) - [i117]Ilias Diakonikolas, Russell Impagliazzo, Daniel Kane, Rex Lei, Jessica Sorrell, Christos Tzamos:
Boosting in the Presence of Massart Noise. CoRR abs/2106.07779 (2021) - [i116]Ilias Diakonikolas, Daniel M. Kane, Daniel Kongsgaard, Jerry Li, Kevin Tian:
Clustering Mixture Models in Almost-Linear Time via List-Decodable Mean Estimation. CoRR abs/2106.08537 (2021) - [i115]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) - [i114]Ilias Diakonikolas, Daniel M. Kane, Christos Tzamos:
Forster Decomposition and Learning Halfspaces with Noise. CoRR abs/2107.05582 (2021) - [i113]Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Threshold Phenomena in Learning Halfspaces with Massart Noise. CoRR abs/2108.08767 (2021) - [i112]Ilias Diakonikolas, Jongho Park, Christos Tzamos:
ReLU Regression with Massart Noise. CoRR abs/2109.04623 (2021) - [i111]Yu Cheng, Ilias Diakonikolas, Daniel M. Kane, Rong Ge, Shivam Gupta, Mahdi Soltanolkotabi:
Outlier-Robust Sparse Estimation via Non-Convex Optimization. CoRR abs/2109.11515 (2021) - [i110]Ilias Diakonikolas, Daniel M. Kane:
Non-Gaussian Component Analysis via Lattice Basis Reduction. CoRR abs/2112.09104 (2021) - 2020
- [j19]David S. Johnson, Lee Breslau, Ilias Diakonikolas, Nick Duffield, Yu Gu, MohammadTaghi Hajiaghayi, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen:
Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs. Oper. Res. 68(3): 896-926 (2020) - [j18]Clément L. Canonne, Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
Testing Bayesian Networks. IEEE Trans. Inf. Theory 66(5): 3132-3170 (2020) - [c87]Ilias Diakonikolas, Surbhi Goel, Sushrut Karmalkar, Adam R. Klivans, Mahdi Soltanolkotabi:
Approximation Schemes for ReLU Regression. COLT 2020: 1452-1485 - [c86]Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Learning Halfspaces with Massart Noise Under Structured Distributions. COLT 2020: 1486-1513 - [c85]Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Nikos Zarifis:
Algorithms and SQ Lower Bounds for PAC Learning One-Hidden-Layer ReLU Networks. COLT 2020: 1514-1539 - [c84]Ainesh Bakshi, Ilias Diakonikolas, Samuel B. Hopkins, Daniel Kane, Sushrut Karmalkar, Pravesh K. Kothari:
Outlier-Robust Clustering of Gaussians and Other Non-Spherical Mixtures. FOCS 2020: 149-159 - [c83]Ilias Diakonikolas, Daniel M. Kane:
Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models. FOCS 2020: 184-195 - [c82]Yu Cheng, Ilias Diakonikolas, Rong Ge, Mahdi Soltanolkotabi:
High-dimensional Robust Mean Estimation via Gradient Descent. ICML 2020: 1768-1778 - [c81]Omar Montasser, Surbhi Goel, Ilias Diakonikolas, Nathan Srebro:
Efficiently Learning Adversarially Robust Halfspaces with Noise. ICML 2020: 7010-7021 - [c80]Ilias Diakonikolas, Daniel Kane, Daniel Kongsgaard:
List-Decodable Mean Estimation via Iterative Multi-Filtering. NeurIPS 2020 - [c79]Ilias Diakonikolas, Daniel M. Kane, Pasin Manurangsi:
The Complexity of Adversarially Robust Proper Learning of Halfspaces with Agnostic Noise. NeurIPS 2020 - [c78]Ilias Diakonikolas, Daniel M. Kane, Ankit Pensia:
Outlier Robust Mean Estimation with Subgaussian Rates via Stability. NeurIPS 2020 - [c77]Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Non-Convex SGD Learns Halfspaces with Adversarial Label Noise. NeurIPS 2020 - [c76]Ilias Diakonikolas, Daniel Kane, Nikos Zarifis:
Near-Optimal SQ Lower Bounds for Agnostically Learning Halfspaces and ReLUs under Gaussian Marginals. NeurIPS 2020 - [p2]Ilias Diakonikolas, Daniel M. Kane:
Robust High-Dimensional Statistics. Beyond the Worst-Case Analysis of Algorithms 2020: 382-402 - [i109]Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Learning Halfspaces with Massart Noise Under Structured Distributions. CoRR abs/2002.05632 (2020) - [i108]Ilias Diakonikolas, Jerry Li, Anastasia Voloshinov:
Efficient Algorithms for Multidimensional Segmented Regression. CoRR abs/2003.11086 (2020) - [i107]Yu Cheng, Ilias Diakonikolas, Rong Ge, Mahdi Soltanolkotabi:
High-Dimensional Robust Mean Estimation via Gradient Descent. CoRR abs/2005.01378 (2020) - [i106]Ilias Diakonikolas, Samuel B. Hopkins, Daniel Kane, Sushrut Karmalkar:
Robustly Learning any Clusterable Mixture of Gaussians. CoRR abs/2005.06417 (2020) - [i105]Omar Montasser, Surbhi Goel, Ilias Diakonikolas, Nathan Srebro:
Efficiently Learning Adversarially Robust Halfspaces with Noise. CoRR abs/2005.07652 (2020) - [i104]Ilias Diakonikolas, Surbhi Goel, Sushrut Karmalkar, Adam R. Klivans, Mahdi Soltanolkotabi:
Approximation Schemes for ReLU Regression. CoRR abs/2005.12844 (2020) - [i103]Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Learning Halfspaces with Tsybakov Noise. CoRR abs/2006.06467 (2020) - [i102]Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Non-Convex SGD Learns Halfspaces with Adversarial Label Noise. CoRR abs/2006.06742 (2020) - [i101]Ilias Diakonikolas, Daniel M. Kane, Daniel Kongsgaard:
List-Decodable Mean Estimation via Iterative Multi-Filtering. CoRR abs/2006.10715 (2020) - [i100]Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Nikos Zarifis:
Algorithms and SQ Lower Bounds for PAC Learning One-Hidden-Layer ReLU Networks. CoRR abs/2006.12476 (2020) - [i99]Ilias Diakonikolas, Daniel M. Kane, Nikos Zarifis:
Near-Optimal SQ Lower Bounds for Agnostically Learning Halfspaces and ReLUs under Gaussian Marginals. CoRR abs/2006.16200 (2020) - [i98]Ilias Diakonikolas, Daniel M. Kane, Pasin Manurangsi:
The Complexity of Adversarially Robust Proper Learning of Halfspaces with Agnostic Noise. CoRR abs/2007.15220 (2020) - [i97]Ilias Diakonikolas, Daniel M. Kane, Ankit Pensia:
Outlier Robust Mean Estimation with Subgaussian Rates via Stability. CoRR abs/2007.15618 (2020) - [i96]Stephen Macke, Maryam Aliakbarpour, Ilias Diakonikolas, Aditya G. Parameswaran, Ronitt Rubinfeld:
Rapid Approximate Aggregation with Distribution-Sensitive Interval Guarantees. CoRR abs/2008.03891 (2020) - [i95]Ilias Diakonikolas, Themis Gouleakis, Daniel M. Kane, John Peebles, Eric Price:
Optimal Testing of Discrete Distributions with High Probability. CoRR abs/2009.06540 (2020) - [i94]Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
A Polynomial Time Algorithm for Learning Halfspaces with Tsybakov Noise. CoRR abs/2010.01705 (2020) - [i93]Ilias Diakonikolas, Daniel M. Kane, Daniel Kongsgaard, Jerry Li, Kevin Tian:
List-Decodable Mean Estimation in Nearly-PCA Time. CoRR abs/2011.09973 (2020) - [i92]Ainesh Bakshi, Ilias Diakonikolas, He Jia, Daniel M. Kane, Pravesh K. Kothari, Santosh S. Vempala:
Robustly Learning Mixtures of k Arbitrary Gaussians. CoRR abs/2012.02119 (2020) - [i91]Ilias Diakonikolas, Daniel M. Kane:
Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models. CoRR abs/2012.07774 (2020) - [i90]Ilias Diakonikolas, Daniel M. Kane:
Hardness of Learning Halfspaces with Massart Noise. CoRR abs/2012.09720 (2020) - [i89]Ilias Diakonikolas, Daniel M. Kane:
The Sample Complexity of Robust Covariance Testing. CoRR abs/2012.15802 (2020) - [i88]Ilias Diakonikolas, Themis Gouleakis, Daniel Kane, John Peebles, Eric Price:
Optimal Testing of Discrete Distributions with High Probability. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j17]Ilias Diakonikolas, Themis Gouleakis, John Peebles, Eric Price:
Collision-Based Testers are Optimal for Uniformity and Closeness. Chic. J. Theor. Comput. Sci. 2019 (2019) - [j16]Ilias Diakonikolas, Gautam Kamath, Daniel Kane, Jerry Li, Ankur Moitra, Alistair Stewart:
Robust Estimators in High-Dimensions Without the Computational Intractability. SIAM J. Comput. 48(2): 742-864 (2019) - [c75]Ilias Diakonikolas, Chrystalla Pavlou:
On the Complexity of the Inverse Semivalue Problem for Weighted Voting Games. AAAI 2019: 1869-1876 - [c74]Yu Cheng, Ilias Diakonikolas, Rong Ge, David P. Woodruff:
Faster Algorithms for High-Dimensional Robust Covariance Estimation. COLT 2019: 727-757 - [c73]Ilias Diakonikolas, Themis Gouleakis, Daniel M. Kane, Sankeerth Rao:
Communication and Memory Efficient Testing of Discrete Distributions. COLT 2019: 1070-1106 - [c72]Ilias Diakonikolas, Daniel M. Kane, John Peebles:
Testing Identity of Multidimensional Histograms. COLT 2019: 1107-1131 - [c71]Ilias Diakonikolas, Gautam Kamath, Daniel Kane, Jerry Li, Jacob Steinhardt, Alistair Stewart:
Sever: A Robust Meta-Algorithm for Stochastic Optimization. ICML 2019: 1596-1606 - [c70]Ilias Diakonikolas, Themis Gouleakis, Christos Tzamos:
Distribution-Independent PAC Learning of Halfspaces with Massart Noise. NeurIPS 2019: 4751-4762 - [c69]Kai Zheng, Haipeng Luo, Ilias Diakonikolas, Liwei Wang:
Equipping Experts/Bandits with Long-term Memory. NeurIPS 2019: 5927-5937 - [c68]Brian Axelrod, Ilias Diakonikolas, Alistair Stewart, Anastasios Sidiropoulos, Gregory Valiant:
A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families. NeurIPS 2019: 7721-7733 - [c67]Ilias Diakonikolas, Daniel Kane, Pasin Manurangsi:
Nearly Tight Bounds for Robust Proper Learning of Halfspaces with a Margin. NeurIPS 2019: 10473-10484 - [c66]