diff options
| author | jeanpouget-abadie <jean.pougetabadie@gmail.com> | 2015-03-20 17:21:54 -0400 |
|---|---|---|
| committer | jeanpouget-abadie <jean.pougetabadie@gmail.com> | 2015-03-20 17:21:54 -0400 |
| commit | e5c19d5ee7d1f338561160f2d9e50b39eaf0cb2b (patch) | |
| tree | 7edddad86006a095c47b316164c39a88fffed674 /results.tex | |
| parent | 1e248e3df3677add70381b7a738db4874f4a9770 (diff) | |
| parent | e62db6b69cdbbe37825f060eec98f600282b4118 (diff) | |
| download | learn-optimize-e5c19d5ee7d1f338561160f2d9e50b39eaf0cb2b.tar.gz | |
Merge branch 'master' of https://github.com/jeanpouget-abadie/learnNoptimize
Diffstat (limited to 'results.tex')
| -rw-r--r-- | results.tex | 6 |
1 files changed, 6 insertions, 0 deletions
diff --git a/results.tex b/results.tex index 1848d35..c9acedd 100644 --- a/results.tex +++ b/results.tex @@ -314,6 +314,12 @@ learning $f$ approximately to optimize it. \subsection{Parametric submodular functions} +\textbf{Note:} all known examples of submodular functions are parametric. The +question is not parametric vs non-parametric but whether or not the number of +parameters is polynomial or exponential in $n$ (the size of the ground set). +For all examples I know except martroid rank functions, it seems to be +polynomial. + \subsubsection{Influence Functions} Let $G = (V, E)$ be a weighted directed graph. Without loss of generality, we |
