Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > ILIAS DIAKONIKOLAS:
All reports by Author Ilias Diakonikolas:

TR26-276 | 23rd October 2026
Ilias Diakonikolas, Jelena Diakonikolas, Puqian Wang, Nikos Zarifis

Learning Positive Linear Combinations of ReLUs in Fully Polynomial Time

We study the fundamental problem of PAC learning positive linear combinations of $k$
arbitrary ReLU activations on $\mathbb{R}^d$ with respect to the Gaussian distribution, in $L_2$
loss. We give the first fully-polynomial time algorithm for this learning task.
Specifically, our algorithm draws $\mathrm{poly}(d, k, 1/\epsilon)$ samples,
more >>>


TR22-178 | 8th December 2022
Ilias Diakonikolas, Christos Tzamos, Daniel Kane

A Strongly Polynomial Algorithm for Approximate Forster Transforms and its Application to Halfspace Learning

The Forster transform is a method of regularizing a dataset
by placing it in {\em radial isotropic position}
while maintaining some of its essential properties.
Forster transforms have played a key role in a diverse range of settings
spanning computer science and functional analysis. Prior work had given
{\em ... more >>>


TR20-140 | 14th September 2020
Ilias Diakonikolas, Themis Gouleakis, Daniel Kane, John Peebles, Eric Price

Optimal Testing of Discrete Distributions with High Probability

We study the problem of testing discrete distributions with a focus on the high probability regime.
Specifically, given samples from one or more discrete distributions, a property $\mathcal{P}$, and
parameters $0< \epsilon, \delta <1$, we want to distinguish {\em with probability at least $1-\delta$}
whether these distributions satisfy $\mathcal{P}$ ... more >>>




ISSN 1433-8092 | Imprint