Konstantinos E. Nikolakakis

CoRR, 2023

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

[BibT_eX]

[DOI]

Patrik Okanovic

Roger Waleffe

Vasilis Mageirakos

Nezihe Merve Gürel

Theodoros Rekatsinas

CoRR, 2023

Select without Fear: Almost All Mini-Batch Schedules Generalize Optimally.

[BibT_eX]

[DOI]

Dionysis Kalogerias

CoRR, 2023

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

[BibT_eX]

[DOI]

Farzin Haddadpour

Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022

Black-Box Generalization.

[BibT_eX]

[DOI]

Farzin Haddadpour

CoRR, 2022

Black-Box Generalization: Stability of Zeroth-Order Learning.

[BibT_eX]

[DOI]

Farzin Haddadpour

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

Quantile Multi-Armed Bandits: Optimal Best-Arm Identification and a Differentially Private Scheme.

[BibT_eX]

[DOI]

Or Sheffet

IEEE J. Sel. Areas Inf. Theory, 2021

Predictive Learning on Hidden Tree-Structured Ising Models.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2021

2020

Best-Arm Identification for Quantile Bandits with Privacy.

[BibT_eX]

[DOI]

Or Sheffet

CoRR, 2020

2019

Non-Parametric Structure Learning on Hidden Tree-Shaped Distributions.

[BibT_eX]

[DOI]

CoRR, 2019

Learning Tree Structures from Noisy Data.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018

Predictive Learning on Sign-Valued Hidden Markov Trees.

[BibT_eX]

[DOI]