3 papers
Throughput-Optimal Scheduling via Rate Learning
Panagiotis Promponas, Víctor Valls, Konstantinos Nikolakakis +2
We study the problem of designing scheduling policies for communication networks. This problem is often addressed with max-weight-type approaches since they are throughput-optimal.…
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…