From d32f92b8f4a4e373b4ff82b3c64d3a69c5cf9c68 Mon Sep 17 00:00:00 2001
From: Stratis Ioannidis <stratis@stratis-Latitude-E6320.(none)>
Date: Sun, 7 Jul 2013 17:33:12 -0700
Subject: conclusions

---
 conclusion.tex | 12 +++++++++---
 1 file changed, 9 insertions(+), 3 deletions(-)

(limited to 'conclusion.tex')

diff --git a/conclusion.tex b/conclusion.tex
index 695dfb7..0935b62 100644
--- a/conclusion.tex
+++ b/conclusion.tex
@@ -1,4 +1,10 @@
-To be written. Will contain 
-(a) list of extensions with a forward pointer to Appendix
-(b) some concluding remark that we initiated the area, the opt criteria is not a priori clear, etc. 
+We have proposed a convex relaxation for \EDP, and showed that it can be used to design a $\delta$-truthful, constant approximation mechanism that runs in polynomial time. Our objective function, commonly known as the Bayes $D$-optimality criterion, is motivated from linear regression, and in particular captures the information gain when experiments are used to learn a linear model. %in \reals^d.
+
+A natural question to ask is to what extent the results we present here generalize to other machine learning tasks beyond linear regression. We outline a path in pursueing such generalizations in Appendix~\ref{sec:ext}. In particular, although the information gain is not generally a submodular function, we show that for a wide class of models, in experiments outcomes are perturbed by independent noise, the information does indeed exhibit submodularity. Several important  learning tasks fall under this category, including generalized linear regression, logistic regression, \emph{etc.} In light of this, it would be interesting to investigate whether our convex relaxation approach generalizes to other learning tasks in this broader class.
+
+The literature on experimental design includes several other optimality criteria~\cite{pukelsheim2006optimal,atkinson2007optimum}. Many can be seen as scalarizations (\emph{i.e.}, scalar mappings) of the the matrix $(X_S^TX_T)^{-1}$---the $\log\det$ being one of them. Studying such alternative objectives, even within the linear regression setting we study here, is also an interesting related problem. Crucially, our convex relaxation \eqref{eq:our-relaxation} involved swapping the $\log\det$ scalarization with the expectation appearing in the multi-linear extension \eqref{eq:multi-linear}. The same swap is known to yield concave objectives for several other optimality criteria, even when the latter are not necessarily submodular (see, \emph{e.g.}, \citeN{boyd2004convex}). Exploiting the convexity of such relaxations to design budget feasible mechanisms, is an additonal open problem of interest.
+
+%To be written. Will contain 
+%(a) list of extensions with a forward pointer to Appendix
+%(b) some concluding remark that we initiated the area, the opt criteria is not a priori clear, etc. 
 
-- 
cgit v1.2.3-70-g09d2

