Two-Sample Testing can be as Hard as Structure Learning in Ising Models: Minimax Lower Bounds.

Aditya Gangrade Bobak Nazer Venkatesh Saligrama

Published in: ICASSP (2018)

Keyphrases

structure learning
lower bound
bayesian networks
parameter learning
probabilistic model
graphical models
parameter estimation
markov logic networks
data mining
sample size
np hard
upper bound
model selection
machine learning algorithms
worst case
objective function
reinforcement learning
machine learning