Professional Documents
Culture Documents
Assignment_I__Latex_and_Python_Basics
Assignment_I__Latex_and_Python_Basics
T
his latex template provides some instruc- add the entries to the file literature.bib. Below are
tions on how to format your assignment some examples of how to refer to related works.
report. Feel free to use your favorite la- The reader should get a copy of Bishop’s book on
tex editor. Follow the structure below if it suits pattern recognition and machine learning (Bishop,
your needs. 2006) from our library. Also highly recommended
are the books of Murphy (2012) e Williams e Ras-
mussen (2006). Also make sure to refer to all
1 Introduction artwork like Figure 1.
Another example of actively citing authors is,
A short introduction to the problem.
e.g., Bishop (2006) discusses many elementary
You may want to list your contributions using
machine learning concepts.
the command itemize.
7 def transform ( s e l f ,
y = w1 + w2 x1 + w3 x2 + · · · + wD+1 xD ,
input_vector ) :
y = xT w. (2) 8 r e t u r n 1/(1+np . exp(−1∗
input_vector ) )
2.1 Referencing related work
Large code excerpts should be listed in the Ap-
You may want to use Google Scholar to find related pendix in a single column format to enhance the
scientific publications. Download the bib files and readability.
Page 1 of 4
Aula x: Título da Aula
2.3 You may add more structure to your • The font size of text in figures should be equal
report to the figure caption font size. E.g., in MA-
TLAB use a font size of 18 − 24 for figures.
Your assignment report should comply with the fol-
lowing structure. Feel free to add latex structure
Use the command
elements like
\paragraph*{...}, \subsubsection*{...} \begin{figure*}[t] ... \end{figure*}
3 Results
Something about your results. Some plots would
be also nice.
Page 2 of 4
Aula x: Título da Aula
4 Conclusion
Something about the problems of the method you
used and give hints on how to solve them.
Bibliography
Bishop, Christopher M (2006). Pattern recognition
and machine learning. springer.
Murphy, Kevin P (2012). Machine learning: a pro-
babilistic perspective. MIT press.
Williams, Christopher KI e Carl Edward Rasmus-
sen (2006). Gaussian processes for machine lear-
ning. Vol. 2. 3. MIT press Cambridge, MA.
Page 3 of 4
APPENDIX
Add all relevant information to reimplement your algorithms or to reproduce the derivations to the
appendix.
Adding code
You can also directly print your source code using the command shown below.
1 # ∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗
2 # T h i s s c r i p t d e m o n s t r a t e s how a s i m p l e f i g u r e can be
3 # c r e a t e d u s i n g t h e package m a t p l o t l i b .
4 #
5 # The example was developed by Honghu Xue , a PhD s t u d e n t
6 # o f Univ.− P r o f . Dr . Elmar Rueckert , 2022
7 # ∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗
8 import numpy as np
9 from m a t p l o t l i b import p y p l o t as p l t
10
11 f i g = p lt . figure ()
12 x = np . l i n s p a c e ( 0 , 500 , 500)
13 y_1 = np . l o g ( x )
14 s t d _ y _ 1 = 0.02 ∗x
15 p l t . p l o t ( x , y_1 , c o l o r = ’ b ’ , alpha = 0 . 6 , l a b e l= ’ method 1 ’ )
16 p l t . f i l l _ b e t w e e n ( x , y_1−std_y_1 , y_1+s t d _ y _ 1 , c o l o r = ’ b ’ , alpha = 0 . 1 )
##539 c a f
17
18 y_2 = x ∗ 0 . 1
19 s t d _ y _ 2 = 0.01 ∗x
20 p l t . p l o t ( x , y_2 , c o l o r = ’ r ’ , alpha = 0 . 6 , l a b e l= ’ method 2 ’ )
21 p l t . f i l l _ b e t w e e n ( x , y_2−std_y_2 , y_2+s t d _ y _ 2 , c o l o r = ’ r ’ , alpha = 0 . 1 )
##539 c a f
22
23
24 #p l . t i t l e ( ’ E p i s o d i c s p i l l a g e a v e r a g e ’ )
25 p l t . xlabel ( ’ training episodes ’ )
26 p l t . y l a b e l ( ’ e p s o d i c reward ’ )
27 p l t . legend ( l o c= ’ upper l e f t ’ )
28 p l t . show ( )
29
Additional Results
Often additional tables and figures are presented in the appendix.