EP2_Solutions.tex

\documentclass{article}

\usepackage{xcolor}
\usepackage{amsmath}
\usepackage{amsthm}
\usepackage{amssymb}
\usepackage{graphicx}
\usepackage{algorithm}
\usepackage[margin=1.0in]{geometry}
\newtheorem{theorem}{Theorem}[section]
\newtheorem{lemma}[theorem]{Lemma}
\DeclareMathOperator*{\argmax}{arg\,max}
\DeclareMathOperator*{\argmin}{arg\,min}

\title{SK Hynix ML Courses - Convex Optimization in ML\\ \vspace{0.2in} Solutions to Exercise Problems 2}
\author{TA Gyeongjo Hwang\footnote{hkj4276@kaist.ac.kr}, Doyeon Kim\footnote{dy.kim@kaist.ac.kr}}

\begin{document}

\maketitle

\begin{enumerate}
\item \textit{(1st order condition of convex functions)} Suppose $f: \mathbf{R}^d$
asdfasdfjkhasdklfhasdlkfh $\mathbb{R}, \mathbf{R}, \argmin_{d \in \mathbb{R}}, \mathcal{L}$.
\begin{equation}
asdf = asdf
\end{equation}

\begin{align}
asdf &= asdf \\
&= a~s~~dfasdfasdf \\
&= asdfasdf \\
&= asdf \\
&= asdf \\
&= W^{[1]}x^{(i)} + b^{[1]} \\
&= W^{[1]} \in \mathbb{R}^{m \times n}
\end{align}


\begin{enumerate}
\item Suppose that adsklfjas;lkdfjasdl;kfjasdlk;\\\\\\\\\\\\\\\\\\\\ fjasd;lkfjadslkfjasf ;lkjasdl ;kfjasdl ;kfjadsl ;kfjsdalkfjal;\\\\\\ kefjeawoifuaewifjasoidfjasdlkvj;dlkvfbnmalkejga ; oiewjgeo; iaejgoisajerg adsklfjas;lkdfjasdl;kfjasdlk; fjasd;lkfjadslkfjasf ;lkjasdl ;kfjasdl ;kfjadsl ;kfjsdalkfjal; kefjeawoifuaewifjasoidfjasdlkvj;dlkvfbnmalkejga ; oiewjgeo; iaejgoisajerg adsklfjas;lkdfjasdl;kfjasdlk; fjasd;lkfjadslkfjasf ;lkjasdl ;kfjasdl ;kfjadsl ;kfjsdalkfjal; kefjeawoifuaewifjasoidfjasdlkvj;dlkvfbnmalkejga ; oiewjgeo; iaejgoisajerg

\end{enumerate}
\end{enumerate}




\end{document}