← Search

Dionysios Kalogerias

4 accepted papers

2024

Repeated Random Sampling for Minimizing the Time-to-Accuracy of Learning

ICLR 2024poster

Methods for carefully selecting or generating a small set of training data to learn from, i.e., data pruning, coreset selection, and dataset distillation, have been shown to be effective in reducing the ever-increasing cost of training neural networks. Behind this success are rigorously designed, ye…

2023

Beyond Lipschitz: Sharp Generalization and Excess Risk Bounds for Full-Batch GD

ICLR 2023poster

We provide sharp path-dependent generalization and excess risk guarantees for the full-batch Gradient Descent (GD) algorithm on smooth losses (possibly non-Lipschitz, possibly nonconvex). At the heart of our analysis is an upper bound on the generalization error, which implies that average output st…

Cited by 19SourcePDFScholar
2022

Black-Box Generalization: Stability of Zeroth-Order Learning

NeurIPS 2022accept

We provide the first generalization error analysis for black-box learning through derivative-free optimization. Under the assumption of a Lipschitz and smooth unknown loss, we consider the Zeroth-order Stochastic Search (ZoSS) algorithm, that updates a $d$-dimensional model by replacing stochastic g…

Cited by 18SourcePDFScholar