7 citations · 16 across the 9 of their papers we have counts for
4 papers · 1 filter
Beyond Lipschitz: Sharp Generalization and Excess Risk Bounds for Full-Batch GD
Konstantinos E. Nikolakakis, Farzin Haddadpour, Amin Karbasi +1
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 nonc…
Quantile Multi-Armed Bandits: Optimal Best-Arm Identification and a Differentially Private Scheme
Kontantinos E. Nikolakakis, Dionysios S. Kalogerias, Or Sheffet +1
We study the best-arm identification problem in multi-armed bandits with stochastic, potentially private rewards, when the goal is to identify the arm with the highest quantile at…
Optimal Rates for Learning Hidden Tree Structures
Konstantinos E. Nikolakakis, Dionysios S. Kalogerias, Anand D. Sarwate
We provide high probability finite sample complexity guarantees for hidden non-parametric structure learning of tree-shaped graphical models, whose hidden and observable nodes are…
Predictive Learning on Hidden Tree-Structured Ising Models
Konstantinos E. Nikolakakis, Dionysios S. Kalogerias, Anand D. Sarwate
We provide high-probability sample complexity guarantees for exact structure recovery and accurate predictive learning using noise-corrupted samples from an acyclic (tree-shaped) g…