activity
20082026
most citedSever: A Robust Meta-Algorithm for Stochastic Optimization

142 citations · 958 across the 125 of their papers we have counts for

collaborators

140 papers

cs.LG2026

Statistical Query Lower Bounds for Smoothed Agnostic Learning

Ilias Diakonikolas, Daniel M. Kane

We study the complexity of smoothed agnostic learning, recently introduced by~\cite{CKKMS24}, in which the learner competes with the best classifier in a target class under slight…

quant-ph2025

Agnostic Product Mixed State Tomography via Robust Statistics

Alvan Arulandu, Ilias Diakonikolas, Daniel Kane +1

We study the complexity of two closely related learning problems, one quantum and one classical. In the quantum setting, we consider agnostic tomography for the natural class of pr…

cs.LG2025

Batch List-Decodable Linear Regression via Higher Moments

Ilias Diakonikolas, Daniel M. Kane, Sushrut Karmalkar +2

We study the task of list-decodable linear regression using batches. A batch is called clean if it consists of i.i.d. samples from an unknown linear regression distribution. For a…

cs.DS2025

Efficient Multivariate Robust Mean Estimation Under Mean-Shift Contamination

Ilias Diakonikolas, Giannis Iakovidis, Daniel M. Kane +1

We study the algorithmic problem of robust mean estimation of an identity covariance Gaussian in the presence of mean-shift contamination. In this contamination model, we are given…

cs.DS2025

Entangled Mean Estimation in High-Dimensions

Ilias Diakonikolas, Daniel M. Kane, Sihan Liu +1

We study the task of high-dimensional entangled mean estimation in the subset-of-signals model. Specifically, given independent random points in …

cs.DS2024

Implicit High-Order Moment Tensor Estimation and Learning Latent Variable Models

Ilias Diakonikolas, Daniel M. Kane

We study the task of learning latent-variable models. A common algorithmic technique for this task is the method of moments. Unfortunately, moment-based approaches are hampered by…