81 citations · 175 across the 31 of their papers we have counts for
3 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…
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…