Ilias Diakonikolas
Orcid: 0000-0002-5486-1856Affiliations:
- University of Wisconsin, Madison, WI, USA (2019-present)
- University Southern California, CA, USA (2016-2019)
- University of Edinburgh, UK (2012-2015)
- University of California, Berkeley, CA, USA (2010-2012)
- Columbia University, New York City, USA (2004-2010)
According to our database1,
Ilias Diakonikolas
authored at least 185 papers
between 2007 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
CoRR, 2024
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Super Non-singular Decompositions of Polynomials and Their Application to Robustly Learning Low-Degree PTFs.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Proceedings of the Twelfth International Conference on Learning Representations, 2024
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024
2023
CoRR, 2023
CoRR, 2023
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023
Robust Second-Order Nonconvex Optimization and Its Application to Low Rank Matrix Sensing.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Near-Optimal Algorithms for Gaussians with Huber Contamination: Mean Estimation and Linear Regression.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
A Spectral Algorithm for List-Decodable Covariance Estimation in Relative Frobenius Norm.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Near-Optimal Bounds for Learning Gaussian Halfspaces with Random Classification Noise.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Proceedings of the International Conference on Machine Learning, 2023
Near-Optimal Cryptographic Hardness of Agnostically Learning Halfspaces and ReLU Regression under Gaussian Marginals.
Proceedings of the International Conference on Machine Learning, 2023
Proceedings of the International Conference on Machine Learning, 2023
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023
Distribution-Independent Regression for Generalized Linear Models with Oblivious Corruptions.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023
Information-Computation Tradeoffs for Learning Margin Halfspaces with Random Classification Noise.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023
2022
On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer.
SIAM J. Comput., 2022
A Strongly Polynomial Algorithm for Approximate Forster Transforms and its Application to Halfspace Learning.
Electron. Colloquium Comput. Complex., 2022
Learning general halfspaces with general Massart noise under the Gaussian distribution.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
Learning General Halfspaces with Adversarial Label Noise via Online Gradient Descent.
Proceedings of the International Conference on Machine Learning, 2022
Proceedings of the International Conference on Machine Learning, 2022
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022
Optimal SQ Lower Bounds for Robustly Learning Discrete Product Distributions and Ising Models.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022
2021
The Optimality of Polynomial Regression for Agnostic Learning under Gaussian Marginals.
CoRR, 2021
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
Proceedings of the 38th International Conference on Machine Learning, 2021
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021
Proceedings of the Conference on Learning Theory, 2021
The Optimality of Polynomial Regression for Agnostic Learning under Gaussian Marginals in the SQ Model.
Proceedings of the Conference on Learning Theory, 2021
Proceedings of the Conference on Learning Theory, 2021
Proceedings of the Conference on Learning Theory, 2021
Proceedings of the Conference on Learning Theory, 2021
2020
Oper. Res., 2020
Electron. Colloquium Comput. Complex., 2020
Near-Optimal SQ Lower Bounds for Agnostically Learning Halfspaces and ReLUs under Gaussian Marginals.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
The Complexity of Adversarially Robust Proper Learning of Halfspaces with Agnostic Noise.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Proceedings of the 37th International Conference on Machine Learning, 2020
Proceedings of the 37th International Conference on Machine Learning, 2020
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
Proceedings of the Conference on Learning Theory, 2020
Proceedings of the Conference on Learning Theory, 2020
Proceedings of the Conference on Learning Theory, 2020
Proceedings of the Beyond the Worst-Case Analysis of Algorithms, 2020
2019
SIAM J. Comput., 2019
Chic. J. Theor. Comput. Sci., 2019
Degree-푑 chow parameters robustly determine degree-푑 PTFs (and algorithmic applications).
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
Proceedings of the 36th International Conference on Machine Learning, 2019
Proceedings of the Conference on Learning Theory, 2019
Proceedings of the Conference on Learning Theory, 2019
Proceedings of the Conference on Learning Theory, 2019
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019
2018
Games Econ. Behav., 2018
Degree-$d$ Chow Parameters Robustly Determine Degree-$d$ PTFs (and Algorithmic Applications).
Electron. Colloquium Comput. Complex., 2018
A Polynomial Time Algorithm for Maximum Likelihood Estimation of Multivariate Log-concave Densities.
CoRR, 2018
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Proceedings of the 35th International Conference on Machine Learning, 2018
Proceedings of the Conference On Learning Theory, 2018
Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities.
Proceedings of the Conference On Learning Theory, 2018
2017
Electron. Colloquium Comput. Complex., 2017
Electron. Colloquium Comput. Complex., 2017
Electron. Colloquium Comput. Complex., 2017
CoRR, 2017
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017
Proceedings of the 34th International Conference on Machine Learning, 2017
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
Proceedings of the 30th Conference on Learning Theory, 2017
2016
A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry.
SIAM J. Discret. Math., 2016
Statistical Query Lower Bounds for Robust Estimation of High-dimensional Gaussians and Gaussian Mixtures.
Electron. Colloquium Comput. Complex., 2016
Electron. Colloquium Comput. Complex., 2016
The fourier transform of poisson multinomial distributions and its algorithmic applications.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
Proceedings of the 33nd International Conference on Machine Learning, 2016
Proceedings of the 29th Conference on Learning Theory, 2016
Optimal Learning via the Fourier Transform for Sums of Independent Integer Random Variables.
Proceedings of the 29th Conference on Learning Theory, 2016
2015
Nearly Optimal Learning and Sparse Covers for Sums of Independent Integer Random Variables.
CoRR, 2015
Chic. J. Theor. Comput. Sci., 2015
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015
Optimal Algorithms and Lower Bounds for Testing Closeness of Structured Distributions.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015
2014
A Regularity Lemma and Low-Weight Approximators for Low-Degree Polynomial Threshold Functions.
Theory Comput., 2014
SIAM J. Comput., 2014
Proceedings of the Symposium on Theory of Computing, 2014
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014
2013
Electron. Colloquium Comput. Complex., 2013
Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions.
Electron. Colloquium Comput. Complex., 2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013
2012
Electron. Colloquium Comput. Complex., 2012
Nearly optimal solutions for the Chow Parameters Problem and low-weight approximation of halfspaces.
Electron. Colloquium Comput. Complex., 2012
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012
2011
Hardness Results for Agnostically Learning Low-Degree Polynomial Threshold Functions.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
Proceedings of the 48th Design Automation Conference, 2011
Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011
2010
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010
2009
SIAM J. Comput., 2009
Electron. Colloquium Comput. Complex., 2009
2008
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
2007
Proceedings of the Approximation, 2007