This source did not publish a separate summary. Review SKILL.md before using the skill.
SKILL.md
Beamer Presentation Guide
Create professional academic presentations using LaTeX Beamer with themes, animations, and best practices for conference talks and research seminars.
Basic Beamer Document
\documentclass[aspectratio=169]{beamer} % 16:9 aspect ratio
% Other options: aspectratio=43 (4:3, default), aspectratio=1610
\usetheme{Madrid} % Visual theme
\usecolortheme{default} % Color scheme
\usefonttheme{professionalfonts}
\usepackage{amsmath,amssymb}
\usepackage{graphicx}
\usepackage{booktabs} % Better tables
\usepackage{hyperref}
\title[Short Title]{Full Title of Your Presentation}
\subtitle{Conference Name 2025}
\author[A. Smith]{Alice Smith\inst{1} \and Bob Jones\inst{2}}
\institute[MIT, Stanford]{
\inst{1}MIT \and \inst{2}Stanford University
}
\date{March 15, 2025}
\begin{document}
\begin{frame}
\titlepage
\end{frame}
\begin{frame}{Outline}
\tableofcontents
\end{frame}
\section{Introduction}
\begin{frame}{Motivation}
\begin{itemize}
\item Research question and why it matters
\item Key challenge in the field
\item Our contribution in one sentence
\end{itemize}
\end{frame}
\end{document}
Popular Beamer Themes
Theme
Style
Best For
Madrid
Professional, structured headers
Conference talks
Metropolis (mtheme)
Modern, minimal, flat design
CS/tech conferences
CambridgeUS
Traditional academic
University seminars
Singapore
Clean navigation sidebar
Long presentations
Bergen
Compact, information-dense
Technical deep dives
default
Plain, no decoration
Maximum content area
Installing Metropolis (Recommended)
% Metropolis is a modern, clean theme widely used in CS/ML talks
\documentclass[aspectratio=169]{beamer}
\usetheme{metropolis}
% Customize colors
\definecolor{customPrimary}{RGB}{0, 83, 159} % University blue
\setbeamercolor{frametitle}{bg=customPrimary}
\setbeamercolor{progress bar}{fg=customPrimary}
% Optional: use Fira Sans font (matches Metropolis design)
% \usepackage[sfdefault]{FiraSans}
Slide Types and Templates
Title + Content Slide
\begin{frame}{Main Result}
\begin{theorem}[Our Main Theorem]
For any $\epsilon > 0$, Algorithm~\ref{alg:ours} achieves an
approximation ratio of $(1 - \epsilon)$ in time $O(n \log n / \epsilon)$.
\end{theorem}
\vspace{0.5em}
Key implications:
\begin{enumerate}
\item First polynomial-time approximation scheme for this problem
\item Improves over Smith et al. (2023) by a factor of $O(\log n)$
\item Extends to weighted variants
\end{enumerate}
\end{frame}