-
Notifications
You must be signed in to change notification settings - Fork 25
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Signed-off-by: Harsh Menon <[email protected]>
- Loading branch information
Showing
13 changed files
with
4,291 additions
and
0 deletions.
There are no files selected for viewing
Binary file not shown.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,78 @@ | ||
| % ALGORITHM STYLE -- Released 8 April 1996 | ||
| % for LaTeX-2e | ||
| % Copyright -- 1994 Peter Williams | ||
| % E-mail [email protected] | ||
| \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}} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,187 @@ | ||
| % ALGORITHMIC STYLE -- Released 8 APRIL 1996 | ||
| % for LaTeX version 2e | ||
| % Copyright -- 1994 Peter Williams | ||
| % E-mail [email protected] | ||
| % | ||
| % Modified by Alex Smola (08/2000) | ||
| % E-mail [email protected] | ||
| % | ||
| \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}} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,45 @@ | ||
| \relax | ||
| \providecommand\hyper@newdestlabel[2]{} | ||
| \providecommand\HyperFirstAtBeginDocument{\AtBeginDocument} | ||
| \HyperFirstAtBeginDocument{\ifx\hyper@anchor\@undefined | ||
| \global\let\oldnewlabel\newlabel | ||
| \gdef\newlabel#1#2{\newlabelxx{#1}#2} | ||
| \gdef\newlabelxx#1#2#3#4#5#6{\oldnewlabel{#1}{{#2}{#3}}} | ||
| \AtEndDocument{\ifx\hyper@anchor\@undefined | ||
| \let\newlabel\oldnewlabel | ||
| \fi} | ||
| \fi} | ||
| \global\let\hyper@last\relax | ||
| \gdef\HyperFirstAtBeginDocument#1{#1} | ||
| \providecommand\HyField@AuxAddToFields[1]{} | ||
| \providecommand\HyField@AuxAddToCoFields[2]{} | ||
| \newlabel{submission}{{1}{1}{}{section.1}{}} | ||
| \citation{langley00} | ||
| \newlabel{author info}{{2.3}{2}{}{subsection.2.3}{}} | ||
| \citation{anonymous} | ||
| \newlabel{final author}{{2.3.2}{3}{}{subsubsection.2.3.2}{}} | ||
| \citation{Samuel59} | ||
| \citation{Samuel59} | ||
| \citation{kearns89,Samuel59,mitchell80} | ||
| \citation{MachineLearningI} | ||
| \citation{Samuel59} | ||
| \citation{langley00} | ||
| \citation{Newell81} | ||
| \citation{DudaHart2nd} | ||
| \citation{MachineLearningI} | ||
| \citation{mitchell80} | ||
| \citation{kearns89} | ||
| \newlabel{alg:example}{{1}{4}{}{algorithm.1}{}} | ||
| \newlabel{sample-table}{{1}{4}{Classification accuracies for naive Bayes and flexible Bayes on various data sets}{table.1}{}} | ||
| \citation{langley00} | ||
| \bibdata{example_paper} | ||
| \bibcite{anonymous}{{1}{2018}{{Author}}{{}}} | ||
| \bibcite{DudaHart2nd}{{2}{2000}{{Duda et~al.}}{{Duda, Hart, and Stork}}} | ||
| \bibcite{kearns89}{{3}{1989}{{Kearns}}{{}}} | ||
| \bibcite{langley00}{{4}{2000}{{Langley}}{{}}} | ||
| \bibcite{MachineLearningI}{{5}{1983}{{Michalski et~al.}}{{Michalski, Carbonell, and Mitchell}}} | ||
| \bibcite{mitchell80}{{6}{1980}{{Mitchell}}{{}}} | ||
| \bibcite{Newell81}{{7}{1981}{{Newell \& Rosenbloom}}{{Newell and Rosenbloom}}} | ||
| \bibcite{Samuel59}{{8}{1959}{{Samuel}}{{}}} | ||
| \bibstyle{mlsys2024} | ||
| \gdef \@abspage@last{5} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,54 @@ | ||
| \begin{thebibliography}{8} | ||
| \providecommand{\natexlab}[1]{#1} | ||
| \providecommand{\url}[1]{\texttt{#1}} | ||
| \expandafter\ifx\csname urlstyle\endcsname\relax | ||
| \providecommand{\doi}[1]{doi: #1}\else | ||
| \providecommand{\doi}{doi: \begingroup \urlstyle{rm}\Url}\fi | ||
|
|
||
| \bibitem[Author(2018)]{anonymous} | ||
| Author, N.~N. | ||
| \newblock Suppressed for anonymity, 2018. | ||
|
|
||
| \bibitem[Duda et~al.(2000)Duda, Hart, and Stork]{DudaHart2nd} | ||
| Duda, R.~O., Hart, P.~E., and Stork, D.~G. | ||
| \newblock \emph{Pattern Classification}. | ||
| \newblock John Wiley and Sons, 2nd edition, 2000. | ||
|
|
||
| \bibitem[Kearns(1989)]{kearns89} | ||
| Kearns, M.~J. | ||
| \newblock \emph{Computational Complexity of Machine Learning}. | ||
| \newblock PhD thesis, Department of Computer Science, Harvard University, 1989. | ||
|
|
||
| \bibitem[Langley(2000)]{langley00} | ||
| Langley, P. | ||
| \newblock Crafting papers on machine learning. | ||
| \newblock In Langley, P. (ed.), \emph{Proceedings of the 17th International | ||
| Conference on Machine Learning (ICML 2000)}, pp.\ 1207--1216, Stanford, CA, | ||
| 2000. Morgan Kaufmann. | ||
|
|
||
| \bibitem[Michalski et~al.(1983)Michalski, Carbonell, and | ||
| Mitchell]{MachineLearningI} | ||
| Michalski, R.~S., Carbonell, J.~G., and Mitchell, T.~M. (eds.). | ||
| \newblock \emph{Machine Learning: An Artificial Intelligence Approach, Vol. I}. | ||
| \newblock Tioga, Palo Alto, CA, 1983. | ||
|
|
||
| \bibitem[Mitchell(1980)]{mitchell80} | ||
| Mitchell, T.~M. | ||
| \newblock The need for biases in learning generalizations. | ||
| \newblock Technical report, Computer Science Department, Rutgers University, | ||
| New Brunswick, MA, 1980. | ||
|
|
||
| \bibitem[Newell \& Rosenbloom(1981)Newell and Rosenbloom]{Newell81} | ||
| Newell, A. and Rosenbloom, P.~S. | ||
| \newblock Mechanisms of skill acquisition and the law of practice. | ||
| \newblock In Anderson, J.~R. (ed.), \emph{Cognitive Skills and Their | ||
| Acquisition}, chapter~1, pp.\ 1--51. Lawrence Erlbaum Associates, Inc., | ||
| Hillsdale, NJ, 1981. | ||
|
|
||
| \bibitem[Samuel(1959)]{Samuel59} | ||
| Samuel, A.~L. | ||
| \newblock Some studies in machine learning using the game of checkers. | ||
| \newblock \emph{IBM Journal of Research and Development}, 3\penalty0 | ||
| (3):\penalty0 211--229, 1959. | ||
|
|
||
| \end{thebibliography} |
Oops, something went wrong.