<p>Let me first clarify what the paper states: "Most algorithmic approaches used in practice and in theory on a wide variety of problems can be implemented using only access to such an [meaning SQ] oracle". So the question is not really whether MCMC "falls into the SQ framework" (the framework does not place any restrictions on computation) but whether the access to data samples that is necessary to run the algorithm can be replaced with access to an SQ oracle without invalidating the guarantees provided by the algorithm. One can also show that an algorithm for which we have no guarantees is an SQ algorithm but that requires an implementation using an "unbiased" oracle (referred to as 1-STAT in the paper). Lower bounds that can be proved against such an oracle are weaker.</p>

<p>Now regarding MCMC with SQs: the main way to apply MCMC to these kinds of problems that we had in mind in described in an example at the bottom of page 4. Please also take a look at the proof of Thm. 9 here in a follow up paper on this type of techniques:
<a href="http://arxiv.org/pdf/1311.4821v5.pdf" rel="nofollow">http://arxiv.org/pdf/1311.4821v5.pdf</a> </p>

CC BY-SA 3.0
2015-10-18T06:14:43.367Z
2015-10-18T06:14:43.367Z
Vitaly
<p>It is known that a wide range of algorithms fall into the statistical query (SQ) learning model by Michael Kearns. Examples include k-means, logistic regression, naive Bayes (NB), SVM, ICA, PCA, gaussian discriminant analysis, EM, and backpropagation for neural networks. (See, e.g., <a href="http://papers.nips.cc/paper/3150-map-reduce-for-machine-learning-on-multicore.pdf" rel="nofollow">http://papers.nips.cc/paper/3150-map-reduce-for-machine-learning-on-multicore.pdf</a> for proofs.)</p>

<p>According to Feldman et al. (<a href="http://arxiv.org/pdf/1201.1214v5.pdf" rel="nofollow">http://arxiv.org/pdf/1201.1214v5.pdf</a>), it seems that MCMC also belongs to the SQ model. However, I didn't find any concrete proofs for this simple fact in existing literature. So, does MCMC directly falls into the SQ model? Or it requires modifications to fit in?</p>

<machine-learning><query-complexity><pac-learning>
Does MCMC belong to the statistical query model?
Minkov
# Does MCMC belong to the statistical query model?

(Asked by: username_0 on 2015-10-17)

It is known that a wide range of algorithms fall into the statistical query (SQ) learning model by Michael Kearns. Examples include k-means, logistic regression, naive Bayes (NB), SVM, ICA, PCA, gaussian discriminant analysis, EM, and backpropagation for neural networks. (See, e.g., <http://papers.nips.cc/paper/3150-map-reduce-for-machine-learning-on-multicore.pdf> for proofs.)

According to Feldman et al. (<http://arxiv.org/pdf/1201.1214v5.pdf>), it seems that MCMC also belongs to the SQ model. However, I didn't find any concrete proofs for this simple fact in existing literature. So, does MCMC directly falls into the SQ model? Or it requires modifications to fit in?

**Tags:** machine-learning, query-complexity, pac-learning

---

## 1 answers

### Answer by username_1 on 2015-10-18. Score: 4 | Accepted answer

Let me first clarify what the paper states: "Most algorithmic approaches used in practice and in theory on a wide variety of problems can be implemented using only access to such an [meaning SQ] oracle". So the question is not really whether MCMC "falls into the SQ framework" (the framework does not place any restrictions on computation) but whether the access to data samples that is necessary to run the algorithm can be replaced with access to an SQ oracle without invalidating the guarantees provided by the algorithm. One can also show that an algorithm for which we have no guarantees is an SQ algorithm but that requires an implementation using an "unbiased" oracle (referred to as 1-STAT in the paper). Lower bounds that can be proved against such an oracle are weaker.

Now regarding MCMC with SQs: the main way to apply MCMC to these kinds of problems that we had in mind in described in an example at the bottom of page 4. Please also take a look at the proof of Thm. 9 here in a follow up paper on this type of techniques:
<http://arxiv.org/pdf/1311.4821v5.pdf>


---

