ML Conference Paper (NeurIPS / ICML / ICLR style) LaTeX Template

% ─────────────────────────────────────────────────────────────────────────
% ML CONFERENCE PAPER TEMPLATE
% Works for NeurIPS / ICML / ICLR / CVPR / AAAI submissions.
%
% To use the official style file:
%   NeurIPS: \usepackage{neurips_2025}
%   ICML:    \usepackage{icml2025}
%   ICLR:    \usepackage{iclr2025_conference}
% Download from the conference website and place next to this .tex file.
% ─────────────────────────────────────────────────────────────────────────
\documentclass{article}
% ── References: written to refs.bib at compile time ─────────────────────
% Replace these entries with your own, or delete this block and point
% \bibliography{} at your .bib file. Run pdflatex, bibtex, pdflatex x2
% (latexmk and Overleaf do it for you).
\begin{filecontents*}[overwrite]{refs.bib}
@inproceedings{vaswani2017attention,
  author    = {Vaswani, Ashish and Shazeer, Noam and Parmar, Niki and Uszkoreit, Jakob and Jones, Llion and Gomez, Aidan N. and Kaiser, {\L}ukasz and Polosukhin, Illia},
  title     = {Attention Is All You Need},
  booktitle = {Advances in Neural Information Processing Systems},
  volume    = {30},
  year      = {2017}
}
@inproceedings{devlin2019bert,
  author    = {Devlin, Jacob and Chang, Ming-Wei and Lee, Kenton and Toutanova, Kristina},
  title     = {{BERT}: Pre-training of Deep Bidirectional Transformers for Language Understanding},
  booktitle = {Proceedings of the 2019 Conference of the North {A}merican Chapter of the Association for Computational Linguistics (NAACL-HLT)},
  pages     = {4171--4186},
  year      = {2019}
}
@inproceedings{brown2020language,
  author    = {Brown, Tom B. and Mann, Benjamin and Ryder, Nick and Subbiah, Melanie and Kaplan, Jared and others},
  title     = {Language Models are Few-Shot Learners},
  booktitle = {Advances in Neural Information Processing Systems},
  volume    = {33},
  pages     = {1877--1901},
  year      = {2020}
}
@article{lecun1998gradient,
  author  = {LeCun, Yann and Bottou, L{\'e}on and Bengio, Yoshua and Haffner, Patrick},
  title   = {Gradient-Based Learning Applied to Document Recognition},
  journal = {Proceedings of the {IEEE}},
  volume  = {86},
  number  = {11},
  pages   = {2278--2324},
  year    = {1998}
}
@inproceedings{he2016deep,
  author    = {He, Kaiming and Zhang, Xiangyu and Ren, Shaoqing and Sun, Jian},
  title     = {Deep Residual Learning for Image Recognition},
  booktitle = {Proceedings of the {IEEE} Conference on Computer Vision and Pattern Recognition ({CVPR})},
  pages     = {770--778},
  year      = {2016}
}
@book{goodfellow2016deep,
  author    = {Goodfellow, Ian and Bengio, Yoshua and Courville, Aaron},
  title     = {Deep Learning},
  publisher = {MIT Press},
  year      = {2016}
}
@misc{ref1,
  author = {Author, Alice},
  title  = {[Baseline Method]},
  year   = {2023},
  note   = {Placeholder: replace with the real reference}
}
@misc{ref2,
  author = {Author, Bob},
  title  = {[Method B]},
  year   = {2024},
  note   = {Placeholder: replace with the real reference}
}
\end{filecontents*}
\usepackage[T1]{fontenc}
\usepackage{lmodern}
\usepackage[margin=2.5cm, top=2.5cm]{geometry}
\usepackage{amsmath,amssymb,amsthm}
\usepackage{graphicx}
\usepackage{booktabs}
\usepackage{algorithm}
\usepackage{algpseudocode}
\usepackage{microtype}
\usepackage{xcolor}
\usepackage{natbib}
\usepackage[hidelinks]{hyperref}

% ── Anonymous submission header (remove for camera-ready) ───────────────
\title{\textbf{Title of Your Paper}\\
  \large Submitted to [Conference Year], under review}

% For camera-ready, replace with real author block:
% \author{
%   First Author\thanks{Equal contribution.} \And Second Author \AND Third Author \\
%   University Name \quad\quad Lab / Affiliation \\
%   \texttt{\{first,second\}@university.edu}
% }
\author{Anonymous Authors}
\date{}

% ── Custom commands ─────────────────────────────────────────────────────
\newcommand{\R}{\mathbb{R}}
\newcommand{\E}{\mathbb{E}}
\newcommand{\norm}[1]{\left\|#1\right\|}
\newcommand{\KL}[2]{D_{\mathrm{KL}}\left(#1\,\|\,#2\right)}

% ── Theorem environments ────────────────────────────────────────────────
\newtheorem{theorem}{Theorem}
\newtheorem{lemma}[theorem]{Lemma}
\newtheorem{proposition}[theorem]{Proposition}
\newtheorem{corollary}[theorem]{Corollary}
\theoremstyle{definition}
\newtheorem{definition}{Definition}
\theoremstyle{remark}
\newtheorem{remark}{Remark}

\begin{document}
\maketitle

% ── Abstract ────────────────────────────────────────────────────────────
\begin{abstract}
We address [the problem] in the setting of [context].
Our main contribution is [method/result], which achieves [metric] on [benchmark],
outperforming prior work by [margin]. We provide theoretical guarantees showing [guarantee].
Code will be released at \texttt{https://github.com/anonymous/repo}.
\end{abstract}

% ── 1. Introduction ─────────────────────────────────────────────────────
\section{Introduction}
\label{sec:intro}

Start with the problem and why it matters.
\citet{vaswani2017attention} introduced the transformer architecture;
subsequent work \citep{devlin2019bert,brown2020language} showed...

\paragraph{Contributions.}
Our main contributions are:
\begin{enumerate}
  \item[(i)] A novel [method] that [property] (Section~\ref{sec:method}).
  \item[(ii)] Theoretical analysis proving \emph{[convergence rate]}
    (Theorem~\ref{thm:main}).
  \item[(iii)] Empirical evaluation showing \emph{state-of-the-art} on
    [benchmark] (Section~\ref{sec:experiments}).
\end{enumerate}

% ── 2. Related Work ─────────────────────────────────────────────────────
\section{Related Work}
\label{sec:related}

\paragraph{[Topic A].}
Prior work by \citet{lecun1998gradient} established [result].
More recently, \citet{he2016deep} showed [finding].

\paragraph{[Topic B].}
Our work differs from \citet{goodfellow2016deep} in that [key difference].

% ── 3. Method ───────────────────────────────────────────────────────────
\section{Method}
\label{sec:method}

\subsection{Problem Setup}

Let $\mathcal{X} \subset \R^d$ denote the input space and
$\mathcal{Y}$ the label space.
We observe $n$ i.i.d.~samples $(\mathbf{x}_i, y_i)_{i=1}^n$ drawn from
distribution $\mathcal{D}$ over $\mathcal{X} \times \mathcal{Y}$.
Our goal is to minimise the expected risk:
\[
  \mathcal{R}(f) = \E_{(\mathbf{x},y) \sim \mathcal{D}}[\ell(f(\mathbf{x}), y)]
\]

\subsection{Proposed Algorithm}

\begin{algorithm}[h]
  \caption{[Your Algorithm Name]}
  \label{alg:main}
  \begin{algorithmic}[1]
    \State \textbf{Input:} Dataset $\{(\mathbf{x}_i, y_i)\}_{i=1}^n$,
      learning rate $\eta > 0$, iterations $T$
    \State Initialise parameters $\theta_0 \in \R^p$
    \For{$t = 1, \ldots, T$}
      \State Sample mini-batch $\mathcal{B} \subset [n]$, $|\mathcal{B}| = b$
      \State Compute gradient $\mathbf{g}_t = \frac{1}{b}\sum_{i \in \mathcal{B}}
        \nabla_\theta \ell(f_\theta(\mathbf{x}_i), y_i)$
      \State Update $\theta_{t+1} = \theta_t - \eta \mathbf{g}_t$
    \EndFor
    \State \Return $\theta_T$
  \end{algorithmic}
\end{algorithm}

\subsection{Theoretical Analysis}

\begin{theorem}
  \label{thm:main}
  Under Assumptions [A1--A3], Algorithm~\ref{alg:main} satisfies:
  \[
    \E[\mathcal{R}(f_{\theta_T})] - \mathcal{R}^* \leq
    \frac{\|\theta_0 - \theta^*\|^2}{2\eta T} + \frac{\eta L \sigma^2}{2}
  \]
  where $L$ is the Lipschitz constant and $\sigma^2$ is the gradient variance.
\end{theorem}
\begin{proof}
  By the descent lemma for $L$-smooth functions and telescoping. $\square$
\end{proof}

% ── 4. Experiments ──────────────────────────────────────────────────────
\section{Experiments}
\label{sec:experiments}

\subsection{Setup}

\textbf{Datasets.}
We evaluate on [Dataset A] ($n$ = X, $d$ = Y) and [Dataset B] ($n$ = X).

\textbf{Baselines.}
We compare against: (1) Method A \citep{ref1}; (2) Method B \citep{ref2};
(3) Method C (our ablation).

\textbf{Implementation.}
All models trained on [hardware] with [framework]. Hyper-parameters selected via
cross-validation; see Appendix~\ref{app:hparams} for details.

\subsection{Main Results}

Table~\ref{tab:main} shows that our method achieves state-of-the-art on all benchmarks.

\begin{table}[htbp]
  \centering
  \caption{Comparison on [task]. Higher is better ($\uparrow$). Best in \textbf{bold}.}
  \label{tab:main}
  \begin{tabular}{lcccc}
    \toprule
    Method & Acc.~(\%) $\uparrow$ & F1 $\uparrow$ & Params & FLOPs \\
    \midrule
    Baseline~\citep{ref1} & 88.4 & 0.879 & 25M & 4.1G \\
    Method B~\citep{ref2} & 91.2 & 0.908 & 67M & 11.3G \\
    \midrule
    \textbf{Ours} & \textbf{94.7} & \textbf{0.943} & \textbf{18M} & \textbf{2.8G} \\
    \bottomrule
  \end{tabular}
\end{table}

\subsection{Ablation Study}

We isolate the contribution of each component in Table~\ref{tab:ablation}.

\begin{table}[htbp]
  \centering
  \caption{Ablation on [Dataset A].}
  \label{tab:ablation}
  \begin{tabular}{lcc}
    \toprule
    Variant & Acc. & $\Delta$ \\
    \midrule
    Full model & 94.7\% & -- \\
    w/o component A & 92.1\% & $-$2.6 \\
    w/o component B & 90.8\% & $-$3.9 \\
    \bottomrule
  \end{tabular}
\end{table}

% ── 5. Conclusion ───────────────────────────────────────────────────────
\section{Conclusion}
We proposed [method], achieving [result]. Future work includes [direction].

% ── References ──────────────────────────────────────────────────────────
\bibliographystyle{plainnat}
\bibliography{refs}

% ── Appendix ────────────────────────────────────────────────────────────
\appendix
\section{Proofs}
\label{app:proofs}

\textbf{Proof of Theorem~\ref{thm:main}.}
Full derivation here.

\section{Hyper-parameter Settings}
\label{app:hparams}

\begin{table}[htbp]
  \centering
  \caption{Hyper-parameters used for each dataset.}
  \label{tab:hparams}
  \begin{tabular}{lcc}
    \toprule
    Hyper-parameter & Dataset A & Dataset B \\
    \midrule
    Learning rate & $10^{-3}$ & $5\times10^{-4}$ \\
    Batch size & 256 & 128 \\
    Epochs & 200 & 100 \\
    \bottomrule
  \end{tabular}
\end{table}

\end{document}

Is the ML Conference Paper (NeurIPS / ICML / ICLR style) template free?

Yes. Every latexci template is free and needs no signup: the full source is on this page, free to copy and use in your own documents, including academic and commercial work. Open it in the browser editor or paste it into any TeX editor.

How do I use this template?

Click “Open in editor” to load it straight into the live LaTeX preview, or copy the source into Overleaf or your local TeX editor (TeX Live, MiKTeX).