diff options
| -rw-r--r-- | finale/algorithm.sty | 79 | ||||
| -rw-r--r-- | finale/algorithmic.sty | 201 | ||||
| -rw-r--r-- | finale/def.tex | 1 | ||||
| -rw-r--r-- | finale/final_report.tex | 63 | ||||
| -rw-r--r-- | finale/icml2015.bst | 1441 | ||||
| -rw-r--r-- | finale/icml2015.sty | 615 | ||||
| -rw-r--r-- | finale/sections/active.tex | 9 | ||||
| -rw-r--r-- | finale/sections/bayesian.tex | 9 | ||||
| -rw-r--r-- | finale/sections/experiments.tex | 7 | ||||
| -rw-r--r-- | finale/sections/intro.tex | 11 | ||||
| -rw-r--r-- | finale/sections/model.tex | 68 | ||||
| -rw-r--r-- | finale/sections/related.tex | 41 | ||||
| -rw-r--r-- | finale/sections/relatex.tex | 2 |
13 files changed, 2546 insertions, 1 deletions
diff --git a/finale/algorithm.sty b/finale/algorithm.sty new file mode 100644 index 0000000..a723c1c --- /dev/null +++ b/finale/algorithm.sty @@ -0,0 +1,79 @@ +% ALGORITHM STYLE -- Released 8 April 1996
+% for LaTeX-2e
+% Copyright -- 1994 Peter Williams
+% E-mail Peter.Williams@dsto.defence.gov.au
+\NeedsTeXFormat{LaTeX2e}
+\ProvidesPackage{algorithm}
+\typeout{Document Style `algorithm' - floating environment}
+
+\RequirePackage{float}
+\RequirePackage{ifthen}
+\newcommand{\ALG@within}{nothing}
+\newboolean{ALG@within}
+\setboolean{ALG@within}{false}
+\newcommand{\ALG@floatstyle}{ruled}
+\newcommand{\ALG@name}{Algorithm}
+\newcommand{\listalgorithmname}{List of \ALG@name s}
+
+% Declare Options
+% first appearance
+\DeclareOption{plain}{
+ \renewcommand{\ALG@floatstyle}{plain}
+}
+\DeclareOption{ruled}{
+ \renewcommand{\ALG@floatstyle}{ruled}
+}
+\DeclareOption{boxed}{
+ \renewcommand{\ALG@floatstyle}{boxed}
+}
+% then numbering convention
+\DeclareOption{part}{
+ \renewcommand{\ALG@within}{part}
+ \setboolean{ALG@within}{true}
+}
+\DeclareOption{chapter}{
+ \renewcommand{\ALG@within}{chapter}
+ \setboolean{ALG@within}{true}
+}
+\DeclareOption{section}{
+ \renewcommand{\ALG@within}{section}
+ \setboolean{ALG@within}{true}
+}
+\DeclareOption{subsection}{
+ \renewcommand{\ALG@within}{subsection}
+ \setboolean{ALG@within}{true}
+}
+\DeclareOption{subsubsection}{
+ \renewcommand{\ALG@within}{subsubsection}
+ \setboolean{ALG@within}{true}
+}
+\DeclareOption{nothing}{
+ \renewcommand{\ALG@within}{nothing}
+ \setboolean{ALG@within}{true}
+}
+\DeclareOption*{\edef\ALG@name{\CurrentOption}}
+
+% ALGORITHM
+%
+\ProcessOptions
+\floatstyle{\ALG@floatstyle}
+\ifthenelse{\boolean{ALG@within}}{
+ \ifthenelse{\equal{\ALG@within}{part}}
+ {\newfloat{algorithm}{htbp}{loa}[part]}{}
+ \ifthenelse{\equal{\ALG@within}{chapter}}
+ {\newfloat{algorithm}{htbp}{loa}[chapter]}{}
+ \ifthenelse{\equal{\ALG@within}{section}}
+ {\newfloat{algorithm}{htbp}{loa}[section]}{}
+ \ifthenelse{\equal{\ALG@within}{subsection}}
+ {\newfloat{algorithm}{htbp}{loa}[subsection]}{}
+ \ifthenelse{\equal{\ALG@within}{subsubsection}}
+ {\newfloat{algorithm}{htbp}{loa}[subsubsection]}{}
+ \ifthenelse{\equal{\ALG@within}{nothing}}
+ {\newfloat{algorithm}{htbp}{loa}}{}
+}{
+ \newfloat{algorithm}{htbp}{loa}
+}
+\floatname{algorithm}{\ALG@name}
+
+\newcommand{\listofalgorithms}{\listof{algorithm}{\listalgorithmname}}
+
diff --git a/finale/algorithmic.sty b/finale/algorithmic.sty new file mode 100644 index 0000000..e2502a6 --- /dev/null +++ b/finale/algorithmic.sty @@ -0,0 +1,201 @@ +% ALGORITHMIC STYLE -- Released 8 APRIL 1996
+% for LaTeX version 2e
+% Copyright -- 1994 Peter Williams
+% E-mail PeterWilliams@dsto.defence.gov.au
+%
+% Modified by Alex Smola (08/2000)
+% E-mail Alex.Smola@anu.edu.au
+%
+\NeedsTeXFormat{LaTeX2e}
+\ProvidesPackage{algorithmic}
+\typeout{Document Style `algorithmic' - environment}
+%
+\RequirePackage{ifthen}
+\RequirePackage{calc}
+\newboolean{ALC@noend}
+\setboolean{ALC@noend}{false}
+\newcounter{ALC@line}
+\newcounter{ALC@rem}
+\newlength{\ALC@tlm}
+%
+\DeclareOption{noend}{\setboolean{ALC@noend}{true}}
+%
+\ProcessOptions
+%
+% ALGORITHMIC
+\newcommand{\algorithmicrequire}{\textbf{Require:}}
+\newcommand{\algorithmicensure}{\textbf{Ensure:}}
+\newcommand{\algorithmiccomment}[1]{\{#1\}}
+\newcommand{\algorithmicend}{\textbf{end}}
+\newcommand{\algorithmicif}{\textbf{if}}
+\newcommand{\algorithmicthen}{\textbf{then}}
+\newcommand{\algorithmicelse}{\textbf{else}}
+\newcommand{\algorithmicelsif}{\algorithmicelse\ \algorithmicif}
+\newcommand{\algorithmicendif}{\algorithmicend\ \algorithmicif}
+\newcommand{\algorithmicfor}{\textbf{for}}
+\newcommand{\algorithmicforall}{\textbf{for all}}
+\newcommand{\algorithmicdo}{\textbf{do}}
+\newcommand{\algorithmicendfor}{\algorithmicend\ \algorithmicfor}
+\newcommand{\algorithmicwhile}{\textbf{while}}
+\newcommand{\algorithmicendwhile}{\algorithmicend\ \algorithmicwhile}
+\newcommand{\algorithmicloop}{\textbf{loop}}
+\newcommand{\algorithmicendloop}{\algorithmicend\ \algorithmicloop}
+\newcommand{\algorithmicrepeat}{\textbf{repeat}}
+\newcommand{\algorithmicuntil}{\textbf{until}}
+
+%changed by alex smola
+\newcommand{\algorithmicinput}{\textbf{input}}
+\newcommand{\algorithmicoutput}{\textbf{output}}
+\newcommand{\algorithmicset}{\textbf{set}}
+\newcommand{\algorithmictrue}{\textbf{true}}
+\newcommand{\algorithmicfalse}{\textbf{false}}
+\newcommand{\algorithmicand}{\textbf{and\ }}
+\newcommand{\algorithmicor}{\textbf{or\ }}
+\newcommand{\algorithmicfunction}{\textbf{function}}
+\newcommand{\algorithmicendfunction}{\algorithmicend\ \algorithmicfunction}
+\newcommand{\algorithmicmain}{\textbf{main}}
+\newcommand{\algorithmicendmain}{\algorithmicend\ \algorithmicmain}
+%end changed by alex smola
+
+\def\ALC@item[#1]{%
+\if@noparitem \@donoparitem
+ \else \if@inlabel \indent \par \fi
+ \ifhmode \unskip\unskip \par \fi
+ \if@newlist \if@nobreak \@nbitem \else
+ \addpenalty\@beginparpenalty
+ \addvspace\@topsep \addvspace{-\parskip}\fi
+ \else \addpenalty\@itempenalty \addvspace\itemsep
+ \fi
+ \global\@inlabeltrue
+\fi
+\everypar{\global\@minipagefalse\global\@newlistfalse
+ \if@inlabel\global\@inlabelfalse \hskip -\parindent \box\@labels
+ \penalty\z@ \fi
+ \everypar{}}\global\@nobreakfalse
+\if@noitemarg \@noitemargfalse \if@nmbrlist \refstepcounter{\@listctr}\fi \fi
+\sbox\@tempboxa{\makelabel{#1}}%
+\global\setbox\@labels
+ \hbox{\unhbox\@labels \hskip \itemindent
+ \hskip -\labelwidth \hskip -\ALC@tlm
+ \ifdim \wd\@tempboxa >\labelwidth
+ \box\@tempboxa
+ \else \hbox to\labelwidth {\unhbox\@tempboxa}\fi
+ \hskip \ALC@tlm}\ignorespaces}
+%
+\newenvironment{algorithmic}[1][0]{
+\let\@item\ALC@item
+ \newcommand{\ALC@lno}{%
+\ifthenelse{\equal{\arabic{ALC@rem}}{0}}
+{{\footnotesize \arabic{ALC@line}:}}{}%
+}
+\let\@listii\@listi
+\let\@listiii\@listi
+\let\@listiv\@listi
+\let\@listv\@listi
+\let\@listvi\@listi
+\let\@listvii\@listi
+ \newenvironment{ALC@g}{
+ \begin{list}{\ALC@lno}{ \itemsep\z@ \itemindent\z@
+ \listparindent\z@ \rightmargin\z@
+ \topsep\z@ \partopsep\z@ \parskip\z@\parsep\z@
+ \leftmargin 1em
+ \addtolength{\ALC@tlm}{\leftmargin}
+ }
+ }
+ {\end{list}}
+ \newcommand{\ALC@it}{\addtocounter{ALC@line}{1}\addtocounter{ALC@rem}{1}\ifthenelse{\equal{\arabic{ALC@rem}}{#1}}{\setcounter{ALC@rem}{0}}{}\item}
+ \newcommand{\ALC@com}[1]{\ifthenelse{\equal{##1}{default}}%
+{}{\ \algorithmiccomment{##1}}}
+ \newcommand{\REQUIRE}{\item[\algorithmicrequire]}
+ \newcommand{\ENSURE}{\item[\algorithmicensure]}
+ \newcommand{\STATE}{\ALC@it}
+ \newcommand{\COMMENT}[1]{\algorithmiccomment{##1}}
+%changes by alex smola
+ \newcommand{\INPUT}{\item[\algorithmicinput]}
+ \newcommand{\OUTPUT}{\item[\algorithmicoutput]}
+ \newcommand{\SET}{\item[\algorithmicset]}
+% \newcommand{\TRUE}{\algorithmictrue}
+% \newcommand{\FALSE}{\algorithmicfalse}
+ \newcommand{\AND}{\algorithmicand}
+ \newcommand{\OR}{\algorithmicor}
+ \newenvironment{ALC@func}{\begin{ALC@g}}{\end{ALC@g}}
+ \newenvironment{ALC@main}{\begin{ALC@g}}{\end{ALC@g}}
+%end changes by alex smola
+ \newenvironment{ALC@if}{\begin{ALC@g}}{\end{ALC@g}}
+ \newenvironment{ALC@for}{\begin{ALC@g}}{\end{ALC@g}}
+ \newenvironment{ALC@whl}{\begin{ALC@g}}{\end{ALC@g}}
+ \newenvironment{ALC@loop}{\begin{ALC@g}}{\end{ALC@g}}
+ \newenvironment{ALC@rpt}{\begin{ALC@g}}{\end{ALC@g}}
+ \renewcommand{\\}{\@centercr}
+ \newcommand{\IF}[2][default]{\ALC@it\algorithmicif\ ##2\ \algorithmicthen%
+\ALC@com{##1}\begin{ALC@if}}
+ \newcommand{\SHORTIF}[2]{\ALC@it\algorithmicif\ ##1\
+ \algorithmicthen\ {##2}}
+ \newcommand{\ELSE}[1][default]{\end{ALC@if}\ALC@it\algorithmicelse%
+\ALC@com{##1}\begin{ALC@if}}
+ \newcommand{\ELSIF}[2][default]%
+{\end{ALC@if}\ALC@it\algorithmicelsif\ ##2\ \algorithmicthen%
+\ALC@com{##1}\begin{ALC@if}}
+ \newcommand{\FOR}[2][default]{\ALC@it\algorithmicfor\ ##2\ \algorithmicdo%
+\ALC@com{##1}\begin{ALC@for}}
+ \newcommand{\FORALL}[2][default]{\ALC@it\algorithmicforall\ ##2\ %
+\algorithmicdo%
+\ALC@com{##1}\begin{ALC@for}}
+ \newcommand{\SHORTFORALL}[2]{\ALC@it\algorithmicforall\ ##1\ %
+ \algorithmicdo\ {##2}}
+ \newcommand{\WHILE}[2][default]{\ALC@it\algorithmicwhile\ ##2\ %
+\algorithmicdo%
+\ALC@com{##1}\begin{ALC@whl}}
+ \newcommand{\LOOP}[1][default]{\ALC@it\algorithmicloop%
+\ALC@com{##1}\begin{ALC@loop}}
+%changed by alex smola
+ \newcommand{\FUNCTION}[2][default]{\ALC@it\algorithmicfunction\ ##2\ %
+ \ALC@com{##1}\begin{ALC@func}}
+ \newcommand{\MAIN}[2][default]{\ALC@it\algorithmicmain\ ##2\ %
+ \ALC@com{##1}\begin{ALC@main}}
+%end changed by alex smola
+ \newcommand{\REPEAT}[1][default]{\ALC@it\algorithmicrepeat%
+ \ALC@com{##1}\begin{ALC@rpt}}
+ \newcommand{\UNTIL}[1]{\end{ALC@rpt}\ALC@it\algorithmicuntil\ ##1}
+ \ifthenelse{\boolean{ALC@noend}}{
+ \newcommand{\ENDIF}{\end{ALC@if}}
+ \newcommand{\ENDFOR}{\end{ALC@for}}
+ \newcommand{\ENDWHILE}{\end{ALC@whl}}
+ \newcommand{\ENDLOOP}{\end{ALC@loop}}
+ \newcommand{\ENDFUNCTION}{\end{ALC@func}}
+ \newcommand{\ENDMAIN}{\end{ALC@main}}
+ }{
+ \newcommand{\ENDIF}{\end{ALC@if}\ALC@it\algorithmicendif}
+ \newcommand{\ENDFOR}{\end{ALC@for}\ALC@it\algorithmicendfor}
+ \newcommand{\ENDWHILE}{\end{ALC@whl}\ALC@it\algorithmicendwhile}
+ \newcommand{\ENDLOOP}{\end{ALC@loop}\ALC@it\algorithmicendloop}
+ \newcommand{\ENDFUNCTION}{\end{ALC@func}\ALC@it\algorithmicendfunction}
+ \newcommand{\ENDMAIN}{\end{ALC@main}\ALC@it\algorithmicendmain}
+ }
+ \renewcommand{\@toodeep}{}
+ \begin{list}{\ALC@lno}{\setcounter{ALC@line}{0}\setcounter{ALC@rem}{0}%
+ \itemsep\z@ \itemindent\z@ \listparindent\z@%
+ \partopsep\z@ \parskip\z@ \parsep\z@%
+ \labelsep 0.5em \topsep 0.2em%
+ \ifthenelse{\equal{#1}{0}}
+ {\labelwidth 0.5em }
+ {\labelwidth 1.2em }
+ \leftmargin\labelwidth \addtolength{\leftmargin}{\labelsep}
+ \ALC@tlm\labelsep
+ }
+ }
+ {\end{list}}
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/finale/def.tex b/finale/def.tex index 7262705..1fff48d 100644 --- a/finale/def.tex +++ b/finale/def.tex @@ -1,6 +1,5 @@ \usepackage{fancyvrb} \usepackage{color} -\usepackage[UTF-8]{inputenc} \makeatletter \def\PY@reset{\let\PY@it=\relax \let\PY@bf=\relax% diff --git a/finale/final_report.tex b/finale/final_report.tex new file mode 100644 index 0000000..28ae3dd --- /dev/null +++ b/finale/final_report.tex @@ -0,0 +1,63 @@ +\documentclass[10pt]{article} +\usepackage[utf8x]{inputenc} +\usepackage{amsmath, amssymb, amsthm, microtype} +\usepackage[pagebackref=false,breaklinks=true, + colorlinks=true,citecolor=blue]{hyperref} +\usepackage[capitalize, noabbrev]{cleveref} +\usepackage{graphicx} +\usepackage{bbm} +%\usepackage{fullpage} +\input{def} +\usepackage{icml2015} +%\usepackage{algpseudocode} +\DeclareMathOperator*{\argmax}{arg\,max} +\DeclareMathOperator*{\argmin}{arg\,min} +\DeclareMathOperator{\E}{\mathbb{E}} +\let\P\relax +\DeclareMathOperator{\P}{\mathbb{P}} +\newcommand{\ex}[1]{\E\left[#1\right]} +\newcommand{\prob}[1]{\P\left[#1\right]} +\newcommand{\inprod}[1]{\left\langle #1 \right\rangle} +\newcommand{\R}{\mathbf{R}} +\newcommand{\N}{\mathbf{N}} +\newcommand{\C}{\mathcal{C}} +\newcommand{\eps}{\varepsilon} +\newcommand{\bt}{\boldsymbol{\theta}} +\newcommand{\bx}{\mathbf{x}} +\newcommand{\cl}[1]{\text{\textbf{#1}}} +\newcommand{\eqdef}{\mathbin{\stackrel{\rm def}{=}}} + +\newtheorem{theorem}{Theorem} +\newtheorem{proposition}[theorem]{Proposition} +\newtheorem{lemma}[theorem]{Lemma} +\newtheorem{corollary}[theorem]{Corollary} +\theoremstyle{definition} +\newtheorem{definition}[theorem]{Definition} +\theoremstyle{remark} +\newtheorem*{example}{Example} +\newtheorem*{remark}{Remark} + +\title{Bayesian and Activ Learning for Graph Inference} +\author{Thibaut Horel \and Jean Pouget-Abadie} + +\begin{document} + +\maketitle +\section{Introduction} +\input{sections/intro.tex} + +\section{Model} +\input{sections/model.tex} + +\section{Bayesian Inference} +\input{sections/bayesian.tex} + +\section{Active Learning} +\input{sections/active.tex} + +\section{Experiments} +\input{sections/experiments.tex} + +\bibliography{sparse} +\bibliographystyle{icml2015} +\end{document} diff --git a/finale/icml2015.bst b/finale/icml2015.bst new file mode 100644 index 0000000..7709ca8 --- /dev/null +++ b/finale/icml2015.bst @@ -0,0 +1,1441 @@ +%% File: `icml2010.bst' +%% A modification of `plainnl.bst' for use with natbib package +%% +%% Copyright 2010 Hal Daum\'e III +%% Modified by J. Fürnkranz +%% - Changed labels from (X and Y, 2000) to (X & Y, 2000) +%% - Changed References to last name first and abbreviated first names. +%% +%% Copyright 1993-2007 Patrick W Daly +%% Max-Planck-Institut f\"ur Sonnensystemforschung +%% Max-Planck-Str. 2 +%% D-37191 Katlenburg-Lindau +%% Germany +%% E-mail: daly@mps.mpg.de +%% +%% This program can be redistributed and/or modified under the terms +%% of the LaTeX Project Public License Distributed from CTAN +%% archives in directory macros/latex/base/lppl.txt; either +%% version 1 of the License, or any later version. +%% + % Version and source file information: + % \ProvidesFile{icml2010.mbs}[2007/11/26 1.93 (PWD)] + % + % BibTeX `plainnat' family + % version 0.99b for BibTeX versions 0.99a or later, + % for LaTeX versions 2.09 and 2e. + % + % For use with the `natbib.sty' package; emulates the corresponding + % member of the `plain' family, but with author-year citations. + % + % With version 6.0 of `natbib.sty', it may also be used for numerical + % citations, while retaining the commands \citeauthor, \citefullauthor, + % and \citeyear to print the corresponding information. + % + % For version 7.0 of `natbib.sty', the KEY field replaces missing + % authors/editors, and the date is left blank in \bibitem. + % + % Includes field EID for the sequence/citation number of electronic journals + % which is used instead of page numbers. + % + % Includes fields ISBN and ISSN. + % + % Includes field URL for Internet addresses. + % + % Includes field DOI for Digital Object Idenfifiers. + % + % Works best with the url.sty package of Donald Arseneau. + % + % Works with identical authors and year are further sorted by + % citation key, to preserve any natural sequence. + % +ENTRY + { address + author + booktitle + chapter + doi + eid + edition + editor + howpublished + institution + isbn + issn + journal + key + month + note + number + organization + pages + publisher + school + series + title + type + url + volume + year + } + {} + { label extra.label sort.label short.list } + +INTEGERS { output.state before.all mid.sentence after.sentence after.block } + +FUNCTION {init.state.consts} +{ #0 'before.all := + #1 'mid.sentence := + #2 'after.sentence := + #3 'after.block := +} + +STRINGS { s t } + +FUNCTION {output.nonnull} +{ 's := + output.state mid.sentence = + { ", " * write$ } + { output.state after.block = + { add.period$ write$ + newline$ + "\newblock " write$ + } + { output.state before.all = + 'write$ + { add.period$ " " * write$ } + if$ + } + if$ + mid.sentence 'output.state := + } + if$ + s +} + +FUNCTION {output} +{ duplicate$ empty$ + 'pop$ + 'output.nonnull + if$ +} + +FUNCTION {output.check} +{ 't := + duplicate$ empty$ + { pop$ "empty " t * " in " * cite$ * warning$ } + 'output.nonnull + if$ +} + +FUNCTION {fin.entry} +{ add.period$ + write$ + newline$ +} + +FUNCTION {new.block} +{ output.state before.all = + 'skip$ + { after.block 'output.state := } + if$ +} + +FUNCTION {new.sentence} +{ output.state after.block = + 'skip$ + { output.state before.all = + 'skip$ + { after.sentence 'output.state := } + if$ + } + if$ +} + +FUNCTION {not} +{ { #0 } + { #1 } + if$ +} + +FUNCTION {and} +{ 'skip$ + { pop$ #0 } + if$ +} + +FUNCTION {or} +{ { pop$ #1 } + 'skip$ + if$ +} + +FUNCTION {new.block.checka} +{ empty$ + 'skip$ + 'new.block + if$ +} + +FUNCTION {new.block.checkb} +{ empty$ + swap$ empty$ + and + 'skip$ + 'new.block + if$ +} + +FUNCTION {new.sentence.checka} +{ empty$ + 'skip$ + 'new.sentence + if$ +} + +FUNCTION {new.sentence.checkb} +{ empty$ + swap$ empty$ + and + 'skip$ + 'new.sentence + if$ +} + +FUNCTION {field.or.null} +{ duplicate$ empty$ + { pop$ "" } + 'skip$ + if$ +} + +FUNCTION {emphasize} +{ duplicate$ empty$ + { pop$ "" } + { "\emph{" swap$ * "}" * } + if$ +} + +INTEGERS { nameptr namesleft numnames } + +FUNCTION {format.names} +{ 's := + #1 'nameptr := + s num.names$ 'numnames := + numnames 'namesleft := + { namesleft #0 > } + { s nameptr "{vv~}{ll}{, jj}{, ff}" format.name$ 't := + nameptr #1 > + { namesleft #1 > + { ", " * t * } + { numnames #2 > + { "," * } + 'skip$ + if$ + t "others" = + { " et~al." * } + { " and " * t * } + if$ + } + if$ + } + 't + if$ + nameptr #1 + 'nameptr := + namesleft #1 - 'namesleft := + } + while$ +} + +FUNCTION {format.key} +{ empty$ + { key field.or.null } + { "" } + if$ +} + +FUNCTION {format.authors} +{ author empty$ + { "" } + { author format.names } + if$ +} + +FUNCTION {format.editors} +{ editor empty$ + { "" } + { editor format.names + editor num.names$ #1 > + { " (eds.)" * } + { " (ed.)" * } + if$ + } + if$ +} + +FUNCTION {format.isbn} +{ isbn empty$ + { "" } + { new.block "ISBN " isbn * } + if$ +} + +FUNCTION {format.issn} +{ issn empty$ + { "" } + { new.block "ISSN " issn * } + if$ +} + +FUNCTION {format.url} +{ url empty$ + { "" } + { new.block "URL \url{" url * "}" * } + if$ +} + +FUNCTION {format.doi} +{ doi empty$ + { "" } + { new.block "\doi{" doi * "}" * } + if$ +} + +FUNCTION {format.title} +{ title empty$ + { "" } + { title "t" change.case$ } + if$ +} + +FUNCTION {format.full.names} +{'s := + #1 'nameptr := + s num.names$ 'numnames := + numnames 'namesleft := + { namesleft #0 > } + { s nameptr + "{vv~}{ll}" format.name$ 't := + nameptr #1 > + { + namesleft #1 > + { ", " * t * } + { + numnames #2 > + { "," * } + 'skip$ + if$ + t "others" = + { " et~al." * } + { " and " * t * } + if$ + } + if$ + } + 't + if$ + nameptr #1 + 'nameptr := + namesleft #1 - 'namesleft := + } + while$ +} + +FUNCTION {author.editor.full} +{ author empty$ + { editor empty$ + { "" } + { editor format.full.names } + if$ + } + { author format.full.names } + if$ +} + +FUNCTION {author.full} +{ author empty$ + { "" } + { author format.full.names } + if$ +} + +FUNCTION {editor.full} +{ editor empty$ + { "" } + { editor format.full.names } + if$ +} + +FUNCTION {make.full.names} +{ type$ "book" = + type$ "inbook" = + or + 'author.editor.full + { type$ "proceedings" = + 'editor.full + 'author.full + if$ + } + if$ +} + +FUNCTION {output.bibitem} +{ newline$ + "\bibitem[" write$ + label write$ + ")" make.full.names duplicate$ short.list = + { pop$ } + { * } + if$ + "]{" * write$ + cite$ write$ + "}" write$ + newline$ + "" + before.all 'output.state := +} + +FUNCTION {n.dashify} +{ 't := + "" + { t empty$ not } + { t #1 #1 substring$ "-" = + { t #1 #2 substring$ "--" = not + { "--" * + t #2 global.max$ substring$ 't := + } + { { t #1 #1 substring$ "-" = } + { "-" * + t #2 global.max$ substring$ 't := + } + while$ + } + if$ + } + { t #1 #1 substring$ * + t #2 global.max$ substring$ 't := + } + if$ + } + while$ +} + +FUNCTION {format.date} +{ year duplicate$ empty$ + { "empty year in " cite$ * warning$ + pop$ "" } + 'skip$ + if$ + month empty$ + 'skip$ + { month + " " * swap$ * + } + if$ + extra.label * +} + +FUNCTION {format.btitle} +{ title emphasize +} + +FUNCTION {tie.or.space.connect} +{ duplicate$ text.length$ #3 < + { "~" } + { " " } + if$ + swap$ * * +} + +FUNCTION {either.or.check} +{ empty$ + 'pop$ + { "can't use both " swap$ * " fields in " * cite$ * warning$ } + if$ +} + +FUNCTION {format.bvolume} +{ volume empty$ + { "" } + { "volume" volume tie.or.space.connect + series empty$ + 'skip$ + { " of " * series emphasize * } + if$ + "volume and number" number either.or.check + } + if$ +} + +FUNCTION {format.number.series} +{ volume empty$ + { number empty$ + { series field.or.null } + { output.state mid.sentence = + { "number" } + { "Number" } + if$ + number tie.or.space.connect + series empty$ + { "there's a number but no series in " cite$ * warning$ } + { " in " * series * } + if$ + } + if$ + } + { "" } + if$ +} + +FUNCTION {format.edition} +{ edition empty$ + { "" } + { output.state mid.sentence = + { edition "l" change.case$ " edition" * } + { edition "t" change.case$ " edition" * } + if$ + } + if$ +} + +INTEGERS { multiresult } + +FUNCTION {multi.page.check} +{ 't := + #0 'multiresult := + { multiresult not + t empty$ not + and + } + { t #1 #1 substring$ + duplicate$ "-" = + swap$ duplicate$ "," = + swap$ "+" = + or or + { #1 'multiresult := } + { t #2 global.max$ substring$ 't := } + if$ + } + while$ + multiresult +} + +FUNCTION {format.pages} +{ pages empty$ + { "" } + { pages multi.page.check + { "pp.\ " pages n.dashify tie.or.space.connect } + { "pp.\ " pages tie.or.space.connect } + if$ + } + if$ +} + +FUNCTION {format.eid} +{ eid empty$ + { "" } + { "art." eid tie.or.space.connect } + if$ +} + +FUNCTION {format.vol.num.pages} +{ volume field.or.null + number empty$ + 'skip$ + { "\penalty0 (" number * ")" * * + volume empty$ + { "there's a number but no volume in " cite$ * warning$ } + 'skip$ + if$ + } + if$ + pages empty$ + 'skip$ + { duplicate$ empty$ + { pop$ format.pages } + { ":\penalty0 " * pages n.dashify * } + if$ + } + if$ +} + +FUNCTION {format.vol.num.eid} +{ volume field.or.null + number empty$ + 'skip$ + { "\penalty0 (" number * ")" * * + volume empty$ + { "there's a number but no volume in " cite$ * warning$ } + 'skip$ + if$ + } + if$ + eid empty$ + 'skip$ + { duplicate$ empty$ + { pop$ format.eid } + { ":\penalty0 " * eid * } + if$ + } + if$ +} + +FUNCTION {format.chapter.pages} +{ chapter empty$ + 'format.pages + { type empty$ + { "chapter" } + { type "l" change.case$ } + if$ + chapter tie.or.space.connect + pages empty$ + 'skip$ + { ", " * format.pages * } + if$ + } + if$ +} + +FUNCTION {format.in.ed.booktitle} +{ booktitle empty$ + { "" } + { editor empty$ + { "In " booktitle emphasize * } + { "In " format.editors * ", " * booktitle emphasize * } + if$ + } + if$ +} + +FUNCTION {empty.misc.check} +{ author empty$ title empty$ howpublished empty$ + month empty$ year empty$ note empty$ + and and and and and + key empty$ not and + { "all relevant fields are empty in " cite$ * warning$ } + 'skip$ + if$ +} + +FUNCTION {format.thesis.type} +{ type empty$ + 'skip$ + { pop$ + type "t" change.case$ + } + if$ +} + +FUNCTION {format.tr.number} +{ type empty$ + { "Technical Report" } + 'type + if$ + number empty$ + { "t" change.case$ } + { number tie.or.space.connect } + if$ +} + +FUNCTION {format.article.crossref} +{ key empty$ + { journal empty$ + { "need key or journal for " cite$ * " to crossref " * crossref * + warning$ + "" + } + { "In \emph{" journal * "}" * } + if$ + } + { "In " } + if$ + " \citet{" * crossref * "}" * +} + +FUNCTION {format.book.crossref} +{ volume empty$ + { "empty volume in " cite$ * "'s crossref of " * crossref * warning$ + "In " + } + { "Volume" volume tie.or.space.connect + " of " * + } + if$ + editor empty$ + editor field.or.null author field.or.null = + or + { key empty$ + { series empty$ + { "need editor, key, or series for " cite$ * " to crossref " * + crossref * warning$ + "" * + } + { "\emph{" * series * "}" * } + if$ + } + 'skip$ + if$ + } + 'skip$ + if$ + " \citet{" * crossref * "}" * +} + +FUNCTION {format.incoll.inproc.crossref} +{ editor empty$ + editor field.or.null author field.or.null = + or + { key empty$ + { booktitle empty$ + { "need editor, key, or booktitle for " cite$ * " to crossref " * + crossref * warning$ + "" + } + { "In \emph{" booktitle * "}" * } + if$ + } + { "In " } + if$ + } + { "In " } + if$ + " \citet{" * crossref * "}" * +} + +FUNCTION {article} +{ output.bibitem + format.authors "author" output.check + author format.key output + new.block + format.title "title" output.check + new.block + crossref missing$ + { journal emphasize "journal" output.check + eid empty$ + { format.vol.num.pages output } + { format.vol.num.eid output } + if$ + format.date "year" output.check + } + { format.article.crossref output.nonnull + eid empty$ + { format.pages output } + { format.eid output } + if$ + } + if$ + format.issn output + format.doi output + format.url output + new.block + note output + fin.entry +} + +FUNCTION {book} +{ output.bibitem + author empty$ + { format.editors "author and editor" output.check + editor format.key output + } + { format.authors output.nonnull + crossref missing$ + { "author and editor" editor either.or.check } + 'skip$ + if$ + } + if$ + new.block + format.btitle "title" output.check + crossref missing$ + { format.bvolume output + new.block + format.number.series output + new.sentence + publisher "publisher" output.check + address output + } + { new.block + format.book.crossref output.nonnull + } + if$ + format.edition output + format.date "year" output.check + format.isbn output + format.doi output + format.url output + new.block + note output + fin.entry +} + +FUNCTION {booklet} +{ output.bibitem + format.authors output + author format.key output + new.block + format.title "title" output.check + howpublished address new.block.checkb + howpublished output + address output + format.date output + format.isbn output + format.doi output + format.url output + new.block + note output + fin.entry +} + +FUNCTION {inbook} +{ output.bibitem + author empty$ + { format.editors "author and editor" output.check + editor format.key output + } + { format.authors output.nonnull + crossref missing$ + { "author and editor" editor either.or.check } + 'skip$ + if$ + } + if$ + new.block + format.btitle "title" output.check + crossref missing$ + { format.bvolume output + format.chapter.pages "chapter and pages" output.check + new.block + format.number.series output + new.sentence + publisher "publisher" output.check + address output + } + { format.chapter.pages "chapter and pages" output.check + new.block + format.book.crossref output.nonnull + } + if$ + format.edition output + format.date "year" output.check + format.isbn output + format.doi output + format.url output + new.block + note output + fin.entry +} + +FUNCTION {incollection} +{ output.bibitem + format.authors "author" output.check + author format.key output + new.block + format.title "title" output.check + new.block + crossref missing$ + { format.in.ed.booktitle "booktitle" output.check + format.bvolume output + format.number.series output + format.chapter.pages output + new.sentence + publisher "publisher" output.check + address output + format.edition output + format.date "year" output.check + } + { format.incoll.inproc.crossref output.nonnull + format.chapter.pages output + } + if$ + format.isbn output + format.doi output + format.url output + new.block + note output + fin.entry +} + +FUNCTION {inproceedings} +{ output.bibitem + format.authors "author" output.check + author format.key output + new.block + format.title "title" output.check + new.block + crossref missing$ + { format.in.ed.booktitle "booktitle" output.check + format.bvolume output + format.number.series output + format.pages output + address empty$ + { organization publisher new.sentence.checkb + organization output + publisher output + format.date "year" output.check + } + { address output.nonnull + format.date "year" output.check + new.sentence + organization output + publisher output + } + if$ + } + { format.incoll.inproc.crossref output.nonnull + format.pages output + } + if$ + format.isbn output + format.doi output + format.url output + new.block + note output + fin.entry +} + +FUNCTION {conference} { inproceedings } + +FUNCTION {manual} +{ output.bibitem + format.authors output + author format.key output + new.block + format.btitle "title" output.check + organization address new.block.checkb + organization output + address output + format.edition output + format.date output + format.url output + new.block + note output + fin.entry +} + +FUNCTION {mastersthesis} +{ output.bibitem + format.authors "author" output.check + author format.key output + new.block + format.title "title" output.check + new.block + "Master's thesis" format.thesis.type output.nonnull + school "school" output.check + address output + format.date "year" output.check + format.url output + new.block + note output + fin.entry +} + +FUNCTION {misc} +{ output.bibitem + format.authors output + author format.key output + title howpublished new.block.checkb + format.title output + howpublished new.block.checka + howpublished output + format.date output + format.issn output + format.url output + new.block + note output + fin.entry + empty.misc.check +} + +FUNCTION {phdthesis} +{ output.bibitem + format.authors "author" output.check + author format.key output + new.block + format.btitle "title" output.check + new.block + "PhD thesis" format.thesis.type output.nonnull + school "school" output.check + address output + format.date "year" output.check + format.url output + new.block + note output + fin.entry +} + +FUNCTION {proceedings} +{ output.bibitem + format.editors output + editor format.key output + new.block + format.btitle "title" output.check + format.bvolume output + format.number.series output + address output + format.date "year" output.check + new.sentence + organization output + publisher output + format.isbn output + format.doi output + format.url output + new.block + note output + fin.entry +} + +FUNCTION {techreport} +{ output.bibitem + format.authors "author" output.check + author format.key output + new.block + format.title "title" output.check + new.block + format.tr.number output.nonnull + institution "institution" output.check + address output + format.date "year" output.check + format.url output + new.block + note output + fin.entry +} + +FUNCTION {unpublished} +{ output.bibitem + format.authors "author" output.check + author format.key output + new.block + format.title "title" output.check + new.block + note "note" output.check + format.date output + format.url output + fin.entry +} + +FUNCTION {default.type} { misc } + + +MACRO {jan} {"January"} + +MACRO {feb} {"February"} + +MACRO {mar} {"March"} + +MACRO {apr} {"April"} + +MACRO {may} {"May"} + +MACRO {jun} {"June"} + +MACRO {jul} {"July"} + +MACRO {aug} {"August"} + +MACRO {sep} {"September"} + +MACRO {oct} {"October"} + +MACRO {nov} {"November"} + +MACRO {dec} {"December"} + + + +MACRO {acmcs} {"ACM Computing Surveys"} + +MACRO {acta} {"Acta Informatica"} + +MACRO {cacm} {"Communications of the ACM"} + +MACRO {ibmjrd} {"IBM Journal of Research and Development"} + +MACRO {ibmsj} {"IBM Systems Journal"} + +MACRO {ieeese} {"IEEE Transactions on Software Engineering"} + +MACRO {ieeetc} {"IEEE Transactions on Computers"} + +MACRO {ieeetcad} + {"IEEE Transactions on Computer-Aided Design of Integrated Circuits"} + +MACRO {ipl} {"Information Processing Letters"} + +MACRO {jacm} {"Journal of the ACM"} + +MACRO {jcss} {"Journal of Computer and System Sciences"} + +MACRO {scp} {"Science of Computer Programming"} + +MACRO {sicomp} {"SIAM Journal on Computing"} + +MACRO {tocs} {"ACM Transactions on Computer Systems"} + +MACRO {tods} {"ACM Transactions on Database Systems"} + +MACRO {tog} {"ACM Transactions on Graphics"} + +MACRO {toms} {"ACM Transactions on Mathematical Software"} + +MACRO {toois} {"ACM Transactions on Office Information Systems"} + +MACRO {toplas} {"ACM Transactions on Programming Languages and Systems"} + +MACRO {tcs} {"Theoretical Computer Science"} + + +READ + +FUNCTION {sortify} +{ purify$ + "l" change.case$ +} + +INTEGERS { len } + +FUNCTION {chop.word} +{ 's := + 'len := + s #1 len substring$ = + { s len #1 + global.max$ substring$ } + 's + if$ +} + +FUNCTION {format.lab.names} +{ 's := + s #1 "{vv~}{ll}" format.name$ + s num.names$ duplicate$ + #2 > + { pop$ " et~al." * } + { #2 < + 'skip$ + { s #2 "{ff }{vv }{ll}{ jj}" format.name$ "others" = + { " et~al." * } + { " \& " * s #2 "{vv~}{ll}" format.name$ * } + if$ + } + if$ + } + if$ +} + +FUNCTION {author.key.label} +{ author empty$ + { key empty$ + { cite$ #1 #3 substring$ } + 'key + if$ + } + { author format.lab.names } + if$ +} + +FUNCTION {author.editor.key.label} +{ author empty$ + { editor empty$ + { key empty$ + { cite$ #1 #3 substring$ } + 'key + if$ + } + { editor format.lab.names } + if$ + } + { author format.lab.names } + if$ +} + +FUNCTION {author.key.organization.label} +{ author empty$ + { key empty$ + { organization empty$ + { cite$ #1 #3 substring$ } + { "The " #4 organization chop.word #3 text.prefix$ } + if$ + } + 'key + if$ + } + { author format.lab.names } + if$ +} + +FUNCTION {editor.key.organization.label} +{ editor empty$ + { key empty$ + { organization empty$ + { cite$ #1 #3 substring$ } + { "The " #4 organization chop.word #3 text.prefix$ } + if$ + } + 'key + if$ + } + { editor format.lab.names } + if$ +} + +FUNCTION {calc.short.authors} +{ type$ "book" = + type$ "inbook" = + or + 'author.editor.key.label + { type$ "proceedings" = + 'editor.key.organization.label + { type$ "manual" = + 'author.key.organization.label + 'author.key.label + if$ + } + if$ + } + if$ + 'short.list := +} + +FUNCTION {calc.label} +{ calc.short.authors + short.list + "(" + * + year duplicate$ empty$ + short.list key field.or.null = or + { pop$ "" } + 'skip$ + if$ + * + 'label := +} + +FUNCTION {sort.format.names} +{ 's := + #1 'nameptr := + "" + s num.names$ 'numnames := + numnames 'namesleft := + { namesleft #0 > } + { + s nameptr "{vv{ } }{ll{ }}{ ff{ }}{ jj{ }}" format.name$ 't := + nameptr #1 > + { + " " * + namesleft #1 = t "others" = and + { "zzzzz" * } + { numnames #2 > nameptr #2 = and + { "zz" * year field.or.null * " " * } + 'skip$ + if$ + t sortify * + } + if$ + } + { t sortify * } + if$ + nameptr #1 + 'nameptr := + namesleft #1 - 'namesleft := + } + while$ +} + +FUNCTION {sort.format.title} +{ 't := + "A " #2 + "An " #3 + "The " #4 t chop.word + chop.word + chop.word + sortify + #1 global.max$ substring$ +} + +FUNCTION {author.sort} +{ author empty$ + { key empty$ + { "to sort, need author or key in " cite$ * warning$ + "" + } + { key sortify } + if$ + } + { author sort.format.names } + if$ +} + +FUNCTION {author.editor.sort} +{ author empty$ + { editor empty$ + { key empty$ + { "to sort, need author, editor, or key in " cite$ * warning$ + "" + } + { key sortify } + if$ + } + { editor sort.format.names } + if$ + } + { author sort.format.names } + if$ +} + +FUNCTION {author.organization.sort} +{ author empty$ + { organization empty$ + { key empty$ + { "to sort, need author, organization, or key in " cite$ * warning$ + "" + } + { key sortify } + if$ + } + { "The " #4 organization chop.word sortify } + if$ + } + { author sort.format.names } + if$ +} + +FUNCTION {editor.organization.sort} +{ editor empty$ + { organization empty$ + { key empty$ + { "to sort, need editor, organization, or key in " cite$ * warning$ + "" + } + { key sortify } + if$ + } + { "The " #4 organization chop.word sortify } + if$ + } + { editor sort.format.names } + if$ +} + + +FUNCTION {presort} +{ calc.label + label sortify + " " + * + type$ "book" = + type$ "inbook" = + or + 'author.editor.sort + { type$ "proceedings" = + 'editor.organization.sort + { type$ "manual" = + 'author.organization.sort + 'author.sort + if$ + } + if$ + } + if$ + " " + * + year field.or.null sortify + * + " " + * + cite$ + * + #1 entry.max$ substring$ + 'sort.label := + sort.label * + #1 entry.max$ substring$ + 'sort.key$ := +} + +ITERATE {presort} + +SORT + +STRINGS { longest.label last.label next.extra } + +INTEGERS { longest.label.width last.extra.num number.label } + +FUNCTION {initialize.longest.label} +{ "" 'longest.label := + #0 int.to.chr$ 'last.label := + "" 'next.extra := + #0 'longest.label.width := + #0 'last.extra.num := + #0 'number.label := +} + +FUNCTION {forward.pass} +{ last.label label = + { last.extra.num #1 + 'last.extra.num := + last.extra.num int.to.chr$ 'extra.label := + } + { "a" chr.to.int$ 'last.extra.num := + "" 'extra.label := + label 'last.label := + } + if$ + number.label #1 + 'number.label := +} + +FUNCTION {reverse.pass} +{ next.extra "b" = + { "a" 'extra.label := } + 'skip$ + if$ + extra.label 'next.extra := + extra.label + duplicate$ empty$ + 'skip$ + { "{\natexlab{" swap$ * "}}" * } + if$ + 'extra.label := + label extra.label * 'label := +} + +EXECUTE {initialize.longest.label} + +ITERATE {forward.pass} + +REVERSE {reverse.pass} + +FUNCTION {bib.sort.order} +{ sort.label 'sort.key$ := +} + +ITERATE {bib.sort.order} + +SORT + +FUNCTION {begin.bib} +{ preamble$ empty$ + 'skip$ + { preamble$ write$ newline$ } + if$ + "\begin{thebibliography}{" number.label int.to.str$ * "}" * + write$ newline$ + "\providecommand{\natexlab}[1]{#1}" + write$ newline$ + "\providecommand{\url}[1]{\texttt{#1}}" + write$ newline$ + "\expandafter\ifx\csname urlstyle\endcsname\relax" + write$ newline$ + " \providecommand{\doi}[1]{doi: #1}\else" + write$ newline$ + " \providecommand{\doi}{doi: \begingroup \urlstyle{rm}\Url}\fi" + write$ newline$ +} + +EXECUTE {begin.bib} + +EXECUTE {init.state.consts} + +ITERATE {call.type$} + +FUNCTION {end.bib} +{ newline$ + "\end{thebibliography}" write$ newline$ +} + +EXECUTE {end.bib} diff --git a/finale/icml2015.sty b/finale/icml2015.sty new file mode 100644 index 0000000..4798e3c --- /dev/null +++ b/finale/icml2015.sty @@ -0,0 +1,615 @@ +% File: icml2015.sty (LaTeX style file for ICML-2015) + +% This file contains the LaTeX formatting parameters for a two-column +% conference proceedings that is 8.5 inches wide by 11 inches high. +% +% Modified by Percy Liang 12/2/2013: changed the year, location from the previous template for ICML 2014 + +% Modified by Fei Sha 9/2/2013: changed the year, location form the previous template for ICML 2013 +% +% Modified by Fei Sha 4/24/2013: (1) remove the extra whitespace after the first author's email address (in %the camera-ready version) (2) change the Proceeding ... of ICML 2010 to 2014 so PDF's metadata will show up % correctly +% +% Modified by Sanjoy Dasgupta, 2013: changed years, location +% +% Modified by Francesco Figari, 2012: changed years, location +% +% Modified by Christoph Sawade and Tobias Scheffer, 2011: added line +% numbers, changed years +% +% Modified by Hal Daume III, 2010: changed years, added hyperlinks +% +% Modified by Kiri Wagstaff, 2009: changed years +% +% Modified by Sam Roweis, 2008: changed years +% +% Modified by Ricardo Silva, 2007: update of the ifpdf verification +% +% Modified by Prasad Tadepalli and Andrew Moore, merely changing years. +% +% Modified by Kristian Kersting, 2005, based on Jennifer Dy's 2004 version +% - running title. If the original title is to long or is breaking a line, +% use \icmltitlerunning{...} in the preamble to supply a shorter form. +% Added fancyhdr package to get a running head. +% - Updated to store the page size because pdflatex does compile the +% page size into the pdf. +% +% Hacked by Terran Lane, 2003: +% - Updated to use LaTeX2e style file conventions (ProvidesPackage, +% etc.) +% - Added an ``appearing in'' block at the base of the first column +% (thus keeping the ``appearing in'' note out of the bottom margin +% where the printer should strip in the page numbers). +% - Added a package option [accepted] that selects between the ``Under +% review'' notice (default, when no option is specified) and the +% ``Appearing in'' notice (for use when the paper has been accepted +% and will appear). +% +% Originally created as: ml2k.sty (LaTeX style file for ICML-2000) +% by P. Langley (12/23/99) + +%%%%%%%%%%%%%%%%%%%% +%% This version of the style file supports both a ``review'' version +%% and a ``final/accepted'' version. The difference is only in the +%% text that appears in the note at the bottom of the first column of +%% the first page. The default behavior is to print a note to the +%% effect that the paper is under review and don't distribute it. The +%% final/accepted version prints an ``Appearing in'' note. To get the +%% latter behavior, in the calling file change the ``usepackage'' line +%% from: +%% \usepackage{icml2015} +%% to +%% \usepackage[accepted]{icml2015} +%%%%%%%%%%%%%%%%%%%% + +\NeedsTeXFormat{LaTeX2e} +\ProvidesPackage{icml2015}[2015/01/01 v2.0 ICML Conference Style File] + +% Use fancyhdr package +\RequirePackage{fancyhdr} +\RequirePackage{color} +\RequirePackage{algorithm} +\RequirePackage{algorithmic} +\RequirePackage{natbib} +\RequirePackage{eso-pic} % used by \AddToShipoutPicture + +%%%%%%%% Options +\DeclareOption{accepted}{% + \renewcommand{\Notice@String}{\ICML@appearing} + \gdef\isaccepted{1} +} +\DeclareOption{nohyperref}{% + \gdef\nohyperref{1} +} + +\ifdefined\nohyperref\else\ifdefined\hypersetup + \definecolor{mydarkblue}{rgb}{0,0.08,0.45} + \hypersetup{ % + pdftitle={}, + pdfauthor={}, + pdfsubject={Proceedings of the International Conference on Machine Learning 2015}, + pdfkeywords={}, + pdfborder=0 0 0, + pdfpagemode=UseNone, + colorlinks=true, + linkcolor=mydarkblue, + citecolor=mydarkblue, + filecolor=mydarkblue, + urlcolor=mydarkblue, + pdfview=FitH} + + \ifdefined\isaccepted \else + \hypersetup{pdfauthor={Anonymous Submission}} + \fi +\fi\fi + +%%%%%%%%%%%%%%%%%%%% +% This string is printed at the bottom of the page for the +% final/accepted version of the ``appearing in'' note. Modify it to +% change that text. +%%%%%%%%%%%%%%%%%%%% +\newcommand{\ICML@appearing}{\textit{Proceedings of the +$\mathit{32}^{nd}$ International Conference on Machine Learning}, +Lille, France, 2015. JMLR: W\&CP volume 37. +Copyright 2015 by the author(s).} + +%%%%%%%%%%%%%%%%%%%% +% This string is printed at the bottom of the page for the draft/under +% review version of the ``appearing in'' note. Modify it to change +% that text. +%%%%%%%%%%%%%%%%%%%% +\newcommand{\Notice@String}{Preliminary work. Under review by the +International Conference on Machine Learning (ICML). Do not distribute.} + +% Cause the declared options to actually be parsed and activated +\ProcessOptions\relax + +% Uncomment the following for debugging. It will cause LaTeX to dump +% the version of the ``appearing in'' string that will actually appear +% in the document. +%\typeout{>> Notice string='\Notice@String'} + +% Change citation commands to be more like old ICML styles +\newcommand{\yrcite}[1]{\citeyearpar{#1}} +\renewcommand{\cite}[1]{\citep{#1}} + + +%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% +% to ensure the letter format is used. pdflatex does compile the +% page size into the pdf. This is done using \pdfpagewidth and +% \pdfpageheight. As Latex does not know this directives, we first +% check whether pdflatex or latex is used. +% +% Kristian Kersting 2005 +% +% in order to account for the more recent use of pdfetex as the default +% compiler, I have changed the pdf verification. +% +% Ricardo Silva 2007 +%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% + +\paperwidth=8.5in +\paperheight=11in + +% old PDFLaTex verification, circa 2005 +% +%\newif\ifpdf\ifx\pdfoutput\undefined +% \pdffalse % we are not running PDFLaTeX +%\else +% \pdfoutput=1 % we are running PDFLaTeX +% \pdftrue +%\fi + +\newif\ifpdf %adapted from ifpdf.sty +\ifx\pdfoutput\undefined +\else + \ifx\pdfoutput\relax + \else + \ifcase\pdfoutput + \else + \pdftrue + \fi + \fi +\fi + +\ifpdf +% \pdfpagewidth=\paperwidth +% \pdfpageheight=\paperheight + \setlength{\pdfpagewidth}{8.5in} + \setlength{\pdfpageheight}{11in} +\fi + +% Physical page layout + +\evensidemargin -0.23in +\oddsidemargin -0.23in +\setlength\textheight{9.0in} +\setlength\textwidth{6.75in} +\setlength\columnsep{0.25in} +\setlength\headheight{10pt} +\setlength\headsep{10pt} +\addtolength{\topmargin}{-20pt} + +%\setlength\headheight{1em} +%\setlength\headsep{1em} +\addtolength{\topmargin}{-0.29in} + +%\addtolength{\topmargin}{-2em} + +%% The following is adapted from code in the acmconf.sty conference +%% style file. The constants in it are somewhat magical, and appear +%% to work well with the two-column format on US letter paper that +%% ICML uses, but will break if you change that layout, or if you use +%% a longer block of text for the copyright notice string. Fiddle with +%% them if necessary to get the block to fit/look right. +%% +%% -- Terran Lane, 2003 +%% +%% The following comments are included verbatim from acmconf.sty: +%% +%%% This section (written by KBT) handles the 1" box in the lower left +%%% corner of the left column of the first page by creating a picture, +%%% and inserting the predefined string at the bottom (with a negative +%%% displacement to offset the space allocated for a non-existent +%%% caption). +%%% +\def\ftype@copyrightbox{8} +\def\@copyrightspace{ +% Create a float object positioned at the bottom of the column. Note +% that because of the mystical nature of floats, this has to be called +% before the first column is populated with text (e.g., from the title +% or abstract blocks). Otherwise, the text will force the float to +% the next column. -- TDRL. +\@float{copyrightbox}[b] +\begin{center} +\setlength{\unitlength}{1pc} +\begin{picture}(20,1.5) +% Create a line separating the main text from the note block. +% 4.818pc==0.8in. +\put(0,2.5){\line(1,0){4.818}} +% Insert the text string itself. Note that the string has to be +% enclosed in a parbox -- the \put call needs a box object to +% position. Without the parbox, the text gets splattered across the +% bottom of the page semi-randomly. The 19.75pc distance seems to be +% the width of the column, though I can't find an appropriate distance +% variable to substitute here. -- TDRL. +\put(0,0){\parbox[b]{19.75pc}{\small \Notice@String}} +\end{picture} +\end{center} +\end@float} + +% Note: A few Latex versions need the next line instead of the former. +% \addtolength{\topmargin}{0.3in} +% \setlength\footheight{0pt} +\setlength\footskip{0pt} +%\pagestyle{empty} +\flushbottom \twocolumn +\sloppy + +% Clear out the addcontentsline command +\def\addcontentsline#1#2#3{} + +%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% +%%% commands for formatting paper title, author names, and addresses. + +%%start%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% +%%%%%% title as running head -- Kristian Kersting 2005 %%%%%%%%%%%%% + + +%\makeatletter +%\newtoks\mytoksa +%\newtoks\mytoksb +%\newcommand\addtomylist[2]{% +% \mytoksa\expandafter{#1}% +% \mytoksb{#2}% +% \edef#1{\the\mytoksa\the\mytoksb}% +%} +%\makeatother + +% box to check the size of the running head +\newbox\titrun + +% general page style +\pagestyle{fancy} +\fancyhf{} +\fancyhead{} +\fancyfoot{} +% set the width of the head rule to 1 point +\renewcommand{\headrulewidth}{1pt} + +% definition to set the head as running head in the preamble +\def\icmltitlerunning#1{\gdef\@icmltitlerunning{#1}} + +% main definition adapting \icmltitle from 2004 +\long\def\icmltitle#1{% + + %check whether @icmltitlerunning exists + % if not \icmltitle is used as running head + \ifx\undefined\@icmltitlerunning% + \gdef\@icmltitlerunning{#1} + \fi + + %add it to pdf information + \ifdefined\nohyperref\else\ifdefined\hypersetup + \hypersetup{pdftitle={#1}} + \fi\fi + + %get the dimension of the running title + \global\setbox\titrun=\vbox{\small\bf\@icmltitlerunning} + + % error flag + \gdef\@runningtitleerror{0} + + % running title too long + \ifdim\wd\titrun>\textwidth% + {\gdef\@runningtitleerror{1}}% + % running title breaks a line + \else\ifdim\ht\titrun>6.25pt + {\gdef\@runningtitleerror{2}}% + \fi + \fi + + % if there is somthing wrong with the running title + \ifnum\@runningtitleerror>0 + \typeout{}% + \typeout{}% + \typeout{*******************************************************}% + \typeout{Title exceeds size limitations for running head.}% + \typeout{Please supply a shorter form for the running head} + \typeout{with \string\icmltitlerunning{...}\space prior to \string\begin{document}}% + \typeout{*******************************************************}% + \typeout{}% + \typeout{}% + % set default running title + \chead{\small\bf Title Suppressed Due to Excessive Size}% + \else + % 'everything' fine, set provided running title + \chead{\small\bf\@icmltitlerunning}% + \fi + + % no running title on the first page of the paper + \thispagestyle{empty} + +%%%%%%%%%%%%%%%%%%%% Kristian Kersting %%%%%%%%%%%%%%%%%%%%%%%%% +%end%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% + + {\center\baselineskip 18pt + \toptitlebar{\Large\bf #1}\bottomtitlebar} +} + + +\gdef\icmlfullauthorlist{} +\newcommand\addstringtofullauthorlist{\g@addto@macro\icmlfullauthorlist} +\newcommand\addtofullauthorlist[1]{% + \ifdefined\icmlanyauthors + \addstringtofullauthorlist{, #1} + \else + \addstringtofullauthorlist{#1}% + \gdef\icmlanyauthors{1} + \fi + \ifdefined\nohyperref\else\ifdefined\hypersetup + \hypersetup{pdfauthor=\icmlfullauthorlist} + \fi\fi} + + +\def\toptitlebar{\hrule height1pt \vskip .25in} +\def\bottomtitlebar{\vskip .22in \hrule height1pt \vskip .3in} +\def\icmlauthor#1#2{% + \ifdefined\isaccepted + \par {\bf #1} \hfill {\sc #2}% + \addtofullauthorlist{#1} + \fi +} +\long\def\icmladdress#1{% + \ifdefined\isaccepted + \par\vskip 0.03in #1 \vskip 0.10in + \fi +} + +%% keywords as first class citizens +\def\icmlkeywords#1{% +% \ifdefined\isaccepted \else +% \par {\bf Keywords:} #1% +% \fi +% \ifdefined\nohyperref\else\ifdefined\hypersetup +% \hypersetup{pdfkeywords={#1}} +% \fi\fi +% \ifdefined\isaccepted \else +% \par {\bf Keywords:} #1% +% \fi + \ifdefined\nohyperref\else\ifdefined\hypersetup + \hypersetup{pdfkeywords={#1}} + \fi\fi +} + +% modification to natbib citations +\setcitestyle{authoryear,round,citesep={;},aysep={,},yysep={;}} + +% Redefinition of the abstract environment. +\renewenvironment{abstract} + {% +% Insert the ``appearing in'' copyright notice. +\@copyrightspace +\centerline{\large\bf Abstract} + \vspace{-0.12in}\begin{quote}} + {\par\end{quote}\vskip 0.12in} + +% numbered section headings with different treatment of numbers + +\def\@startsection#1#2#3#4#5#6{\if@noskipsec \leavevmode \fi + \par \@tempskipa #4\relax + \@afterindenttrue +% Altered the following line to indent a section's first paragraph. +% \ifdim \@tempskipa <\z@ \@tempskipa -\@tempskipa \@afterindentfalse\fi + \ifdim \@tempskipa <\z@ \@tempskipa -\@tempskipa \fi + \if@nobreak \everypar{}\else + \addpenalty{\@secpenalty}\addvspace{\@tempskipa}\fi \@ifstar + {\@ssect{#3}{#4}{#5}{#6}}{\@dblarg{\@sict{#1}{#2}{#3}{#4}{#5}{#6}}}} + +\def\@sict#1#2#3#4#5#6[#7]#8{\ifnum #2>\c@secnumdepth + \def\@svsec{}\else + \refstepcounter{#1}\edef\@svsec{\csname the#1\endcsname}\fi + \@tempskipa #5\relax + \ifdim \@tempskipa>\z@ + \begingroup #6\relax + \@hangfrom{\hskip #3\relax\@svsec.~}{\interlinepenalty \@M #8\par} + \endgroup + \csname #1mark\endcsname{#7}\addcontentsline + {toc}{#1}{\ifnum #2>\c@secnumdepth \else + \protect\numberline{\csname the#1\endcsname}\fi + #7}\else + \def\@svsechd{#6\hskip #3\@svsec #8\csname #1mark\endcsname + {#7}\addcontentsline + {toc}{#1}{\ifnum #2>\c@secnumdepth \else + \protect\numberline{\csname the#1\endcsname}\fi + #7}}\fi + \@xsect{#5}} + +\def\@sect#1#2#3#4#5#6[#7]#8{\ifnum #2>\c@secnumdepth + \def\@svsec{}\else + \refstepcounter{#1}\edef\@svsec{\csname the#1\endcsname\hskip 0.4em }\fi + \@tempskipa #5\relax + \ifdim \@tempskipa>\z@ + \begingroup #6\relax + \@hangfrom{\hskip #3\relax\@svsec}{\interlinepenalty \@M #8\par} + \endgroup + \csname #1mark\endcsname{#7}\addcontentsline + {toc}{#1}{\ifnum #2>\c@secnumdepth \else + \protect\numberline{\csname the#1\endcsname}\fi + #7}\else + \def\@svsechd{#6\hskip #3\@svsec #8\csname #1mark\endcsname + {#7}\addcontentsline + {toc}{#1}{\ifnum #2>\c@secnumdepth \else + \protect\numberline{\csname the#1\endcsname}\fi + #7}}\fi + \@xsect{#5}} + +% section headings with less space above and below them +\def\thesection {\arabic{section}} +\def\thesubsection {\thesection.\arabic{subsection}} +\def\section{\@startsection{section}{1}{\z@}{-0.12in}{0.02in} + {\large\bf\raggedright}} +\def\subsection{\@startsection{subsection}{2}{\z@}{-0.10in}{0.01in} + {\normalsize\bf\raggedright}} +\def\subsubsection{\@startsection{subsubsection}{3}{\z@}{-0.08in}{0.01in} + {\normalsize\sc\raggedright}} +\def\paragraph{\@startsection{paragraph}{4}{\z@}{1.5ex plus + 0.5ex minus .2ex}{-1em}{\normalsize\bf}} +\def\subparagraph{\@startsection{subparagraph}{5}{\z@}{1.5ex plus + 0.5ex minus .2ex}{-1em}{\normalsize\bf}} + +% Footnotes +\footnotesep 6.65pt % +\skip\footins 9pt +\def\footnoterule{\kern-3pt \hrule width 0.8in \kern 2.6pt } +\setcounter{footnote}{0} + +% Lists and paragraphs +\parindent 0pt +\topsep 4pt plus 1pt minus 2pt +\partopsep 1pt plus 0.5pt minus 0.5pt +\itemsep 2pt plus 1pt minus 0.5pt +\parsep 2pt plus 1pt minus 0.5pt +\parskip 6pt + +\leftmargin 2em \leftmargini\leftmargin \leftmarginii 2em +\leftmarginiii 1.5em \leftmarginiv 1.0em \leftmarginv .5em +\leftmarginvi .5em +\labelwidth\leftmargini\advance\labelwidth-\labelsep \labelsep 5pt + +\def\@listi{\leftmargin\leftmargini} +\def\@listii{\leftmargin\leftmarginii + \labelwidth\leftmarginii\advance\labelwidth-\labelsep + \topsep 2pt plus 1pt minus 0.5pt + \parsep 1pt plus 0.5pt minus 0.5pt + \itemsep \parsep} +\def\@listiii{\leftmargin\leftmarginiii + \labelwidth\leftmarginiii\advance\labelwidth-\labelsep + \topsep 1pt plus 0.5pt minus 0.5pt + \parsep \z@ \partopsep 0.5pt plus 0pt minus 0.5pt + \itemsep \topsep} +\def\@listiv{\leftmargin\leftmarginiv + \labelwidth\leftmarginiv\advance\labelwidth-\labelsep} +\def\@listv{\leftmargin\leftmarginv + \labelwidth\leftmarginv\advance\labelwidth-\labelsep} +\def\@listvi{\leftmargin\leftmarginvi + \labelwidth\leftmarginvi\advance\labelwidth-\labelsep} + +\abovedisplayskip 7pt plus2pt minus5pt% +\belowdisplayskip \abovedisplayskip +\abovedisplayshortskip 0pt plus3pt% +\belowdisplayshortskip 4pt plus3pt minus3pt% + +% Less leading in most fonts (due to the narrow columns) +% The choices were between 1-pt and 1.5-pt leading +\def\@normalsize{\@setsize\normalsize{11pt}\xpt\@xpt} +\def\small{\@setsize\small{10pt}\ixpt\@ixpt} +\def\footnotesize{\@setsize\footnotesize{10pt}\ixpt\@ixpt} +\def\scriptsize{\@setsize\scriptsize{8pt}\viipt\@viipt} +\def\tiny{\@setsize\tiny{7pt}\vipt\@vipt} +\def\large{\@setsize\large{14pt}\xiipt\@xiipt} +\def\Large{\@setsize\Large{16pt}\xivpt\@xivpt} +\def\LARGE{\@setsize\LARGE{20pt}\xviipt\@xviipt} +\def\huge{\@setsize\huge{23pt}\xxpt\@xxpt} +\def\Huge{\@setsize\Huge{28pt}\xxvpt\@xxvpt} + +% Revised formatting for figure captions and table titles. +\newsavebox\captionbox\newdimen\captionboxwid + +\long\def\@makecaption#1#2{ + \vskip 10pt + \baselineskip 11pt + \setbox\@tempboxa\hbox{#1. #2} + \ifdim \wd\@tempboxa >\hsize + \sbox{\captionbox}{\small\sl #1.~} + \captionboxwid=\wd\captionbox + \usebox\captionbox {\footnotesize #2} +% \usebox\captionbox {\small #2} + \else + \centerline{{\small\sl #1.} {\small #2}} + \fi} + +\def\fnum@figure{Figure \thefigure} +\def\fnum@table{Table \thetable} + +% Strut macros for skipping spaces above and below text in tables. +\def\abovestrut#1{\rule[0in]{0in}{#1}\ignorespaces} +\def\belowstrut#1{\rule[-#1]{0in}{#1}\ignorespaces} + +\def\abovespace{\abovestrut{0.20in}} +\def\aroundspace{\abovestrut{0.20in}\belowstrut{0.10in}} +\def\belowspace{\belowstrut{0.10in}} + +% Various personal itemization commands. +\def\texitem#1{\par\noindent\hangindent 12pt + \hbox to 12pt {\hss #1 ~}\ignorespaces} +\def\icmlitem{\texitem{$\bullet$}} + +% To comment out multiple lines of text. +\long\def\comment#1{} + + + + +%% Line counter (not in final version). Adapted from NIPS style file by Christoph Sawade + +% Vertical Ruler +% This code is, largely, from the CVPR 2010 conference style file +% ----- define vruler +\makeatletter +\newbox\icmlrulerbox +\newcount\icmlrulercount +\newdimen\icmlruleroffset +\newdimen\cv@lineheight +\newdimen\cv@boxheight +\newbox\cv@tmpbox +\newcount\cv@refno +\newcount\cv@tot +% NUMBER with left flushed zeros \fillzeros[<WIDTH>]<NUMBER> +\newcount\cv@tmpc@ \newcount\cv@tmpc +\def\fillzeros[#1]#2{\cv@tmpc@=#2\relax\ifnum\cv@tmpc@<0\cv@tmpc@=-\cv@tmpc@\fi +\cv@tmpc=1 % +\loop\ifnum\cv@tmpc@<10 \else \divide\cv@tmpc@ by 10 \advance\cv@tmpc by 1 \fi + \ifnum\cv@tmpc@=10\relax\cv@tmpc@=11\relax\fi \ifnum\cv@tmpc@>10 \repeat +\ifnum#2<0\advance\cv@tmpc1\relax-\fi +\loop\ifnum\cv@tmpc<#1\relax0\advance\cv@tmpc1\relax\fi \ifnum\cv@tmpc<#1 \repeat +\cv@tmpc@=#2\relax\ifnum\cv@tmpc@<0\cv@tmpc@=-\cv@tmpc@\fi \relax\the\cv@tmpc@}% +% \makevruler[<SCALE>][<INITIAL_COUNT>][<STEP>][<DIGITS>][<HEIGHT>] +\def\makevruler[#1][#2][#3][#4][#5]{ + \begingroup\offinterlineskip + \textheight=#5\vbadness=10000\vfuzz=120ex\overfullrule=0pt% + \global\setbox\icmlrulerbox=\vbox to \textheight{% + { + \parskip=0pt\hfuzz=150em\cv@boxheight=\textheight + \cv@lineheight=#1\global\icmlrulercount=#2% + \cv@tot\cv@boxheight\divide\cv@tot\cv@lineheight\advance\cv@tot2% + \cv@refno1\vskip-\cv@lineheight\vskip1ex% + \loop\setbox\cv@tmpbox=\hbox to0cm{ % side margin + \hfil {\hfil\fillzeros[#4]\icmlrulercount} + }% + \ht\cv@tmpbox\cv@lineheight\dp\cv@tmpbox0pt\box\cv@tmpbox\break + \advance\cv@refno1\global\advance\icmlrulercount#3\relax + \ifnum\cv@refno<\cv@tot\repeat + } + } + \endgroup +}% +\makeatother +% ----- end of vruler + + +% \makevruler[<SCALE>][<INITIAL_COUNT>][<STEP>][<DIGITS>][<HEIGHT>] +\def\icmlruler#1{\makevruler[12pt][#1][1][3][\textheight]\usebox{\icmlrulerbox}} +\AddToShipoutPicture{% +\icmlruleroffset=\textheight +\advance\icmlruleroffset by 5.2pt % top margin + \color[rgb]{.7,.7,.7} + \ifdefined\isaccepted \else + \AtTextUpperLeft{% + \put(\LenToUnit{-35pt},\LenToUnit{-\icmlruleroffset}){%left ruler + \icmlruler{\icmlrulercount}} + \put(\LenToUnit{1.04\textwidth},\LenToUnit{-\icmlruleroffset}){%right ruler + \icmlruler{\icmlrulercount}} + } + \fi +} +\endinput diff --git a/finale/sections/active.tex b/finale/sections/active.tex new file mode 100644 index 0000000..84cf4c6 --- /dev/null +++ b/finale/sections/active.tex @@ -0,0 +1,9 @@ +intro (motivation, description) + +mutual information approach + +two approx: + +- first step truncation + +- variance in lieu of MI diff --git a/finale/sections/bayesian.tex b/finale/sections/bayesian.tex new file mode 100644 index 0000000..04ba7b3 --- /dev/null +++ b/finale/sections/bayesian.tex @@ -0,0 +1,9 @@ +advantages, disadvantages + +graphical model and description + +MCMC + +variational inference + +Bohning diff --git a/finale/sections/experiments.tex b/finale/sections/experiments.tex new file mode 100644 index 0000000..c9cf762 --- /dev/null +++ b/finale/sections/experiments.tex @@ -0,0 +1,7 @@ +implementation: PyMC (scalability), blocks + +baseline + +graphs/datasets + +bullshit diff --git a/finale/sections/intro.tex b/finale/sections/intro.tex new file mode 100644 index 0000000..56f31b7 --- /dev/null +++ b/finale/sections/intro.tex @@ -0,0 +1,11 @@ +\begin{itemize} + \item graph inference: what is the proble? what is an observation, + contagion model + \item prior work:Â sample complexity with MLE + \item here: bayesian approach + \begin{itemize} + \item natural framework for active learning wwith significant + speedup over passive + \end{itemize} +\end{itemize} +\input{sections/related.tex} diff --git a/finale/sections/model.tex b/finale/sections/model.tex new file mode 100644 index 0000000..cb8b699 --- /dev/null +++ b/finale/sections/model.tex @@ -0,0 +1,68 @@ +The GLC model is described over a directed graph $G = (V, \Theta)$. Denoting by +$k=|V|$ the number of nodes in the graph, $\Theta\in\R_{+}^{k\times k}$ is the +matrix of edge weights. Note that $\Theta$ implicitly defines the edge set $E$ of +the graph through the following equivalence: +\begin{displaymath} + (u,v)\in E\Leftrightarrow \Theta_{u,v} > 0,\quad + (u,v)\in V^2 +\end{displaymath} + +The time is discretized and indexed by a variable $t\in\N$. The nodes can be in +one of three states: \emph{susceptible}, \emph{infected} or \emph{immune}. +Let us denote by $S_t$ the set of nodes susceptible at the beginning of time +step $t\in\N$ and by $I_t$ the set of nodes who become infected at this time +step. The following dynamics: +\begin{displaymath} + S_0 = V,\quad S_{t+1} = S_t \setminus I_t +\end{displaymath} +expresses that the nodes infected at a time step are no longer susceptible +starting from the next time step (they become part of the immune nodes). + +The dynamics of $I_t$ are described by a random Markovian process. Let us +denote by $x_t$ the indicator vector of $I_t$ at time step $t\in\N$. $x_0$ is +drawn from a \emph{source distribution} $p_s:\{0,1\}^n\to[0,1]$. For $t\geq 1$, +we have: +\begin{equation} + \label{eq:markov} + \forall i\in S_t,\quad + \P\big(x_{i}^{t} = 1\,|\, x^{t-1}\big) = f(\bt_i\cdot x^{t-1}) +\end{equation} +where $\bt_i$ is the $i$th column of $\Theta$. The function $f:\R\to[0,1]$ can +be interpreted as the inverse link function of the model. Finally, the +transitions in \cref{eq:markov} occur independently for each $i$. A cascade +continues until no infected nodes remains. + +We refer the reader to \cite{pouget} for a more complete description of the +model and examples of common contagion models which can be interpreted as +specific instances of the GLC model. + +It follows from Section 2, that a source distribution $p_s$ and +\cref{eq:markov} together completely specify the distribution $p$ of a cascade +$\mathbf{x} = (x_t)_{t\geq 0}$: +\begin{equation} + \label{eq:dist} + \mathcal{L}_{\Theta}(\bx) + = p_s(x^0)\prod_{\substack{t\geq 1 \\ i\in S_t}} + f(\bt_i\cdot x^{t-1})^{x^t_i}\big(1-f(\theta_i\cdot x^{t-1})\big)^{1-x_i^t} +\end{equation} + +\paragraph{MLE estimation.} +It follows from the form of \cref{eq:dist} that the log-likelihood of $\Theta$ +given cascade data can be written as the sum of $k$ terms, each term $i$ only +depending on $\bt_i$. Hence, each $\bt_i$ can be learnt separately by solving +a node-specific optimization problem. Specifically, for a given node $i$, if we +concatenate together all the time steps $t$ where this node was susceptible and +write $y^t = x^{t+1}_i$, \emph{i.e} whether or not the node became infected at +the next time step, the MLE estimator for $\bt_i$ is obtained by solving the +following optimization problem: +\begin{equation} + \label{eq:mle} + \hat{\theta}\in \argmax_\theta \sum_{t} y^t\log f(\theta\cdot x^t) + + (1-y^t) \log \big(1 - f(\theta\cdot x^t)\big) +\end{equation} +It is interesting to note that at the node-level, doing MLE inference for the +GLC model is exactly amounts to fitting a Generalized Linear Model. When $f$ is +log-concave as is the case in most examples of GLC models, then the above +optimization problem becomes a convex optimization problem which can be solved +exactly and efficiently. The code to perform MLE estimation can be found in the +appendix, file \textsf{mle.py}. diff --git a/finale/sections/related.tex b/finale/sections/related.tex new file mode 100644 index 0000000..59fb759 --- /dev/null +++ b/finale/sections/related.tex @@ -0,0 +1,41 @@ +\paragraph{Related works.} +The study of edge prediction in graphs has been an active field of research for +over a decade~\cite{Nowell08, Leskovec07, AdarA05}.~\cite{GomezRodriguez:2010} +introduced the {\scshape Netinf} algorithm, which approximates the likelihood of +cascades represented as a continuous process. The algorithm, relying on +Maximum-Likelihood and convex relaxations was improved in later +work~\cite{gomezbalduzzi:2011}, but is not known to have any theoretical +guarantees beside empirical validation on synthetic networks. + +Let us denote by $m$ the number of nodes in the graph and for a given node, we +denote by $s$ its in-degree. In what follows, we call a \emph{recovery +guarantee} an upper bound on the number of observations required (expressed as +a function of $s$ and $m$) to learn the incoming edges of a node to a fixed +arbitrary accuracy level. \cite{Netrapalli:2012} studied the discrete-time +version of the independent cascade model and obtained the first ${\cal O}(s^2 +\log m)$ recovery guarantee on general networks, by using unregularized MLE and +making a {\it correlation decay\/} assumption, which limits the number of new +infections at every step. They also suggest a {\scshape Greedy} algorithm, +with provably good performance in tree graphs, which maintains a counter of +each node's antecedents, i.e. the set of nodes infected at a prior time step to +its infection time. The work of~\cite{Abrahao:13} studies the same +continuous-model framework as \cite{GomezRodriguez:2010} and obtains an ${\cal +O}(s^9 \log^2 s \log m)$ support recovery algorithm, without the +\emph{correlation decay} assumption. \cite{du2013uncover,Daneshmand:2014} +propose Lasso regularization of MLE for recovering the weights of the graph +under a continuous-time independent cascade model. The work +of~\cite{du2014influence} is slightly orthogonal to ours since they suggest +learning the \emph{influence} function, rather than the parameters of the +network directly. + +More recently, the continuous process studied in previous work has been +reformulated as a Hawkes process, with recent papers +\cite{linderman2014discovering, linderman2015scalable, simma2012modeling}, +focusing on Expectation-Maximization, and Variational Inference methods to learn +these processes. Because of the discrete nature of the GLC model, we hope to +bring a better understanding to the link between the properties of a graph and +its \emph{learnability}. We wish to further explore the idea of non-product +priors raised in \cite{linderman2014discovering, linderman2015scalable}, since +the experimental validation of their work focused on simple graph priors. +Finally, the \emph{Active Learning} formulation is, to the best of the +authors' knowledge, novel in this context. diff --git a/finale/sections/relatex.tex b/finale/sections/relatex.tex new file mode 100644 index 0000000..366ae04 --- /dev/null +++ b/finale/sections/relatex.tex @@ -0,0 +1,2 @@ +pomme + |
