Two-sample Hypothesis Testing for Inhomogeneous Random Graphs

no code implementations • 4 Jul 2017 • Debarghya Ghoshdastidar, Maurilio Gutzeit, Alexandra Carpentier, Ulrike Von Luxburg

Given a population of $m$ graphs from each model, we derive minimax separation rates for the problem of testing $P=Q$ against $d(P, Q)>\rho$.

Two-sample testing Vocal Bursts Valence Prediction

Two-Sample Tests for Large Random Graphs Using Network Statistics

no code implementations • 17 May 2017 • Debarghya Ghoshdastidar, Maurilio Gutzeit, Alexandra Carpentier, Ulrike Von Luxburg

We consider a two-sample hypothesis testing problem, where the distributions are defined on the space of undirected graphs, and one has access to only one observation from each model.

Two-sample testing Vocal Bursts Valence Prediction

An optimal algorithm for the Thresholding Bandit Problem

no code implementations • 27 May 2016 • Andrea Locatelli, Maurilio Gutzeit, Alexandra Carpentier

We study a specific \textit{combinatorial pure exploration stochastic bandit problem} where the learner aims at finding the set of arms whose means are above a given threshold, up to a given precision, and \textit{for a fixed time horizon}.