From 23cd8db76a1cc2acf913ce733aed265bf043b067 Mon Sep 17 00:00:00 2001 From: Morten Hjorth-Jensen Date: Sun, 28 May 2023 21:21:09 +0200 Subject: [PATCH] update --- doc/pub/week34/html/._week34-bs000.html | 148 ++- doc/pub/week34/html/._week34-bs001.html | 167 ++- doc/pub/week34/html/._week34-bs002.html | 144 ++- doc/pub/week34/html/._week34-bs003.html | 162 +-- doc/pub/week34/html/._week34-bs004.html | 161 ++- doc/pub/week34/html/._week34-bs005.html | 164 +-- doc/pub/week34/html/._week34-bs006.html | 164 ++- doc/pub/week34/html/._week34-bs007.html | 168 ++- doc/pub/week34/html/._week34-bs008.html | 167 ++- doc/pub/week34/html/._week34-bs009.html | 170 ++- doc/pub/week34/html/._week34-bs010.html | 188 ++-- doc/pub/week34/html/._week34-bs011.html | 187 ++- doc/pub/week34/html/._week34-bs012.html | 172 ++- doc/pub/week34/html/._week34-bs013.html | 157 ++- doc/pub/week34/html/._week34-bs014.html | 170 +-- doc/pub/week34/html/._week34-bs015.html | 196 ++-- doc/pub/week34/html/._week34-bs016.html | 235 ++-- doc/pub/week34/html/._week34-bs017.html | 226 ++-- doc/pub/week34/html/._week34-bs018.html | 171 ++- doc/pub/week34/html/._week34-bs019.html | 157 ++- doc/pub/week34/html/._week34-bs020.html | 174 +-- doc/pub/week34/html/._week34-bs021.html | 187 ++- doc/pub/week34/html/._week34-bs022.html | 184 ++- doc/pub/week34/html/._week34-bs023.html | 195 ++-- doc/pub/week34/html/._week34-bs024.html | 195 ++-- doc/pub/week34/html/._week34-bs025.html | 186 ++- doc/pub/week34/html/._week34-bs026.html | 177 ++- doc/pub/week34/html/._week34-bs027.html | 203 ++-- doc/pub/week34/html/._week34-bs028.html | 202 ++-- doc/pub/week34/html/._week34-bs029.html | 200 ++-- doc/pub/week34/html/._week34-bs030.html | 202 ++-- doc/pub/week34/html/._week34-bs031.html | 170 +-- doc/pub/week34/html/._week34-bs032.html | 377 +++++-- doc/pub/week34/html/._week34-bs033.html | 505 +++++---- doc/pub/week34/html/._week34-bs034.html | 523 ++++----- doc/pub/week34/html/._week34-bs035.html | 392 ++----- doc/pub/week34/html/._week34-bs036.html | 1053 +++++++++++++++-- doc/pub/week34/html/._week34-bs037.html | 1061 ++---------------- doc/pub/week34/html/._week34-bs038.html | 176 +-- doc/pub/week34/html/._week34-bs039.html | 172 +-- doc/pub/week34/html/._week34-bs040.html | 177 ++- doc/pub/week34/html/._week34-bs041.html | 165 ++- doc/pub/week34/html/._week34-bs042.html | 160 +-- doc/pub/week34/html/._week34-bs043.html | 185 +-- doc/pub/week34/html/._week34-bs044.html | 193 ++-- doc/pub/week34/html/._week34-bs045.html | 176 ++- doc/pub/week34/html/._week34-bs046.html | 175 ++- doc/pub/week34/html/._week34-bs047.html | 262 +++-- doc/pub/week34/html/._week34-bs048.html | 271 ++--- doc/pub/week34/html/._week34-bs049.html | 193 ++-- doc/pub/week34/html/._week34-bs050.html | 209 ++-- doc/pub/week34/html/._week34-bs051.html | 196 ++-- doc/pub/week34/html/._week34-bs052.html | 172 +-- doc/pub/week34/html/._week34-bs053.html | 248 ++-- doc/pub/week34/html/._week34-bs054.html | 206 ++-- doc/pub/week34/html/._week34-bs055.html | 262 ++--- doc/pub/week34/html/._week34-bs056.html | 172 ++- doc/pub/week34/html/._week34-bs057.html | 157 ++- doc/pub/week34/html/._week34-bs058.html | 160 +-- doc/pub/week34/html/._week34-bs059.html | 161 ++- doc/pub/week34/html/._week34-bs060.html | 185 +-- doc/pub/week34/html/._week34-bs061.html | 205 ++-- doc/pub/week34/html/._week34-bs062.html | 273 +++-- doc/pub/week34/html/._week34-bs063.html | 244 ++-- doc/pub/week34/html/._week34-bs064.html | 515 +++++++-- doc/pub/week34/html/week34-bs.html | 148 ++- doc/pub/week34/html/week34-reveal.html | 53 +- doc/pub/week34/html/week34-solarized.html | 46 +- doc/pub/week34/html/week34.html | 46 +- doc/pub/week34/ipynb/ipynb-week34-src.tar.gz | Bin 103516 -> 103516 bytes doc/pub/week34/ipynb/week34.ipynb | 687 ++++++------ doc/src/week34/week34.do.txt | 24 +- 72 files changed, 8248 insertions(+), 8086 deletions(-) diff --git a/doc/pub/week34/html/._week34-bs000.html b/doc/pub/week34/html/._week34-bs000.html index be8d2e03a..5535c47e1 100644 --- a/doc/pub/week34/html/._week34-bs000.html +++ b/doc/pub/week34/html/._week34-bs000.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -369,7 +367,7 @@ MathJax.Hub.Config({
-

Week 34, August 22-26, 2022

+

Week 34, August 21-25, 2021


@@ -394,7 +392,7 @@ MathJax.Hub.Config({
  • 9
  • 10
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • @@ -408,7 +406,7 @@ MathJax.Hub.Config({ -->
    - © 1999-2022, Morten Hjorth-Jensen. Released under CC Attribution-NonCommercial 4.0 license + © 1999-2023, Morten Hjorth-Jensen. Released under CC Attribution-NonCommercial 4.0 license
    diff --git a/doc/pub/week34/html/._week34-bs001.html b/doc/pub/week34/html/._week34-bs001.html index 983e098b2..ed7091469 100644 --- a/doc/pub/week34/html/._week34-bs001.html +++ b/doc/pub/week34/html/._week34-bs001.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -353,21 +351,22 @@ MathJax.Hub.Config({

    Overview of first week

    +

    The sessions on Tuesdays and Wednesdays last four hours and will include partly lectures in a flipped mode (promoting active learning) and work on exercices and projects. +The sessions will begin with lectures and questions and answers about the material to be covered every week. There are four groups, Tuesdays 815am-12pm and 1215pm-4pm and +Wednesdays 815am-12pm and 1215pm-4pm. Please sign up as soon as possible for one of the groups. Max capacity per group is 30-40 persons. +

    + +

    On Thursdays we have a regular lecture. These lectures start at 1215pm and end at 2pm. +The first week we wtart with simple linear regression, a repetition of linear algebra and elements of statistics needed for the course. +

    +
      -
    • Wednesday August 24: Introduction to software and repetition of Python Programming
      • -
    • Thursday August 25: Computer lab in the morning, First lecture 1215pm-2pm: Presentation of the course, aims and content
      • -
    • Thursday: Second Lecture: Start with simple linear regression and repetition of linear algebra and elements of statistics
      • - -
    • Friday August 26: Linear regression
      • - -
    • Computer lab: Wednesdays, 8am-6pm and Thursdays 8am-12pm and additional self study 4pm-6pm. First time: Wednesday August 24.
      • +
    • August 22: Presentation of the course, aims and content. Introduction to software and repetition of Python Programming, linear algebra and basic elements of statistics. Please select group.
      • +
    • August 23: Presentation of the course, aims and content. Introduction to software and repetition of Python Programming, linear algebra and basic elements of statistics. Please select group.
      • +
    • August 24: Lecture: Linear regression, examples and theory
    @@ -389,7 +388,7 @@ MathJax.Hub.Config({
  • 10
  • 11
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs002.html b/doc/pub/week34/html/._week34-bs002.html index c6b6cf574..2afc861d2 100644 --- a/doc/pub/week34/html/._week34-bs002.html +++ b/doc/pub/week34/html/._week34-bs002.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -385,7 +383,7 @@ MathJax.Hub.Config({
  • 11
  • 12
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs003.html b/doc/pub/week34/html/._week34-bs003.html index a5db0ed3b..efde81517 100644 --- a/doc/pub/week34/html/._week34-bs003.html +++ b/doc/pub/week34/html/._week34-bs003.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,11 +349,23 @@ MathJax.Hub.Config({

     

     

     

    -

    Thursday August 25

    +

    Lectures and ComputerLab

    -

    The lectures will be recorded and updated videos will be posted after the lectures.

    +
    +
    + +
      +
    • The sessions on Tuesdays and Wednesdays last four hours and will include partly lectures in a flipped mode (promoting active learning) and work on exercices and projects.
      • +
    • Thursdays: regular lectures (12.15pm-2pm)
      • +
    • Weekly reading assignments and videos needed to solve projects and exercises.
      • +
    • Weekly exercises when not working on projects. You can hand in exercises if you want.
      • +
    • Detailed lecture notes, exercises, all programs presented, projects etc can be found at the homepage of the course.
      • +
    • Weekly plans and all other information are on the official webpage.
      • +
    • No final exam, three projects that are graded and have to be approved.
      • +
    +
    +
    -

    Zoom link for lectures: https://msu.zoom.us/j/91706435521?pwd=Zll6dU1lRVpEbmlMWU9za1dyT0gvQT09

    @@ -375,7 +385,7 @@ MathJax.Hub.Config({

  • 12
  • 13
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs004.html b/doc/pub/week34/html/._week34-bs004.html index facf0377d..d0bbf50ed 100644 --- a/doc/pub/week34/html/._week34-bs004.html +++ b/doc/pub/week34/html/._week34-bs004.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,23 +349,12 @@ MathJax.Hub.Config({

     

     

     

    -

    Lectures and ComputerLab

    +

    Communication channels

    -
    -
    -
      -
    • Lectures: Thursday (12.15pm-2pm and Friday (12.15pm-2pm).
      • -
    • Weekly reading assignments and videos needed to solve projects and exercises.
      • -
    • Weekly exercises when not working on projects. You can hand in exercises if you want.
      • -
    • Detailed lecture notes, exercises, all programs presented, projects etc can be found at the homepage of the course.
      • -
    • Weekly plans and all other information are on the official webpage.
      • -
    • No final exam, three projects that are graded and have to be approved.
      • +
    • Chat and communications via canvas.uio.no
      • +
    • Slack channel: machinelearninguio.slack.com
    -
    -
    - -

    diff --git a/doc/pub/week34/html/._week34-bs005.html b/doc/pub/week34/html/._week34-bs005.html index 52fed360d..77e8c81a6 100644 --- a/doc/pub/week34/html/._week34-bs005.html +++ b/doc/pub/week34/html/._week34-bs005.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,12 +349,26 @@ MathJax.Hub.Config({

     

     

     

    -

    Communication channels

    +

    Course Format

    +
    +
    +
      -
    • Chat and communications via canvas.uio.no, GDPR safe
      • -
    • Slack channel: machinelearninguio.slack.com
      • +
    • Three compulsory projects. Electronic reports only using Canvas to hand in projects and git as version control software and GitHub for repository (or GitLab) of all your material.
      • +
    • Evaluation and grading: The three projects are graded and each counts 1/3 of the final mark. No final written or oral exam. +
        +
      1. For the last project each group/participant submits a proposal or works with suggested (by us) proposals for the project.
        2. +
      2. If possible, we would like to organize the last project as a workshop where each group makes a poster and presents this to all other participants of the course
        3. +
      3. Poster session where all participants can study and discuss the other proposals.
        4. +
      4. Based on feedback etc, each group finalizes the report and submits for grading.
        5. +
      +
    • Python is the default programming language, but feel free to use C/C++ and/or Fortran or other programming languages. All source codes discussed during the lectures can be found at the webpage and github address of the course.
    +
    +
    + +

    diff --git a/doc/pub/week34/html/._week34-bs006.html b/doc/pub/week34/html/._week34-bs006.html index 89d8f3d88..a49e5ca35 100644 --- a/doc/pub/week34/html/._week34-bs006.html +++ b/doc/pub/week34/html/._week34-bs006.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,21 +349,21 @@ MathJax.Hub.Config({

     

     

     

    -

    Course Format

    +

    Teachers

    + +Teachers :
      -
    • Three compulsory projects. Electronic reports only using Canvas to hand in projects and git as version control software and GitHub for repository (or GitLab) of all your material.
      • -
    • Evaluation and grading: The three projects are graded and each counts 1/3 of the final mark. No final written or oral exam. -
        -
      1. For the last project each group/participant submits a proposal or works with suggested (by us) proposals for the project.
        2. -
      2. If possible, we would like to organize the last project as a workshop where each group makes a poster and presents this to all other participants of the course
        3. -
      3. Poster session where all participants can study and discuss the other proposals.
        4. -
      4. Based on feedback etc, each group finalizes the report and submits for grading.
        5. -
      -
    • Python is the default programming language, but feel free to use C/C++ and/or Fortran or other programming languages. All source codes discussed during the lectures can be found at the webpage and github address of the course.
      • +
    • Morten Hjorth-Jensen, morten.hjorth-jensen@fys.uio.no
      • +
        +
      • Phone: +47-48257387
        • +
      • Office: Department of Physics, University of Oslo, Eastern wing, room FØ470
        • +
      • Office hours: Anytime! Individual or group office hours can be arranged either in person or via zoom. Feel free to send an email for planning.
        • +
      +
    • Ida Torkjellsdatter Storehaug, i.t.storehaug@fys.uio.no
    @@ -392,7 +390,7 @@ MathJax.Hub.Config({
  • 15
  • 16
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs007.html b/doc/pub/week34/html/._week34-bs007.html index 982a4adf4..c24002d20 100644 --- a/doc/pub/week34/html/._week34-bs007.html +++ b/doc/pub/week34/html/._week34-bs007.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,28 +349,18 @@ MathJax.Hub.Config({

     

     

     

    -

    Teachers

    +

    Deadlines for projects (tentative)

    -Teachers : -
      -
    • Morten Hjorth-Jensen, morten.hjorth-jensen@fys.uio.no
      • -
        -
      • Phone: +47-48257387
        • -
      • Office: Department of Physics, University of Oslo, Eastern wing, room FØ470
        • -
      • Office hours: Anytime! Individual or group office hours can be arranged either in person or via zoom. Feel free to send an email for planning.
        • -
      -
    • Øyvind Sigmundson Schøyen, oyvinssc@student.matnat.uio.no
      • -
    • Stian Dysthe Bilek stian.bilek@fys.uio.no
      • -
    • Ida Torkjellsdatter Storehaug, i.t.storehaug@fys.uio.no
      • -
    • Sigurd Sørlie Rustad, s.s.rustad@fys.uio.no
      • -
    • Behnoosh Ashrafi, behnoosh.ashrafi@fys.uio.no
      • -
    • Frida Marie Engøy Westbye, f.m.e.westby@fys.uio.no
      • -
    • Joao Guilherme Carvalho Inacio, joaogca@fys.uio.no
      • -
    +
      +
    1. Project 1: October 11 (available September 5) graded with feedback)
      2. +
    2. Project 2: November 11 (available October 7, graded with feedback)
      3. +
    3. Project 3: December 9 (available November 11, graded with feedback)
      4. +
    +

    Projects are handed in using Canvas. We use Github as repository for codes, benchmark calculations etc. Comments and feedback on projects only via Canvas.

    @@ -399,7 +387,7 @@ MathJax.Hub.Config({
  • 16
  • 17
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs008.html b/doc/pub/week34/html/._week34-bs008.html index 0ac064437..67e154661 100644 --- a/doc/pub/week34/html/._week34-bs008.html +++ b/doc/pub/week34/html/._week34-bs008.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,22 +349,23 @@ MathJax.Hub.Config({

     

     

     

    -

    Deadlines for projects (tentative)

    - -
    -
    - +
      -
    1. Project 1: October 11 (available September 5) graded with feedback)
      2. -
    2. Project 2: November 11 (available October 7, graded with feedback)
      3. -
    3. Project 3: December 9 (available November 11, graded with feedback)
      4. +
    4. The lecture notes are collected as a jupyter-book at https://compphysics.github.io/MachineLearning/doc/LectureNotes/_build/html/intro.html.
    -

    Projects are handed in using Canvas. We use Github as repository for codes, benchmark calculations etc. Comments and feedback on projects only via Canvas.

    -
    -
    +

    In addition to the lecture notes, we recommend the books of Bishop and Goodfellow et al. We will follow these texts closely and the weekly reading assignments refer to these two texts. The text by Hastie et al is also widely used in the Machine Learning community. Finally, we also recommend the hands-on text by Geron, see below.

    +
      +
    1. Christopher M. Bishop, Pattern Recognition and Machine Learning, Springer, https://www.springer.com/gp/book/9780387310732.
      2. +
    2. Ian Goodfellow, Yoshua Bengio, and Aaron Courville. The different chapters are available for free at https://www.deeplearningbook.org/. Chapters 2-14 are highly recommended. The lectures follow to a larg extent this text. The weekly plans will include reading suggestions from these two textbooks.
      3. +
    +

    Additional textbooks:

    +
      +
    1. Trevor Hastie, Robert Tibshirani, Jerome H. Friedman, The Elements of Statistical Learning, Springer, https://www.springer.com/gp/book/9780387848570. This is a well-known text and serves as additional literature.
      2. +
    2. Aurelien Geron, Hands‑On Machine Learning with Scikit‑Learn and TensorFlow, O'Reilly, https://www.oreilly.com/library/view/hands-on-machine-learning/9781492032632/. This text is very useful since it contains many code examples and hands-on applications of all algorithms discussed in this course.
      3. +

    diff --git a/doc/pub/week34/html/._week34-bs009.html b/doc/pub/week34/html/._week34-bs009.html index 7e47cd3a8..1e96d0cdf 100644 --- a/doc/pub/week34/html/._week34-bs009.html +++ b/doc/pub/week34/html/._week34-bs009.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,23 +349,19 @@ MathJax.Hub.Config({

     

     

     

    - +

    Prerequisites

    -
      -
    1. The lecture notes are collected as a jupyter-book at https://compphysics.github.io/MachineLearning/doc/LectureNotes/_build/html/intro.html.
      2. -
    -

    In addition to the lecture notes, we recommend the books of Bishop and Goodfellow et al. We will follow these texts closely and the weekly reading assignments refer to these two texts. The text by Hastie et al is also widely used in the Machine Learning community. Finally, we also recommend the hands-on text by Geron, see below.

    +

    Basic knowledge in programming and mathematics, with an emphasis on +linear algebra. Knowledge of Python or/and C++ as programming +languages is strongly recommended and experience with Jupiter notebook +is recommended. Required courses are the equivalents to the University +of Oslo mathematics courses MAT1100, MAT1110, MAT1120 and at least one +of the corresponding computing and programming courses INF1000/INF1110 +or MAT-INF1100/MAT-INF1100L/BIOS1100/KJM-INF1100. Most universities +offer nowadays a basic programming course (often compulsory) where +Python is the recurring programming language. +

    -
      -
    1. Christopher M. Bishop, Pattern Recognition and Machine Learning, Springer, https://www.springer.com/gp/book/9780387310732.
      2. -
    2. Ian Goodfellow, Yoshua Bengio, and Aaron Courville. The different chapters are available for free at https://www.deeplearningbook.org/. Chapters 2-14 are highly recommended. The lectures follow to a larg extent this text. The weekly plans will include reading suggestions from these two textbooks.
      3. -
    -

    Additional textbooks:

    - -
      -
    1. Trevor Hastie, Robert Tibshirani, Jerome H. Friedman, The Elements of Statistical Learning, Springer, https://www.springer.com/gp/book/9780387848570. This is a well-known text and serves as additional literature.
      2. -
    2. Aurelien Geron, Hands‑On Machine Learning with Scikit‑Learn and TensorFlow, O'Reilly, https://www.oreilly.com/library/view/hands-on-machine-learning/9781492032632/. This text is very useful since it contains many code examples and hands-on applications of all algorithms discussed in this course.
      3. -

    diff --git a/doc/pub/week34/html/._week34-bs010.html b/doc/pub/week34/html/._week34-bs010.html index 31807a6a7..ba80584e7 100644 --- a/doc/pub/week34/html/._week34-bs010.html +++ b/doc/pub/week34/html/._week34-bs010.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,19 +349,43 @@ MathJax.Hub.Config({

     

     

     

    -

    Prerequisites

    +

    Learning outcomes

    -

    Basic knowledge in programming and mathematics, with an emphasis on -linear algebra. Knowledge of Python or/and C++ as programming -languages is strongly recommended and experience with Jupiter notebook -is recommended. Required courses are the equivalents to the University -of Oslo mathematics courses MAT1100, MAT1110, MAT1120 and at least one -of the corresponding computing and programming courses INF1000/INF1110 -or MAT-INF1100/MAT-INF1100L/BIOS1100/KJM-INF1100. Most universities -offer nowadays a basic programming course (often compulsory) where -Python is the recurring programming language. +

    +
    + + +

    This course aims at giving you insights and knowledge about many of +the central algorithms used in Data Analysis and Machine Learning. +The course is project based and through various numerical projects, +normally three, you will be exposed to fundamental research problems +in these fields, with the aim to reproduce state of the art scientific +results. Both supervised and unsupervised methods will be covered. The +emphasis is on a frequentist approach, although we will try to link it +with a Bayesian approach as well. You will learn to develop and +structure large codes for studying different cases where Machine +Learning is applied to, get acquainted with computing facilities and +learn to handle large scientific projects. A good scientific and +ethical conduct is emphasized throughout the course. More +specifically, after this course you will

    +
      +
    • Learn about basic data analysis, statistical analysis, Bayesian statistics, Monte Carlo sampling, data optimization and machine learning;
      • +
    • Be capable of extending the acquired knowledge to other systems and cases;
      • +
    • Have an understanding of central algorithms used in data analysis and machine learning;
      • +
    • Understand linear methods for regression and classification, from ordinary least squares, via Lasso and Ridge to Logistic regression;
      • +
    • Learn about neural networks and deep learning methods for supervised and unsupervised learning. Emphasis on feed forward neural networks, convolutional and recurrent neural networks;
      • +
    • Learn about about decision trees, random forests, bagging and boosting methods;
      • +
    • Learn about support vector machines and kernel transformations;
      • +
    • Reduction of data sets, from PCA to clustering;
      • +
    • Autoencoders and Reinforcement Learning;
      • +
    • Work on numerical projects to illustrate the theory. The projects play a central role and you are expected to know modern programming languages like Python or C++ and/or Fortran (Fortran2003 or later) or Julia or other.
      • +
    +
    +
    + +

    diff --git a/doc/pub/week34/html/._week34-bs011.html b/doc/pub/week34/html/._week34-bs011.html index b6ad0babc..705482fb2 100644 --- a/doc/pub/week34/html/._week34-bs011.html +++ b/doc/pub/week34/html/._week34-bs011.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,38 +349,29 @@ MathJax.Hub.Config({

     

     

     

    -

    Learning outcomes

    +

    Topics covered in this course: Statistical analysis and optimization of data

    + +

    The course has two central parts

    + +
      +
    1. Statistical analysis and optimization of data
      2. +
    2. Machine learning
      3. +
    +

    These topics will be scattered thorughout the course and may not necessarily be taught separately. Rather, we will often take an approach (during the lectures and project/exercise sessions) where say elements from statistical data analysis are mixed with specific Machine Learning algorithms

    -

    This course aims at giving you insights and knowledge about many of -the central algorithms used in Data Analysis and Machine Learning. -The course is project based and through various numerical projects, -normally three, you will be exposed to fundamental research problems -in these fields, with the aim to reproduce state of the art scientific -results. Both supervised and unsupervised methods will be covered. The -emphasis is on a frequentist approach, although we will try to link it -with a Bayesian approach as well. You will learn to develop and -structure large codes for studying different cases where Machine -Learning is applied to, get acquainted with computing facilities and -learn to handle large scientific projects. A good scientific and -ethical conduct is emphasized throughout the course. More -specifically, after this course you will -

    - +

    We plan to cover the following topics:

      -
    • Learn about basic data analysis, statistical analysis, Bayesian statistics, Monte Carlo sampling, data optimization and machine learning;
      • -
    • Be capable of extending the acquired knowledge to other systems and cases;
      • -
    • Have an understanding of central algorithms used in data analysis and machine learning;
      • -
    • Understand linear methods for regression and classification, from ordinary least squares, via Lasso and Ridge to Logistic regression;
      • -
    • Learn about neural networks and deep learning methods for supervised and unsupervised learning. Emphasis on feed forward neural networks, convolutional and recurrent neural networks;
      • -
    • Learn about about decision trees, random forests, bagging and boosting methods;
      • -
    • Learn about support vector machines and kernel transformations;
      • -
    • Reduction of data sets, from PCA to clustering;
      • -
    • Autoencoders and Reinforcement Learning;
      • -
    • Work on numerical projects to illustrate the theory. The projects play a central role and you are expected to know modern programming languages like Python or C++ and/or Fortran (Fortran2003 or later) or Julia or other.
      • +
    • Basic concepts, expectation values, variance, covariance, correlation functions and errors;
      • +
    • Simpler models, binomial distribution, the Poisson distribution, simple and multivariate normal distributions;
      • +
    • Central elements of Bayesian statistics and modeling;
      • +
    • Gradient methods for data optimization;
      • +
    • Monte Carlo methods, Markov chains, Gibbs sampling and Metropolis-Hastings sampling (tentative);
      • +
    • Estimation of errors and resampling techniques such as the cross-validation, blocking, bootstrapping and jackknife methods;
      • +
    • Principal Component Analysis (PCA) and its mathematical foundation;
    @@ -413,7 +402,7 @@ specifically, after this course you will
  • 20
  • 21
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs012.html b/doc/pub/week34/html/._week34-bs012.html index 69069b663..e2d93c59f 100644 --- a/doc/pub/week34/html/._week34-bs012.html +++ b/doc/pub/week34/html/._week34-bs012.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,30 +349,22 @@ MathJax.Hub.Config({

     

     

     

    -

    Topics covered in this course: Statistical analysis and optimization of data

    - -

    The course has two central parts

    - -
      -
    1. Statistical analysis and optimization of data
      2. -
    2. Machine learning
      3. -
    -

    These topics will be scattered thorughout the course and may not necessarily be taught separately. Rather, we will often take an approach (during the lectures and project/exercise sessions) where say elements from statistical data analysis are mixed with specific Machine Learning algorithms

    +

    Topics covered in this course: Machine Learning

    - -

    We plan to cover the following topics:

    +

    The following topics will be covered

      -
    • Basic concepts, expectation values, variance, covariance, correlation functions and errors;
      • -
    • Simpler models, binomial distribution, the Poisson distribution, simple and multivariate normal distributions;
      • -
    • Central elements of Bayesian statistics and modeling;
      • -
    • Gradient methods for data optimization;
      • -
    • Monte Carlo methods, Markov chains, Gibbs sampling and Metropolis-Hastings sampling (tentative);
      • -
    • Estimation of errors and resampling techniques such as the cross-validation, blocking, bootstrapping and jackknife methods;
      • -
    • Principal Component Analysis (PCA) and its mathematical foundation;
      • +
    • Linear Regression and Logistic Regression;
      • +
    • Neural networks and deep learning, including convolutional and recurrent neural networks;
      • +
    • Decisions trees, Random Forests, Bagging and Boosting;
      • +
    • Support vector machines;
      • +
    • Bayesian linear and logistic regression (tentative);
      • +
    • Boltzmann Machines (tentative);
      • +
    • Unsupervised learning Dimensionality reduction, from PCA to clustering;
    +

    Hands-on demonstrations, exercises and projects aim at deepening your understanding of these topics.

    @@ -404,7 +394,7 @@ MathJax.Hub.Config({
  • 21
  • 22
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs013.html b/doc/pub/week34/html/._week34-bs013.html index 8f1dc207c..874ae9f0f 100644 --- a/doc/pub/week34/html/._week34-bs013.html +++ b/doc/pub/week34/html/._week34-bs013.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,22 +349,15 @@ MathJax.Hub.Config({

     

     

     

    -

    Topics covered in this course: Machine Learning

    +
    -

    The following topics will be covered

      -
    • Linear Regression and Logistic Regression;
      • -
    • Neural networks and deep learning, including convolutional and recurrent neural networks;
      • -
    • Decisions trees, Random Forests, Bagging and Boosting;
      • -
    • Support vector machines;
      • -
    • Bayesian linear and logistic regression (tentative);
      • -
    • Boltzmann Machines (tentative);
      • -
    • Unsupervised learning Dimensionality reduction, from PCA to clustering;
      • +
    • GIT for version control, and GitHub or GitLab as repositories, highly recommended. This will be discussed during the first exercise session
      • +
    • Anaconda and other Python environments, see intro slides and links to programming resources at https://computationalscienceuio.github.io/RefreshProgrammingSkills/intro.html
    -

    Hands-on demonstrations, exercises and projects aim at deepening your understanding of these topics.

    @@ -396,7 +387,7 @@ MathJax.Hub.Config({
  • 22
  • 23
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs014.html b/doc/pub/week34/html/._week34-bs014.html index 7c98fdda0..85053f88f 100644 --- a/doc/pub/week34/html/._week34-bs014.html +++ b/doc/pub/week34/html/._week34-bs014.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,19 +349,23 @@ MathJax.Hub.Config({

     

     

     

    - - -
    -
    - - -
    -
    +

    Other courses on Data science and Machine Learning at UiO

    +

    The link here https://www.mn.uio.no/english/research/about/centre-focus/innovation/data-science/studies/ gives an excellent overview of courses on Machine learning at UiO.

    +
      +
    1. STK2100 Machine learning and statistical methods for prediction and classification.
      2. +
    2. IN3050/4050 Introduction to Artificial Intelligence and Machine Learning. Introductory course in machine learning and AI with an algorithmic approach.
      3. +
    3. STK-INF3000/4000 Selected Topics in Data Science. The course provides insight into selected contemporary relevant topics within Data Science.
      4. +
    4. IN4080 Natural Language Processing. Probabilistic and machine learning techniques applied to natural language processing.
      5. +
    5. STK-IN4300 Statistical learning methods in Data Science. An advanced introduction to statistical and machine learning. For students with a good mathematics and statistics background.
      6. +
    6. INF4490 Biologically Inspired Computing. An introduction to self-adapting methods also called artificial intelligence or machine learning.
      7. +
    7. IN-STK5000 Adaptive Methods for Data-Based Decision Making. Methods for adaptive collection and processing of data based on machine learning techniques.
      8. +
    8. IN5400/INF5860 Machine Learning for Image Analysis. An introduction to deep learning with particular emphasis on applications within Image analysis, but useful for other application areas too.
      9. +
    9. TEK5040 Deep learning for autonomous systems. The course addresses advanced algorithms and architectures for deep learning with neural networks. The course provides an introduction to how deep-learning techniques can be used in the construction of key parts of advanced autonomous systems that exist in physical environments and cyber environments.
      10. +
    10. STK4051 Computational Statistics
      11. +
    11. STK4021 Applied Bayesian Analysis and Numerical Methods
      12. +

    diff --git a/doc/pub/week34/html/._week34-bs015.html b/doc/pub/week34/html/._week34-bs015.html index 81029f36f..116ba8685 100644 --- a/doc/pub/week34/html/._week34-bs015.html +++ b/doc/pub/week34/html/._week34-bs015.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,23 +349,45 @@ MathJax.Hub.Config({

     

     

     

    -

    Other courses on Data science and Machine Learning at UiO

    +

    Introduction

    -

    The link here https://www.mn.uio.no/english/research/about/centre-focus/innovation/data-science/studies/ gives an excellent overview of courses on Machine learning at UiO.

    +

    Our emphasis throughout this series of lectures +is on understanding the mathematical aspects of +different algorithms used in the fields of data analysis and machine learning. +

    + +

    However, where possible we will emphasize the +importance of using available software. We start thus with a hands-on +and top-down approach to machine learning. The aim is thus to start with +relevant data or data we have produced +and use these to introduce statistical data analysis +concepts and machine learning algorithms before we delve into the +algorithms themselves. The examples we will use in the beginning, start with simple +polynomials with random noise added. We will use the Python +software package Scikit-Learn and +introduce various machine learning algorithms to make fits of +the data and predictions. We move thereafter to more interesting +cases such as data from say experiments (below we will look at experimental nuclear binding energies as an example). +These are examples where we can easily set up the data and +then use machine learning algorithms included in for example +Scikit-Learn. +

    + +

    These examples will serve us the purpose of getting +started. Furthermore, they allow us to catch more than two birds with +a stone. They will allow us to bring in some programming specific +topics and tools as well as showing the power of various Python +libraries for machine learning and statistical data analysis. +

    + +

    Here, we will mainly focus on two +specific Python packages for Machine Learning, Scikit-Learn and +Tensorflow (see below for links etc). Moreover, the examples we +introduce will serve as inputs to many of our discussions later, as +well as allowing you to set up models and produce your own data and +get started with programming. +

    -
      -
    1. STK2100 Machine learning and statistical methods for prediction and classification.
      2. -
    2. IN3050/4050 Introduction to Artificial Intelligence and Machine Learning. Introductory course in machine learning and AI with an algorithmic approach.
      3. -
    3. STK-INF3000/4000 Selected Topics in Data Science. The course provides insight into selected contemporary relevant topics within Data Science.
      4. -
    4. IN4080 Natural Language Processing. Probabilistic and machine learning techniques applied to natural language processing.
      5. -
    5. STK-IN4300 Statistical learning methods in Data Science. An advanced introduction to statistical and machine learning. For students with a good mathematics and statistics background.
      6. -
    6. INF4490 Biologically Inspired Computing. An introduction to self-adapting methods also called artificial intelligence or machine learning.
      7. -
    7. IN-STK5000 Adaptive Methods for Data-Based Decision Making. Methods for adaptive collection and processing of data based on machine learning techniques.
      8. -
    8. IN5400/INF5860 Machine Learning for Image Analysis. An introduction to deep learning with particular emphasis on applications within Image analysis, but useful for other application areas too.
      9. -
    9. TEK5040 Deep learning for autonomous systems. The course addresses advanced algorithms and architectures for deep learning with neural networks. The course provides an introduction to how deep-learning techniques can be used in the construction of key parts of advanced autonomous systems that exist in physical environments and cyber environments.
      10. -
    10. STK4051 Computational Statistics
      11. -
    11. STK4021 Applied Bayesian Analysis and Numerical Methods
      12. -

    diff --git a/doc/pub/week34/html/._week34-bs016.html b/doc/pub/week34/html/._week34-bs016.html index 9572bd91f..743bd1e58 100644 --- a/doc/pub/week34/html/._week34-bs016.html +++ b/doc/pub/week34/html/._week34-bs016.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,43 +349,74 @@ MathJax.Hub.Config({

     

     

     

    -

    Introduction

    +

    What is Machine Learning?

    -

    Our emphasis throughout this series of lectures -is on understanding the mathematical aspects of -different algorithms used in the fields of data analysis and machine learning. +

    Statistics, data science and machine learning form important fields of +research in modern science. They describe how to learn and make +predictions from data, as well as allowing us to extract important +correlations about physical process and the underlying laws of motion +in large data sets. The latter, big data sets, appear frequently in +essentially all disciplines, from the traditional Science, Technology, +Mathematics and Engineering fields to Life Science, Law, education +research, the Humanities and the Social Sciences.

    -

    However, where possible we will emphasize the -importance of using available software. We start thus with a hands-on -and top-down approach to machine learning. The aim is thus to start with -relevant data or data we have produced -and use these to introduce statistical data analysis -concepts and machine learning algorithms before we delve into the -algorithms themselves. The examples we will use in the beginning, start with simple -polynomials with random noise added. We will use the Python -software package Scikit-Learn and -introduce various machine learning algorithms to make fits of -the data and predictions. We move thereafter to more interesting -cases such as data from say experiments (below we will look at experimental nuclear binding energies as an example). -These are examples where we can easily set up the data and -then use machine learning algorithms included in for example -Scikit-Learn. +

    It has become more +and more common to see research projects on big data in for example +the Social Sciences where extracting patterns from complicated survey +data is one of many research directions. Having a solid grasp of data +analysis and machine learning is thus becoming central to scientific +computing in many fields, and competences and skills within the fields +of machine learning and scientific computing are nowadays strongly +requested by many potential employers. The latter cannot be +overstated, familiarity with machine learning has almost become a +prerequisite for many of the most exciting employment opportunities, +whether they are in bioinformatics, life science, physics or finance, +in the private or the public sector. This author has had several +students or met students who have been hired recently based on their +skills and competences in scientific computing and data science, often +with marginal knowledge of machine learning.

    -

    These examples will serve us the purpose of getting -started. Furthermore, they allow us to catch more than two birds with -a stone. They will allow us to bring in some programming specific -topics and tools as well as showing the power of various Python -libraries for machine learning and statistical data analysis. +

    Machine learning is a subfield of computer science, and is closely +related to computational statistics. It evolved from the study of +pattern recognition in artificial intelligence (AI) research, and has +made contributions to AI tasks like computer vision, natural language +processing and speech recognition. Many of the methods we will study are also +strongly rooted in basic mathematics and physics research.

    -

    Here, we will mainly focus on two -specific Python packages for Machine Learning, Scikit-Learn and -Tensorflow (see below for links etc). Moreover, the examples we -introduce will serve as inputs to many of our discussions later, as -well as allowing you to set up models and produce your own data and -get started with programming. +

    Ideally, machine learning represents the science of giving computers +the ability to learn without being explicitly programmed. The idea is +that there exist generic algorithms which can be used to find patterns +in a broad class of data sets without having to write code +specifically for each problem. The algorithm will build its own logic +based on the data. You should however always keep in mind that +machines and algorithms are to a large extent developed by humans. The +insights and knowledge we have about a specific system, play a central +role when we develop a specific machine learning algorithm. +

    + +

    Machine learning is an extremely rich field, in spite of its young +age. The increases we have seen during the last three decades in +computational capabilities have been followed by developments of +methods and techniques for analyzing and handling large date sets, +relying heavily on statistics, computer science and mathematics. The +field is rather new and developing rapidly. Popular software packages +written in Python for machine learning like +Scikit-learn, +Tensorflow, +PyTorch and Keras, all +freely available at their respective GitHub sites, encompass +communities of developers in the thousands or more. And the number of +code developers and contributors keeps increasing. Not all the +algorithms and methods can be given a rigorous mathematical +justification, opening up thereby large rooms for experimenting and +trial and error and thereby exciting new developments. However, a +solid command of linear algebra, multivariate theory, probability +theory, statistical data analysis, understanding errors and Monte +Carlo methods are central elements in a proper understanding of many +of algorithms and methods we will discuss.

    @@ -415,7 +444,7 @@ get started with programming.

  • 25
  • 26
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs017.html b/doc/pub/week34/html/._week34-bs017.html index e0ba2d0b1..18b0eb1aa 100644 --- a/doc/pub/week34/html/._week34-bs017.html +++ b/doc/pub/week34/html/._week34-bs017.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,76 +349,28 @@ MathJax.Hub.Config({

     

     

     

    -

    What is Machine Learning?

    +

    Types of Machine Learning

    -

    Statistics, data science and machine learning form important fields of -research in modern science. They describe how to learn and make -predictions from data, as well as allowing us to extract important -correlations about physical process and the underlying laws of motion -in large data sets. The latter, big data sets, appear frequently in -essentially all disciplines, from the traditional Science, Technology, -Mathematics and Engineering fields to Life Science, Law, education -research, the Humanities and the Social Sciences. +

    The approaches to machine learning are many, but are often split into +two main categories. In supervised learning we know the answer to a +problem, and let the computer deduce the logic behind it. On the other +hand, unsupervised learning is a method for finding patterns and +relationship in data sets without any prior knowledge of the system. +Some authours also operate with a third category, namely +reinforcement learning. This is a paradigm of learning inspired by +behavioral psychology, where learning is achieved by trial-and-error, +solely from rewards and punishment.

    -

    It has become more -and more common to see research projects on big data in for example -the Social Sciences where extracting patterns from complicated survey -data is one of many research directions. Having a solid grasp of data -analysis and machine learning is thus becoming central to scientific -computing in many fields, and competences and skills within the fields -of machine learning and scientific computing are nowadays strongly -requested by many potential employers. The latter cannot be -overstated, familiarity with machine learning has almost become a -prerequisite for many of the most exciting employment opportunities, -whether they are in bioinformatics, life science, physics or finance, -in the private or the public sector. This author has had several -students or met students who have been hired recently based on their -skills and competences in scientific computing and data science, often -with marginal knowledge of machine learning. -

    - -

    Machine learning is a subfield of computer science, and is closely -related to computational statistics. It evolved from the study of -pattern recognition in artificial intelligence (AI) research, and has -made contributions to AI tasks like computer vision, natural language -processing and speech recognition. Many of the methods we will study are also -strongly rooted in basic mathematics and physics research. -

    - -

    Ideally, machine learning represents the science of giving computers -the ability to learn without being explicitly programmed. The idea is -that there exist generic algorithms which can be used to find patterns -in a broad class of data sets without having to write code -specifically for each problem. The algorithm will build its own logic -based on the data. You should however always keep in mind that -machines and algorithms are to a large extent developed by humans. The -insights and knowledge we have about a specific system, play a central -role when we develop a specific machine learning algorithm. -

    - -

    Machine learning is an extremely rich field, in spite of its young -age. The increases we have seen during the last three decades in -computational capabilities have been followed by developments of -methods and techniques for analyzing and handling large date sets, -relying heavily on statistics, computer science and mathematics. The -field is rather new and developing rapidly. Popular software packages -written in Python for machine learning like -Scikit-learn, -Tensorflow, -PyTorch and Keras, all -freely available at their respective GitHub sites, encompass -communities of developers in the thousands or more. And the number of -code developers and contributors keeps increasing. Not all the -algorithms and methods can be given a rigorous mathematical -justification, opening up thereby large rooms for experimenting and -trial and error and thereby exciting new developments. However, a -solid command of linear algebra, multivariate theory, probability -theory, statistical data analysis, understanding errors and Monte -Carlo methods are central elements in a proper understanding of many -of algorithms and methods we will discuss. +

    Another way to categorize machine learning tasks is to consider the +desired output of a system. Some of the most common tasks are:

    +

    diff --git a/doc/pub/week34/html/._week34-bs018.html b/doc/pub/week34/html/._week34-bs018.html index 6716d068c..ec96924e7 100644 --- a/doc/pub/week34/html/._week34-bs018.html +++ b/doc/pub/week34/html/._week34-bs018.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,28 +349,19 @@ MathJax.Hub.Config({

     

     

     

    -

    Types of Machine Learning

    +

    Essential elements of ML

    -

    The approaches to machine learning are many, but are often split into -two main categories. In supervised learning we know the answer to a -problem, and let the computer deduce the logic behind it. On the other -hand, unsupervised learning is a method for finding patterns and -relationship in data sets without any prior knowledge of the system. -Some authours also operate with a third category, namely -reinforcement learning. This is a paradigm of learning inspired by -behavioral psychology, where learning is achieved by trial-and-error, -solely from rewards and punishment. +

    The methods we cover have three main topics in common, irrespective of +whether we deal with supervised or unsupervised learning.

    - -

    Another way to categorize machine learning tasks is to consider the -desired output of a system. Some of the most common tasks are: -

    - + + +

    diff --git a/doc/pub/week34/html/._week34-bs019.html b/doc/pub/week34/html/._week34-bs019.html index 9cb226206..4774b82e4 100644 --- a/doc/pub/week34/html/._week34-bs019.html +++ b/doc/pub/week34/html/._week34-bs019.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,18 +349,9 @@ MathJax.Hub.Config({

     

     

     

    -

    Essential elements of ML

    +

    An optimization/minimization problem

    -

    The methods we cover have three main topics in common, irrespective of -whether we deal with supervised or unsupervised learning. -

    - - - +

    At the heart of basically all Machine Learning algorithms we will encounter so-called minimization or optimization algorithms. A large family of such methods are so-called gradient methods.

    @@ -389,7 +378,7 @@ whether we deal with supervised or unsupervised learning.

  • 28
  • 29
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs020.html b/doc/pub/week34/html/._week34-bs020.html index bbad12924..07eb30b00 100644 --- a/doc/pub/week34/html/._week34-bs020.html +++ b/doc/pub/week34/html/._week34-bs020.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,9 +349,35 @@ MathJax.Hub.Config({

     

     

     

    -

    An optimization/minimization problem

    +

    A Frequentist approach to data analysis

    -

    At the heart of basically all Machine Learning algorithms we will encounter so-called minimization or optimization algorithms. A large family of such methods are so-called gradient methods.

    +

    When you hear phrases like predictions and estimations and +correlations and causations, what do you think of? May be you think +of the difference between classifying new data points and generating +new data points. +Or perhaps you consider that correlations represent some kind of symmetric statements like +if \( A \) is correlated with \( B \), then \( B \) is correlated with +\( A \). Causation on the other hand is directional, that is if \( A \) causes \( B \), \( B \) does not +necessarily cause \( A \). +

    + +

    These concepts are in some sense the difference between machine +learning and statistics. In machine learning and prediction based +tasks, we are often interested in developing algorithms that are +capable of learning patterns from given data in an automated fashion, +and then using these learned patterns to make predictions or +assessments of newly given data. In many cases, our primary concern +is the quality of the predictions or assessments, and we are less +concerned about the underlying patterns that were learned in order +to make these predictions. +

    + +

    In machine learning we normally use a so-called frequentist approach, +where the aim is to make predictions and find correlations. We focus +less on for example extracting a probability distribution function (PDF). The PDF can be +used in turn to make estimations and find causations such as given \( A \) +what is the likelihood of finding \( B \). +

    @@ -380,7 +404,7 @@ MathJax.Hub.Config({

  • 29
  • 30
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs021.html b/doc/pub/week34/html/._week34-bs021.html index c1e4a8ee5..83bcf3cdb 100644 --- a/doc/pub/week34/html/._week34-bs021.html +++ b/doc/pub/week34/html/._week34-bs021.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,34 +349,31 @@ MathJax.Hub.Config({

     

     

     

    -

    A Frequentist approach to data analysis

    +

    What is a good model?

    -

    When you hear phrases like predictions and estimations and -correlations and causations, what do you think of? May be you think -of the difference between classifying new data points and generating -new data points. -Or perhaps you consider that correlations represent some kind of symmetric statements like -if \( A \) is correlated with \( B \), then \( B \) is correlated with -\( A \). Causation on the other hand is directional, that is if \( A \) causes \( B \), \( B \) does not -necessarily cause \( A \). +

    In science and engineering we often end up in situations where we want to infer (or learn) a +quantitative model \( M \) for a given set of sample points \( \boldsymbol{X} \in [x_1, x_2,\dots x_N] \).

    -

    These concepts are in some sense the difference between machine -learning and statistics. In machine learning and prediction based -tasks, we are often interested in developing algorithms that are -capable of learning patterns from given data in an automated fashion, -and then using these learned patterns to make predictions or -assessments of newly given data. In many cases, our primary concern -is the quality of the predictions or assessments, and we are less -concerned about the underlying patterns that were learned in order -to make these predictions. +

    As we will see repeatedely in these lectures, we could try to fit these data points to a model given by a +straight line, or if we wish to be more sophisticated to a more complex +function.

    -

    In machine learning we normally use a so-called frequentist approach, -where the aim is to make predictions and find correlations. We focus -less on for example extracting a probability distribution function (PDF). The PDF can be -used in turn to make estimations and find causations such as given \( A \) -what is the likelihood of finding \( B \). +

    The reason for inferring such a model is that it +serves many useful purposes. On the one hand, the model can reveal information +encoded in the data or underlying mechanisms from which the data were generated. For instance, we could discover important +corelations that relate interesting physics interpretations. +

    + +

    In addition, it can simplify the representation of the given data set and help +us in making predictions about future data samples. +

    + +

    A first important consideration to keep in mind is that inferring the correct model +for a given data set is an elusive, if not impossible, task. The fundamental difficulty +is that if we are not specific about what we mean by a correct model, there +could easily be many different models that fit the given data set equally well.

    @@ -406,7 +401,7 @@ what is the likelihood of finding \( B \).

  • 30
  • 31
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs022.html b/doc/pub/week34/html/._week34-bs022.html index f616a93ec..7af6d7c65 100644 --- a/doc/pub/week34/html/._week34-bs022.html +++ b/doc/pub/week34/html/._week34-bs022.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,32 +349,30 @@ MathJax.Hub.Config({

     

     

     

    -

    What is a good model?

    +

    What is a good model? Can we define it?

    -

    In science and engineering we often end up in situations where we want to infer (or learn) a -quantitative model \( M \) for a given set of sample points \( \boldsymbol{X} \in [x_1, x_2,\dots x_N] \). +

    The central question is this: what leads us to say that a model is correct or +optimal for a given data set? To make the model inference problem well posed, i.e., +to guarantee that there is a unique optimal model for the given data, we need to +impose additional assumptions or restrictions on the class of models considered. To +this end, we should not be looking for just any model that can describe the data. +Instead, we should look for a model \( M \) that is the best among a restricted class +of models. In addition, to make the model inference problem computationally +tractable, we need to specify how restricted the class of models needs to be. A +common strategy is to start +with the simplest possible class of models that is just necessary to describe the data +or solve the problem at hand. More precisely, the model class should be rich enough +to contain at least one model that can fit the data to a desired accuracy and yet be +restricted enough that it is relatively simple to find the best model for the given data.

    -

    As we will see repeatedely in these lectures, we could try to fit these data points to a model given by a -straight line, or if we wish to be more sophisticated to a more complex -function. +

    Thus, the most popular strategy is to start from the +simplest class of models and increase the complexity of the models only when the +simpler models become inadequate. For instance, if we work with a regression problem to fit a set of sample points, one +may first try the simplest class of models, namely linear models, followed obviously by more complex models.

    -

    The reason for inferring such a model is that it -serves many useful purposes. On the one hand, the model can reveal information -encoded in the data or underlying mechanisms from which the data were generated. For instance, we could discover important -corelations that relate interesting physics interpretations. -

    - -

    In addition, it can simplify the representation of the given data set and help -us in making predictions about future data samples. -

    - -

    A first important consideration to keep in mind is that inferring the correct model -for a given data set is an elusive, if not impossible, task. The fundamental difficulty -is that if we are not specific about what we mean by a correct model, there -could easily be many different models that fit the given data set equally well. -

    +

    How to evaluate which model fits best the data is something we will come back to over and over again in these sets of lectures.

    @@ -403,7 +399,7 @@ could easily be many different models that fit the given data set equally we

  • 31
  • 32
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs023.html b/doc/pub/week34/html/._week34-bs023.html index 0d093c5fa..c4c67d345 100644 --- a/doc/pub/week34/html/._week34-bs023.html +++ b/doc/pub/week34/html/._week34-bs023.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,30 +349,43 @@ MathJax.Hub.Config({

     

     

     

    -

    What is a good model? Can we define it?

    +

    Software and needed installations

    -

    The central question is this: what leads us to say that a model is correct or -optimal for a given data set? To make the model inference problem well posed, i.e., -to guarantee that there is a unique optimal model for the given data, we need to -impose additional assumptions or restrictions on the class of models considered. To -this end, we should not be looking for just any model that can describe the data. -Instead, we should look for a model \( M \) that is the best among a restricted class -of models. In addition, to make the model inference problem computationally -tractable, we need to specify how restricted the class of models needs to be. A -common strategy is to start -with the simplest possible class of models that is just necessary to describe the data -or solve the problem at hand. More precisely, the model class should be rich enough -to contain at least one model that can fit the data to a desired accuracy and yet be -restricted enough that it is relatively simple to find the best model for the given data. +

    We will make extensive use of Python as programming language and its +myriad of available libraries. You will find +Jupyter notebooks invaluable in your work. You can run R +codes in the Jupyter/IPython notebooks, with the immediate benefit of +visualizing your data. You can also use compiled languages like C++, +Rust, Julia, Fortran etc if you prefer. The focus in these lectures will be +on Python.

    -

    Thus, the most popular strategy is to start from the -simplest class of models and increase the complexity of the models only when the -simpler models become inadequate. For instance, if we work with a regression problem to fit a set of sample points, one -may first try the simplest class of models, namely linear models, followed obviously by more complex models. +

    If you have Python installed (we strongly recommend Python3) and you feel +pretty familiar with installing different packages, we recommend that +you install the following Python packages via pip as

    -

    How to evaluate which model fits best the data is something we will come back to over and over again in these sets of lectures.

    +
      +
    1. pip install numpy scipy matplotlib ipython scikit-learn mglearn sympy pandas pillow
      2. +
    +

    For Python3, replace pip with pip3.

    + +

    For OSX users we recommend, after having installed Xcode, to +install brew. Brew allows for a seamless installation of additional +software via for example +

    + +
      +
    1. brew install python3
      2. +
    +

    For Linux users, with its variety of distributions like for example the widely popular Ubuntu distribution, +you can use pip as well and simply install Python as +

    + +
      +
    1. sudo apt-get install python3 (or python for pyhton2.7)
      2. +
    +

    etc etc.

    @@ -401,7 +412,7 @@ may first try the simplest class of models, namely linear models, followed obvio

  • 32
  • 33
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs024.html b/doc/pub/week34/html/._week34-bs024.html index c47abb009..6acaa48ec 100644 --- a/doc/pub/week34/html/._week34-bs024.html +++ b/doc/pub/week34/html/._week34-bs024.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,44 +349,37 @@ MathJax.Hub.Config({

     

     

     

    -

    Software and needed installations

    +

    Python installers

    -

    We will make extensive use of Python as programming language and its -myriad of available libraries. You will find -Jupyter notebooks invaluable in your work. You can run R -codes in the Jupyter/IPython notebooks, with the immediate benefit of -visualizing your data. You can also use compiled languages like C++, -Rust, Julia, Fortran etc if you prefer. The focus in these lectures will be -on Python. +

    If you don't want to perform these operations separately and venture +into the hassle of exploring how to set up dependencies and paths, we +recommend two widely used distrubutions which set up all relevant +dependencies for Python, namely

    -

    If you have Python installed (we strongly recommend Python3) and you feel -pretty familiar with installing different packages, we recommend that -you install the following Python packages via pip as +

    +

    which is an open source +distribution of the Python and R programming languages for large-scale +data processing, predictive analytics, and scientific computing, that +aims to simplify package management and deployment. Package versions +are managed by the package management system conda.

    -
      -
    1. pip install numpy scipy matplotlib ipython scikit-learn mglearn sympy pandas pillow
      2. -
    -

    For Python3, replace pip with pip3.

    - -

    For OSX users we recommend, after having installed Xcode, to -install brew. Brew allows for a seamless installation of additional -software via for example +

    +

    is a Python +distribution for scientific and analytic computing distribution and +analysis environment, available for free and under a commercial +license.

    -
      -
    1. brew install python3
      2. -
    -

    For Linux users, with its variety of distributions like for example the widely popular Ubuntu distribution, -you can use pip as well and simply install Python as +

    Furthermore, Google's Colab is a free Jupyter notebook environment that requires +no setup and runs entirely in the cloud. Try it out!

    -
      -
    1. sudo apt-get install python3 (or python for pyhton2.7)
      2. -
    -

    etc etc.

    -

    diff --git a/doc/pub/week34/html/._week34-bs025.html b/doc/pub/week34/html/._week34-bs025.html index bbbf6bab1..31ddf4a62 100644 --- a/doc/pub/week34/html/._week34-bs025.html +++ b/doc/pub/week34/html/._week34-bs025.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,37 +349,23 @@ MathJax.Hub.Config({

     

     

     

    -

    Python installers

    - -

    If you don't want to perform these operations separately and venture -into the hassle of exploring how to set up dependencies and paths, we -recommend two widely used distrubutions which set up all relevant -dependencies for Python, namely -

    +

    Useful Python libraries

    +

    Here we list several useful Python libraries we strongly recommend (if you use anaconda many of these are already there)

    -

    which is an open source -distribution of the Python and R programming languages for large-scale -data processing, predictive analytics, and scientific computing, that -aims to simplify package management and deployment. Package versions -are managed by the package management system conda. -

    - - -

    is a Python -distribution for scientific and analytic computing distribution and -analysis environment, available for free and under a commercial -license. -

    - -

    Furthermore, Google's Colab is a free Jupyter notebook environment that requires -no setup and runs entirely in the cloud. Try it out! -

    -

    diff --git a/doc/pub/week34/html/._week34-bs026.html b/doc/pub/week34/html/._week34-bs026.html index 5046493dc..5d373cb79 100644 --- a/doc/pub/week34/html/._week34-bs026.html +++ b/doc/pub/week34/html/._week34-bs026.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,23 +349,24 @@ MathJax.Hub.Config({

     

     

     

    -

    Useful Python libraries

    -

    Here we list several useful Python libraries we strongly recommend (if you use anaconda many of these are already there)

    +

    Installing R, C++, cython or Julia

    + +

    You will also find it convenient to utilize R. We will mainly +use Python during our lectures and in various projects and exercises. +Those of you +already familiar with R should feel free to continue using R, keeping +however an eye on the parallel Python set ups. Similarly, if you are a +Python afecionado, feel free to explore R as well. Jupyter/Ipython +notebook allows you to run R codes interactively in your +browser. The software library R is really tailored for statistical data analysis +and allows for an easy usage of the tools and algorithms we will discuss in these +lectures. +

    + +

    To install R with Jupyter notebook +follow the link here +

    -

    diff --git a/doc/pub/week34/html/._week34-bs027.html b/doc/pub/week34/html/._week34-bs027.html index 78377ebfc..f9d7064ac 100644 --- a/doc/pub/week34/html/._week34-bs027.html +++ b/doc/pub/week34/html/._week34-bs027.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,22 +349,55 @@ MathJax.Hub.Config({

     

     

     

    -

    Installing R, C++, cython or Julia

    +

    Installing R, C++, cython, Numba etc

    -

    You will also find it convenient to utilize R. We will mainly -use Python during our lectures and in various projects and exercises. -Those of you -already familiar with R should feel free to continue using R, keeping -however an eye on the parallel Python set ups. Similarly, if you are a -Python afecionado, feel free to explore R as well. Jupyter/Ipython -notebook allows you to run R codes interactively in your -browser. The software library R is really tailored for statistical data analysis -and allows for an easy usage of the tools and algorithms we will discuss in these -lectures. +

    For the C++ aficionados, Jupyter/IPython notebook allows you also to +install C++ and run codes written in this language interactively in +the browser. Since we will emphasize writing many of the algorithms +yourself, you can thus opt for either Python or C++ (or Fortran or other compiled languages) as programming +languages.

    -

    To install R with Jupyter notebook -follow the link here +

    To add more entropy, cython can also be used when running your +notebooks. It means that Python with the jupyter notebook +setup allows you to integrate widely popular softwares and tools for +scientific computing. Similarly, the +Numba Python package delivers increased performance +capabilities with minimal rewrites of your codes. With its +versatility, including symbolic operations, Python offers a unique +computational environment. Your jupyter notebook can easily be +converted into a nicely rendered PDF file or a Latex file for +further processing. For example, convert to latex as +

    + + + +
    +
    +
    +
    +
    + 
    pycod jupyter nbconvert filename.ipynb --to latex 
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    And to add more versatility, the Python package SymPy is a Python library for symbolic mathematics. It aims to become a full-featured computer algebra system (CAS) and is entirely written in Python.

    + +

    Finally, if you wish to use the light mark-up language +doconce you can convert a standard ascii text file into various HTML +formats, ipython notebooks, latex files, pdf files etc with minimal edits. These lectures were generated using doconce.

    @@ -394,7 +425,7 @@ lectures.

  • 36
  • 37
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs028.html b/doc/pub/week34/html/._week34-bs028.html index 08623b1d6..10776df6a 100644 --- a/doc/pub/week34/html/._week34-bs028.html +++ b/doc/pub/week34/html/._week34-bs028.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,57 +349,19 @@ MathJax.Hub.Config({

     

     

     

    -

    Installing R, C++, cython, Numba etc

    +

    Numpy examples and Important Matrix and vector handling packages

    -

    For the C++ aficionados, Jupyter/IPython notebook allows you also to -install C++ and run codes written in this language interactively in -the browser. Since we will emphasize writing many of the algorithms -yourself, you can thus opt for either Python or C++ (or Fortran or other compiled languages) as programming -languages. -

    - -

    To add more entropy, cython can also be used when running your -notebooks. It means that Python with the jupyter notebook -setup allows you to integrate widely popular softwares and tools for -scientific computing. Similarly, the -Numba Python package delivers increased performance -capabilities with minimal rewrites of your codes. With its -versatility, including symbolic operations, Python offers a unique -computational environment. Your jupyter notebook can easily be -converted into a nicely rendered PDF file or a Latex file for -further processing. For example, convert to latex as -

    - - - -
    -
    -
    -
    -
    - 
    pycod jupyter nbconvert filename.ipynb --to latex 
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    And to add more versatility, the Python package SymPy is a Python library for symbolic mathematics. It aims to become a full-featured computer algebra system (CAS) and is entirely written in Python.

    - -

    Finally, if you wish to use the light mark-up language -doconce you can convert a standard ascii text file into various HTML -formats, ipython notebooks, latex files, pdf files etc with minimal edits. These lectures were generated using doconce. +

    There are several central software libraries for linear algebra and eigenvalue problems. Several of the more +popular ones have been wrapped into ofter software packages like those from the widely used text Numerical Recipes. The original source codes in many of the available packages are often taken from the widely used +software package LAPACK, which follows two other popular packages +developed in the 1970s, namely EISPACK and LINPACK. We describe them shortly here.

    +

    diff --git a/doc/pub/week34/html/._week34-bs029.html b/doc/pub/week34/html/._week34-bs029.html index 19be4da71..b2d964051 100644 --- a/doc/pub/week34/html/._week34-bs029.html +++ b/doc/pub/week34/html/._week34-bs029.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,19 +349,53 @@ MathJax.Hub.Config({

     

     

     

    -

    Numpy examples and Important Matrix and vector handling packages

    +

    Basic Matrix Features

    + +
    +
    + +$$ + \mathbf{A} = + \begin{bmatrix} a_{11} & a_{12} & a_{13} & a_{14} \\ + a_{21} & a_{22} & a_{23} & a_{24} \\ + a_{31} & a_{32} & a_{33} & a_{34} \\ + a_{41} & a_{42} & a_{43} & a_{44} + \end{bmatrix}\qquad +\mathbf{I} = + \begin{bmatrix} 1 & 0 & 0 & 0 \\ + 0 & 1 & 0 & 0 \\ + 0 & 0 & 1 & 0 \\ + 0 & 0 & 0 & 1 + \end{bmatrix} +$$ + +

    The inverse of a matrix is defined by

    + +$$ +\mathbf{A}^{-1} \cdot \mathbf{A} = I +$$ + + +
    +
    + + + + + + + + + + + +
    Relations Name matrix elements
    \( A=A^{T} \) symmetric \( a_{ij}=a_{ji} \)
    \( A=\left (A^{T}\right )^{-1} \) real orthogonal \( \sum_k a_{ik}a_{jk}=\sum_k a_{ki} a_{kj}=\delta_{ij} \)
    \( A=A^{ * } \) real matrix \( a_{ij}=a_{ij}^{ < em>} \)
    \( A=A^{\dagger} \) hermitian \( a_{ij}=a_{ji}^{ < /em>} \)
    \( A=\left(A^{\dagger}\right )^{-1} \) unitary \( \sum_k a_{ik}a_{jk}^{ < em>}=\sum_k a_{ki}^{ < /em> } a_{kj}=\delta_{ij} \)
    +
    +
    +
    +
    -

    There are several central software libraries for linear algebra and eigenvalue problems. Several of the more -popular ones have been wrapped into ofter software packages like those from the widely used text Numerical Recipes. The original source codes in many of the available packages are often taken from the widely used -software package LAPACK, which follows two other popular packages -developed in the 1970s, namely EISPACK and LINPACK. We describe them shortly here. -

    -

    diff --git a/doc/pub/week34/html/._week34-bs030.html b/doc/pub/week34/html/._week34-bs030.html index f25001ecc..14cfc7e9f 100644 --- a/doc/pub/week34/html/._week34-bs030.html +++ b/doc/pub/week34/html/._week34-bs030.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,53 +349,19 @@ MathJax.Hub.Config({

     

     

     

    -

    Basic Matrix Features

    - -
    -
    - -$$ - \mathbf{A} = - \begin{bmatrix} a_{11} & a_{12} & a_{13} & a_{14} \\ - a_{21} & a_{22} & a_{23} & a_{24} \\ - a_{31} & a_{32} & a_{33} & a_{34} \\ - a_{41} & a_{42} & a_{43} & a_{44} - \end{bmatrix}\qquad -\mathbf{I} = - \begin{bmatrix} 1 & 0 & 0 & 0 \\ - 0 & 1 & 0 & 0 \\ - 0 & 0 & 1 & 0 \\ - 0 & 0 & 0 & 1 - \end{bmatrix} -$$ - -

    The inverse of a matrix is defined by

    - -$$ -\mathbf{A}^{-1} \cdot \mathbf{A} = I -$$ - - -
    -
    - - - - - - - - - - - -
    Relations Name matrix elements
    \( A=A^{T} \) symmetric \( a_{ij}=a_{ji} \)
    \( A=\left (A^{T}\right )^{-1} \) real orthogonal \( \sum_k a_{ik}a_{jk}=\sum_k a_{ki} a_{kj}=\delta_{ij} \)
    \( A=A^{ * } \) real matrix \( a_{ij}=a_{ij}^{ < em>} \)
    \( A=A^{\dagger} \) hermitian \( a_{ij}=a_{ji}^{ < /em>} \)
    \( A=\left(A^{\dagger}\right )^{-1} \) unitary \( \sum_k a_{ik}a_{jk}^{ < em>}=\sum_k a_{ki}^{ < /em> } a_{kj}=\delta_{ij} \)
    -
    -
    -
    -
    - +

    Some famous Matrices

    +

    diff --git a/doc/pub/week34/html/._week34-bs031.html b/doc/pub/week34/html/._week34-bs031.html index bd8d22a15..06bab9cd6 100644 --- a/doc/pub/week34/html/._week34-bs031.html +++ b/doc/pub/week34/html/._week34-bs031.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,19 +349,25 @@ MathJax.Hub.Config({

     

     

     

    -

    Some famous Matrices

    +

    More Basic Matrix Features

    + +
    +
    + +

    For an \( N\times N \) matrix \( \mathbf{A} \) the following properties are all equivalent

      -
    • Diagonal if \( a_{ij}=0 \) for \( i\ne j \)
      • -
    • Upper triangular if \( a_{ij}=0 \) for \( i>j \)
      • -
    • Lower triangular if \( a_{ij}=0 \) for \( i < j \)
      • -
    • Upper Hessenberg if \( a_{ij}=0 \) for \( i>j+1 \)
      • -
    • Lower Hessenberg if \( a_{ij}=0 \) for \( i < j+1 \)
      • -
    • Tridiagonal if \( a_{ij}=0 \) for \( |i -j|>1 \)
      • -
    • Lower banded with bandwidth \( p \): \( a_{ij}=0 \) for \( i>j+p \)
      • -
    • Upper banded with bandwidth \( p \): \( a_{ij}=0 \) for \( i < j+p \)
      • -
    • Banded, block upper triangular, block lower triangular....
      • +
    • If the inverse of \( \mathbf{A} \) exists, \( \mathbf{A} \) is nonsingular.
      • +
    • The equation \( \mathbf{Ax}=0 \) implies \( \mathbf{x}=0 \).
      • +
    • The rows of \( \mathbf{A} \) form a basis of \( R^N \).
      • +
    • The columns of \( \mathbf{A} \) form a basis of \( R^N \).
      • +
    • \( \mathbf{A} \) is a product of elementary matrices.
      • +
    • \( 0 \) is not eigenvalue of \( \mathbf{A} \).
    +
    +
    + +

    diff --git a/doc/pub/week34/html/._week34-bs032.html b/doc/pub/week34/html/._week34-bs032.html index e124b3158..233133c27 100644 --- a/doc/pub/week34/html/._week34-bs032.html +++ b/doc/pub/week34/html/._week34-bs032.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,22 +349,229 @@ MathJax.Hub.Config({

     

     

     

    -

    More Basic Matrix Features

    +

    Numpy and arrays

    +

    Numpy provides an easy way to handle arrays in Python. The standard way to import this library is as

    -
    -
    - -

    For an \( N\times N \) matrix \( \mathbf{A} \) the following properties are all equivalent

    -
      -
    • If the inverse of \( \mathbf{A} \) exists, \( \mathbf{A} \) is nonsingular.
      • -
    • The equation \( \mathbf{Ax}=0 \) implies \( \mathbf{x}=0 \).
      • -
    • The rows of \( \mathbf{A} \) form a basis of \( R^N \).
      • -
    • The columns of \( \mathbf{A} \) form a basis of \( R^N \).
      • -
    • \( \mathbf{A} \) is a product of elementary matrices.
      • -
    • \( 0 \) is not eigenvalue of \( \mathbf{A} \).
      • -
    + +
    +
    +
    +
    +
    + 
    import numpy as np
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    Here follows a simple example where we set up an array of ten elements, all determined by random numbers drawn according to the normal distribution,

    + + +
    +
    +
    +
    +
    + 
    n = 10
+x = np.random.normal(size=n)
+print(x)
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    We defined a vector \( x \) with \( n=10 \) elements with its values given by the Normal distribution \( N(0,1) \). +Another alternative is to declare a vector as follows +

    + + +
    +
    +
    +
    +
    + 
    import numpy as np
+x = np.array([1, 2, 3])
+print(x)
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    Here we have defined a vector with three elements, with \( x_0=1 \), \( x_1=2 \) and \( x_2=3 \). Note that both Python and C++ +start numbering array elements from \( 0 \) and on. This means that a vector with \( n \) elements has a sequence of entities \( x_0, x_1, x_2, \dots, x_{n-1} \). We could also let (recommended) Numpy to compute the logarithms of a specific array as +

    + + +
    +
    +
    +
    +
    + 
    import numpy as np
+x = np.log(np.array([4, 7, 8]))
+print(x)
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    In the last example we used Numpy's unary function \( np.log \). This function is +highly tuned to compute array elements since the code is vectorized +and does not require looping. We normaly recommend that you use the +Numpy intrinsic functions instead of the corresponding log function +from Python's math module. The looping is done explicitely by the +np.log function. The alternative, and slower way to compute the +logarithms of a vector would be to write +

    + + + +
    +
    +
    +
    +
    + 
    import numpy as np
+from math import log
+x = np.array([4, 7, 8])
+for i in range(0, len(x)):
+    x[i] = log(x[i])
+print(x)
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    We note that our code is much longer already and we need to import the log function from the math module. +The attentive reader will also notice that the output is \( [1, 1, 2] \). Python interprets automagically our numbers as integers (like the automatic keyword in C++). To change this we could define our array elements to be double precision numbers as +

    + + +
    +
    +
    +
    +
    + 
    import numpy as np
+x = np.log(np.array([4, 7, 8], dtype = np.float64))
+print(x)
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    or simply write them as double precision numbers (Python uses 64 bits as default for floating point type variables), that is

    + + +
    +
    +
    +
    +
    + 
    import numpy as np
+x = np.log(np.array([4.0, 7.0, 8.0]))
+print(x)
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    To check the number of bytes (remember that one byte contains eight bits for double precision variables), you can use simple use the itemsize functionality (the array \( x \) is actually an object which inherits the functionalities defined in Numpy) as

    + + +
    +
    +
    +
    +
    + 
    import numpy as np
+x = np.log(np.array([4.0, 7.0, 8.0]))
+print(x.itemsize)
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    @@ -395,7 +600,7 @@ MathJax.Hub.Config({
  • 41
  • 42
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs033.html b/doc/pub/week34/html/._week34-bs033.html index 11985292d..a63b48d83 100644 --- a/doc/pub/week34/html/._week34-bs033.html +++ b/doc/pub/week34/html/._week34-bs033.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,8 +349,12 @@ MathJax.Hub.Config({

     

     

     

    -

    Numpy and arrays

    -

    Numpy provides an easy way to handle arrays in Python. The standard way to import this library is as

    +

    Matrices in Python

    + +

    Having defined vectors, we are now ready to try out matrices. We can +define a \( 3 \times 3 \) real matrix \( \boldsymbol{A} \) as (recall that we user +lowercase letters for vectors and uppercase letters for matrices) +

    @@ -362,6 +364,8 @@ MathJax.Hub.Config({ 
    import numpy as np
+A = np.log(np.array([ [4.0, 7.0, 8.0], [3.0, 10.0, 11.0], [4.0, 5.0, 7.0] ]))
+print(A)
    @@ -377,7 +381,7 @@ MathJax.Hub.Config({
    -

    Here follows a simple example where we set up an array of ten elements, all determined by random numbers drawn according to the normal distribution,

    +

    If we use the shape function we would get \( (3, 3) \) as output, that is verifying that our matrix is a \( 3\times 3 \) matrix. We can slice the matrix and print for example the first column (Python organized matrix elements in a row-major order, see below) as

    @@ -385,9 +389,191 @@ MathJax.Hub.Config({
    - 
    n = 10
+  
    import numpy as np
+A = np.log(np.array([ [4.0, 7.0, 8.0], [3.0, 10.0, 11.0], [4.0, 5.0, 7.0] ]))
+# print the first column, row-major order and elements start with 0
+print(A[:,0]) 
+
    
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + + +

    We can continue this was by printing out other columns or rows. The example here prints out the second column

    + + +
    +
    +
    +
    +
    + 
    import numpy as np
+A = np.log(np.array([ [4.0, 7.0, 8.0], [3.0, 10.0, 11.0], [4.0, 5.0, 7.0] ]))
+# print the first column, row-major order and elements start with 0
+print(A[1,:]) 
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    Numpy contains many other functionalities that allow us to slice, subdivide etc etc arrays. We strongly recommend that you look up the Numpy website for more details. Useful functions when defining a matrix are the np.zeros function which declares a matrix of a given dimension and sets all elements to zero

    + + +
    +
    +
    +
    +
    + 
    import numpy as np
+n = 10
+# define a matrix of dimension 10 x 10 and set all elements to zero
+A = np.zeros( (n, n) )
+print(A) 
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    or initializing all elements to

    + + +
    +
    +
    +
    +
    + 
    import numpy as np
+n = 10
+# define a matrix of dimension 10 x 10 and set all elements to one
+A = np.ones( (n, n) )
+print(A) 
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    or as unitarily distributed random numbers (see the material on random number generators in the statistics part)

    + + +
    +
    +
    +
    +
    + 
    import numpy as np
+n = 10
+# define a matrix of dimension 10 x 10 and set all elements to random numbers with x \in [0, 1]
+A = np.random.rand(n, n)
+print(A) 
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    As we will see throughout these lectures, there are several extremely useful functionalities in Numpy. +As an example, consider the discussion of the covariance matrix. Suppose we have defined three vectors +\( \boldsymbol{x}, \boldsymbol{y}, \boldsymbol{z} \) with \( n \) elements each. The covariance matrix is defined as +

    +$$ +\boldsymbol{\Sigma} = \begin{bmatrix} \sigma_{xx} & \sigma_{xy} & \sigma_{xz} \\ + \sigma_{yx} & \sigma_{yy} & \sigma_{yz} \\ + \sigma_{zx} & \sigma_{zy} & \sigma_{zz} + \end{bmatrix}, +$$ + +

    where for example

    +$$ +\sigma_{xy} =\frac{1}{n} \sum_{i=0}^{n-1}(x_i- \overline{x})(y_i- \overline{y}). +$$ + +

    The Numpy function np.cov calculates the covariance elements using the factor \( 1/(n-1) \) instead of \( 1/n \) since it assumes we do not have the exact mean values. +The following simple function uses the np.vstack function which takes each vector of dimension \( 1\times n \) and produces a \( 3\times n \) matrix \( \boldsymbol{W} \) +

    +$$ +\boldsymbol{W} = \begin{bmatrix} x_0 & x_1 & x_2 & \dots & x_{n-2} & x_{n-1} \\ + y_0 & y_1 & y_2 & \dots & y_{n-2} & y_{n-1} \\ + z_0 & z_1 & z_2 & \dots & z_{n-2} & z_{n-1} \\ + \end{bmatrix}, +$$ + +

    which in turn is converted into into the \( 3\times 3 \) covariance matrix +\( \boldsymbol{\Sigma} \) via the Numpy function np.cov(). We note that we can also calculate +the mean value of each set of samples \( \boldsymbol{x} \) etc using the Numpy +function np.mean(x). We can also extract the eigenvalues of the +covariance matrix through the np.linalg.eig() function. +

    + + + +
    +
    +
    +
    +
    + 
    # Importing various packages
+import numpy as np
+
+n = 100
 x = np.random.normal(size=n)
-print(x)
+print(np.mean(x))
+y = 4+3*x+np.random.normal(size=n)
+print(np.mean(y))
+z = x**3+np.random.normal(size=n)
+print(np.mean(z))
+W = np.vstack((x, y, z))
+Sigma = np.cov(W)
+print(Sigma)
+Eigvals, Eigvecs = np.linalg.eig(Sigma)
+print(Eigvals)
    @@ -401,12 +587,6 @@ x = np.r
    - - -

    We defined a vector \( x \) with \( n=10 \) elements with its values given by the Normal distribution \( N(0,1) \). -Another alternative is to declare a vector as follows -

    -
    @@ -414,153 +594,16 @@ Another alternative is to declare a vector as follows 
    import numpy as np
-x = np.array([1, 2, 3])
-print(x)
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - - -

    Here we have defined a vector with three elements, with \( x_0=1 \), \( x_1=2 \) and \( x_2=3 \). Note that both Python and C++ -start numbering array elements from \( 0 \) and on. This means that a vector with \( n \) elements has a sequence of entities \( x_0, x_1, x_2, \dots, x_{n-1} \). We could also let (recommended) Numpy to compute the logarithms of a specific array as -

    - - -
    -
    -
    -
    -
    - 
    import numpy as np
-x = np.log(np.array([4, 7, 8]))
-print(x)
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    In the last example we used Numpy's unary function \( np.log \). This function is -highly tuned to compute array elements since the code is vectorized -and does not require looping. We normaly recommend that you use the -Numpy intrinsic functions instead of the corresponding log function -from Python's math module. The looping is done explicitely by the -np.log function. The alternative, and slower way to compute the -logarithms of a vector would be to write -

    - - - -
    -
    -
    -
    -
    - 
    import numpy as np
-from math import log
-x = np.array([4, 7, 8])
-for i in range(0, len(x)):
-    x[i] = log(x[i])
-print(x)
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    We note that our code is much longer already and we need to import the log function from the math module. -The attentive reader will also notice that the output is \( [1, 1, 2] \). Python interprets automagically our numbers as integers (like the automatic keyword in C++). To change this we could define our array elements to be double precision numbers as -

    - - -
    -
    -
    -
    -
    - 
    import numpy as np
-x = np.log(np.array([4, 7, 8], dtype = np.float64))
-print(x)
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    or simply write them as double precision numbers (Python uses 64 bits as default for floating point type variables), that is

    - - -
    -
    -
    -
    -
    - 
    import numpy as np
-x = np.log(np.array([4.0, 7.0, 8.0]))
-print(x)
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    To check the number of bytes (remember that one byte contains eight bits for double precision variables), you can use simple use the itemsize functionality (the array \( x \) is actually an object which inherits the functionalities defined in Numpy) as

    - - -
    -
    -
    -
    -
    - 
    import numpy as np
-x = np.log(np.array([4.0, 7.0, 8.0]))
-print(x.itemsize)
+import matplotlib.pyplot as plt
+from scipy import sparse
+eye = np.eye(4)
+print(eye)
+sparse_mtx = sparse.csr_matrix(eye)
+print(sparse_mtx)
+x = np.linspace(-10,10,100)
+y = np.sin(x)
+plt.plot(x,y,marker='x')
+plt.show()
    @@ -602,7 +645,7 @@ x = np.l
  • 42
  • 43
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs034.html b/doc/pub/week34/html/._week34-bs034.html index 3b9f201cf..a8844b8d8 100644 --- a/doc/pub/week34/html/._week34-bs034.html +++ b/doc/pub/week34/html/._week34-bs034.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,13 +349,24 @@ MathJax.Hub.Config({

     

     

     

    -

    Matrices in Python

    +

    Meet the Pandas

    -

    Having defined vectors, we are now ready to try out matrices. We can -define a \( 3 \times 3 \) real matrix \( \boldsymbol{A} \) as (recall that we user -lowercase letters for vectors and uppercase letters for matrices) +

    +

    +

    +
    +

    + +

    Another useful Python package is +pandas, which is an open source library +providing high-performance, easy-to-use data structures and data +analysis tools for Python. pandas stands for panel data, a term borrowed from econometrics and is an efficient library for data analysis with an emphasis on tabular data. +pandas has two major classes, the DataFrame class with two-dimensional data objects and tabular data organized in columns and the class Series with a focus on one-dimensional data objects. Both classes allow you to index data easily as we will see in the examples below. +pandas allows you also to perform mathematical operations on the data, spanning from simple reshapings of vectors and matrices to statistical operations.

    +

    The following simple example shows how we can, in an easy way make tables of our data. Here we define a data set which includes names, place of birth and date of birth, and displays the data in an easy to read way. We will see repeated use of pandas, in particular in connection with classification of data.

    +
    @@ -365,9 +374,15 @@ lowercase letters for vectors and uppercase letters for matrices)
    - 
    import numpy as np
-A = np.log(np.array([ [4.0, 7.0, 8.0], [3.0, 10.0, 11.0], [4.0, 5.0, 7.0] ]))
-print(A)
+  
    import pandas as pd
+from IPython.display import display
+data = {'First Name': ["Frodo", "Bilbo", "Aragorn II", "Samwise"],
+        'Last Name': ["Baggins", "Baggins","Elessar","Gamgee"],
+        'Place of birth': ["Shire", "Shire", "Eriador", "Shire"],
+        'Date of Birth T.A.': [2968, 2890, 2931, 2980]
+        }
+data_pandas = pd.DataFrame(data)
+display(data_pandas)
    @@ -383,199 +398,20 @@ A = np.l
    -

    If we use the shape function we would get \( (3, 3) \) as output, that is verifying that our matrix is a \( 3\times 3 \) matrix. We can slice the matrix and print for example the first column (Python organized matrix elements in a row-major order, see below) as

    - - -
    -
    -
    -
    -
    - 
    import numpy as np
-A = np.log(np.array([ [4.0, 7.0, 8.0], [3.0, 10.0, 11.0], [4.0, 5.0, 7.0] ]))
-# print the first column, row-major order and elements start with 0
-print(A[:,0]) 
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    We can continue this was by printing out other columns or rows. The example here prints out the second column

    - - -
    -
    -
    -
    -
    - 
    import numpy as np
-A = np.log(np.array([ [4.0, 7.0, 8.0], [3.0, 10.0, 11.0], [4.0, 5.0, 7.0] ]))
-# print the first column, row-major order and elements start with 0
-print(A[1,:]) 
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    Numpy contains many other functionalities that allow us to slice, subdivide etc etc arrays. We strongly recommend that you look up the Numpy website for more details. Useful functions when defining a matrix are the np.zeros function which declares a matrix of a given dimension and sets all elements to zero

    - - -
    -
    -
    -
    -
    - 
    import numpy as np
-n = 10
-# define a matrix of dimension 10 x 10 and set all elements to zero
-A = np.zeros( (n, n) )
-print(A) 
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    or initializing all elements to

    - - -
    -
    -
    -
    -
    - 
    import numpy as np
-n = 10
-# define a matrix of dimension 10 x 10 and set all elements to one
-A = np.ones( (n, n) )
-print(A) 
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    or as unitarily distributed random numbers (see the material on random number generators in the statistics part)

    - - -
    -
    -
    -
    -
    - 
    import numpy as np
-n = 10
-# define a matrix of dimension 10 x 10 and set all elements to random numbers with x \in [0, 1]
-A = np.random.rand(n, n)
-print(A) 
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    As we will see throughout these lectures, there are several extremely useful functionalities in Numpy. -As an example, consider the discussion of the covariance matrix. Suppose we have defined three vectors -\( \boldsymbol{x}, \boldsymbol{y}, \boldsymbol{z} \) with \( n \) elements each. The covariance matrix is defined as -

    -$$ -\boldsymbol{\Sigma} = \begin{bmatrix} \sigma_{xx} & \sigma_{xy} & \sigma_{xz} \\ - \sigma_{yx} & \sigma_{yy} & \sigma_{yz} \\ - \sigma_{zx} & \sigma_{zy} & \sigma_{zz} - \end{bmatrix}, -$$ - -

    where for example

    -$$ -\sigma_{xy} =\frac{1}{n} \sum_{i=0}^{n-1}(x_i- \overline{x})(y_i- \overline{y}). -$$ - -

    The Numpy function np.cov calculates the covariance elements using the factor \( 1/(n-1) \) instead of \( 1/n \) since it assumes we do not have the exact mean values. -The following simple function uses the np.vstack function which takes each vector of dimension \( 1\times n \) and produces a \( 3\times n \) matrix \( \boldsymbol{W} \) -

    -$$ -\boldsymbol{W} = \begin{bmatrix} x_0 & x_1 & x_2 & \dots & x_{n-2} & x_{n-1} \\ - y_0 & y_1 & y_2 & \dots & y_{n-2} & y_{n-1} \\ - z_0 & z_1 & z_2 & \dots & z_{n-2} & z_{n-1} \\ - \end{bmatrix}, -$$ - -

    which in turn is converted into into the \( 3\times 3 \) covariance matrix -\( \boldsymbol{\Sigma} \) via the Numpy function np.cov(). We note that we can also calculate -the mean value of each set of samples \( \boldsymbol{x} \) etc using the Numpy -function np.mean(x). We can also extract the eigenvalues of the -covariance matrix through the np.linalg.eig() function. +

    In the above we have imported pandas with the shorthand pd, the latter has become the standard way we import pandas. We make then a list of various variables +and reorganize the aboves lists into a DataFrame and then print out a neat table with specific column labels as Name, place of birth and date of birth. +Displaying these results, we see that the indices are given by the default numbers from zero to three. +pandas is extremely flexible and we can easily change the above indices by defining a new type of indexing as

    -
    - 
    # Importing various packages
-import numpy as np
-
-n = 100
-x = np.random.normal(size=n)
-print(np.mean(x))
-y = 4+3*x+np.random.normal(size=n)
-print(np.mean(y))
-z = x**3+np.random.normal(size=n)
-print(np.mean(z))
-W = np.vstack((x, y, z))
-Sigma = np.cov(W)
-print(Sigma)
-Eigvals, Eigvecs = np.linalg.eig(Sigma)
-print(Eigvals)
+  
    data_pandas = pd.DataFrame(data,index=['Frodo','Bilbo','Aragorn','Sam'])
+display(data_pandas)
    @@ -589,6 +425,66 @@ Eigvals, Eigvecs = np +
    +
    +
    +
    +
    + 
    display(data_pandas.loc['Aragorn'])
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    We can easily append data to this, for example

    + + +
    +
    +
    +
    +
    + 
    new_hobbit = {'First Name': ["Peregrin"],
+              'Last Name': ["Took"],
+              'Place of birth': ["Shire"],
+              'Date of Birth T.A.': [2990]
+              }
+data_pandas=data_pandas.append(pd.DataFrame(new_hobbit, index=['Pippin']))
+display(data_pandas)
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    Here are other examples where we use the DataFrame functionality to handle arrays, now with more interesting features for us, namely numbers. We set up a matrix +of dimensionality \( 10\times 5 \) and compute the mean value and standard deviation of each column. Similarly, we can perform mathematial operations like squaring the matrix elements and many other operations. +

    +
    @@ -596,15 +492,58 @@ Eigvals, Eigvecs = np 
    import numpy as np
-import matplotlib.pyplot as plt
-from scipy import sparse
-eye = np.eye(4)
-print(eye)
-sparse_mtx = sparse.csr_matrix(eye)
-print(sparse_mtx)
-x = np.linspace(-10,10,100)
-y = np.sin(x)
-plt.plot(x,y,marker='x')
+import pandas as pd
+from IPython.display import display
+np.random.seed(100)
+# setting up a 10 x 5 matrix
+rows = 10
+cols = 5
+a = np.random.randn(rows,cols)
+df = pd.DataFrame(a)
+display(df)
+print(df.mean())
+print(df.std())
+display(df**2)
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    Thereafter we can select specific columns only and plot final results

    + + +
    +
    +
    +
    +
    + 
    df.columns = ['First', 'Second', 'Third', 'Fourth', 'Fifth']
+df.index = np.arange(10)
+
+display(df)
+print(df['Second'].mean() )
+print(df.info())
+print(df.describe())
+
+from pylab import plt, mpl
+plt.style.use('seaborn')
+mpl.rcParams['font.family'] = 'serif'
+
+df.cumsum().plot(lw=2.0, figsize=(10,6))
+plt.show()
+
+
+df.plot.bar(figsize=(10,6), rot=15)
 plt.show()
    @@ -621,6 +560,42 @@ plt.show()
    +

    We can produce a \( 4\times 4 \) matrix

    + + +
    +
    +
    +
    +
    + 
    b = np.arange(16).reshape((4,4))
+print(b)
+df1 = pd.DataFrame(b)
+print(df1)
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    and many other operations.

    + +

    The Series class is another important class included in +pandas. You can view it as a specialization of DataFrame but where +we have just a single column of data. It shares many of the same features as _DataFrame. As with DataFrame, +most operations are vectorized, achieving thereby a high performance when dealing with computations of arrays, in particular labeled arrays. +As we will see below it leads also to a very concice code close to the mathematical operations we may be interested in. +For multidimensional arrays, we recommend strongly xarray. xarray has much of the same flexibility as pandas, but allows for the extension to higher dimensions than two. We will see examples later of the usage of both pandas and xarray. +

    @@ -647,7 +622,7 @@ plt.show()

  • 43
  • 44
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs035.html b/doc/pub/week34/html/._week34-bs035.html index 180cf1d99..03953a1a5 100644 --- a/doc/pub/week34/html/._week34-bs035.html +++ b/doc/pub/week34/html/._week34-bs035.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,253 +349,11 @@ MathJax.Hub.Config({

     

     

     

    -

    Meet the Pandas

    +

    Friday August 27

    -

    -
    -

    -
    -

    +

    "Video of Lecture August 27, 2021":"https://www.uio.no/studier/emner/matnat/fys/FYS-STK4155/h21/forelesningsvideoer/LectureThursdayAugust27.mp4?vrtx=view-as-webpage

    -

    Another useful Python package is -pandas, which is an open source library -providing high-performance, easy-to-use data structures and data -analysis tools for Python. pandas stands for panel data, a term borrowed from econometrics and is an efficient library for data analysis with an emphasis on tabular data. -pandas has two major classes, the DataFrame class with two-dimensional data objects and tabular data organized in columns and the class Series with a focus on one-dimensional data objects. Both classes allow you to index data easily as we will see in the examples below. -pandas allows you also to perform mathematical operations on the data, spanning from simple reshapings of vectors and matrices to statistical operations. -

    - -

    The following simple example shows how we can, in an easy way make tables of our data. Here we define a data set which includes names, place of birth and date of birth, and displays the data in an easy to read way. We will see repeated use of pandas, in particular in connection with classification of data.

    - - - -
    -
    -
    -
    -
    - 
    import pandas as pd
-from IPython.display import display
-data = {'First Name': ["Frodo", "Bilbo", "Aragorn II", "Samwise"],
-        'Last Name': ["Baggins", "Baggins","Elessar","Gamgee"],
-        'Place of birth': ["Shire", "Shire", "Eriador", "Shire"],
-        'Date of Birth T.A.': [2968, 2890, 2931, 2980]
-        }
-data_pandas = pd.DataFrame(data)
-display(data_pandas)
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    In the above we have imported pandas with the shorthand pd, the latter has become the standard way we import pandas. We make then a list of various variables -and reorganize the aboves lists into a DataFrame and then print out a neat table with specific column labels as Name, place of birth and date of birth. -Displaying these results, we see that the indices are given by the default numbers from zero to three. -pandas is extremely flexible and we can easily change the above indices by defining a new type of indexing as -

    - - -
    -
    -
    -
    -
    - 
    data_pandas = pd.DataFrame(data,index=['Frodo','Bilbo','Aragorn','Sam'])
-display(data_pandas)
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    Thereafter we display the content of the row which begins with the index Aragorn

    - - -
    -
    -
    -
    -
    - 
    display(data_pandas.loc['Aragorn'])
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    We can easily append data to this, for example

    - - -
    -
    -
    -
    -
    - 
    new_hobbit = {'First Name': ["Peregrin"],
-              'Last Name': ["Took"],
-              'Place of birth': ["Shire"],
-              'Date of Birth T.A.': [2990]
-              }
-data_pandas=data_pandas.append(pd.DataFrame(new_hobbit, index=['Pippin']))
-display(data_pandas)
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    Here are other examples where we use the DataFrame functionality to handle arrays, now with more interesting features for us, namely numbers. We set up a matrix -of dimensionality \( 10\times 5 \) and compute the mean value and standard deviation of each column. Similarly, we can perform mathematial operations like squaring the matrix elements and many other operations. -

    - - -
    -
    -
    -
    -
    - 
    import numpy as np
-import pandas as pd
-from IPython.display import display
-np.random.seed(100)
-# setting up a 10 x 5 matrix
-rows = 10
-cols = 5
-a = np.random.randn(rows,cols)
-df = pd.DataFrame(a)
-display(df)
-print(df.mean())
-print(df.std())
-display(df**2)
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    Thereafter we can select specific columns only and plot final results

    - - -
    -
    -
    -
    -
    - 
    df.columns = ['First', 'Second', 'Third', 'Fourth', 'Fifth']
-df.index = np.arange(10)
-
-display(df)
-print(df['Second'].mean() )
-print(df.info())
-print(df.describe())
-
-from pylab import plt, mpl
-plt.style.use('seaborn')
-mpl.rcParams['font.family'] = 'serif'
-
-df.cumsum().plot(lw=2.0, figsize=(10,6))
-plt.show()
-
-
-df.plot.bar(figsize=(10,6), rot=15)
-plt.show()
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    We can produce a \( 4\times 4 \) matrix

    - - -
    -
    -
    -
    -
    - 
    b = np.arange(16).reshape((4,4))
-print(b)
-df1 = pd.DataFrame(b)
-print(df1)
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    and many other operations.

    - -

    The Series class is another important class included in -pandas. You can view it as a specialization of DataFrame but where -we have just a single column of data. It shares many of the same features as _DataFrame. As with DataFrame, -most operations are vectorized, achieving thereby a high performance when dealing with computations of arrays, in particular labeled arrays. -As we will see below it leads also to a very concice code close to the mathematical operations we may be interested in. -For multidimensional arrays, we recommend strongly xarray. xarray has much of the same flexibility as pandas, but allows for the extension to higher dimensions than two. We will see examples later of the usage of both pandas and xarray. -

    +

    Video of Lecture from fall 2020 and Handwritten notes

    @@ -624,7 +380,7 @@ For multidimensional arrays, we recommend strongly 44

  • 45
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs036.html b/doc/pub/week34/html/._week34-bs036.html index 9640f779a..8ca92ea3f 100644 --- a/doc/pub/week34/html/._week34-bs036.html +++ b/doc/pub/week34/html/._week34-bs036.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,11 +349,914 @@ MathJax.Hub.Config({

     

     

     

    -

    Friday August 27

    +

    Simple linear regression model using scikit-learn

    -

    "Video of Lecture August 27, 2021":"https://www.uio.no/studier/emner/matnat/fys/FYS-STK4155/h21/forelesningsvideoer/LectureThursdayAugust27.mp4?vrtx=view-as-webpage

    +

    We start with perhaps our simplest possible example, using Scikit-Learn to perform linear regression analysis on a data set produced by us.

    -

    Video of Lecture from fall 2020 and Handwritten notes

    +

    What follows is a simple Python code where we have defined a function +\( y \) in terms of the variable \( x \). Both are defined as vectors with \( 100 \) entries. +The numbers in the vector \( \boldsymbol{x} \) are given +by random numbers generated with a uniform distribution with entries +\( x_i \in [0,1] \) (more about probability distribution functions +later). These values are then used to define a function \( y(x) \) +(tabulated again as a vector) with a linear dependence on \( x \) plus a +random noise added via the normal distribution. +

    + +

    The Numpy functions are imported used the import numpy as np +statement and the random number generator for the uniform distribution +is called using the function np.random.rand(), where we specificy +that we want \( 100 \) random variables. Using Numpy we define +automatically an array with the specified number of elements, \( 100 \) in +our case. With the Numpy function randn() we can compute random +numbers with the normal distribution (mean value \( \mu \) equal to zero and +variance \( \sigma^2 \) set to one) and produce the values of \( y \) assuming a linear +dependence as function of \( x \) +

    + +$$ +y = 2x+N(0,1), +$$ + +

    where \( N(0,1) \) represents random numbers generated by the normal +distribution. From Scikit-Learn we import then the +LinearRegression functionality and make a prediction \( \tilde{y} = +\alpha + \beta x \) using the function fit(x,y). We call the set of +data \( (\boldsymbol{x},\boldsymbol{y}) \) for our training data. The Python package +scikit-learn has also a functionality which extracts the above +fitting parameters \( \alpha \) and \( \beta \) (see below). Later we will +distinguish between training data and test data. +

    + +

    For plotting we use the Python package +matplotlib which produces publication +quality figures. Feel free to explore the extensive +gallery of examples. In +this example we plot our original values of \( x \) and \( y \) as well as the +prediction ypredict (\( \tilde{y} \)), which attempts at fitting our +data with a straight line. +

    + +

    The Python code follows here.

    + + +
    +
    +
    +
    +
    + 
    # Importing various packages
+import numpy as np
+import matplotlib.pyplot as plt
+from sklearn.linear_model import LinearRegression
+
+x = np.random.rand(100,1)
+y = 2*x+np.random.randn(100,1)
+linreg = LinearRegression()
+linreg.fit(x,y)
+xnew = np.array([[0],[1]])
+ypredict = linreg.predict(xnew)
+
+plt.plot(xnew, ypredict, "r-")
+plt.plot(x, y ,'ro')
+plt.axis([0,1.0,0, 5.0])
+plt.xlabel(r'$x$')
+plt.ylabel(r'$y$')
+plt.title(r'Simple Linear Regression')
+plt.show()
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    This example serves several aims. It allows us to demonstrate several +aspects of data analysis and later machine learning algorithms. The +immediate visualization shows that our linear fit is not +impressive. It goes through the data points, but there are many +outliers which are not reproduced by our linear regression. We could +now play around with this small program and change for example the +factor in front of \( x \) and the normal distribution. Try to change the +function \( y \) to +

    + +$$ +y = 10x+0.01 \times N(0,1), +$$ + +

    where \( x \) is defined as before. Does the fit look better? Indeed, by +reducing the role of the noise given by the normal distribution we see immediately that +our linear prediction seemingly reproduces better the training +set. However, this testing 'by the eye' is obviouly not satisfactory in the +long run. Here we have only defined the training data and our model, and +have not discussed a more rigorous approach to the cost function. +

    + +

    We need more rigorous criteria in defining whether we have succeeded or +not in modeling our training data. You will be surprised to see that +many scientists seldomly venture beyond this 'by the eye' approach. A +standard approach for the cost function is the so-called \( \chi^2 \) +function (a variant of the mean-squared error (MSE)) +

    + +$$ \chi^2 = \frac{1}{n} +\sum_{i=0}^{n-1}\frac{(y_i-\tilde{y}_i)^2}{\sigma_i^2}, +$$ + +

    where \( \sigma_i^2 \) is the variance (to be defined later) of the entry +\( y_i \). We may not know the explicit value of \( \sigma_i^2 \), it serves +however the aim of scaling the equations and make the cost function +dimensionless. +

    + +

    Minimizing the cost function is a central aspect of +our discussions to come. Finding its minima as function of the model +parameters (\( \alpha \) and \( \beta \) in our case) will be a recurring +theme in these series of lectures. Essentially all machine learning +algorithms we will discuss center around the minimization of the +chosen cost function. This depends in turn on our specific +model for describing the data, a typical situation in supervised +learning. Automatizing the search for the minima of the cost function is a +central ingredient in all algorithms. Typical methods which are +employed are various variants of gradient methods. These will be +discussed in more detail later. Again, you'll be surprised to hear that +many practitioners minimize the above function ''by the eye', popularly dubbed as +'chi by the eye'. That is, change a parameter and see (visually and numerically) that +the \( \chi^2 \) function becomes smaller. +

    + +

    There are many ways to define the cost function. A simpler approach is to look at the relative difference between the training data and the predicted data, that is we define +the relative error (why would we prefer the MSE instead of the relative error?) as +

    + +$$ +\epsilon_{\mathrm{relative}}= \frac{\vert \boldsymbol{y} -\boldsymbol{\tilde{y}}\vert}{\vert \boldsymbol{y}\vert}. +$$ + +

    The squared cost function results in an arithmetic mean-unbiased +estimator, and the absolute-value cost function results in a +median-unbiased estimator (in the one-dimensional case, and a +geometric median-unbiased estimator for the multi-dimensional +case). The squared cost function has the disadvantage that it has the tendency +to be dominated by outliers. +

    + +

    We can modify easily the above Python code and plot the relative error instead

    + + +
    +
    +
    +
    +
    + 
    import numpy as np
+import matplotlib.pyplot as plt
+from sklearn.linear_model import LinearRegression
+
+x = np.random.rand(100,1)
+y = 5*x+0.01*np.random.randn(100,1)
+linreg = LinearRegression()
+linreg.fit(x,y)
+ypredict = linreg.predict(x)
+
+plt.plot(x, np.abs(ypredict-y)/abs(y), "ro")
+plt.axis([0,1.0,0.0, 0.5])
+plt.xlabel(r'$x$')
+plt.ylabel(r'$\epsilon_{\mathrm{relative}}$')
+plt.title(r'Relative error')
+plt.show()
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    Depending on the parameter in front of the normal distribution, we may +have a small or larger relative error. Try to play around with +different training data sets and study (graphically) the value of the +relative error. +

    + +

    As mentioned above, Scikit-Learn has an impressive functionality. +We can for example extract the values of \( \alpha \) and \( \beta \) and +their error estimates, or the variance and standard deviation and many +other properties from the statistical data analysis. +

    + +

    Here we show an +example of the functionality of Scikit-Learn. +

    + + +
    +
    +
    +
    +
    + 
    import numpy as np 
+import matplotlib.pyplot as plt 
+from sklearn.linear_model import LinearRegression 
+from sklearn.metrics import mean_squared_error, r2_score, mean_squared_log_error, mean_absolute_error
+
+x = np.random.rand(100,1)
+y = 2.0+ 5*x+0.5*np.random.randn(100,1)
+linreg = LinearRegression()
+linreg.fit(x,y)
+ypredict = linreg.predict(x)
+print('The intercept alpha: \n', linreg.intercept_)
+print('Coefficient beta : \n', linreg.coef_)
+# The mean squared error                               
+print("Mean squared error: %.2f" % mean_squared_error(y, ypredict))
+# Explained variance score: 1 is perfect prediction                                 
+print('Variance score: %.2f' % r2_score(y, ypredict))
+# Mean squared log error                                                        
+print('Mean squared log error: %.2f' % mean_squared_log_error(y, ypredict) )
+# Mean absolute error                                                           
+print('Mean absolute error: %.2f' % mean_absolute_error(y, ypredict))
+plt.plot(x, ypredict, "r-")
+plt.plot(x, y ,'ro')
+plt.axis([0.0,1.0,1.5, 7.0])
+plt.xlabel(r'$x$')
+plt.ylabel(r'$y$')
+plt.title(r'Linear Regression fit ')
+plt.show()
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    The function coef gives us the parameter \( \beta \) of our fit while intercept yields +\( \alpha \). Depending on the constant in front of the normal distribution, we get values near or far from \( \alpha =2 \) and \( \beta =5 \). Try to play around with different parameters in front of the normal distribution. The function meansquarederror gives us the mean square error, a risk metric corresponding to the expected value of the squared (quadratic) error or loss defined as +

    +$$ MSE(\boldsymbol{y},\boldsymbol{\tilde{y}}) = \frac{1}{n} +\sum_{i=0}^{n-1}(y_i-\tilde{y}_i)^2, +$$ + +

    The smaller the value, the better the fit. Ideally we would like to +have an MSE equal zero. The attentive reader has probably recognized +this function as being similar to the \( \chi^2 \) function defined above. +

    + +

    The r2score function computes \( R^2 \), the coefficient of +determination. It provides a measure of how well future samples are +likely to be predicted by the model. Best possible score is 1.0 and it +can be negative (because the model can be arbitrarily worse). A +constant model that always predicts the expected value of \( \boldsymbol{y} \), +disregarding the input features, would get a \( R^2 \) score of \( 0.0 \). +

    + +

    If \( \tilde{\boldsymbol{y}}_i \) is the predicted value of the \( i-th \) sample and \( y_i \) is the corresponding true value, then the score \( R^2 \) is defined as

    +$$ +R^2(\boldsymbol{y}, \tilde{\boldsymbol{y}}) = 1 - \frac{\sum_{i=0}^{n - 1} (y_i - \tilde{y}_i)^2}{\sum_{i=0}^{n - 1} (y_i - \bar{y})^2}, +$$ + +

    where we have defined the mean value of \( \boldsymbol{y} \) as

    +$$ +\bar{y} = \frac{1}{n} \sum_{i=0}^{n - 1} y_i. +$$ + +

    Another quantity taht we will meet again in our discussions of regression analysis is + the mean absolute error (MAE), a risk metric corresponding to the expected value of the absolute error loss or what we call the \( l1 \)-norm loss. In our discussion above we presented the relative error. +The MAE is defined as follows +

    +$$ +\text{MAE}(\boldsymbol{y}, \boldsymbol{\tilde{y}}) = \frac{1}{n} \sum_{i=0}^{n-1} \left| y_i - \tilde{y}_i \right|. +$$ + +

    We present the +squared logarithmic (quadratic) error +

    +$$ +\text{MSLE}(\boldsymbol{y}, \boldsymbol{\tilde{y}}) = \frac{1}{n} \sum_{i=0}^{n - 1} (\log_e (1 + y_i) - \log_e (1 + \tilde{y}_i) )^2, +$$ + +

    where \( \log_e (x) \) stands for the natural logarithm of \( x \). This error +estimate is best to use when targets having exponential growth, such +as population counts, average sales of a commodity over a span of +years etc. +

    + +

    Finally, another cost function is the Huber cost function used in robust regression.

    + +

    The rationale behind this possible cost function is its reduced +sensitivity to outliers in the data set. In our discussions on +dimensionality reduction and normalization of data we will meet other +ways of dealing with outliers. +

    + +

    The Huber cost function is defined as

    +$$ +H_{\delta}(\boldsymbol{a})=\left\{\begin{array}{cc}\frac{1}{2} \boldsymbol{a}^{2}& \text{for }|\boldsymbol{a}|\leq \delta\\ \delta (|\boldsymbol{a}|-\frac{1}{2}\delta ),&\text{otherwise}.\end{array}\right. +$$ + +

    Here \( \boldsymbol{a}=\boldsymbol{y} - \boldsymbol{\tilde{y}} \).

    + +

    We will discuss in more detail these and other functions in the +various lectures. We conclude this part with another example. Instead +of a linear \( x \)-dependence we study now a cubic polynomial and use the +polynomial regression analysis tools of scikit-learn. +

    + + + +
    +
    +
    +
    +
    + 
    import matplotlib.pyplot as plt
+import numpy as np
+import random
+from sklearn.linear_model import Ridge
+from sklearn.preprocessing import PolynomialFeatures
+from sklearn.pipeline import make_pipeline
+from sklearn.linear_model import LinearRegression
+
+x=np.linspace(0.02,0.98,200)
+noise = np.asarray(random.sample((range(200)),200))
+y=x**3*noise
+yn=x**3*100
+poly3 = PolynomialFeatures(degree=3)
+X = poly3.fit_transform(x[:,np.newaxis])
+clf3 = LinearRegression()
+clf3.fit(X,y)
+
+Xplot=poly3.fit_transform(x[:,np.newaxis])
+poly3_plot=plt.plot(x, clf3.predict(Xplot), label='Cubic Fit')
+plt.plot(x,yn, color='red', label="True Cubic")
+plt.scatter(x, y, label='Data', color='orange', s=15)
+plt.legend()
+plt.show()
+
+def error(a):
+    for i in y:
+        err=(y-yn)/yn
+    return abs(np.sum(err))/len(err)
+
+print (error(y))
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +

    To our real data: nuclear binding energies. Brief reminder on masses and binding energies

    + +

    Let us now dive into nuclear physics and remind ourselves briefly about some basic features about binding +energies. A basic quantity which can be measured for the ground +states of nuclei is the atomic mass \( M(N, Z) \) of the neutral atom with +atomic mass number \( A \) and charge \( Z \). The number of neutrons is \( N \). There are indeed several sophisticated experiments worldwide which allow us to measure this quantity to high precision (parts per million even). +

    + +

    Atomic masses are usually tabulated in terms of the mass excess defined by

    +$$ +\Delta M(N, Z) = M(N, Z) - uA, +$$ + +

    where \( u \) is the Atomic Mass Unit

    +$$ +u = M(^{12}\mathrm{C})/12 = 931.4940954(57) \hspace{0.1cm} \mathrm{MeV}/c^2. +$$ + +

    The nucleon masses are

    +$$ +m_p = 1.00727646693(9)u, +$$ + +

    and

    +$$ +m_n = 939.56536(8)\hspace{0.1cm} \mathrm{MeV}/c^2 = 1.0086649156(6)u. +$$ + +

    In the 2016 mass evaluation of by W.J.Huang, G.Audi, M.Wang, F.G.Kondev, S.Naimi and X.Xu +there are data on masses and decays of 3437 nuclei. +

    + +

    The nuclear binding energy is defined as the energy required to break +up a given nucleus into its constituent parts of \( N \) neutrons and \( Z \) +protons. In terms of the atomic masses \( M(N, Z) \) the binding energy is +defined by +

    + +$$ +BE(N, Z) = ZM_H c^2 + Nm_n c^2 - M(N, Z)c^2 , +$$ + +

    where \( M_H \) is the mass of the hydrogen atom and \( m_n \) is the mass of the neutron. +In terms of the mass excess the binding energy is given by +

    +$$ +BE(N, Z) = Z\Delta_H c^2 + N\Delta_n c^2 -\Delta(N, Z)c^2 , +$$ + +

    where \( \Delta_H c^2 = 7.2890 \) MeV and \( \Delta_n c^2 = 8.0713 \) MeV.

    + +

    A popular and physically intuitive model which can be used to parametrize +the experimental binding energies as function of \( A \), is the so-called +liquid drop model. The ansatz is based on the following expression +

    + +$$ +BE(N,Z) = a_1A-a_2A^{2/3}-a_3\frac{Z^2}{A^{1/3}}-a_4\frac{(N-Z)^2}{A}, +$$ + +

    where \( A \) stands for the number of nucleons and the $a_i$s are parameters which are determined by a fit +to the experimental data. +

    + +

    To arrive at the above expression we have assumed that we can make the following assumptions:

    + +
      +
    • There is a volume term \( a_1A \) proportional with the number of nucleons (the energy is also an extensive quantity). When an assembly of nucleons of the same size is packed together into the smallest volume, each interior nucleon has a certain number of other nucleons in contact with it. This contribution is proportional to the volume.
      • +
    • There is a surface energy term \( a_2A^{2/3} \). The assumption here is that a nucleon at the surface of a nucleus interacts with fewer other nucleons than one in the interior of the nucleus and hence its binding energy is less. This surface energy term takes that into account and is therefore negative and is proportional to the surface area.
      • +
    • There is a Coulomb energy term \( a_3\frac{Z^2}{A^{1/3}} \). The electric repulsion between each pair of protons in a nucleus yields less binding.
      • +
    • There is an asymmetry term \( a_4\frac{(N-Z)^2}{A} \). This term is associated with the Pauli exclusion principle and reflects the fact that the proton-neutron interaction is more attractive on the average than the neutron-neutron and proton-proton interactions.
      • +
    +

    We could also add a so-called pairing term, which is a correction term that +arises from the tendency of proton pairs and neutron pairs to +occur. An even number of particles is more stable than an odd number. +

    +

    Organizing our data

    + +

    Let us start with reading and organizing our data. +We start with the compilation of masses and binding energies from 2016. +After having downloaded this file to our own computer, we are now ready to read the file and start structuring our data. +

    + +

    We start with preparing folders for storing our calculations and the data file over masses and binding energies. We import also various modules that we will find useful in order to present various Machine Learning methods. Here we focus mainly on the functionality of scikit-learn.

    + + +
    +
    +
    +
    +
    + 
    # Common imports
+import numpy as np
+import pandas as pd
+import matplotlib.pyplot as plt
+import sklearn.linear_model as skl
+from sklearn.model_selection import train_test_split
+from sklearn.metrics import mean_squared_error, r2_score, mean_absolute_error
+import os
+
+# Where to save the figures and data files
+PROJECT_ROOT_DIR = "Results"
+FIGURE_ID = "Results/FigureFiles"
+DATA_ID = "DataFiles/"
+
+if not os.path.exists(PROJECT_ROOT_DIR):
+    os.mkdir(PROJECT_ROOT_DIR)
+
+if not os.path.exists(FIGURE_ID):
+    os.makedirs(FIGURE_ID)
+
+if not os.path.exists(DATA_ID):
+    os.makedirs(DATA_ID)
+
+def image_path(fig_id):
+    return os.path.join(FIGURE_ID, fig_id)
+
+def data_path(dat_id):
+    return os.path.join(DATA_ID, dat_id)
+
+def save_fig(fig_id):
+    plt.savefig(image_path(fig_id) + ".png", format='png')
+
+infile = open(data_path("MassEval2016.dat"),'r')
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    Before we proceed, we define also a function for making our plots. You can obviously avoid this and simply set up various matplotlib commands every time you need them. You may however find it convenient to collect all such commands in one function and simply call this function.

    + + +
    +
    +
    +
    +
    + 
    from pylab import plt, mpl
+plt.style.use('seaborn')
+mpl.rcParams['font.family'] = 'serif'
+
+def MakePlot(x,y, styles, labels, axlabels):
+    plt.figure(figsize=(10,6))
+    for i in range(len(x)):
+        plt.plot(x[i], y[i], styles[i], label = labels[i])
+        plt.xlabel(axlabels[0])
+        plt.ylabel(axlabels[1])
+    plt.legend(loc=0)
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    Our next step is to read the data on experimental binding energies and +reorganize them as functions of the mass number \( A \), the number of +protons \( Z \) and neutrons \( N \) using pandas. Before we do this it is +always useful (unless you have a binary file or other types of compressed +data) to actually open the file and simply take a look at it! +

    + +

    In particular, the program that outputs the final nuclear masses is written in Fortran with a specific format. It means that we need to figure out the format and which columns contain the data we are interested in. Pandas comes with a function that reads formatted output. After having admired the file, we are now ready to start massaging it with pandas. The file begins with some basic format information.

    + + +
    +
    +
    +
    +
    + 
    """                                                                                                                         
+This is taken from the data file of the mass 2016 evaluation.                                                               
+All files are 3436 lines long with 124 character per line.                                                                  
+       Headers are 39 lines long.                                                                                           
+   col 1     :  Fortran character control: 1 = page feed  0 = line feed                                                     
+   format    :  a1,i3,i5,i5,i5,1x,a3,a4,1x,f13.5,f11.5,f11.3,f9.3,1x,a2,f11.3,f9.3,1x,i3,1x,f12.5,f11.5                     
+   These formats are reflected in the pandas widths variable below, see the statement                                       
+   widths=(1,3,5,5,5,1,3,4,1,13,11,11,9,1,2,11,9,1,3,1,12,11,1),                                                            
+   Pandas has also a variable header, with length 39 in this case.                                                          
+"""
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    The data we are interested in are in columns 2, 3, 4 and 11, giving us +the number of neutrons, protons, mass numbers and binding energies, +respectively. We add also for the sake of completeness the element name. The data are in fixed-width formatted lines and we will +covert them into the pandas DataFrame structure. +

    + + + +
    +
    +
    +
    +
    + 
    # Read the experimental data with Pandas
+Masses = pd.read_fwf(infile, usecols=(2,3,4,6,11),
+              names=('N', 'Z', 'A', 'Element', 'Ebinding'),
+              widths=(1,3,5,5,5,1,3,4,1,13,11,11,9,1,2,11,9,1,3,1,12,11,1),
+              header=39,
+              index_col=False)
+
+# Extrapolated values are indicated by '#' in place of the decimal place, so
+# the Ebinding column won't be numeric. Coerce to float and drop these entries.
+Masses['Ebinding'] = pd.to_numeric(Masses['Ebinding'], errors='coerce')
+Masses = Masses.dropna()
+# Convert from keV to MeV.
+Masses['Ebinding'] /= 1000
+
+# Group the DataFrame by nucleon number, A.
+Masses = Masses.groupby('A')
+# Find the rows of the grouped DataFrame with the maximum binding energy.
+Masses = Masses.apply(lambda t: t[t.Ebinding==t.Ebinding.max()])
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    We have now read in the data, grouped them according to the variables we are interested in. +We see how easy it is to reorganize the data using pandas. If we +were to do these operations in C/C++ or Fortran, we would have had to +write various functions/subroutines which perform the above +reorganizations for us. Having reorganized the data, we can now start +to make some simple fits using both the functionalities in numpy and +Scikit-Learn afterwards. +

    + +

    Now we define five variables which contain +the number of nucleons \( A \), the number of protons \( Z \) and the number of neutrons \( N \), the element name and finally the energies themselves. +

    + + +
    +
    +
    +
    +
    + 
    A = Masses['A']
+Z = Masses['Z']
+N = Masses['N']
+Element = Masses['Element']
+Energies = Masses['Ebinding']
+print(Masses)
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    The next step, and we will define this mathematically later, is to set up the so-called design matrix. We will throughout call this matrix \( \boldsymbol{X} \). +It has dimensionality \( p\times n \), where \( n \) is the number of data points and \( p \) are the so-called predictors. In our case here they are given by the number of polynomials in \( A \) we wish to include in the fit. +

    + + +
    +
    +
    +
    +
    + 
    # Now we set up the design matrix X
+X = np.zeros((len(A),5))
+X[:,0] = 1
+X[:,1] = A
+X[:,2] = A**(2.0/3.0)
+X[:,3] = A**(-1.0/3.0)
+X[:,4] = A**(-1.0)
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    With scikitlearn we are now ready to use linear regression and fit our data.

    + + +
    +
    +
    +
    +
    + 
    clf = skl.LinearRegression().fit(X, Energies)
+fity = clf.predict(X)
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    Pretty simple! +Now we can print measures of how our fit is doing, the coefficients from the fits and plot the final fit together with our data. +

    + + +
    +
    +
    +
    +
    + 
    # The mean squared error                               
+print("Mean squared error: %.2f" % mean_squared_error(Energies, fity))
+# Explained variance score: 1 is perfect prediction                                 
+print('Variance score: %.2f' % r2_score(Energies, fity))
+# Mean absolute error                                                           
+print('Mean absolute error: %.2f' % mean_absolute_error(Energies, fity))
+print(clf.coef_, clf.intercept_)
+
+Masses['Eapprox']  = fity
+# Generate a plot comparing the experimental with the fitted values values.
+fig, ax = plt.subplots()
+ax.set_xlabel(r'$A = N + Z$')
+ax.set_ylabel(r'$E_\mathrm{bind}\,/\mathrm{MeV}$')
+ax.plot(Masses['A'], Masses['Ebinding'], alpha=0.7, lw=2,
+            label='Ame2016')
+ax.plot(Masses['A'], Masses['Eapprox'], alpha=0.7, lw=2, c='m',
+            label='Fit')
+ax.legend()
+save_fig("Masses2016")
+plt.show()
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +

    Seeing the wood for the trees

    + +

    As a teaser, let us now see how we can do this with decision trees using scikit-learn. Later we will switch to so-called random forests!

    + + + +
    +
    +
    +
    +
    + 
    #Decision Tree Regression
+from sklearn.tree import DecisionTreeRegressor
+regr_1=DecisionTreeRegressor(max_depth=5)
+regr_2=DecisionTreeRegressor(max_depth=7)
+regr_3=DecisionTreeRegressor(max_depth=9)
+regr_1.fit(X, Energies)
+regr_2.fit(X, Energies)
+regr_3.fit(X, Energies)
+
+
+y_1 = regr_1.predict(X)
+y_2 = regr_2.predict(X)
+y_3=regr_3.predict(X)
+Masses['Eapprox'] = y_3
+# Plot the results
+plt.figure()
+plt.plot(A, Energies, color="blue", label="Data", linewidth=2)
+plt.plot(A, y_1, color="red", label="max_depth=5", linewidth=2)
+plt.plot(A, y_2, color="green", label="max_depth=7", linewidth=2)
+plt.plot(A, y_3, color="m", label="max_depth=9", linewidth=2)
+
+plt.xlabel("$A$")
+plt.ylabel("$E$[MeV]")
+plt.title("Decision Tree Regression")
+plt.legend()
+save_fig("Masses2016Trees")
+plt.show()
+print(Masses)
+print(np.mean( (Energies-y_1)**2))
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +

    And what about using neural networks?

    +

    The seaborn package allows us to visualize data in an efficient way. Note that we use scikit-learn's multi-layer perceptron (or feed forward neural network) +functionality. +

    + + +
    +
    +
    +
    +
    + 
    from sklearn.neural_network import MLPRegressor
+from sklearn.metrics import accuracy_score
+import seaborn as sns
+
+X_train = X
+Y_train = Energies
+n_hidden_neurons = 100
+epochs = 100
+# store models for later use
+eta_vals = np.logspace(-5, 1, 7)
+lmbd_vals = np.logspace(-5, 1, 7)
+# store the models for later use
+DNN_scikit = np.zeros((len(eta_vals), len(lmbd_vals)), dtype=object)
+train_accuracy = np.zeros((len(eta_vals), len(lmbd_vals)))
+sns.set()
+for i, eta in enumerate(eta_vals):
+    for j, lmbd in enumerate(lmbd_vals):
+        dnn = MLPRegressor(hidden_layer_sizes=(n_hidden_neurons), activation='logistic',
+                            alpha=lmbd, learning_rate_init=eta, max_iter=epochs)
+        dnn.fit(X_train, Y_train)
+        DNN_scikit[i][j] = dnn
+        train_accuracy[i][j] = dnn.score(X_train, Y_train)
+
+fig, ax = plt.subplots(figsize = (10, 10))
+sns.heatmap(train_accuracy, annot=True, ax=ax, cmap="viridis")
+ax.set_title("Training Accuracy")
+ax.set_ylabel("$\eta$")
+ax.set_xlabel("$\lambda$")
+plt.show()
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +

    A first summary

    + +

    The aim behind these introductory words was to present to you various +Python libraries and their functionalities, in particular libraries like +numpy, pandas, xarray and matplotlib and other that make our life much easier +in handling various data sets and visualizing data. +

    + +

    Furthermore, +Scikit-Learn allows us with few lines of code to implement popular +Machine Learning algorithms for supervised learning. Later we will meet Tensorflow, a powerful library for deep learning. +Now it is time to dive more into the details of various methods. We will start with linear regression and try to take a deeper look at what it entails. +

    @@ -382,7 +1283,7 @@ MathJax.Hub.Config({

  • 45
  • 46
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs037.html b/doc/pub/week34/html/._week34-bs037.html index dbc3e6e5f..87310d9de 100644 --- a/doc/pub/week34/html/._week34-bs037.html +++ b/doc/pub/week34/html/._week34-bs037.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,913 +349,22 @@ MathJax.Hub.Config({

     

     

     

    -

    Simple linear regression model using scikit-learn

    - -

    We start with perhaps our simplest possible example, using Scikit-Learn to perform linear regression analysis on a data set produced by us.

    - -

    What follows is a simple Python code where we have defined a function -\( y \) in terms of the variable \( x \). Both are defined as vectors with \( 100 \) entries. -The numbers in the vector \( \boldsymbol{x} \) are given -by random numbers generated with a uniform distribution with entries -\( x_i \in [0,1] \) (more about probability distribution functions -later). These values are then used to define a function \( y(x) \) -(tabulated again as a vector) with a linear dependence on \( x \) plus a -random noise added via the normal distribution. -

    - -

    The Numpy functions are imported used the import numpy as np -statement and the random number generator for the uniform distribution -is called using the function np.random.rand(), where we specificy -that we want \( 100 \) random variables. Using Numpy we define -automatically an array with the specified number of elements, \( 100 \) in -our case. With the Numpy function randn() we can compute random -numbers with the normal distribution (mean value \( \mu \) equal to zero and -variance \( \sigma^2 \) set to one) and produce the values of \( y \) assuming a linear -dependence as function of \( x \) -

    - -$$ -y = 2x+N(0,1), -$$ - -

    where \( N(0,1) \) represents random numbers generated by the normal -distribution. From Scikit-Learn we import then the -LinearRegression functionality and make a prediction \( \tilde{y} = -\alpha + \beta x \) using the function fit(x,y). We call the set of -data \( (\boldsymbol{x},\boldsymbol{y}) \) for our training data. The Python package -scikit-learn has also a functionality which extracts the above -fitting parameters \( \alpha \) and \( \beta \) (see below). Later we will -distinguish between training data and test data. -

    - -

    For plotting we use the Python package -matplotlib which produces publication -quality figures. Feel free to explore the extensive -gallery of examples. In -this example we plot our original values of \( x \) and \( y \) as well as the -prediction ypredict (\( \tilde{y} \)), which attempts at fitting our -data with a straight line. -

    - -

    The Python code follows here.

    - - -
    -
    -
    -
    -
    - 
    # Importing various packages
-import numpy as np
-import matplotlib.pyplot as plt
-from sklearn.linear_model import LinearRegression
-
-x = np.random.rand(100,1)
-y = 2*x+np.random.randn(100,1)
-linreg = LinearRegression()
-linreg.fit(x,y)
-xnew = np.array([[0],[1]])
-ypredict = linreg.predict(xnew)
-
-plt.plot(xnew, ypredict, "r-")
-plt.plot(x, y ,'ro')
-plt.axis([0,1.0,0, 5.0])
-plt.xlabel(r'$x$')
-plt.ylabel(r'$y$')
-plt.title(r'Simple Linear Regression')
-plt.show()
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    This example serves several aims. It allows us to demonstrate several -aspects of data analysis and later machine learning algorithms. The -immediate visualization shows that our linear fit is not -impressive. It goes through the data points, but there are many -outliers which are not reproduced by our linear regression. We could -now play around with this small program and change for example the -factor in front of \( x \) and the normal distribution. Try to change the -function \( y \) to -

    - -$$ -y = 10x+0.01 \times N(0,1), -$$ - -

    where \( x \) is defined as before. Does the fit look better? Indeed, by -reducing the role of the noise given by the normal distribution we see immediately that -our linear prediction seemingly reproduces better the training -set. However, this testing 'by the eye' is obviouly not satisfactory in the -long run. Here we have only defined the training data and our model, and -have not discussed a more rigorous approach to the cost function. -

    - -

    We need more rigorous criteria in defining whether we have succeeded or -not in modeling our training data. You will be surprised to see that -many scientists seldomly venture beyond this 'by the eye' approach. A -standard approach for the cost function is the so-called \( \chi^2 \) -function (a variant of the mean-squared error (MSE)) -

    - -$$ \chi^2 = \frac{1}{n} -\sum_{i=0}^{n-1}\frac{(y_i-\tilde{y}_i)^2}{\sigma_i^2}, -$$ - -

    where \( \sigma_i^2 \) is the variance (to be defined later) of the entry -\( y_i \). We may not know the explicit value of \( \sigma_i^2 \), it serves -however the aim of scaling the equations and make the cost function -dimensionless. -

    - -

    Minimizing the cost function is a central aspect of -our discussions to come. Finding its minima as function of the model -parameters (\( \alpha \) and \( \beta \) in our case) will be a recurring -theme in these series of lectures. Essentially all machine learning -algorithms we will discuss center around the minimization of the -chosen cost function. This depends in turn on our specific -model for describing the data, a typical situation in supervised -learning. Automatizing the search for the minima of the cost function is a -central ingredient in all algorithms. Typical methods which are -employed are various variants of gradient methods. These will be -discussed in more detail later. Again, you'll be surprised to hear that -many practitioners minimize the above function ''by the eye', popularly dubbed as -'chi by the eye'. That is, change a parameter and see (visually and numerically) that -the \( \chi^2 \) function becomes smaller. -

    - -

    There are many ways to define the cost function. A simpler approach is to look at the relative difference between the training data and the predicted data, that is we define -the relative error (why would we prefer the MSE instead of the relative error?) as -

    - -$$ -\epsilon_{\mathrm{relative}}= \frac{\vert \boldsymbol{y} -\boldsymbol{\tilde{y}}\vert}{\vert \boldsymbol{y}\vert}. -$$ - -

    The squared cost function results in an arithmetic mean-unbiased -estimator, and the absolute-value cost function results in a -median-unbiased estimator (in the one-dimensional case, and a -geometric median-unbiased estimator for the multi-dimensional -case). The squared cost function has the disadvantage that it has the tendency -to be dominated by outliers. -

    - -

    We can modify easily the above Python code and plot the relative error instead

    - - -
    -
    -
    -
    -
    - 
    import numpy as np
-import matplotlib.pyplot as plt
-from sklearn.linear_model import LinearRegression
-
-x = np.random.rand(100,1)
-y = 5*x+0.01*np.random.randn(100,1)
-linreg = LinearRegression()
-linreg.fit(x,y)
-ypredict = linreg.predict(x)
-
-plt.plot(x, np.abs(ypredict-y)/abs(y), "ro")
-plt.axis([0,1.0,0.0, 0.5])
-plt.xlabel(r'$x$')
-plt.ylabel(r'$\epsilon_{\mathrm{relative}}$')
-plt.title(r'Relative error')
-plt.show()
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    Depending on the parameter in front of the normal distribution, we may -have a small or larger relative error. Try to play around with -different training data sets and study (graphically) the value of the -relative error. -

    - -

    As mentioned above, Scikit-Learn has an impressive functionality. -We can for example extract the values of \( \alpha \) and \( \beta \) and -their error estimates, or the variance and standard deviation and many -other properties from the statistical data analysis. -

    - -

    Here we show an -example of the functionality of Scikit-Learn. -

    - - -
    -
    -
    -
    -
    - 
    import numpy as np 
-import matplotlib.pyplot as plt 
-from sklearn.linear_model import LinearRegression 
-from sklearn.metrics import mean_squared_error, r2_score, mean_squared_log_error, mean_absolute_error
-
-x = np.random.rand(100,1)
-y = 2.0+ 5*x+0.5*np.random.randn(100,1)
-linreg = LinearRegression()
-linreg.fit(x,y)
-ypredict = linreg.predict(x)
-print('The intercept alpha: \n', linreg.intercept_)
-print('Coefficient beta : \n', linreg.coef_)
-# The mean squared error                               
-print("Mean squared error: %.2f" % mean_squared_error(y, ypredict))
-# Explained variance score: 1 is perfect prediction                                 
-print('Variance score: %.2f' % r2_score(y, ypredict))
-# Mean squared log error                                                        
-print('Mean squared log error: %.2f' % mean_squared_log_error(y, ypredict) )
-# Mean absolute error                                                           
-print('Mean absolute error: %.2f' % mean_absolute_error(y, ypredict))
-plt.plot(x, ypredict, "r-")
-plt.plot(x, y ,'ro')
-plt.axis([0.0,1.0,1.5, 7.0])
-plt.xlabel(r'$x$')
-plt.ylabel(r'$y$')
-plt.title(r'Linear Regression fit ')
-plt.show()
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    The function coef gives us the parameter \( \beta \) of our fit while intercept yields -\( \alpha \). Depending on the constant in front of the normal distribution, we get values near or far from \( \alpha =2 \) and \( \beta =5 \). Try to play around with different parameters in front of the normal distribution. The function meansquarederror gives us the mean square error, a risk metric corresponding to the expected value of the squared (quadratic) error or loss defined as -

    -$$ MSE(\boldsymbol{y},\boldsymbol{\tilde{y}}) = \frac{1}{n} -\sum_{i=0}^{n-1}(y_i-\tilde{y}_i)^2, -$$ - -

    The smaller the value, the better the fit. Ideally we would like to -have an MSE equal zero. The attentive reader has probably recognized -this function as being similar to the \( \chi^2 \) function defined above. -

    - -

    The r2score function computes \( R^2 \), the coefficient of -determination. It provides a measure of how well future samples are -likely to be predicted by the model. Best possible score is 1.0 and it -can be negative (because the model can be arbitrarily worse). A -constant model that always predicts the expected value of \( \boldsymbol{y} \), -disregarding the input features, would get a \( R^2 \) score of \( 0.0 \). -

    - -

    If \( \tilde{\boldsymbol{y}}_i \) is the predicted value of the \( i-th \) sample and \( y_i \) is the corresponding true value, then the score \( R^2 \) is defined as

    -$$ -R^2(\boldsymbol{y}, \tilde{\boldsymbol{y}}) = 1 - \frac{\sum_{i=0}^{n - 1} (y_i - \tilde{y}_i)^2}{\sum_{i=0}^{n - 1} (y_i - \bar{y})^2}, -$$ - -

    where we have defined the mean value of \( \boldsymbol{y} \) as

    -$$ -\bar{y} = \frac{1}{n} \sum_{i=0}^{n - 1} y_i. -$$ - -

    Another quantity taht we will meet again in our discussions of regression analysis is - the mean absolute error (MAE), a risk metric corresponding to the expected value of the absolute error loss or what we call the \( l1 \)-norm loss. In our discussion above we presented the relative error. -The MAE is defined as follows -

    -$$ -\text{MAE}(\boldsymbol{y}, \boldsymbol{\tilde{y}}) = \frac{1}{n} \sum_{i=0}^{n-1} \left| y_i - \tilde{y}_i \right|. -$$ - -

    We present the -squared logarithmic (quadratic) error -

    -$$ -\text{MSLE}(\boldsymbol{y}, \boldsymbol{\tilde{y}}) = \frac{1}{n} \sum_{i=0}^{n - 1} (\log_e (1 + y_i) - \log_e (1 + \tilde{y}_i) )^2, -$$ - -

    where \( \log_e (x) \) stands for the natural logarithm of \( x \). This error -estimate is best to use when targets having exponential growth, such -as population counts, average sales of a commodity over a span of -years etc. -

    - -

    Finally, another cost function is the Huber cost function used in robust regression.

    - -

    The rationale behind this possible cost function is its reduced -sensitivity to outliers in the data set. In our discussions on -dimensionality reduction and normalization of data we will meet other -ways of dealing with outliers. -

    - -

    The Huber cost function is defined as

    -$$ -H_{\delta}(\boldsymbol{a})=\left\{\begin{array}{cc}\frac{1}{2} \boldsymbol{a}^{2}& \text{for }|\boldsymbol{a}|\leq \delta\\ \delta (|\boldsymbol{a}|-\frac{1}{2}\delta ),&\text{otherwise}.\end{array}\right. -$$ - -

    Here \( \boldsymbol{a}=\boldsymbol{y} - \boldsymbol{\tilde{y}} \).

    - -

    We will discuss in more detail these and other functions in the -various lectures. We conclude this part with another example. Instead -of a linear \( x \)-dependence we study now a cubic polynomial and use the -polynomial regression analysis tools of scikit-learn. -

    - - - -
    -
    -
    -
    -
    - 
    import matplotlib.pyplot as plt
-import numpy as np
-import random
-from sklearn.linear_model import Ridge
-from sklearn.preprocessing import PolynomialFeatures
-from sklearn.pipeline import make_pipeline
-from sklearn.linear_model import LinearRegression
-
-x=np.linspace(0.02,0.98,200)
-noise = np.asarray(random.sample((range(200)),200))
-y=x**3*noise
-yn=x**3*100
-poly3 = PolynomialFeatures(degree=3)
-X = poly3.fit_transform(x[:,np.newaxis])
-clf3 = LinearRegression()
-clf3.fit(X,y)
-
-Xplot=poly3.fit_transform(x[:,np.newaxis])
-poly3_plot=plt.plot(x, clf3.predict(Xplot), label='Cubic Fit')
-plt.plot(x,yn, color='red', label="True Cubic")
-plt.scatter(x, y, label='Data', color='orange', s=15)
-plt.legend()
-plt.show()
-
-def error(a):
-    for i in y:
-        err=(y-yn)/yn
-    return abs(np.sum(err))/len(err)
-
-print (error(y))
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -

    To our real data: nuclear binding energies. Brief reminder on masses and binding energies

    - -

    Let us now dive into nuclear physics and remind ourselves briefly about some basic features about binding -energies. A basic quantity which can be measured for the ground -states of nuclei is the atomic mass \( M(N, Z) \) of the neutral atom with -atomic mass number \( A \) and charge \( Z \). The number of neutrons is \( N \). There are indeed several sophisticated experiments worldwide which allow us to measure this quantity to high precision (parts per million even). -

    - -

    Atomic masses are usually tabulated in terms of the mass excess defined by

    -$$ -\Delta M(N, Z) = M(N, Z) - uA, -$$ - -

    where \( u \) is the Atomic Mass Unit

    -$$ -u = M(^{12}\mathrm{C})/12 = 931.4940954(57) \hspace{0.1cm} \mathrm{MeV}/c^2. -$$ - -

    The nucleon masses are

    -$$ -m_p = 1.00727646693(9)u, -$$ - -

    and

    -$$ -m_n = 939.56536(8)\hspace{0.1cm} \mathrm{MeV}/c^2 = 1.0086649156(6)u. -$$ - -

    In the 2016 mass evaluation of by W.J.Huang, G.Audi, M.Wang, F.G.Kondev, S.Naimi and X.Xu -there are data on masses and decays of 3437 nuclei. -

    - -

    The nuclear binding energy is defined as the energy required to break -up a given nucleus into its constituent parts of \( N \) neutrons and \( Z \) -protons. In terms of the atomic masses \( M(N, Z) \) the binding energy is -defined by -

    - -$$ -BE(N, Z) = ZM_H c^2 + Nm_n c^2 - M(N, Z)c^2 , -$$ - -

    where \( M_H \) is the mass of the hydrogen atom and \( m_n \) is the mass of the neutron. -In terms of the mass excess the binding energy is given by -

    -$$ -BE(N, Z) = Z\Delta_H c^2 + N\Delta_n c^2 -\Delta(N, Z)c^2 , -$$ - -

    where \( \Delta_H c^2 = 7.2890 \) MeV and \( \Delta_n c^2 = 8.0713 \) MeV.

    - -

    A popular and physically intuitive model which can be used to parametrize -the experimental binding energies as function of \( A \), is the so-called -liquid drop model. The ansatz is based on the following expression -

    - -$$ -BE(N,Z) = a_1A-a_2A^{2/3}-a_3\frac{Z^2}{A^{1/3}}-a_4\frac{(N-Z)^2}{A}, -$$ - -

    where \( A \) stands for the number of nucleons and the $a_i$s are parameters which are determined by a fit -to the experimental data. -

    - -

    To arrive at the above expression we have assumed that we can make the following assumptions:

    +

    Why Linear Regression (aka Ordinary Least Squares and family)

    +

    Fitting a continuous function with linear parameterization in terms of the parameters \( \boldsymbol{\beta} \).

      -
    • There is a volume term \( a_1A \) proportional with the number of nucleons (the energy is also an extensive quantity). When an assembly of nucleons of the same size is packed together into the smallest volume, each interior nucleon has a certain number of other nucleons in contact with it. This contribution is proportional to the volume.
      • -
    • There is a surface energy term \( a_2A^{2/3} \). The assumption here is that a nucleon at the surface of a nucleus interacts with fewer other nucleons than one in the interior of the nucleus and hence its binding energy is less. This surface energy term takes that into account and is therefore negative and is proportional to the surface area.
      • -
    • There is a Coulomb energy term \( a_3\frac{Z^2}{A^{1/3}} \). The electric repulsion between each pair of protons in a nucleus yields less binding.
      • -
    • There is an asymmetry term \( a_4\frac{(N-Z)^2}{A} \). This term is associated with the Pauli exclusion principle and reflects the fact that the proton-neutron interaction is more attractive on the average than the neutron-neutron and proton-proton interactions.
      • +
    • Method of choice for fitting a continuous function!
      • +
    • Gives an excellent introduction to central Machine Learning features with understandable pedagogical links to other methods like Neural Networks, Support Vector Machines etc
      • +
    • Analytical expression for the fitting parameters \( \boldsymbol{\beta} \)
      • +
    • Analytical expressions for statistical propertiers like mean values, variances, confidence intervals and more
      • +
    • Analytical relation with probabilistic interpretations
      • +
    • Easy to introduce basic concepts like bias-variance tradeoff, cross-validation, resampling and regularization techniques and many other ML topics
      • +
    • Easy to code! And links well with classification problems and logistic regression and neural networks
      • +
    • Allows for easy hands-on understanding of gradient descent methods
      • +
    • and many more features
    -

    We could also add a so-called pairing term, which is a correction term that -arises from the tendency of proton pairs and neutron pairs to -occur. An even number of particles is more stable than an odd number. -

    -

    Organizing our data

    - -

    Let us start with reading and organizing our data. -We start with the compilation of masses and binding energies from 2016. -After having downloaded this file to our own computer, we are now ready to read the file and start structuring our data. -

    - -

    We start with preparing folders for storing our calculations and the data file over masses and binding energies. We import also various modules that we will find useful in order to present various Machine Learning methods. Here we focus mainly on the functionality of scikit-learn.

    - - -
    -
    -
    -
    -
    - 
    # Common imports
-import numpy as np
-import pandas as pd
-import matplotlib.pyplot as plt
-import sklearn.linear_model as skl
-from sklearn.model_selection import train_test_split
-from sklearn.metrics import mean_squared_error, r2_score, mean_absolute_error
-import os
-
-# Where to save the figures and data files
-PROJECT_ROOT_DIR = "Results"
-FIGURE_ID = "Results/FigureFiles"
-DATA_ID = "DataFiles/"
-
-if not os.path.exists(PROJECT_ROOT_DIR):
-    os.mkdir(PROJECT_ROOT_DIR)
-
-if not os.path.exists(FIGURE_ID):
-    os.makedirs(FIGURE_ID)
-
-if not os.path.exists(DATA_ID):
-    os.makedirs(DATA_ID)
-
-def image_path(fig_id):
-    return os.path.join(FIGURE_ID, fig_id)
-
-def data_path(dat_id):
-    return os.path.join(DATA_ID, dat_id)
-
-def save_fig(fig_id):
-    plt.savefig(image_path(fig_id) + ".png", format='png')
-
-infile = open(data_path("MassEval2016.dat"),'r')
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    Before we proceed, we define also a function for making our plots. You can obviously avoid this and simply set up various matplotlib commands every time you need them. You may however find it convenient to collect all such commands in one function and simply call this function.

    - - -
    -
    -
    -
    -
    - 
    from pylab import plt, mpl
-plt.style.use('seaborn')
-mpl.rcParams['font.family'] = 'serif'
-
-def MakePlot(x,y, styles, labels, axlabels):
-    plt.figure(figsize=(10,6))
-    for i in range(len(x)):
-        plt.plot(x[i], y[i], styles[i], label = labels[i])
-        plt.xlabel(axlabels[0])
-        plt.ylabel(axlabels[1])
-    plt.legend(loc=0)
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    Our next step is to read the data on experimental binding energies and -reorganize them as functions of the mass number \( A \), the number of -protons \( Z \) and neutrons \( N \) using pandas. Before we do this it is -always useful (unless you have a binary file or other types of compressed -data) to actually open the file and simply take a look at it! -

    - -

    In particular, the program that outputs the final nuclear masses is written in Fortran with a specific format. It means that we need to figure out the format and which columns contain the data we are interested in. Pandas comes with a function that reads formatted output. After having admired the file, we are now ready to start massaging it with pandas. The file begins with some basic format information.

    - - -
    -
    -
    -
    -
    - 
    """                                                                                                                         
-This is taken from the data file of the mass 2016 evaluation.                                                               
-All files are 3436 lines long with 124 character per line.                                                                  
-       Headers are 39 lines long.                                                                                           
-   col 1     :  Fortran character control: 1 = page feed  0 = line feed                                                     
-   format    :  a1,i3,i5,i5,i5,1x,a3,a4,1x,f13.5,f11.5,f11.3,f9.3,1x,a2,f11.3,f9.3,1x,i3,1x,f12.5,f11.5                     
-   These formats are reflected in the pandas widths variable below, see the statement                                       
-   widths=(1,3,5,5,5,1,3,4,1,13,11,11,9,1,2,11,9,1,3,1,12,11,1),                                                            
-   Pandas has also a variable header, with length 39 in this case.                                                          
-"""
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    The data we are interested in are in columns 2, 3, 4 and 11, giving us -the number of neutrons, protons, mass numbers and binding energies, -respectively. We add also for the sake of completeness the element name. The data are in fixed-width formatted lines and we will -covert them into the pandas DataFrame structure. -

    - - - -
    -
    -
    -
    -
    - 
    # Read the experimental data with Pandas
-Masses = pd.read_fwf(infile, usecols=(2,3,4,6,11),
-              names=('N', 'Z', 'A', 'Element', 'Ebinding'),
-              widths=(1,3,5,5,5,1,3,4,1,13,11,11,9,1,2,11,9,1,3,1,12,11,1),
-              header=39,
-              index_col=False)
-
-# Extrapolated values are indicated by '#' in place of the decimal place, so
-# the Ebinding column won't be numeric. Coerce to float and drop these entries.
-Masses['Ebinding'] = pd.to_numeric(Masses['Ebinding'], errors='coerce')
-Masses = Masses.dropna()
-# Convert from keV to MeV.
-Masses['Ebinding'] /= 1000
-
-# Group the DataFrame by nucleon number, A.
-Masses = Masses.groupby('A')
-# Find the rows of the grouped DataFrame with the maximum binding energy.
-Masses = Masses.apply(lambda t: t[t.Ebinding==t.Ebinding.max()])
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    We have now read in the data, grouped them according to the variables we are interested in. -We see how easy it is to reorganize the data using pandas. If we -were to do these operations in C/C++ or Fortran, we would have had to -write various functions/subroutines which perform the above -reorganizations for us. Having reorganized the data, we can now start -to make some simple fits using both the functionalities in numpy and -Scikit-Learn afterwards. -

    - -

    Now we define five variables which contain -the number of nucleons \( A \), the number of protons \( Z \) and the number of neutrons \( N \), the element name and finally the energies themselves. -

    - - -
    -
    -
    -
    -
    - 
    A = Masses['A']
-Z = Masses['Z']
-N = Masses['N']
-Element = Masses['Element']
-Energies = Masses['Ebinding']
-print(Masses)
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    The next step, and we will define this mathematically later, is to set up the so-called design matrix. We will throughout call this matrix \( \boldsymbol{X} \). -It has dimensionality \( p\times n \), where \( n \) is the number of data points and \( p \) are the so-called predictors. In our case here they are given by the number of polynomials in \( A \) we wish to include in the fit. -

    - - -
    -
    -
    -
    -
    - 
    # Now we set up the design matrix X
-X = np.zeros((len(A),5))
-X[:,0] = 1
-X[:,1] = A
-X[:,2] = A**(2.0/3.0)
-X[:,3] = A**(-1.0/3.0)
-X[:,4] = A**(-1.0)
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    With scikitlearn we are now ready to use linear regression and fit our data.

    - - -
    -
    -
    -
    -
    - 
    clf = skl.LinearRegression().fit(X, Energies)
-fity = clf.predict(X)
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    Pretty simple! -Now we can print measures of how our fit is doing, the coefficients from the fits and plot the final fit together with our data. -

    - - -
    -
    -
    -
    -
    - 
    # The mean squared error                               
-print("Mean squared error: %.2f" % mean_squared_error(Energies, fity))
-# Explained variance score: 1 is perfect prediction                                 
-print('Variance score: %.2f' % r2_score(Energies, fity))
-# Mean absolute error                                                           
-print('Mean absolute error: %.2f' % mean_absolute_error(Energies, fity))
-print(clf.coef_, clf.intercept_)
-
-Masses['Eapprox']  = fity
-# Generate a plot comparing the experimental with the fitted values values.
-fig, ax = plt.subplots()
-ax.set_xlabel(r'$A = N + Z$')
-ax.set_ylabel(r'$E_\mathrm{bind}\,/\mathrm{MeV}$')
-ax.plot(Masses['A'], Masses['Ebinding'], alpha=0.7, lw=2,
-            label='Ame2016')
-ax.plot(Masses['A'], Masses['Eapprox'], alpha=0.7, lw=2, c='m',
-            label='Fit')
-ax.legend()
-save_fig("Masses2016")
-plt.show()
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -

    Seeing the wood for the trees

    - -

    As a teaser, let us now see how we can do this with decision trees using scikit-learn. Later we will switch to so-called random forests!

    - - - -
    -
    -
    -
    -
    - 
    #Decision Tree Regression
-from sklearn.tree import DecisionTreeRegressor
-regr_1=DecisionTreeRegressor(max_depth=5)
-regr_2=DecisionTreeRegressor(max_depth=7)
-regr_3=DecisionTreeRegressor(max_depth=9)
-regr_1.fit(X, Energies)
-regr_2.fit(X, Energies)
-regr_3.fit(X, Energies)
-
-
-y_1 = regr_1.predict(X)
-y_2 = regr_2.predict(X)
-y_3=regr_3.predict(X)
-Masses['Eapprox'] = y_3
-# Plot the results
-plt.figure()
-plt.plot(A, Energies, color="blue", label="Data", linewidth=2)
-plt.plot(A, y_1, color="red", label="max_depth=5", linewidth=2)
-plt.plot(A, y_2, color="green", label="max_depth=7", linewidth=2)
-plt.plot(A, y_3, color="m", label="max_depth=9", linewidth=2)
-
-plt.xlabel("$A$")
-plt.ylabel("$E$[MeV]")
-plt.title("Decision Tree Regression")
-plt.legend()
-save_fig("Masses2016Trees")
-plt.show()
-print(Masses)
-print(np.mean( (Energies-y_1)**2))
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -

    And what about using neural networks?

    -

    The seaborn package allows us to visualize data in an efficient way. Note that we use scikit-learn's multi-layer perceptron (or feed forward neural network) -functionality. -

    - - -
    -
    -
    -
    -
    - 
    from sklearn.neural_network import MLPRegressor
-from sklearn.metrics import accuracy_score
-import seaborn as sns
-
-X_train = X
-Y_train = Energies
-n_hidden_neurons = 100
-epochs = 100
-# store models for later use
-eta_vals = np.logspace(-5, 1, 7)
-lmbd_vals = np.logspace(-5, 1, 7)
-# store the models for later use
-DNN_scikit = np.zeros((len(eta_vals), len(lmbd_vals)), dtype=object)
-train_accuracy = np.zeros((len(eta_vals), len(lmbd_vals)))
-sns.set()
-for i, eta in enumerate(eta_vals):
-    for j, lmbd in enumerate(lmbd_vals):
-        dnn = MLPRegressor(hidden_layer_sizes=(n_hidden_neurons), activation='logistic',
-                            alpha=lmbd, learning_rate_init=eta, max_iter=epochs)
-        dnn.fit(X_train, Y_train)
-        DNN_scikit[i][j] = dnn
-        train_accuracy[i][j] = dnn.score(X_train, Y_train)
-
-fig, ax = plt.subplots(figsize = (10, 10))
-sns.heatmap(train_accuracy, annot=True, ax=ax, cmap="viridis")
-ax.set_title("Training Accuracy")
-ax.set_ylabel("$\eta$")
-ax.set_xlabel("$\lambda$")
-plt.show()
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -

    A first summary

    - -

    The aim behind these introductory words was to present to you various -Python libraries and their functionalities, in particular libraries like -numpy, pandas, xarray and matplotlib and other that make our life much easier -in handling various data sets and visualizing data. -

    - -

    Furthermore, -Scikit-Learn allows us with few lines of code to implement popular -Machine Learning algorithms for supervised learning. Later we will meet Tensorflow, a powerful library for deep learning. -Now it is time to dive more into the details of various methods. We will start with linear regression and try to take a deeper look at what it entails. +

    For more discussions of Ridge and Lasso regression, Wessel van Wieringen's article is highly recommended. +Similarly, Mehta et al's article is also recommended.

    @@ -1285,7 +392,7 @@ Now it is time to dive more into the details of various methods. We will start w

  • 46
  • 47
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs038.html b/doc/pub/week34/html/._week34-bs038.html index a57d95195..dc9693cd1 100644 --- a/doc/pub/week34/html/._week34-bs038.html +++ b/doc/pub/week34/html/._week34-bs038.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,24 +349,26 @@ MathJax.Hub.Config({

     

     

     

    -

    Why Linear Regression (aka Ordinary Least Squares and family)

    +

    Regression analysis, overarching aims

    +
    +
    + -

    Fitting a continuous function with linear parameterization in terms of the parameters \( \boldsymbol{\beta} \).

    -
      -
    • Method of choice for fitting a continuous function!
      • -
    • Gives an excellent introduction to central Machine Learning features with understandable pedagogical links to other methods like Neural Networks, Support Vector Machines etc
      • -
    • Analytical expression for the fitting parameters \( \boldsymbol{\beta} \)
      • -
    • Analytical expressions for statistical propertiers like mean values, variances, confidence intervals and more
      • -
    • Analytical relation with probabilistic interpretations
      • -
    • Easy to introduce basic concepts like bias-variance tradeoff, cross-validation, resampling and regularization techniques and many other ML topics
      • -
    • Easy to code! And links well with classification problems and logistic regression and neural networks
      • -
    • Allows for easy hands-on understanding of gradient descent methods
      • -
    • and many more features
      • -
    -

    For more discussions of Ridge and Lasso regression, Wessel van Wieringen's article is highly recommended. -Similarly, Mehta et al's article is also recommended. +

    Regression modeling deals with the description of the sampling distribution of a given random variable \( y \) and how it varies as function of another variable or a set of such variables \( \boldsymbol{x} =[x_0, x_1,\dots, x_{n-1}]^T \). +The first variable is called the dependent, the outcome or the response variable while the set of variables \( \boldsymbol{x} \) is called the independent variable, or the predictor variable or the explanatory variable.

    +

    A regression model aims at finding a likelihood function \( p(\boldsymbol{y}\vert \boldsymbol{x}) \), that is the conditional distribution for \( \boldsymbol{y} \) with a given \( \boldsymbol{x} \). The estimation of \( p(\boldsymbol{y}\vert \boldsymbol{x}) \) is made using a data set with

    +
      +
    • \( n \) cases \( i = 0, 1, 2, \dots, n-1 \)
      • +
    • Response (target, dependent or outcome) variable \( y_i \) with \( i = 0, 1, 2, \dots, n-1 \)
      • +
    • \( p \) so-called explanatory (independent or predictor) variables \( \boldsymbol{x}_i=[x_{i0}, x_{i1}, \dots, x_{ip-1}] \) with \( i = 0, 1, 2, \dots, n-1 \) and explanatory variables running from \( 0 \) to \( p-1 \). See below for more explicit examples.
      • +
    +

    The goal of the regression analysis is to extract/exploit relationship between \( \boldsymbol{y} \) and \( \boldsymbol{x} \) in or to infer causal dependencies, approximations to the likelihood functions, functional relationships and to make predictions, making fits and many other things.

    +
    +
    + +

    diff --git a/doc/pub/week34/html/._week34-bs039.html b/doc/pub/week34/html/._week34-bs039.html index 91c70d2e4..0fdbb6ba9 100644 --- a/doc/pub/week34/html/._week34-bs039.html +++ b/doc/pub/week34/html/._week34-bs039.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,22 +349,30 @@ MathJax.Hub.Config({

     

     

     

    -

    Regression analysis, overarching aims

    +

    Regression analysis, overarching aims II

    -

    Regression modeling deals with the description of the sampling distribution of a given random variable \( y \) and how it varies as function of another variable or a set of such variables \( \boldsymbol{x} =[x_0, x_1,\dots, x_{n-1}]^T \). -The first variable is called the dependent, the outcome or the response variable while the set of variables \( \boldsymbol{x} \) is called the independent variable, or the predictor variable or the explanatory variable. +

    Consider an experiment in which \( p \) characteristics of \( n \) samples are +measured. The data from this experiment, for various explanatory variables \( p \) are normally represented by a matrix +\( \mathbf{X} \).

    -

    A regression model aims at finding a likelihood function \( p(\boldsymbol{y}\vert \boldsymbol{x}) \), that is the conditional distribution for \( \boldsymbol{y} \) with a given \( \boldsymbol{x} \). The estimation of \( p(\boldsymbol{y}\vert \boldsymbol{x}) \) is made using a data set with

    -
      -
    • \( n \) cases \( i = 0, 1, 2, \dots, n-1 \)
      • -
    • Response (target, dependent or outcome) variable \( y_i \) with \( i = 0, 1, 2, \dots, n-1 \)
      • -
    • \( p \) so-called explanatory (independent or predictor) variables \( \boldsymbol{x}_i=[x_{i0}, x_{i1}, \dots, x_{ip-1}] \) with \( i = 0, 1, 2, \dots, n-1 \) and explanatory variables running from \( 0 \) to \( p-1 \). See below for more explicit examples.
      • -
    -

    The goal of the regression analysis is to extract/exploit relationship between \( \boldsymbol{y} \) and \( \boldsymbol{x} \) in or to infer causal dependencies, approximations to the likelihood functions, functional relationships and to make predictions, making fits and many other things.

    +

    The matrix \( \mathbf{X} \) is called the design +matrix. Additional information of the samples is available in the +form of \( \boldsymbol{y} \) (also as above). The variable \( \boldsymbol{y} \) is +generally referred to as the response variable. The aim of +regression analysis is to explain \( \boldsymbol{y} \) in terms of +\( \boldsymbol{X} \) through a functional relationship like \( y_i = +f(\mathbf{X}_{i,\ast}) \). When no prior knowledge on the form of +\( f(\cdot) \) is available, it is common to assume a linear relationship +between \( \boldsymbol{X} \) and \( \boldsymbol{y} \). This assumption gives rise to +the linear regression model where \( \boldsymbol{\beta} = [\beta_0, \ldots, +\beta_{p-1}]^{T} \) are the regression parameters. +

    + +

    Linear regression gives us a set of analytical equations for the parameters \( \beta_j \).

    @@ -396,7 +402,7 @@ The first variable is called the dependent, the outcome or the
  • 48
  • 49
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs040.html b/doc/pub/week34/html/._week34-bs040.html index ef4653797..0b264ac15 100644 --- a/doc/pub/week34/html/._week34-bs040.html +++ b/doc/pub/week34/html/._week34-bs040.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,30 +349,29 @@ MathJax.Hub.Config({

     

     

     

    -

    Regression analysis, overarching aims II

    +

    Examples

    - -

    Consider an experiment in which \( p \) characteristics of \( n \) samples are -measured. The data from this experiment, for various explanatory variables \( p \) are normally represented by a matrix -\( \mathbf{X} \). +

    In order to understand the relation among the predictors \( p \), the set of data \( n \) and the target (outcome, output etc) \( \boldsymbol{y} \), +consider the model we discussed for describing nuclear binding energies.

    -

    The matrix \( \mathbf{X} \) is called the design -matrix. Additional information of the samples is available in the -form of \( \boldsymbol{y} \) (also as above). The variable \( \boldsymbol{y} \) is -generally referred to as the response variable. The aim of -regression analysis is to explain \( \boldsymbol{y} \) in terms of -\( \boldsymbol{X} \) through a functional relationship like \( y_i = -f(\mathbf{X}_{i,\ast}) \). When no prior knowledge on the form of -\( f(\cdot) \) is available, it is common to assume a linear relationship -between \( \boldsymbol{X} \) and \( \boldsymbol{y} \). This assumption gives rise to -the linear regression model where \( \boldsymbol{\beta} = [\beta_0, \ldots, -\beta_{p-1}]^{T} \) are the regression parameters. +

    There we assumed that we could parametrize the data using a polynomial approximation based on the liquid drop model. +Assuming +

    +$$ +BE(A) = a_0+a_1A+a_2A^{2/3}+a_3A^{-1/3}+a_4A^{-1}, +$$ + +

    we have five predictors, that is the intercept, the \( A \) dependent term, the \( A^{2/3} \) term and the \( A^{-1/3} \) and \( A^{-1} \) terms. +This gives \( p=0,1,2,3,4 \). Furthermore we have \( n \) entries for each predictor. It means that our design matrix is a +\( p\times n \) matrix \( \boldsymbol{X} \).

    -

    Linear regression gives us a set of analytical equations for the parameters \( \beta_j \).

    +

    Here the predictors are based on a model we have made. A popular data set which is widely encountered in ML applications is the +so-called credit card default data from Taiwan. The data set contains data on \( n=30000 \) credit card holders with predictors like gender, marital status, age, profession, education, etc. In total there are \( 24 \) such predictors or attributes leading to a design matrix of dimensionality \( 24 \times 30000 \). This is however a classification problem and we will come back to it when we discuss Logistic Regression. +

    @@ -404,7 +401,7 @@ the linear regression model where \( \boldsymbol{\beta} = [\beta_0, \ld
  • 49
  • 50
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs041.html b/doc/pub/week34/html/._week34-bs041.html index d0f1508fc..37d697de4 100644 --- a/doc/pub/week34/html/._week34-bs041.html +++ b/doc/pub/week34/html/._week34-bs041.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,29 +349,18 @@ MathJax.Hub.Config({

     

     

     

    -

    Examples

    +

    General linear models

    -

    In order to understand the relation among the predictors \( p \), the set of data \( n \) and the target (outcome, output etc) \( \boldsymbol{y} \), -consider the model we discussed for describing nuclear binding energies. -

    +

    Before we proceed let us study a case from linear algebra where we aim at fitting a set of data \( \boldsymbol{y}=[y_0,y_1,\dots,y_{n-1}] \). We could think of these data as a result of an experiment or a complicated numerical experiment. These data are functions of a series of variables \( \boldsymbol{x}=[x_0,x_1,\dots,x_{n-1}] \), that is \( y_i = y(x_i) \) with \( i=0,1,2,\dots,n-1 \). The variables \( x_i \) could represent physical quantities like time, temperature, position etc. We assume that \( y(x) \) is a smooth function.

    -

    There we assumed that we could parametrize the data using a polynomial approximation based on the liquid drop model. -Assuming -

    +

    Since obtaining these data points may not be trivial, we want to use these data to fit a function which can allow us to make predictions for values of \( y \) which are not in the present set. The perhaps simplest approach is to assume we can parametrize our function in terms of a polynomial of degree \( n-1 \) with \( n \) points, that is

    $$ -BE(A) = a_0+a_1A+a_2A^{2/3}+a_3A^{-1/3}+a_4A^{-1}, +y=y(x) \rightarrow y(x_i)=\tilde{y}_i+\epsilon_i=\sum_{j=0}^{n-1} \beta_j x_i^j+\epsilon_i, $$ -

    we have five predictors, that is the intercept, the \( A \) dependent term, the \( A^{2/3} \) term and the \( A^{-1/3} \) and \( A^{-1} \) terms. -This gives \( p=0,1,2,3,4 \). Furthermore we have \( n \) entries for each predictor. It means that our design matrix is a -\( p\times n \) matrix \( \boldsymbol{X} \). -

    - -

    Here the predictors are based on a model we have made. A popular data set which is widely encountered in ML applications is the -so-called credit card default data from Taiwan. The data set contains data on \( n=30000 \) credit card holders with predictors like gender, marital status, age, profession, education, etc. In total there are \( 24 \) such predictors or attributes leading to a design matrix of dimensionality \( 24 \times 30000 \). This is however a classification problem and we will come back to it when we discuss Logistic Regression. -

    +

    where \( \epsilon_i \) is the error in our approximation.

    @@ -403,7 +390,7 @@ so-called 50
  • 51
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs042.html b/doc/pub/week34/html/._week34-bs042.html index d6c6070c2..1eff58f16 100644 --- a/doc/pub/week34/html/._week34-bs042.html +++ b/doc/pub/week34/html/._week34-bs042.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,18 +349,20 @@ MathJax.Hub.Config({

     

     

     

    -

    General linear models

    +

    Rewriting the fitting procedure as a linear algebra problem

    -

    Before we proceed let us study a case from linear algebra where we aim at fitting a set of data \( \boldsymbol{y}=[y_0,y_1,\dots,y_{n-1}] \). We could think of these data as a result of an experiment or a complicated numerical experiment. These data are functions of a series of variables \( \boldsymbol{x}=[x_0,x_1,\dots,x_{n-1}] \), that is \( y_i = y(x_i) \) with \( i=0,1,2,\dots,n-1 \). The variables \( x_i \) could represent physical quantities like time, temperature, position etc. We assume that \( y(x) \) is a smooth function.

    - -

    Since obtaining these data points may not be trivial, we want to use these data to fit a function which can allow us to make predictions for values of \( y \) which are not in the present set. The perhaps simplest approach is to assume we can parametrize our function in terms of a polynomial of degree \( n-1 \) with \( n \) points, that is

    +

    For every set of values \( y_i,x_i \) we have thus the corresponding set of equations

    $$ -y=y(x) \rightarrow y(x_i)=\tilde{y}_i+\epsilon_i=\sum_{j=0}^{n-1} \beta_j x_i^j+\epsilon_i, +\begin{align*} +y_0&=\beta_0+\beta_1x_0^1+\beta_2x_0^2+\dots+\beta_{n-1}x_0^{n-1}+\epsilon_0\\ +y_1&=\beta_0+\beta_1x_1^1+\beta_2x_1^2+\dots+\beta_{n-1}x_1^{n-1}+\epsilon_1\\ +y_2&=\beta_0+\beta_1x_2^1+\beta_2x_2^2+\dots+\beta_{n-1}x_2^{n-1}+\epsilon_2\\ +\dots & \dots \\ +y_{n-1}&=\beta_0+\beta_1x_{n-1}^1+\beta_2x_{n-1}^2+\dots+\beta_{n-1}x_{n-1}^{n-1}+\epsilon_{n-1}.\\ +\end{align*} $$ - -

    where \( \epsilon_i \) is the error in our approximation.

    @@ -392,7 +392,7 @@ $$
  • 51
  • 52
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs043.html b/doc/pub/week34/html/._week34-bs043.html index afc9294f5..6751de814 100644 --- a/doc/pub/week34/html/._week34-bs043.html +++ b/doc/pub/week34/html/._week34-bs043.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,20 +349,43 @@ MathJax.Hub.Config({

     

     

     

    -

    Rewriting the fitting procedure as a linear algebra problem

    +

    Rewriting the fitting procedure as a linear algebra problem, more details

    -

    For every set of values \( y_i,x_i \) we have thus the corresponding set of equations

    +

    Defining the vectors

    $$ -\begin{align*} -y_0&=\beta_0+\beta_1x_0^1+\beta_2x_0^2+\dots+\beta_{n-1}x_0^{n-1}+\epsilon_0\\ -y_1&=\beta_0+\beta_1x_1^1+\beta_2x_1^2+\dots+\beta_{n-1}x_1^{n-1}+\epsilon_1\\ -y_2&=\beta_0+\beta_1x_2^1+\beta_2x_2^2+\dots+\beta_{n-1}x_2^{n-1}+\epsilon_2\\ -\dots & \dots \\ -y_{n-1}&=\beta_0+\beta_1x_{n-1}^1+\beta_2x_{n-1}^2+\dots+\beta_{n-1}x_{n-1}^{n-1}+\epsilon_{n-1}.\\ -\end{align*} +\boldsymbol{y} = [y_0,y_1, y_2,\dots, y_{n-1}]^T, $$ + +

    and

    +$$ +\boldsymbol{\beta} = [\beta_0,\beta_1, \beta_2,\dots, \beta_{n-1}]^T, +$$ + +

    and

    +$$ +\boldsymbol{\epsilon} = [\epsilon_0,\epsilon_1, \epsilon_2,\dots, \epsilon_{n-1}]^T, +$$ + +

    and the design matrix

    +$$ +\boldsymbol{X}= +\begin{bmatrix} +1& x_{0}^1 &x_{0}^2& \dots & \dots &x_{0}^{n-1}\\ +1& x_{1}^1 &x_{1}^2& \dots & \dots &x_{1}^{n-1}\\ +1& x_{2}^1 &x_{2}^2& \dots & \dots &x_{2}^{n-1}\\ +\dots& \dots &\dots& \dots & \dots &\dots\\ +1& x_{n-1}^1 &x_{n-1}^2& \dots & \dots &x_{n-1}^{n-1}\\ +\end{bmatrix} +$$ + +

    we can rewrite our equations as

    +$$ +\boldsymbol{y} = \boldsymbol{X}\boldsymbol{\beta}+\boldsymbol{\epsilon}. +$$ + +

    The above design matrix is called a Vandermonde matrix.

    @@ -394,7 +415,7 @@ $$
  • 52
  • 53
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs044.html b/doc/pub/week34/html/._week34-bs044.html index 6246334c4..179569d42 100644 --- a/doc/pub/week34/html/._week34-bs044.html +++ b/doc/pub/week34/html/._week34-bs044.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,43 +349,32 @@ MathJax.Hub.Config({

     

     

     

    -

    Rewriting the fitting procedure as a linear algebra problem, more details

    +

    Generalizing the fitting procedure as a linear algebra problem

    -

    Defining the vectors

    + +

    We are obviously not limited to the above polynomial expansions. We +could replace the various powers of \( x \) with elements of Fourier +series or instead of \( x_i^j \) we could have \( \cos{(j x_i)} \) or \( \sin{(j +x_i)} \), or time series or other orthogonal functions. For every set +of values \( y_i,x_i \) we can then generalize the equations to +

    + $$ -\boldsymbol{y} = [y_0,y_1, y_2,\dots, y_{n-1}]^T, +\begin{align*} +y_0&=\beta_0x_{00}+\beta_1x_{01}+\beta_2x_{02}+\dots+\beta_{n-1}x_{0n-1}+\epsilon_0\\ +y_1&=\beta_0x_{10}+\beta_1x_{11}+\beta_2x_{12}+\dots+\beta_{n-1}x_{1n-1}+\epsilon_1\\ +y_2&=\beta_0x_{20}+\beta_1x_{21}+\beta_2x_{22}+\dots+\beta_{n-1}x_{2n-1}+\epsilon_2\\ +\dots & \dots \\ +y_{i}&=\beta_0x_{i0}+\beta_1x_{i1}+\beta_2x_{i2}+\dots+\beta_{n-1}x_{in-1}+\epsilon_i\\ +\dots & \dots \\ +y_{n-1}&=\beta_0x_{n-1,0}+\beta_1x_{n-1,2}+\beta_2x_{n-1,2}+\dots+\beta_{n-1}x_{n-1,n-1}+\epsilon_{n-1}.\\ +\end{align*} $$ -

    and

    -$$ -\boldsymbol{\beta} = [\beta_0,\beta_1, \beta_2,\dots, \beta_{n-1}]^T, -$$ -

    and

    -$$ -\boldsymbol{\epsilon} = [\epsilon_0,\epsilon_1, \epsilon_2,\dots, \epsilon_{n-1}]^T, -$$ - -

    and the design matrix

    -$$ -\boldsymbol{X}= -\begin{bmatrix} -1& x_{0}^1 &x_{0}^2& \dots & \dots &x_{0}^{n-1}\\ -1& x_{1}^1 &x_{1}^2& \dots & \dots &x_{1}^{n-1}\\ -1& x_{2}^1 &x_{2}^2& \dots & \dots &x_{2}^{n-1}\\ -\dots& \dots &\dots& \dots & \dots &\dots\\ -1& x_{n-1}^1 &x_{n-1}^2& \dots & \dots &x_{n-1}^{n-1}\\ -\end{bmatrix} -$$ - -

    we can rewrite our equations as

    -$$ -\boldsymbol{y} = \boldsymbol{X}\boldsymbol{\beta}+\boldsymbol{\epsilon}. -$$ - -

    The above design matrix is called a Vandermonde matrix.

    +Note that we have \( p=n \) here. The matrix is symmetric. This is generally not the case!
    @@ -417,7 +404,7 @@ $$
  • 53
  • 54
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs045.html b/doc/pub/week34/html/._week34-bs045.html index 8fa02163f..a35c5f4c2 100644 --- a/doc/pub/week34/html/._week34-bs045.html +++ b/doc/pub/week34/html/._week34-bs045.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -355,28 +353,24 @@ MathJax.Hub.Config({
    - -

    We are obviously not limited to the above polynomial expansions. We -could replace the various powers of \( x \) with elements of Fourier -series or instead of \( x_i^j \) we could have \( \cos{(j x_i)} \) or \( \sin{(j -x_i)} \), or time series or other orthogonal functions. For every set -of values \( y_i,x_i \) we can then generalize the equations to -

    - +

    We redefine in turn the matrix \( \boldsymbol{X} \) as

    $$ -\begin{align*} -y_0&=\beta_0x_{00}+\beta_1x_{01}+\beta_2x_{02}+\dots+\beta_{n-1}x_{0n-1}+\epsilon_0\\ -y_1&=\beta_0x_{10}+\beta_1x_{11}+\beta_2x_{12}+\dots+\beta_{n-1}x_{1n-1}+\epsilon_1\\ -y_2&=\beta_0x_{20}+\beta_1x_{21}+\beta_2x_{22}+\dots+\beta_{n-1}x_{2n-1}+\epsilon_2\\ -\dots & \dots \\ -y_{i}&=\beta_0x_{i0}+\beta_1x_{i1}+\beta_2x_{i2}+\dots+\beta_{n-1}x_{in-1}+\epsilon_i\\ -\dots & \dots \\ -y_{n-1}&=\beta_0x_{n-1,0}+\beta_1x_{n-1,2}+\beta_2x_{n-1,2}+\dots+\beta_{n-1}x_{n-1,n-1}+\epsilon_{n-1}.\\ -\end{align*} +\boldsymbol{X}= +\begin{bmatrix} +x_{00}& x_{01} &x_{02}& \dots & \dots &x_{0,n-1}\\ +x_{10}& x_{11} &x_{12}& \dots & \dots &x_{1,n-1}\\ +x_{20}& x_{21} &x_{22}& \dots & \dots &x_{2,n-1}\\ +\dots& \dots &\dots& \dots & \dots &\dots\\ +x_{n-1,0}& x_{n-1,1} &x_{n-1,2}& \dots & \dots &x_{n-1,n-1}\\ +\end{bmatrix} $$ +

    and without loss of generality we rewrite again our equations as

    +$$ +\boldsymbol{y} = \boldsymbol{X}\boldsymbol{\beta}+\boldsymbol{\epsilon}. +$$ -Note that we have \( p=n \) here. The matrix is symmetric. This is generally not the case! +

    The left-hand side of this equation is kwown. Our error vector \( \boldsymbol{\epsilon} \) and the parameter vector \( \boldsymbol{\beta} \) are our unknow quantities. How can we obtain the optimal set of \( \beta_i \) values?

    @@ -406,7 +400,7 @@ $$
  • 54
  • 55
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs046.html b/doc/pub/week34/html/._week34-bs046.html index 466581135..04af34a22 100644 --- a/doc/pub/week34/html/._week34-bs046.html +++ b/doc/pub/week34/html/._week34-bs046.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,28 +349,27 @@ MathJax.Hub.Config({

     

     

     

    -

    Generalizing the fitting procedure as a linear algebra problem

    +

    Optimizing our parameters

    -

    We redefine in turn the matrix \( \boldsymbol{X} \) as

    +

    We have defined the matrix \( \boldsymbol{X} \) via the equations

    $$ -\boldsymbol{X}= -\begin{bmatrix} -x_{00}& x_{01} &x_{02}& \dots & \dots &x_{0,n-1}\\ -x_{10}& x_{11} &x_{12}& \dots & \dots &x_{1,n-1}\\ -x_{20}& x_{21} &x_{22}& \dots & \dots &x_{2,n-1}\\ -\dots& \dots &\dots& \dots & \dots &\dots\\ -x_{n-1,0}& x_{n-1,1} &x_{n-1,2}& \dots & \dots &x_{n-1,n-1}\\ -\end{bmatrix} +\begin{align*} +y_0&=\beta_0x_{00}+\beta_1x_{01}+\beta_2x_{02}+\dots+\beta_{n-1}x_{0n-1}+\epsilon_0\\ +y_1&=\beta_0x_{10}+\beta_1x_{11}+\beta_2x_{12}+\dots+\beta_{n-1}x_{1n-1}+\epsilon_1\\ +y_2&=\beta_0x_{20}+\beta_1x_{21}+\beta_2x_{22}+\dots+\beta_{n-1}x_{2n-1}+\epsilon_1\\ +\dots & \dots \\ +y_{i}&=\beta_0x_{i0}+\beta_1x_{i1}+\beta_2x_{i2}+\dots+\beta_{n-1}x_{in-1}+\epsilon_1\\ +\dots & \dots \\ +y_{n-1}&=\beta_0x_{n-1,0}+\beta_1x_{n-1,2}+\beta_2x_{n-1,2}+\dots+\beta_{n-1}x_{n-1,n-1}+\epsilon_{n-1}.\\ +\end{align*} $$ -

    and without loss of generality we rewrite again our equations as

    -$$ -\boldsymbol{y} = \boldsymbol{X}\boldsymbol{\beta}+\boldsymbol{\epsilon}. -$$ - -

    The left-hand side of this equation is kwown. Our error vector \( \boldsymbol{\epsilon} \) and the parameter vector \( \boldsymbol{\beta} \) are our unknow quantities. How can we obtain the optimal set of \( \beta_i \) values?

    +

    As we noted above, we stayed with a system with the design matrix + \( \boldsymbol{X}\in {\mathbb{R}}^{n\times n} \), that is we have \( p=n \). For reasons to come later (algorithmic arguments) we will hereafter define +our matrix as \( \boldsymbol{X}\in {\mathbb{R}}^{n\times p} \), with the predictors refering to the column numbers and the entries \( n \) being the row elements. +

    @@ -402,7 +399,7 @@ $$
  • 55
  • 56
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs047.html b/doc/pub/week34/html/._week34-bs047.html index 60c039db9..e77044dc8 100644 --- a/doc/pub/week34/html/._week34-bs047.html +++ b/doc/pub/week34/html/._week34-bs047.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,30 +349,108 @@ MathJax.Hub.Config({

     

     

     

    -

    Optimizing our parameters

    -
    -
    - -

    We have defined the matrix \( \boldsymbol{X} \) via the equations

    -$$ -\begin{align*} -y_0&=\beta_0x_{00}+\beta_1x_{01}+\beta_2x_{02}+\dots+\beta_{n-1}x_{0n-1}+\epsilon_0\\ -y_1&=\beta_0x_{10}+\beta_1x_{11}+\beta_2x_{12}+\dots+\beta_{n-1}x_{1n-1}+\epsilon_1\\ -y_2&=\beta_0x_{20}+\beta_1x_{21}+\beta_2x_{22}+\dots+\beta_{n-1}x_{2n-1}+\epsilon_1\\ -\dots & \dots \\ -y_{i}&=\beta_0x_{i0}+\beta_1x_{i1}+\beta_2x_{i2}+\dots+\beta_{n-1}x_{in-1}+\epsilon_1\\ -\dots & \dots \\ -y_{n-1}&=\beta_0x_{n-1,0}+\beta_1x_{n-1,2}+\beta_2x_{n-1,2}+\dots+\beta_{n-1}x_{n-1,n-1}+\epsilon_{n-1}.\\ -\end{align*} -$$ +

    Our model for the nuclear binding energies

    -

    As we noted above, we stayed with a system with the design matrix - \( \boldsymbol{X}\in {\mathbb{R}}^{n\times n} \), that is we have \( p=n \). For reasons to come later (algorithmic arguments) we will hereafter define -our matrix as \( \boldsymbol{X}\in {\mathbb{R}}^{n\times p} \), with the predictors refering to the column numbers and the entries \( n \) being the row elements. -

    +

    In our introductory notes we looked at the so-called liquid drop model. Let us remind ourselves about what we did by looking at the code.

    + +

    We restate the parts of the code we are most interested in.

    + + +
    +
    +
    +
    +
    + 
    # Common imports
+import numpy as np
+import pandas as pd
+import matplotlib.pyplot as plt
+from IPython.display import display
+import os
+
+# Where to save the figures and data files
+PROJECT_ROOT_DIR = "Results"
+FIGURE_ID = "Results/FigureFiles"
+DATA_ID = "DataFiles/"
+
+if not os.path.exists(PROJECT_ROOT_DIR):
+    os.mkdir(PROJECT_ROOT_DIR)
+
+if not os.path.exists(FIGURE_ID):
+    os.makedirs(FIGURE_ID)
+
+if not os.path.exists(DATA_ID):
+    os.makedirs(DATA_ID)
+
+def image_path(fig_id):
+    return os.path.join(FIGURE_ID, fig_id)
+
+def data_path(dat_id):
+    return os.path.join(DATA_ID, dat_id)
+
+def save_fig(fig_id):
+    plt.savefig(image_path(fig_id) + ".png", format='png')
+
+infile = open(data_path("MassEval2016.dat"),'r')
+
+
+# Read the experimental data with Pandas
+Masses = pd.read_fwf(infile, usecols=(2,3,4,6,11),
+              names=('N', 'Z', 'A', 'Element', 'Ebinding'),
+              widths=(1,3,5,5,5,1,3,4,1,13,11,11,9,1,2,11,9,1,3,1,12,11,1),
+              header=39,
+              index_col=False)
+
+# Extrapolated values are indicated by '#' in place of the decimal place, so
+# the Ebinding column won't be numeric. Coerce to float and drop these entries.
+Masses['Ebinding'] = pd.to_numeric(Masses['Ebinding'], errors='coerce')
+Masses = Masses.dropna()
+# Convert from keV to MeV.
+Masses['Ebinding'] /= 1000
+
+# Group the DataFrame by nucleon number, A.
+Masses = Masses.groupby('A')
+# Find the rows of the grouped DataFrame with the maximum binding energy.
+Masses = Masses.apply(lambda t: t[t.Ebinding==t.Ebinding.max()])
+A = Masses['A']
+Z = Masses['Z']
+N = Masses['N']
+Element = Masses['Element']
+Energies = Masses['Ebinding']
+
+# Now we set up the design matrix X
+X = np.zeros((len(A),5))
+X[:,0] = 1
+X[:,1] = A
+X[:,2] = A**(2.0/3.0)
+X[:,3] = A**(-1.0/3.0)
+X[:,4] = A**(-1.0)
+# Then nice printout using pandas
+DesignMatrix = pd.DataFrame(X)
+DesignMatrix.index = A
+DesignMatrix.columns = ['1', 'A', 'A^(2/3)', 'A^(-1/3)', '1/A']
+display(DesignMatrix)
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +

    With \( \boldsymbol{\beta}\in {\mathbb{R}}^{p\times 1} \), it means that we will hereafter write our equations for the approximation as

    +$$ +\boldsymbol{\tilde{y}}= \boldsymbol{X}\boldsymbol{\beta}, +$$ + +

    throughout these lectures.

    @@ -401,7 +477,7 @@ our matrix as \( \boldsymbol{X}\in {\mathbb{R}}^{n\times p} \), with the predict

  • 56
  • 57
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs048.html b/doc/pub/week34/html/._week34-bs048.html index 12d372535..cc96c5ace 100644 --- a/doc/pub/week34/html/._week34-bs048.html +++ b/doc/pub/week34/html/._week34-bs048.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,108 +349,39 @@ MathJax.Hub.Config({

     

     

     

    -

    Our model for the nuclear binding energies

    - -

    In our introductory notes we looked at the so-called liquid drop model. Let us remind ourselves about what we did by looking at the code.

    - -

    We restate the parts of the code we are most interested in.

    - - -
    -
    -
    -
    -
    - 
    # Common imports
-import numpy as np
-import pandas as pd
-import matplotlib.pyplot as plt
-from IPython.display import display
-import os
-
-# Where to save the figures and data files
-PROJECT_ROOT_DIR = "Results"
-FIGURE_ID = "Results/FigureFiles"
-DATA_ID = "DataFiles/"
-
-if not os.path.exists(PROJECT_ROOT_DIR):
-    os.mkdir(PROJECT_ROOT_DIR)
-
-if not os.path.exists(FIGURE_ID):
-    os.makedirs(FIGURE_ID)
-
-if not os.path.exists(DATA_ID):
-    os.makedirs(DATA_ID)
-
-def image_path(fig_id):
-    return os.path.join(FIGURE_ID, fig_id)
-
-def data_path(dat_id):
-    return os.path.join(DATA_ID, dat_id)
-
-def save_fig(fig_id):
-    plt.savefig(image_path(fig_id) + ".png", format='png')
-
-infile = open(data_path("MassEval2016.dat"),'r')
-
-
-# Read the experimental data with Pandas
-Masses = pd.read_fwf(infile, usecols=(2,3,4,6,11),
-              names=('N', 'Z', 'A', 'Element', 'Ebinding'),
-              widths=(1,3,5,5,5,1,3,4,1,13,11,11,9,1,2,11,9,1,3,1,12,11,1),
-              header=39,
-              index_col=False)
-
-# Extrapolated values are indicated by '#' in place of the decimal place, so
-# the Ebinding column won't be numeric. Coerce to float and drop these entries.
-Masses['Ebinding'] = pd.to_numeric(Masses['Ebinding'], errors='coerce')
-Masses = Masses.dropna()
-# Convert from keV to MeV.
-Masses['Ebinding'] /= 1000
-
-# Group the DataFrame by nucleon number, A.
-Masses = Masses.groupby('A')
-# Find the rows of the grouped DataFrame with the maximum binding energy.
-Masses = Masses.apply(lambda t: t[t.Ebinding==t.Ebinding.max()])
-A = Masses['A']
-Z = Masses['Z']
-N = Masses['N']
-Element = Masses['Element']
-Energies = Masses['Ebinding']
-
-# Now we set up the design matrix X
-X = np.zeros((len(A),5))
-X[:,0] = 1
-X[:,1] = A
-X[:,2] = A**(2.0/3.0)
-X[:,3] = A**(-1.0/3.0)
-X[:,4] = A**(-1.0)
-# Then nice printout using pandas
-DesignMatrix = pd.DataFrame(X)
-DesignMatrix.index = A
-DesignMatrix.columns = ['1', 'A', 'A^(2/3)', 'A^(-1/3)', '1/A']
-display(DesignMatrix)
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    With \( \boldsymbol{\beta}\in {\mathbb{R}}^{p\times 1} \), it means that we will hereafter write our equations for the approximation as

    +

    Optimizing our parameters, more details

    +
    +
    + +

    With the above we use the design matrix to define the approximation \( \boldsymbol{\tilde{y}} \) via the unknown quantity \( \boldsymbol{\beta} \) as

    $$ \boldsymbol{\tilde{y}}= \boldsymbol{X}\boldsymbol{\beta}, $$ -

    throughout these lectures.

    +

    and in order to find the optimal parameters \( \beta_i \) instead of solving the above linear algebra problem, we define a function which gives a measure of the spread between the values \( y_i \) (which represent hopefully the exact values) and the parameterized values \( \tilde{y}_i \), namely

    +$$ +C(\boldsymbol{\beta})=\frac{1}{n}\sum_{i=0}^{n-1}\left(y_i-\tilde{y}_i\right)^2=\frac{1}{n}\left\{\left(\boldsymbol{y}-\boldsymbol{\tilde{y}}\right)^T\left(\boldsymbol{y}-\boldsymbol{\tilde{y}}\right)\right\}, +$$ + +

    or using the matrix \( \boldsymbol{X} \) and in a more compact matrix-vector notation as

    +$$ +C(\boldsymbol{\beta})=\frac{1}{n}\left\{\left(\boldsymbol{y}-\boldsymbol{X}\boldsymbol{\beta}\right)^T\left(\boldsymbol{y}-\boldsymbol{X}\boldsymbol{\beta}\right)\right\}. +$$ + +

    This function is one possible way to define the so-called cost function.

    + +

    It is also common to define +the function \( C \) as +

    + +$$ +C(\boldsymbol{\beta})=\frac{1}{2n}\sum_{i=0}^{n-1}\left(y_i-\tilde{y}_i\right)^2, +$$ + +

    since when taking the first derivative with respect to the unknown parameters \( \beta \), the factor of \( 2 \) cancels out.

    +
    +
    +

    @@ -479,7 +408,7 @@ $$

  • 57
  • 58
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs049.html b/doc/pub/week34/html/._week34-bs049.html index 1526bb4d5..f07e285b8 100644 --- a/doc/pub/week34/html/._week34-bs049.html +++ b/doc/pub/week34/html/._week34-bs049.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,36 +349,53 @@ MathJax.Hub.Config({

     

     

     

    -

    Optimizing our parameters, more details

    +

    Interpretations and optimizing our parameters

    -

    With the above we use the design matrix to define the approximation \( \boldsymbol{\tilde{y}} \) via the unknown quantity \( \boldsymbol{\beta} \) as

    + +

    The function

    $$ -\boldsymbol{\tilde{y}}= \boldsymbol{X}\boldsymbol{\beta}, +C(\boldsymbol{\beta})=\frac{1}{n}\left\{\left(\boldsymbol{y}-\boldsymbol{X}\boldsymbol{\beta}\right)^T\left(\boldsymbol{y}-\boldsymbol{X}\boldsymbol{\beta}\right)\right\}, $$ -

    and in order to find the optimal parameters \( \beta_i \) instead of solving the above linear algebra problem, we define a function which gives a measure of the spread between the values \( y_i \) (which represent hopefully the exact values) and the parameterized values \( \tilde{y}_i \), namely

    +

    can be linked to the variance of the quantity \( y_i \) if we interpret the latter as the mean value. +When linking (see the discussion below) with the maximum likelihood approach below, we will indeed interpret \( y_i \) as a mean value +

    $$ -C(\boldsymbol{\beta})=\frac{1}{n}\sum_{i=0}^{n-1}\left(y_i-\tilde{y}_i\right)^2=\frac{1}{n}\left\{\left(\boldsymbol{y}-\boldsymbol{\tilde{y}}\right)^T\left(\boldsymbol{y}-\boldsymbol{\tilde{y}}\right)\right\}, +y_{i}=\langle y_i \rangle = \beta_0x_{i,0}+\beta_1x_{i,1}+\beta_2x_{i,2}+\dots+\beta_{n-1}x_{i,n-1}+\epsilon_i, $$ -

    or using the matrix \( \boldsymbol{X} \) and in a more compact matrix-vector notation as

    -$$ -C(\boldsymbol{\beta})=\frac{1}{n}\left\{\left(\boldsymbol{y}-\boldsymbol{X}\boldsymbol{\beta}\right)^T\left(\boldsymbol{y}-\boldsymbol{X}\boldsymbol{\beta}\right)\right\}. -$$ - -

    This function is one possible way to define the so-called cost function.

    - -

    It is also common to define -the function \( C \) as +

    where \( \langle y_i \rangle \) is the mean value. Keep in mind also that +till now we have treated \( y_i \) as the exact value. Normally, the +response (dependent or outcome) variable \( y_i \) the outcome of a +numerical experiment or another type of experiment and is thus only an +approximation to the true value. It is then always accompanied by an +error estimate, often limited to a statistical error estimate given by +the standard deviation discussed earlier. In the discussion here we +will treat \( y_i \) as our exact value for the response variable.

    +

    In order to find the parameters \( \beta_i \) we will then minimize the spread of \( C(\boldsymbol{\beta}) \), that is we are going to solve the problem

    $$ -C(\boldsymbol{\beta})=\frac{1}{2n}\sum_{i=0}^{n-1}\left(y_i-\tilde{y}_i\right)^2, +{\displaystyle \min_{\boldsymbol{\beta}\in +{\mathbb{R}}^{p}}}\frac{1}{n}\left\{\left(\boldsymbol{y}-\boldsymbol{X}\boldsymbol{\beta}\right)^T\left(\boldsymbol{y}-\boldsymbol{X}\boldsymbol{\beta}\right)\right\}. $$ -

    since when taking the first derivative with respect to the unknown parameters \( \beta \), the factor of \( 2 \) cancels out.

    +

    In practical terms it means we will require

    +$$ +\frac{\partial C(\boldsymbol{\beta})}{\partial \beta_j} = \frac{\partial }{\partial \beta_j}\left[ \frac{1}{n}\sum_{i=0}^{n-1}\left(y_i-\beta_0x_{i,0}-\beta_1x_{i,1}-\beta_2x_{i,2}-\dots-\beta_{n-1}x_{i,n-1}\right)^2\right]=0, +$$ + +

    which results in

    +$$ +\frac{\partial C(\boldsymbol{\beta})}{\partial \beta_j} = -\frac{2}{n}\left[ \sum_{i=0}^{n-1}x_{ij}\left(y_i-\beta_0x_{i,0}-\beta_1x_{i,1}-\beta_2x_{i,2}-\dots-\beta_{n-1}x_{i,n-1}\right)\right]=0, +$$ + +

    or in a matrix-vector form as

    +$$ +\frac{\partial C(\boldsymbol{\beta})}{\partial \boldsymbol{\beta}} = 0 = \boldsymbol{X}^T\left( \boldsymbol{y}-\boldsymbol{X}\boldsymbol{\beta}\right). +$$
    @@ -410,7 +425,7 @@ $$
  • 58
  • 59
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs050.html b/doc/pub/week34/html/._week34-bs050.html index c7da3434b..55d3aafd0 100644 --- a/doc/pub/week34/html/._week34-bs050.html +++ b/doc/pub/week34/html/._week34-bs050.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -355,49 +353,40 @@ MathJax.Hub.Config({
    - -

    The function

    +

    We can rewrite

    $$ -C(\boldsymbol{\beta})=\frac{1}{n}\left\{\left(\boldsymbol{y}-\boldsymbol{X}\boldsymbol{\beta}\right)^T\left(\boldsymbol{y}-\boldsymbol{X}\boldsymbol{\beta}\right)\right\}, +\frac{\partial C(\boldsymbol{\beta})}{\partial \boldsymbol{\beta}} = 0 = \boldsymbol{X}^T\left( \boldsymbol{y}-\boldsymbol{X}\boldsymbol{\beta}\right), $$ -

    can be linked to the variance of the quantity \( y_i \) if we interpret the latter as the mean value. -When linking (see the discussion below) with the maximum likelihood approach below, we will indeed interpret \( y_i \) as a mean value +

    as

    +$$ +\boldsymbol{X}^T\boldsymbol{y} = \boldsymbol{X}^T\boldsymbol{X}\boldsymbol{\beta}, +$$ + +

    and if the matrix \( \boldsymbol{X}^T\boldsymbol{X} \) is invertible we have the solution

    +$$ +\boldsymbol{\beta} =\left(\boldsymbol{X}^T\boldsymbol{X}\right)^{-1}\boldsymbol{X}^T\boldsymbol{y}. +$$ + +

    We note also that since our design matrix is defined as \( \boldsymbol{X}\in +{\mathbb{R}}^{n\times p} \), the product \( \boldsymbol{X}^T\boldsymbol{X} \in +{\mathbb{R}}^{p\times p} \). In the above case we have that \( p \ll n \), +in our case \( p=5 \) meaning that we end up with inverting a small +\( 5\times 5 \) matrix. This is a rather common situation, in many cases we end up with low-dimensional +matrices to invert. The methods discussed here and for many other +supervised learning algorithms like classification with logistic +regression or support vector machines, exhibit dimensionalities which +allow for the usage of direct linear algebra methods such as LU decomposition or Singular Value Decomposition (SVD) for finding the inverse of the matrix +\( \boldsymbol{X}^T\boldsymbol{X} \).

    -$$ -y_{i}=\langle y_i \rangle = \beta_0x_{i,0}+\beta_1x_{i,1}+\beta_2x_{i,2}+\dots+\beta_{n-1}x_{i,n-1}+\epsilon_i, -$$ +
    +
    -

    where \( \langle y_i \rangle \) is the mean value. Keep in mind also that -till now we have treated \( y_i \) as the exact value. Normally, the -response (dependent or outcome) variable \( y_i \) the outcome of a -numerical experiment or another type of experiment and is thus only an -approximation to the true value. It is then always accompanied by an -error estimate, often limited to a statistical error estimate given by -the standard deviation discussed earlier. In the discussion here we -will treat \( y_i \) as our exact value for the response variable. -

    -

    In order to find the parameters \( \beta_i \) we will then minimize the spread of \( C(\boldsymbol{\beta}) \), that is we are going to solve the problem

    -$$ -{\displaystyle \min_{\boldsymbol{\beta}\in -{\mathbb{R}}^{p}}}\frac{1}{n}\left\{\left(\boldsymbol{y}-\boldsymbol{X}\boldsymbol{\beta}\right)^T\left(\boldsymbol{y}-\boldsymbol{X}\boldsymbol{\beta}\right)\right\}. -$$ - -

    In practical terms it means we will require

    -$$ -\frac{\partial C(\boldsymbol{\beta})}{\partial \beta_j} = \frac{\partial }{\partial \beta_j}\left[ \frac{1}{n}\sum_{i=0}^{n-1}\left(y_i-\beta_0x_{i,0}-\beta_1x_{i,1}-\beta_2x_{i,2}-\dots-\beta_{n-1}x_{i,n-1}\right)^2\right]=0, -$$ - -

    which results in

    -$$ -\frac{\partial C(\boldsymbol{\beta})}{\partial \beta_j} = -\frac{2}{n}\left[ \sum_{i=0}^{n-1}x_{ij}\left(y_i-\beta_0x_{i,0}-\beta_1x_{i,1}-\beta_2x_{i,2}-\dots-\beta_{n-1}x_{i,n-1}\right)\right]=0, -$$ - -

    or in a matrix-vector form as

    -$$ -\frac{\partial C(\boldsymbol{\beta})}{\partial \boldsymbol{\beta}} = 0 = \boldsymbol{X}^T\left( \boldsymbol{y}-\boldsymbol{X}\boldsymbol{\beta}\right). -$$ +
    +
    + +

    Small question: Do you think the example we have at hand here (the nuclear binding energies) can lead to problems in inverting the matrix \( \boldsymbol{X}^T\boldsymbol{X} \)? What kind of problems can we expect?

    @@ -427,7 +416,7 @@ $$
  • 59
  • 60
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs051.html b/doc/pub/week34/html/._week34-bs051.html index 75f91057d..ede901188 100644 --- a/doc/pub/week34/html/._week34-bs051.html +++ b/doc/pub/week34/html/._week34-bs051.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,47 +349,27 @@ MathJax.Hub.Config({

     

     

     

    -

    Interpretations and optimizing our parameters

    -
    -
    - -

    We can rewrite

    -$$ -\frac{\partial C(\boldsymbol{\beta})}{\partial \boldsymbol{\beta}} = 0 = \boldsymbol{X}^T\left( \boldsymbol{y}-\boldsymbol{X}\boldsymbol{\beta}\right), -$$ +

    Some useful matrix and vector expressions

    -

    as

    -$$ -\boldsymbol{X}^T\boldsymbol{y} = \boldsymbol{X}^T\boldsymbol{X}\boldsymbol{\beta}, -$$ - -

    and if the matrix \( \boldsymbol{X}^T\boldsymbol{X} \) is invertible we have the solution

    -$$ -\boldsymbol{\beta} =\left(\boldsymbol{X}^T\boldsymbol{X}\right)^{-1}\boldsymbol{X}^T\boldsymbol{y}. -$$ - -

    We note also that since our design matrix is defined as \( \boldsymbol{X}\in -{\mathbb{R}}^{n\times p} \), the product \( \boldsymbol{X}^T\boldsymbol{X} \in -{\mathbb{R}}^{p\times p} \). In the above case we have that \( p \ll n \), -in our case \( p=5 \) meaning that we end up with inverting a small -\( 5\times 5 \) matrix. This is a rather common situation, in many cases we end up with low-dimensional -matrices to invert. The methods discussed here and for many other -supervised learning algorithms like classification with logistic -regression or support vector machines, exhibit dimensionalities which -allow for the usage of direct linear algebra methods such as LU decomposition or Singular Value Decomposition (SVD) for finding the inverse of the matrix -\( \boldsymbol{X}^T\boldsymbol{X} \). +

    The following matrix and vector relation will be useful here and for the rest of the course. Vectors are always written as boldfaced lower case letters and +matrices as upper case boldfaced letters.

    -
    -
    +$$ +\frac{\partial (\boldsymbol{b}^T\boldsymbol{a})}{\partial \boldsymbol{a}} = \boldsymbol{b}, +$$ -
    -
    - -

    Small question: Do you think the example we have at hand here (the nuclear binding energies) can lead to problems in inverting the matrix \( \boldsymbol{X}^T\boldsymbol{X} \)? What kind of problems can we expect?

    -
    -
    +$$ +\frac{\partial (\boldsymbol{a}^T\boldsymbol{A}\boldsymbol{a})}{\partial \boldsymbol{a}} = (\boldsymbol{A}+\boldsymbol{A}^T)\boldsymbol{a}, +$$ +$$ +\frac{\partial tr(\boldsymbol{B}\boldsymbol{A})}{\partial \boldsymbol{A}} = \boldsymbol{B}^T, +$$ + +$$ +\frac{\partial \log{\vert\boldsymbol{A}\vert}}{\partial \boldsymbol{A}} = (\boldsymbol{A}^{-1})^T. +$$

    @@ -418,7 +396,7 @@ allow for the usage of direct linear algebra methods such as LU decomposi

  • 60
  • 61
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs052.html b/doc/pub/week34/html/._week34-bs052.html index ddf574810..af4fb7339 100644 --- a/doc/pub/week34/html/._week34-bs052.html +++ b/doc/pub/week34/html/._week34-bs052.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,27 +349,31 @@ MathJax.Hub.Config({

     

     

     

    -

    Some useful matrix and vector expressions

    - -

    The following matrix and vector relation will be useful here and for the rest of the course. Vectors are always written as boldfaced lower case letters and -matrices as upper case boldfaced letters. -

    - +

    Interpretations and optimizing our parameters

    +
    +
    + +

    The residuals \( \boldsymbol{\epsilon} \) are in turn given by

    $$ -\frac{\partial (\boldsymbol{b}^T\boldsymbol{a})}{\partial \boldsymbol{a}} = \boldsymbol{b}, +\boldsymbol{\epsilon} = \boldsymbol{y}-\boldsymbol{\tilde{y}} = \boldsymbol{y}-\boldsymbol{X}\boldsymbol{\beta}, $$ +

    and with

    $$ -\frac{\partial (\boldsymbol{a}^T\boldsymbol{A}\boldsymbol{a})}{\partial \boldsymbol{a}} = (\boldsymbol{A}+\boldsymbol{A}^T)\boldsymbol{a}, +\boldsymbol{X}^T\left( \boldsymbol{y}-\boldsymbol{X}\boldsymbol{\beta}\right)= 0, $$ +

    we have

    $$ -\frac{\partial tr(\boldsymbol{B}\boldsymbol{A})}{\partial \boldsymbol{A}} = \boldsymbol{B}^T, +\boldsymbol{X}^T\boldsymbol{\epsilon}=\boldsymbol{X}^T\left( \boldsymbol{y}-\boldsymbol{X}\boldsymbol{\beta}\right)= 0, $$ -$$ -\frac{\partial \log{\vert\boldsymbol{A}\vert}}{\partial \boldsymbol{A}} = (\boldsymbol{A}^{-1})^T. -$$ +

    meaning that the solution for \( \boldsymbol{\beta} \) is the one which minimizes the residuals. Later we will link this with the maximum likelihood approach.

    +
    +
    + + +

    Let us now return to our nuclear binding energies and simply code the above equations.

    @@ -398,7 +400,7 @@ $$

  • 61
  • 62
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs053.html b/doc/pub/week34/html/._week34-bs053.html index 294374be5..1274745bd 100644 --- a/doc/pub/week34/html/._week34-bs053.html +++ b/doc/pub/week34/html/._week34-bs053.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,31 +349,97 @@ MathJax.Hub.Config({

     

     

     

    -

    Interpretations and optimizing our parameters

    -
    -
    - -

    The residuals \( \boldsymbol{\epsilon} \) are in turn given by

    -$$ -\boldsymbol{\epsilon} = \boldsymbol{y}-\boldsymbol{\tilde{y}} = \boldsymbol{y}-\boldsymbol{X}\boldsymbol{\beta}, -$$ +

    Own code for Ordinary Least Squares

    -

    and with

    -$$ -\boldsymbol{X}^T\left( \boldsymbol{y}-\boldsymbol{X}\boldsymbol{\beta}\right)= 0, -$$ +

    It is rather straightforward to implement the matrix inversion and obtain the parameters \( \boldsymbol{\beta} \). After having defined the matrix \( \boldsymbol{X} \) we simply need to +write +

    -

    we have

    -$$ -\boldsymbol{X}^T\boldsymbol{\epsilon}=\boldsymbol{X}^T\left( \boldsymbol{y}-\boldsymbol{X}\boldsymbol{\beta}\right)= 0, -$$ - -

    meaning that the solution for \( \boldsymbol{\beta} \) is the one which minimizes the residuals. Later we will link this with the maximum likelihood approach.

    + +
    +
    +
    +
    +
    + 
    # matrix inversion to find beta
+beta = np.linalg.inv(X.T.dot(X)).dot(X.T).dot(Energies)
+# and then make the prediction
+ytilde = X @ beta
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +

    Alternatively, you can use the least squares functionality in Numpy as

    + + +
    +
    +
    +
    +
    + 
    fit = np.linalg.lstsq(X, Energies, rcond =None)[0]
+ytildenp = np.dot(fit,X.T)
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    And finally we plot our fit with and compare with data

    + + +
    +
    +
    +
    +
    + 
    Masses['Eapprox']  = ytilde
+# Generate a plot comparing the experimental with the fitted values values.
+fig, ax = plt.subplots()
+ax.set_xlabel(r'$A = N + Z$')
+ax.set_ylabel(r'$E_\mathrm{bind}\,/\mathrm{MeV}$')
+ax.plot(Masses['A'], Masses['Ebinding'], alpha=0.7, lw=2,
+            label='Ame2016')
+ax.plot(Masses['A'], Masses['Eapprox'], alpha=0.7, lw=2, c='m',
+            label='Fit')
+ax.legend()
+save_fig("Masses2016OLS")
+plt.show()
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    -

    Let us now return to our nuclear binding energies and simply code the above equations.

    @@ -402,7 +466,7 @@ $$

  • 62
  • 63
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs054.html b/doc/pub/week34/html/._week34-bs054.html index 9cb66060f..1fc9e8586 100644 --- a/doc/pub/week34/html/._week34-bs054.html +++ b/doc/pub/week34/html/._week34-bs054.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,10 +349,10 @@ MathJax.Hub.Config({

     

     

     

    -

    Own code for Ordinary Least Squares

    +

    Adding error analysis and training set up

    -

    It is rather straightforward to implement the matrix inversion and obtain the parameters \( \boldsymbol{\beta} \). After having defined the matrix \( \boldsymbol{X} \) we simply need to -write +

    We can easily test our fit by computing the \( R2 \) score that we discussed in connection with the functionality of Scikit-Learn in the introductory slides. +Since we are not using Scikit-Learn here we can define our own \( R2 \) function as

    @@ -363,10 +361,8 @@ write
    - 
    # matrix inversion to find beta
-beta = np.linalg.inv(X.T.dot(X)).dot(X.T).dot(Energies)
-# and then make the prediction
-ytilde = X @ beta
+  
    def R2(y_data, y_model):
+    return 1 - np.sum((y_data - y_model) ** 2) / np.sum((y_data - np.mean(y_data)) ** 2)
    @@ -382,7 +378,7 @@ ytilde = X @
    -

    Alternatively, you can use the least squares functionality in Numpy as

    +

    and we would be using it as

    @@ -390,8 +386,7 @@ ytilde = X @
    - 
    fit = np.linalg.lstsq(X, Energies, rcond =None)[0]
-ytildenp = np.dot(fit,X.T)
+  
    print(R2(Energies,ytilde))
    @@ -407,7 +402,7 @@ ytildenp = np.<
    -

    And finally we plot our fit with and compare with data

    +

    We can easily add our MSE score as

    @@ -415,18 +410,37 @@ ytildenp = np.<
    - 
    Masses['Eapprox']  = ytilde
-# Generate a plot comparing the experimental with the fitted values values.
-fig, ax = plt.subplots()
-ax.set_xlabel(r'$A = N + Z$')
-ax.set_ylabel(r'$E_\mathrm{bind}\,/\mathrm{MeV}$')
-ax.plot(Masses['A'], Masses['Ebinding'], alpha=0.7, lw=2,
-            label='Ame2016')
-ax.plot(Masses['A'], Masses['Eapprox'], alpha=0.7, lw=2, c='m',
-            label='Fit')
-ax.legend()
-save_fig("Masses2016OLS")
-plt.show()
+  
    def MSE(y_data,y_model):
+    n = np.size(y_model)
+    return np.sum((y_data-y_model)**2)/n
+
+print(MSE(Energies,ytilde))
+
    
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    and finally the relative error as

    + + +
    +
    +
    +
    +
    + 
    def RelativeError(y_data,y_model):
+    return abs((y_data-y_model)/y_data)
+print(RelativeError(Energies, ytilde))
    @@ -468,7 +482,7 @@ plt.show()
  • 63
  • 64
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs055.html b/doc/pub/week34/html/._week34-bs055.html index b5a4335f0..dc7c8134e 100644 --- a/doc/pub/week34/html/._week34-bs055.html +++ b/doc/pub/week34/html/._week34-bs055.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,111 +349,31 @@ MathJax.Hub.Config({

     

     

     

    -

    Adding error analysis and training set up

    +

    The \( \chi^2 \) function

    +
    +
    + -

    We can easily test our fit by computing the \( R2 \) score that we discussed in connection with the functionality of Scikit-Learn in the introductory slides. -Since we are not using Scikit-Learn here we can define our own \( R2 \) function as +

    Normally, the response (dependent or outcome) variable \( y_i \) is the +outcome of a numerical experiment or another type of experiment and is +thus only an approximation to the true value. It is then always +accompanied by an error estimate, often limited to a statistical error +estimate given by the standard deviation discussed earlier. In the +discussion here we will treat \( y_i \) as our exact value for the +response variable.

    - -
    -
    -
    -
    -
    - 
    def R2(y_data, y_model):
-    return 1 - np.sum((y_data - y_model) ** 2) / np.sum((y_data - np.mean(y_data)) ** 2)
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    +

    Introducing the standard deviation \( \sigma_i \) for each measurement +\( y_i \), we define now the \( \chi^2 \) function (omitting the \( 1/n \) term) +as +

    -

    and we would be using it as

    +$$ +\chi^2(\boldsymbol{\beta})=\frac{1}{n}\sum_{i=0}^{n-1}\frac{\left(y_i-\tilde{y}_i\right)^2}{\sigma_i^2}=\frac{1}{n}\left\{\left(\boldsymbol{y}-\boldsymbol{\tilde{y}}\right)^T\frac{1}{\boldsymbol{\Sigma^2}}\left(\boldsymbol{y}-\boldsymbol{\tilde{y}}\right)\right\}, +$$ - -
    -
    -
    -
    -
    - 
    print(R2(Energies,ytilde))
-
    +

    where the matrix \( \boldsymbol{\Sigma} \) is a diagonal matrix with \( \sigma_i \) as matrix elements.

    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    We can easily add our MSE score as

    - - -
    -
    -
    -
    -
    - 
    def MSE(y_data,y_model):
-    n = np.size(y_model)
-    return np.sum((y_data-y_model)**2)/n
-
-print(MSE(Energies,ytilde))
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    - -

    and finally the relative error as

    - - -
    -
    -
    -
    -
    - 
    def RelativeError(y_data,y_model):
-    return abs((y_data-y_model)/y_data)
-print(RelativeError(Energies, ytilde))
-
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    -
    @@ -483,8 +401,6 @@ Since we are not using Scikit-Learn here we can define our own \( R2 \) f
  • 63
  • 64
  • 65
    • -
  • ...
    • -
  • 66
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs056.html b/doc/pub/week34/html/._week34-bs056.html index 649a96970..510ae64f7 100644 --- a/doc/pub/week34/html/._week34-bs056.html +++ b/doc/pub/week34/html/._week34-bs056.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -356,25 +354,22 @@ MathJax.Hub.Config({
    -

    Normally, the response (dependent or outcome) variable \( y_i \) is the -outcome of a numerical experiment or another type of experiment and is -thus only an approximation to the true value. It is then always -accompanied by an error estimate, often limited to a statistical error -estimate given by the standard deviation discussed earlier. In the -discussion here we will treat \( y_i \) as our exact value for the -response variable. -

    - -

    Introducing the standard deviation \( \sigma_i \) for each measurement -\( y_i \), we define now the \( \chi^2 \) function (omitting the \( 1/n \) term) -as -

    - +

    In order to find the parameters \( \beta_i \) we will then minimize the spread of \( \chi^2(\boldsymbol{\beta}) \) by requiring

    $$ -\chi^2(\boldsymbol{\beta})=\frac{1}{n}\sum_{i=0}^{n-1}\frac{\left(y_i-\tilde{y}_i\right)^2}{\sigma_i^2}=\frac{1}{n}\left\{\left(\boldsymbol{y}-\boldsymbol{\tilde{y}}\right)^T\frac{1}{\boldsymbol{\Sigma^2}}\left(\boldsymbol{y}-\boldsymbol{\tilde{y}}\right)\right\}, +\frac{\partial \chi^2(\boldsymbol{\beta})}{\partial \beta_j} = \frac{\partial }{\partial \beta_j}\left[ \frac{1}{n}\sum_{i=0}^{n-1}\left(\frac{y_i-\beta_0x_{i,0}-\beta_1x_{i,1}-\beta_2x_{i,2}-\dots-\beta_{n-1}x_{i,n-1}}{\sigma_i}\right)^2\right]=0, $$ -

    where the matrix \( \boldsymbol{\Sigma} \) is a diagonal matrix with \( \sigma_i \) as matrix elements.

    +

    which results in

    +$$ +\frac{\partial \chi^2(\boldsymbol{\beta})}{\partial \beta_j} = -\frac{2}{n}\left[ \sum_{i=0}^{n-1}\frac{x_{ij}}{\sigma_i}\left(\frac{y_i-\beta_0x_{i,0}-\beta_1x_{i,1}-\beta_2x_{i,2}-\dots-\beta_{n-1}x_{i,n-1}}{\sigma_i}\right)\right]=0, +$$ + +

    or in a matrix-vector form as

    +$$ +\frac{\partial \chi^2(\boldsymbol{\beta})}{\partial \boldsymbol{\beta}} = 0 = \boldsymbol{A}^T\left( \boldsymbol{b}-\boldsymbol{A}\boldsymbol{\beta}\right). +$$ + +

    where we have defined the matrix \( \boldsymbol{A} =\boldsymbol{X}/\boldsymbol{\Sigma} \) with matrix elements \( a_{ij} = x_{ij}/\sigma_i \) and the vector \( \boldsymbol{b} \) with elements \( b_i = y_i/\sigma_i \).

    @@ -402,7 +397,6 @@ $$
  • 63
  • 64
  • 65
    • -
  • 66
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs057.html b/doc/pub/week34/html/._week34-bs057.html index 851389495..10c3e24a9 100644 --- a/doc/pub/week34/html/._week34-bs057.html +++ b/doc/pub/week34/html/._week34-bs057.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -356,22 +354,20 @@ MathJax.Hub.Config({
    -

    In order to find the parameters \( \beta_i \) we will then minimize the spread of \( \chi^2(\boldsymbol{\beta}) \) by requiring

    +

    We can rewrite

    $$ -\frac{\partial \chi^2(\boldsymbol{\beta})}{\partial \beta_j} = \frac{\partial }{\partial \beta_j}\left[ \frac{1}{n}\sum_{i=0}^{n-1}\left(\frac{y_i-\beta_0x_{i,0}-\beta_1x_{i,1}-\beta_2x_{i,2}-\dots-\beta_{n-1}x_{i,n-1}}{\sigma_i}\right)^2\right]=0, +\frac{\partial \chi^2(\boldsymbol{\beta})}{\partial \boldsymbol{\beta}} = 0 = \boldsymbol{A}^T\left( \boldsymbol{b}-\boldsymbol{A}\boldsymbol{\beta}\right), $$ -

    which results in

    +

    as

    $$ -\frac{\partial \chi^2(\boldsymbol{\beta})}{\partial \beta_j} = -\frac{2}{n}\left[ \sum_{i=0}^{n-1}\frac{x_{ij}}{\sigma_i}\left(\frac{y_i-\beta_0x_{i,0}-\beta_1x_{i,1}-\beta_2x_{i,2}-\dots-\beta_{n-1}x_{i,n-1}}{\sigma_i}\right)\right]=0, +\boldsymbol{A}^T\boldsymbol{b} = \boldsymbol{A}^T\boldsymbol{A}\boldsymbol{\beta}, $$ -

    or in a matrix-vector form as

    +

    and if the matrix \( \boldsymbol{A}^T\boldsymbol{A} \) is invertible we have the solution

    $$ -\frac{\partial \chi^2(\boldsymbol{\beta})}{\partial \boldsymbol{\beta}} = 0 = \boldsymbol{A}^T\left( \boldsymbol{b}-\boldsymbol{A}\boldsymbol{\beta}\right). +\boldsymbol{\beta} =\left(\boldsymbol{A}^T\boldsymbol{A}\right)^{-1}\boldsymbol{A}^T\boldsymbol{b}. $$ - -

    where we have defined the matrix \( \boldsymbol{A} =\boldsymbol{X}/\boldsymbol{\Sigma} \) with matrix elements \( a_{ij} = x_{ij}/\sigma_i \) and the vector \( \boldsymbol{b} \) with elements \( b_i = y_i/\sigma_i \).

    @@ -398,7 +394,6 @@ $$
  • 63
  • 64
  • 65
    • -
  • 66
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs058.html b/doc/pub/week34/html/._week34-bs058.html index 001059f04..1eb4e045c 100644 --- a/doc/pub/week34/html/._week34-bs058.html +++ b/doc/pub/week34/html/._week34-bs058.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -356,19 +354,24 @@ MathJax.Hub.Config({
    -

    We can rewrite

    +

    If we then introduce the matrix

    $$ -\frac{\partial \chi^2(\boldsymbol{\beta})}{\partial \boldsymbol{\beta}} = 0 = \boldsymbol{A}^T\left( \boldsymbol{b}-\boldsymbol{A}\boldsymbol{\beta}\right), +\boldsymbol{H} = \left(\boldsymbol{A}^T\boldsymbol{A}\right)^{-1}, $$ -

    as

    +

    we have then the following expression for the parameters \( \beta_j \) (the matrix elements of \( \boldsymbol{H} \) are \( h_{ij} \))

    $$ -\boldsymbol{A}^T\boldsymbol{b} = \boldsymbol{A}^T\boldsymbol{A}\boldsymbol{\beta}, +\beta_j = \sum_{k=0}^{p-1}h_{jk}\sum_{i=0}^{n-1}\frac{y_i}{\sigma_i}\frac{x_{ik}}{\sigma_i} = \sum_{k=0}^{p-1}h_{jk}\sum_{i=0}^{n-1}b_ia_{ik} $$ -

    and if the matrix \( \boldsymbol{A}^T\boldsymbol{A} \) is invertible we have the solution

    +

    We state without proof the expression for the uncertainty in the parameters \( \beta_j \) as (we leave this as an exercise)

    $$ -\boldsymbol{\beta} =\left(\boldsymbol{A}^T\boldsymbol{A}\right)^{-1}\boldsymbol{A}^T\boldsymbol{b}. +\sigma^2(\beta_j) = \sum_{i=0}^{n-1}\sigma_i^2\left( \frac{\partial \beta_j}{\partial y_i}\right)^2, +$$ + +

    resulting in

    +$$ +\sigma^2(\beta_j) = \left(\sum_{k=0}^{p-1}h_{jk}\sum_{i=0}^{n-1}a_{ik}\right)\left(\sum_{l=0}^{p-1}h_{jl}\sum_{m=0}^{n-1}a_{ml}\right) = h_{jj}! $$
    @@ -395,7 +398,6 @@ $$
  • 63
  • 64
  • 65
    • -
  • 66
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs059.html b/doc/pub/week34/html/._week34-bs059.html index 0aab908b7..3dab2ae88 100644 --- a/doc/pub/week34/html/._week34-bs059.html +++ b/doc/pub/week34/html/._week34-bs059.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -355,25 +353,19 @@ MathJax.Hub.Config({
    - -

    If we then introduce the matrix

    +

    The first step here is to approximate the function \( y \) with a first-order polynomial, that is we write

    $$ -\boldsymbol{H} = \left(\boldsymbol{A}^T\boldsymbol{A}\right)^{-1}, +y=y(x) \rightarrow y(x_i) \approx \beta_0+\beta_1 x_i. $$ -

    we have then the following expression for the parameters \( \beta_j \) (the matrix elements of \( \boldsymbol{H} \) are \( h_{ij} \))

    +

    By computing the derivatives of \( \chi^2 \) with respect to \( \beta_0 \) and \( \beta_1 \) show that these are given by

    $$ -\beta_j = \sum_{k=0}^{p-1}h_{jk}\sum_{i=0}^{n-1}\frac{y_i}{\sigma_i}\frac{x_{ik}}{\sigma_i} = \sum_{k=0}^{p-1}h_{jk}\sum_{i=0}^{n-1}b_ia_{ik} +\frac{\partial \chi^2(\boldsymbol{\beta})}{\partial \beta_0} = -2\left[ \frac{1}{n}\sum_{i=0}^{n-1}\left(\frac{y_i-\beta_0-\beta_1x_{i}}{\sigma_i^2}\right)\right]=0, $$ -

    We state without proof the expression for the uncertainty in the parameters \( \beta_j \) as (we leave this as an exercise)

    +

    and

    $$ -\sigma^2(\beta_j) = \sum_{i=0}^{n-1}\sigma_i^2\left( \frac{\partial \beta_j}{\partial y_i}\right)^2, -$$ - -

    resulting in

    -$$ -\sigma^2(\beta_j) = \left(\sum_{k=0}^{p-1}h_{jk}\sum_{i=0}^{n-1}a_{ik}\right)\left(\sum_{l=0}^{p-1}h_{jl}\sum_{m=0}^{n-1}a_{ml}\right) = h_{jj}! +\frac{\partial \chi^2(\boldsymbol{\beta})}{\partial \beta_1} = -\frac{2}{n}\left[ \sum_{i=0}^{n-1}x_i\left(\frac{y_i-\beta_0-\beta_1x_{i}}{\sigma_i^2}\right)\right]=0. $$
    @@ -399,7 +391,6 @@ $$
  • 63
  • 64
  • 65
    • -
  • 66
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs060.html b/doc/pub/week34/html/._week34-bs060.html index 0b64d04da..87aedb4e3 100644 --- a/doc/pub/week34/html/._week34-bs060.html +++ b/doc/pub/week34/html/._week34-bs060.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -355,20 +353,50 @@ MathJax.Hub.Config({
    -

    The first step here is to approximate the function \( y \) with a first-order polynomial, that is we write

    + +

    For a linear fit (a first-order polynomial) we don't need to invert a matrix!! +Defining +

    $$ -y=y(x) \rightarrow y(x_i) \approx \beta_0+\beta_1 x_i. +\gamma = \sum_{i=0}^{n-1}\frac{1}{\sigma_i^2}, $$ -

    By computing the derivatives of \( \chi^2 \) with respect to \( \beta_0 \) and \( \beta_1 \) show that these are given by

    + $$ -\frac{\partial \chi^2(\boldsymbol{\beta})}{\partial \beta_0} = -2\left[ \frac{1}{n}\sum_{i=0}^{n-1}\left(\frac{y_i-\beta_0-\beta_1x_{i}}{\sigma_i^2}\right)\right]=0, +\gamma_x = \sum_{i=0}^{n-1}\frac{x_{i}}{\sigma_i^2}, $$ -

    and

    + $$ -\frac{\partial \chi^2(\boldsymbol{\beta})}{\partial \beta_1} = -\frac{2}{n}\left[ \sum_{i=0}^{n-1}x_i\left(\frac{y_i-\beta_0-\beta_1x_{i}}{\sigma_i^2}\right)\right]=0. +\gamma_y = \sum_{i=0}^{n-1}\left(\frac{y_i}{\sigma_i^2}\right), $$ + + +$$ +\gamma_{xx} = \sum_{i=0}^{n-1}\frac{x_ix_{i}}{\sigma_i^2}, +$$ + + +$$ +\gamma_{xy} = \sum_{i=0}^{n-1}\frac{y_ix_{i}}{\sigma_i^2}, +$$ + +

    we obtain

    + +$$ +\beta_0 = \frac{\gamma_{xx}\gamma_y-\gamma_x\gamma_y}{\gamma\gamma_{xx}-\gamma_x^2}, +$$ + + +$$ +\beta_1 = \frac{\gamma_{xy}\gamma-\gamma_x\gamma_y}{\gamma\gamma_{xx}-\gamma_x^2}. +$$ + +

    This approach (different linear and non-linear regression) suffers +often from both being underdetermined and overdetermined in the +unknown coefficients \( \beta_i \). A better approach is to use the +Singular Value Decomposition (SVD) method discussed next week. +

    @@ -392,7 +420,6 @@ $$
  • 63
  • 64
  • 65
    • -
  • 66
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs061.html b/doc/pub/week34/html/._week34-bs061.html index 9d171bc91..761c4291d 100644 --- a/doc/pub/week34/html/._week34-bs061.html +++ b/doc/pub/week34/html/._week34-bs061.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,57 +349,27 @@ MathJax.Hub.Config({

     

     

     

    -

    The \( \chi^2 \) function

    -
    -
    - +

    Fitting an Equation of State for Dense Nuclear Matter

    -

    For a linear fit (a first-order polynomial) we don't need to invert a matrix!! -Defining +

    Before we continue, let us introduce yet another example. We are going to fit the +nuclear equation of state using results from many-body calculations. +The equation of state we have made available here, as function of +density, has been derived using modern nucleon-nucleon potentials with +the addition of three-body +forces. This +time the file is presented as a standard csv file.

    -$$ -\gamma = \sum_{i=0}^{n-1}\frac{1}{\sigma_i^2}, -$$ - -$$ -\gamma_x = \sum_{i=0}^{n-1}\frac{x_{i}}{\sigma_i^2}, -$$ - - -$$ -\gamma_y = \sum_{i=0}^{n-1}\left(\frac{y_i}{\sigma_i^2}\right), -$$ - - -$$ -\gamma_{xx} = \sum_{i=0}^{n-1}\frac{x_ix_{i}}{\sigma_i^2}, -$$ - - -$$ -\gamma_{xy} = \sum_{i=0}^{n-1}\frac{y_ix_{i}}{\sigma_i^2}, -$$ - -

    we obtain

    - -$$ -\beta_0 = \frac{\gamma_{xx}\gamma_y-\gamma_x\gamma_y}{\gamma\gamma_{xx}-\gamma_x^2}, -$$ - - -$$ -\beta_1 = \frac{\gamma_{xy}\gamma-\gamma_x\gamma_y}{\gamma\gamma_{xx}-\gamma_x^2}. -$$ - -

    This approach (different linear and non-linear regression) suffers -often from both being underdetermined and overdetermined in the -unknown coefficients \( \beta_i \). A better approach is to use the -Singular Value Decomposition (SVD) method discussed next week. +

    The beginning of the Python code here is similar to what you have seen +before, with the same initializations and declarations. We use also +pandas again, rather extensively in order to organize our data.

    -
    -
    +

    The difference now is that we use Scikit-Learn's regression tools +instead of our own matrix inversion implementation. Furthermore, we +sneak in Ridge regression (to be discussed below) which includes a +hyperparameter \( \lambda \), also to be explained below. +

    @@ -421,7 +389,6 @@ Singular Value Decomposition (SVD) method discussed next week.

  • 63
  • 64
  • 65
    • -
  • 66
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs062.html b/doc/pub/week34/html/._week34-bs062.html index 8982343aa..9a4cc9710 100644 --- a/doc/pub/week34/html/._week34-bs062.html +++ b/doc/pub/week34/html/._week34-bs062.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,26 +349,122 @@ MathJax.Hub.Config({

     

     

     

    -

    Fitting an Equation of State for Dense Nuclear Matter

    +

    The code

    -

    Before we continue, let us introduce yet another example. We are going to fit the -nuclear equation of state using results from many-body calculations. -The equation of state we have made available here, as function of -density, has been derived using modern nucleon-nucleon potentials with -the addition of three-body -forces. This -time the file is presented as a standard csv file. + + +

    +
    +
    +
    +
    + 
    # Common imports
+import os
+import numpy as np
+import pandas as pd
+import matplotlib.pyplot as plt
+import matplotlib.pyplot as plt
+import sklearn.linear_model as skl
+from sklearn.metrics import mean_squared_error, r2_score, mean_absolute_error
+
+# Where to save the figures and data files
+PROJECT_ROOT_DIR = "Results"
+FIGURE_ID = "Results/FigureFiles"
+DATA_ID = "DataFiles/"
+
+if not os.path.exists(PROJECT_ROOT_DIR):
+    os.mkdir(PROJECT_ROOT_DIR)
+
+if not os.path.exists(FIGURE_ID):
+    os.makedirs(FIGURE_ID)
+
+if not os.path.exists(DATA_ID):
+    os.makedirs(DATA_ID)
+
+def image_path(fig_id):
+    return os.path.join(FIGURE_ID, fig_id)
+
+def data_path(dat_id):
+    return os.path.join(DATA_ID, dat_id)
+
+def save_fig(fig_id):
+    plt.savefig(image_path(fig_id) + ".png", format='png')
+
+infile = open(data_path("EoS.csv"),'r')
+
+# Read the EoS data as  csv file and organize the data into two arrays with density and energies
+EoS = pd.read_csv(infile, names=('Density', 'Energy'))
+EoS['Energy'] = pd.to_numeric(EoS['Energy'], errors='coerce')
+EoS = EoS.dropna()
+Energies = EoS['Energy']
+Density = EoS['Density']
+#  The design matrix now as function of various polytrops
+X = np.zeros((len(Density),4))
+X[:,3] = Density**(4.0/3.0)
+X[:,2] = Density
+X[:,1] = Density**(2.0/3.0)
+X[:,0] = 1
+
+# We use now Scikit-Learn's linear regressor and ridge regressor
+# OLS part
+clf = skl.LinearRegression().fit(X, Energies)
+ytilde = clf.predict(X)
+EoS['Eols']  = ytilde
+# The mean squared error                               
+print("Mean squared error: %.2f" % mean_squared_error(Energies, ytilde))
+# Explained variance score: 1 is perfect prediction                                 
+print('Variance score: %.2f' % r2_score(Energies, ytilde))
+# Mean absolute error                                                           
+print('Mean absolute error: %.2f' % mean_absolute_error(Energies, ytilde))
+print(clf.coef_, clf.intercept_)
+
+# The Ridge regression with a hyperparameter lambda = 0.1
+_lambda = 0.1
+clf_ridge = skl.Ridge(alpha=_lambda).fit(X, Energies)
+yridge = clf_ridge.predict(X)
+EoS['Eridge']  = yridge
+# The mean squared error                               
+print("Mean squared error: %.2f" % mean_squared_error(Energies, yridge))
+# Explained variance score: 1 is perfect prediction                                 
+print('Variance score: %.2f' % r2_score(Energies, yridge))
+# Mean absolute error                                                           
+print('Mean absolute error: %.2f' % mean_absolute_error(Energies, yridge))
+print(clf_ridge.coef_, clf_ridge.intercept_)
+
+fig, ax = plt.subplots()
+ax.set_xlabel(r'$\rho[\mathrm{fm}^{-3}]$')
+ax.set_ylabel(r'Energy per particle')
+ax.plot(EoS['Density'], EoS['Energy'], alpha=0.7, lw=2,
+            label='Theoretical data')
+ax.plot(EoS['Density'], EoS['Eols'], alpha=0.7, lw=2, c='m',
+            label='OLS')
+ax.plot(EoS['Density'], EoS['Eridge'], alpha=0.7, lw=2, c='g',
+            label='Ridge $\lambda = 0.1$')
+ax.legend()
+save_fig("EoSfitting")
+plt.show()
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    The above simple polynomial in density \( \rho \) gives an excellent fit +to the data.

    -

    The beginning of the Python code here is similar to what you have seen -before, with the same initializations and declarations. We use also -pandas again, rather extensively in order to organize our data. -

    - -

    The difference now is that we use Scikit-Learn's regression tools -instead of our own matrix inversion implementation. Furthermore, we -sneak in Ridge regression (to be discussed below) which includes a -hyperparameter \( \lambda \), also to be explained below. +

    We note also that there is a small deviation between the +standard OLS and the Ridge regression at higher densities. We discuss this in more detail +below.

    @@ -390,7 +484,6 @@ hyperparameter \( \lambda \), also to be explained below.

  • 63
  • 64
  • 65
    • -
  • 66
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs063.html b/doc/pub/week34/html/._week34-bs063.html index d110c7014..c9b0336fb 100644 --- a/doc/pub/week34/html/._week34-bs063.html +++ b/doc/pub/week34/html/._week34-bs063.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,7 +349,19 @@ MathJax.Hub.Config({

     

     

     

    -

    The code

    +

    Splitting our Data in Training and Test data

    + +

    It is normal in essentially all Machine Learning studies to split the +data in a training set and a test set (sometimes also an additional +validation set). Scikit-Learn has an own function for this. There +is no explicit recipe for how much data should be included as training +data and say test data. An accepted rule of thumb is to use +approximately \( 2/3 \) to \( 4/5 \) of the data as training data. We will +postpone a discussion of this splitting to the end of these notes and +our discussion of the so-called bias-variance tradeoff. Here we +limit ourselves to repeat the above equation of state fitting example +but now splitting the data into a training set and a test set. +

    @@ -360,15 +370,11 @@ MathJax.Hub.Config({
    - 
    # Common imports
-import os
+  
    import os
 import numpy as np
 import pandas as pd
 import matplotlib.pyplot as plt
-import matplotlib.pyplot as plt
-import sklearn.linear_model as skl
-from sklearn.metrics import mean_squared_error, r2_score, mean_absolute_error
-
+from sklearn.model_selection import train_test_split
 # Where to save the figures and data files
 PROJECT_ROOT_DIR = "Results"
 FIGURE_ID = "Results/FigureFiles"
@@ -392,59 +398,42 @@ DATA_ID = "
 def save_fig(fig_id):
     plt.savefig(image_path(fig_id) + ".png", format='png')
 
+def R2(y_data, y_model):
+    return 1 - np.sum((y_data - y_model) ** 2) / np.sum((y_data - np.mean(y_data)) ** 2)
+def MSE(y_data,y_model):
+    n = np.size(y_model)
+    return np.sum((y_data-y_model)**2)/n
+
 infile = open(data_path("EoS.csv"),'r')
 
-# Read the EoS data as  csv file and organize the data into two arrays with density and energies
+# Read the EoS data as  csv file and organized into two arrays with density and energies
 EoS = pd.read_csv(infile, names=('Density', 'Energy'))
 EoS['Energy'] = pd.to_numeric(EoS['Energy'], errors='coerce')
 EoS = EoS.dropna()
 Energies = EoS['Energy']
 Density = EoS['Density']
 #  The design matrix now as function of various polytrops
-X = np.zeros((len(Density),4))
-X[:,3] = Density**(4.0/3.0)
-X[:,2] = Density
-X[:,1] = Density**(2.0/3.0)
+X = np.zeros((len(Density),5))
 X[:,0] = 1
-
-# We use now Scikit-Learn's linear regressor and ridge regressor
-# OLS part
-clf = skl.LinearRegression().fit(X, Energies)
-ytilde = clf.predict(X)
-EoS['Eols']  = ytilde
-# The mean squared error                               
-print("Mean squared error: %.2f" % mean_squared_error(Energies, ytilde))
-# Explained variance score: 1 is perfect prediction                                 
-print('Variance score: %.2f' % r2_score(Energies, ytilde))
-# Mean absolute error                                                           
-print('Mean absolute error: %.2f' % mean_absolute_error(Energies, ytilde))
-print(clf.coef_, clf.intercept_)
-
-# The Ridge regression with a hyperparameter lambda = 0.1
-_lambda = 0.1
-clf_ridge = skl.Ridge(alpha=_lambda).fit(X, Energies)
-yridge = clf_ridge.predict(X)
-EoS['Eridge']  = yridge
-# The mean squared error                               
-print("Mean squared error: %.2f" % mean_squared_error(Energies, yridge))
-# Explained variance score: 1 is perfect prediction                                 
-print('Variance score: %.2f' % r2_score(Energies, yridge))
-# Mean absolute error                                                           
-print('Mean absolute error: %.2f' % mean_absolute_error(Energies, yridge))
-print(clf_ridge.coef_, clf_ridge.intercept_)
-
-fig, ax = plt.subplots()
-ax.set_xlabel(r'$\rho[\mathrm{fm}^{-3}]$')
-ax.set_ylabel(r'Energy per particle')
-ax.plot(EoS['Density'], EoS['Energy'], alpha=0.7, lw=2,
-            label='Theoretical data')
-ax.plot(EoS['Density'], EoS['Eols'], alpha=0.7, lw=2, c='m',
-            label='OLS')
-ax.plot(EoS['Density'], EoS['Eridge'], alpha=0.7, lw=2, c='g',
-            label='Ridge $\lambda = 0.1$')
-ax.legend()
-save_fig("EoSfitting")
-plt.show()
+X[:,1] = Density**(2.0/3.0)
+X[:,2] = Density
+X[:,3] = Density**(4.0/3.0)
+X[:,4] = Density**(5.0/3.0)
+# We split the data in test and training data
+X_train, X_test, y_train, y_test = train_test_split(X, Energies, test_size=0.2)
+# matrix inversion to find beta
+beta = np.linalg.inv(X_train.T.dot(X_train)).dot(X_train.T).dot(y_train)
+# and then make the prediction
+ytilde = X_train @ beta
+print("Training R2")
+print(R2(y_train,ytilde))
+print("Training MSE")
+print(MSE(y_train,ytilde))
+ypredict = X_test @ beta
+print("Test R2")
+print(R2(y_test,ypredict))
+print("Test MSE")
+print(MSE(y_test,ypredict))
    @@ -460,14 +449,6 @@ plt.show()
    -

    The above simple polynomial in density \( \rho \) gives an excellent fit -to the data. -

    - -

    We note also that there is a small deviation between the -standard OLS and the Ridge regression at higher densities. We discuss this in more detail -below. -

    @@ -485,7 +466,6 @@ below.

  • 63
  • 64
  • 65
    • -
  • 66
  • »
    • diff --git a/doc/pub/week34/html/._week34-bs064.html b/doc/pub/week34/html/._week34-bs064.html index 7378a202a..e975ce7b5 100644 --- a/doc/pub/week34/html/._week34-bs064.html +++ b/doc/pub/week34/html/._week34-bs064.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -351,20 +349,157 @@ MathJax.Hub.Config({

     

     

     

    -

    Splitting our Data in Training and Test data

    +

    Exercises

    +

    Here are three possible exercises for weeks 34 and 35.

    -

    It is normal in essentially all Machine Learning studies to split the -data in a training set and a test set (sometimes also an additional -validation set). Scikit-Learn has an own function for this. There -is no explicit recipe for how much data should be included as training -data and say test data. An accepted rule of thumb is to use -approximately \( 2/3 \) to \( 4/5 \) of the data as training data. We will -postpone a discussion of this splitting to the end of these notes and -our discussion of the so-called bias-variance tradeoff. Here we -limit ourselves to repeat the above equation of state fitting example -but now splitting the data into a training set and a test set. + +

    Exercise 1: Setting up various Python environments

    + +

    The first exercise here is of a mere technical art. We want you to have

    +
      +
    • git as a version control software and to establish a user account on a provider like GitHub. Other providers like GitLab etc are equally fine. You can also use the University of Oslo GitHub facilities.
      • +
    • Install various Python packages
      • +
    +

    We will make extensive use of Python as programming language and its +myriad of available libraries. You will find +IPython/Jupyter notebooks invaluable in your work. You can run R +codes in the Jupyter/IPython notebooks, with the immediate benefit of +visualizing your data. You can also use compiled languages like C++, +Rust, Fortran etc if you prefer. The focus in these lectures will be +on Python.

    +

    If you have Python installed (we recommend Python3) and you feel +pretty familiar with installing different packages, we recommend that +you install the following Python packages via pip as +

    + +
      +
    1. pip install numpy scipy matplotlib ipython scikit-learn sympy pandas pillow
      2. +
    +

    For Tensorflow, we recommend following the instructions in the text of +Aurelien Geron, Hands‑On Machine Learning with Scikit‑Learn and TensorFlow, O'Reilly +

    + +

    We will come back to tensorflow later.

    + +

    For Python3, replace pip with pip3.

    + +

    For OSX users we recommend, after having installed Xcode, to +install brew. Brew allows for a seamless installation of additional +software via for example +

    + +
      +
    1. brew install python3
      2. +
    +

    For Linux users, with its variety of distributions like for example the widely popular Ubuntu distribution, +you can use pip as well and simply install Python as +

    + +
      +
    1. sudo apt-get install python3 (or python for Python2.7)
      2. +
    +

    If you don't want to perform these operations separately and venture +into the hassle of exploring how to set up dependencies and paths, we +recommend two widely used distrubutions which set up all relevant +dependencies for Python, namely +

    + + +

    which is an open source +distribution of the Python and R programming languages for large-scale +data processing, predictive analytics, and scientific computing, that +aims to simplify package management and deployment. Package versions +are managed by the package management system conda. +

    + + +

    is a Python +distribution for scientific and analytic computing distribution and +analysis environment, available for free and under a commercial +license. +

    + +

    We recommend using Anaconda if you are not too familiar with setting paths in a terminal environment.

    + + + + +

    Exercise 2: making your own data and exploring scikit-learn

    + +

    We will generate our own dataset for a function \( y(x) \) where \( x \in [0,1] \) and defined by random numbers computed with the uniform distribution. The function \( y \) is a quadratic polynomial in \( x \) with added stochastic noise according to the normal distribution \( \cal {N}(0,1) \). +The following simple Python instructions define our \( x \) and \( y \) values (with 100 data points). +

    + + +
    +
    +
    +
    +
    + 
    x = np.random.rand(100,1)
+y = 2.0+5*x*x+0.1*np.random.randn(100,1)
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + + +
      +
    1. Write your own code (following the examples under the regression notes) for computing the parametrization of the data set fitting a second-order polynomial.
      2. +
    2. Use thereafter scikit-learn (see again the examples in the regression slides) and compare with your own code.
      3. +
    3. Using scikit-learn, compute also the mean square error, a risk metric corresponding to the expected value of the squared (quadratic) error defined as
      4. +
    +$$ MSE(\boldsymbol{y},\boldsymbol{\tilde{y}}) = \frac{1}{n} +\sum_{i=0}^{n-1}(y_i-\tilde{y}_i)^2, +$$ + +

    and the \( R^2 \) score function. +If \( \tilde{\boldsymbol{y}}_i \) is the predicted value of the \( i-th \) sample and \( y_i \) is the corresponding true value, then the score \( R^2 \) is defined as +

    +$$ +R^2(\boldsymbol{y}, \tilde{\boldsymbol{y}}) = 1 - \frac{\sum_{i=0}^{n - 1} (y_i - \tilde{y}_i)^2}{\sum_{i=0}^{n - 1} (y_i - \bar{y})^2}, +$$ + +

    where we have defined the mean value of \( \boldsymbol{y} \) as

    +$$ +\bar{y} = \frac{1}{n} \sum_{i=0}^{n - 1} y_i. +$$ + +

    You can use the functionality included in scikit-learn. If you feel for it, you can use your own program and define functions which compute the above two functions. +Discuss the meaning of these results. Try also to vary the coefficient in front of the added stochastic noise term and discuss the quality of the fits. +

    + + + +

    +

    +

    + +

    +Solution. +

    +     +
    +

    + +

    The code here is an example of where we define our own design matrix and fit parameters \( \beta \).

    @@ -377,25 +512,6 @@ but now splitting the data into a training set and a test set. import pandas as pd import matplotlib.pyplot as plt from sklearn.model_selection import train_test_split -# Where to save the figures and data files -PROJECT_ROOT_DIR = "Results" -FIGURE_ID = "Results/FigureFiles" -DATA_ID = "DataFiles/" - -if not os.path.exists(PROJECT_ROOT_DIR): - os.mkdir(PROJECT_ROOT_DIR) - -if not os.path.exists(FIGURE_ID): - os.makedirs(FIGURE_ID) - -if not os.path.exists(DATA_ID): - os.makedirs(DATA_ID) - -def image_path(fig_id): - return os.path.join(FIGURE_ID, fig_id) - -def data_path(dat_id): - return os.path.join(DATA_ID, dat_id) def save_fig(fig_id): plt.savefig(image_path(fig_id) + ".png", format='png') @@ -406,25 +522,20 @@ DATA_ID = " n = np.size(y_model) return np.sum((y_data-y_model)**2)/n -infile = open(data_path("EoS.csv"),'r') +x = np.random.rand(100) +y = 2.0+5*x*x+0.1*np.random.randn(100) -# Read the EoS data as csv file and organized into two arrays with density and energies -EoS = pd.read_csv(infile, names=('Density', 'Energy')) -EoS['Energy'] = pd.to_numeric(EoS['Energy'], errors='coerce') -EoS = EoS.dropna() -Energies = EoS['Energy'] -Density = EoS['Density'] -# The design matrix now as function of various polytrops -X = np.zeros((len(Density),5)) -X[:,0] = 1 -X[:,1] = Density**(2.0/3.0) -X[:,2] = Density -X[:,3] = Density**(4.0/3.0) -X[:,4] = Density**(5.0/3.0) + +# The design matrix now as function of a given polynomial +X = np.zeros((len(x),3)) +X[:,0] = 1.0 +X[:,1] = x +X[:,2] = x**2 # We split the data in test and training data -X_train, X_test, y_train, y_test = train_test_split(X, Energies, test_size=0.2) +X_train, X_test, y_train, y_test = train_test_split(X, y, test_size=0.2) # matrix inversion to find beta -beta = np.linalg.inv(X_train.T.dot(X_train)).dot(X_train.T).dot(y_train) +beta = np.linalg.inv(X_train.T @ X_train) @ X_train.T @ y_train +print(beta) # and then make the prediction ytilde = X_train @ beta print("Training R2") @@ -452,6 +563,172 @@ ypredict = X_test Exercise 3: Normalizing our data + +

    A much used approach before starting to train the data is to preprocess our +data. Normally the data may need a rescaling and/or may be sensitive +to extreme values. Scaling the data renders our inputs much more +suitable for the algorithms we want to employ. +

    + +

    Scikit-Learn has several functions which allow us to rescale the +data, normally resulting in much better results in terms of various +accuracy scores. The StandardScaler function in Scikit-Learn +ensures that for each feature/predictor we study the mean value is +zero and the variance is one (every column in the design/feature +matrix). This scaling has the drawback that it does not ensure that +we have a particular maximum or minimum in our data set. Another +function included in Scikit-Learn is the MinMaxScaler which +ensures that all features are exactly between \( 0 \) and \( 1 \). The +

    + +

    The Normalizer scales each data +point such that the feature vector has a euclidean length of one. In other words, it +projects a data point on the circle (or sphere in the case of higher dimensions) with a +radius of 1. This means every data point is scaled by a different number (by the +inverse of it’s length). +This normalization is often used when only the direction (or angle) of the data matters, +not the length of the feature vector. +

    + +

    The RobustScaler works similarly to the StandardScaler in that it +ensures statistical properties for each feature that guarantee that +they are on the same scale. However, the RobustScaler uses the median +and quartiles, instead of mean and variance. This makes the +RobustScaler ignore data points that are very different from the rest +(like measurement errors). These odd data points are also called +outliers, and might often lead to trouble for other scaling +techniques. +

    + +

    It also common to split the data in a training set and a testing set. A typical split is to use \( 80\% \) of the data for training and the rest +for testing. This can be done as follows with our design matrix \( \boldsymbol{X} \) and data \( \boldsymbol{y} \) (remember to import scikit-learn) +

    + + +
    +
    +
    +
    +
    + 
    # split in training and test data
+X_train, X_test, y_train, y_test = train_test_split(X,y,test_size=0.2)
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    Then we can use the standard scaler to scale our data as

    + + +
    +
    +
    +
    +
    + 
    scaler = StandardScaler()
+scaler.fit(X_train)
+X_train_scaled = scaler.transform(X_train)
+X_test_scaled = scaler.transform(X_test)
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    In this exercise we want you to to compute the MSE for the training +data and the test data as function of the complexity of a polynomial, +that is the degree of a given polynomial. We want you also to compute the \( R2 \) score as function of the complexity of the model for both training data and test data. You should also run the calculation with and without scaling. +

    + +

    One of +the aims is to reproduce Figure 2.11 of Hastie et al. +

    + +

    Our data is defined by \( x\in [-3,3] \) with a total of for example \( 100 \) data points.

    + + +
    +
    +
    +
    +
    + 
    np.random.seed()
+n = 100
+maxdegree = 14
+# Make data set.
+x = np.linspace(-3, 3, n).reshape(-1, 1)
+y = np.exp(-x**2) + 1.5 * np.exp(-(x-2)**2)+ np.random.normal(0, 0.1, x.shape)
+
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +

    where \( y \) is the function we want to fit with a given polynomial.

    + + +

    +a) +Write a first code which sets up a design matrix \( X \) defined by a fifth-order polynomial. Scale your data and split it in training and test data. +

    + + + + +

    +b) +Perform an ordinary least squares and compute the means squared error and the \( R2 \) factor for the training data and the test data, with and without scaling. +

    + + + + +

    +c) +Add now a model which allows you to make polynomials up to degree \( 15 \). Perform a standard OLS fitting of the training data and compute the MSE and \( R2 \) for the training and test data and plot both test and training data MSE and \( R2 \) as functions of the polynomial degree. Compare what you see with Figure 2.11 of Hastie et al. Comment your results. For which polynomial degree do you find an optimal MSE (smallest value)? +

    + + + +

      @@ -467,8 +744,6 @@ ypredict = X_test 63
    • 64
    • 65
      • -
    • 66
      • -
    • »
    diff --git a/doc/pub/week34/html/week34-bs.html b/doc/pub/week34/html/week34-bs.html index be8d2e03a..5535c47e1 100644 --- a/doc/pub/week34/html/week34-bs.html +++ b/doc/pub/week34/html/week34-bs.html @@ -38,7 +38,6 @@ doconce format html week34.do.txt --html_style=bootstrap --pygments_html_style=d {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -269,77 +268,76 @@ MathJax.Hub.Config({ @@ -369,7 +367,7 @@ MathJax.Hub.Config({
    -

    Week 34, August 22-26, 2022

    +

    Week 34, August 21-25, 2021


    @@ -394,7 +392,7 @@ MathJax.Hub.Config({
  • 9
  • 10
  • ...
    • -
  • 66
    • +
  • 65
  • »
    • @@ -408,7 +406,7 @@ MathJax.Hub.Config({ -->
    - © 1999-2022, Morten Hjorth-Jensen. Released under CC Attribution-NonCommercial 4.0 license + © 1999-2023, Morten Hjorth-Jensen. Released under CC Attribution-NonCommercial 4.0 license
    diff --git a/doc/pub/week34/html/week34-reveal.html b/doc/pub/week34/html/week34-reveal.html index 1750c9cce..204c43815 100644 --- a/doc/pub/week34/html/week34-reveal.html +++ b/doc/pub/week34/html/week34-reveal.html @@ -184,43 +184,38 @@ MathJax.Hub.Config({
    -

    Week 34, August 22-26, 2022

    +

    Week 34, August 21-25, 2021


    - © 1999-2022, Morten Hjorth-Jensen. Released under CC Attribution-NonCommercial 4.0 license + © 1999-2023, Morten Hjorth-Jensen. Released under CC Attribution-NonCommercial 4.0 license

    Overview of first week

    +

    The sessions on Tuesdays and Wednesdays last four hours and will include partly lectures in a flipped mode (promoting active learning) and work on exercices and projects. +The sessions will begin with lectures and questions and answers about the material to be covered every week. There are four groups, Tuesdays 815am-12pm and 1215pm-4pm and +Wednesdays 815am-12pm and 1215pm-4pm. Please sign up as soon as possible for one of the groups. Max capacity per group is 30-40 persons. +

    + +

    On Thursdays we have a regular lecture. These lectures start at 1215pm and end at 2pm. +The first week we wtart with simple linear regression, a repetition of linear algebra and elements of statistics needed for the course. +

    +

      -

    • Wednesday August 24: Introduction to software and repetition of Python Programming
      • +

    • August 22: Presentation of the course, aims and content. Introduction to software and repetition of Python Programming, linear algebra and basic elements of statistics. Please select group.
      • -

    • Thursday August 25: Computer lab in the morning, First lecture 1215pm-2pm: Presentation of the course, aims and content
      • +

    • August 23: Presentation of the course, aims and content. Introduction to software and repetition of Python Programming, linear algebra and basic elements of statistics. Please select group.
      • -

    • Thursday: Second Lecture: Start with simple linear regression and repetition of linear algebra and elements of statistics
      • - -

      - -

    • Friday August 26: Linear regression
      • - -

      - -

    • Computer lab: Wednesdays, 8am-6pm and Thursdays 8am-12pm and additional self study 4pm-6pm. First time: Wednesday August 24.
      • +

    • August 24: Lecture: Linear regression, examples and theory
    @@ -243,14 +238,6 @@ MathJax.Hub.Config({
    -
    -

    Thursday August 25

    - -

    The lectures will be recorded and updated videos will be posted after the lectures.

    - -

    Zoom link for lectures: https://msu.zoom.us/j/91706435521?pwd=Zll6dU1lRVpEbmlMWU9za1dyT0gvQT09

    -
    -

    Lectures and ComputerLab

    @@ -259,7 +246,9 @@ MathJax.Hub.Config({

      -

    • Lectures: Thursday (12.15pm-2pm and Friday (12.15pm-2pm).
      • +

    • The sessions on Tuesdays and Wednesdays last four hours and will include partly lectures in a flipped mode (promoting active learning) and work on exercices and projects.
      • + +

    • Thursdays: regular lectures (12.15pm-2pm)

    • Weekly reading assignments and videos needed to solve projects and exercises.
      • @@ -278,7 +267,7 @@ MathJax.Hub.Config({

      Communication channels

        -

      • Chat and communications via canvas.uio.no, GDPR safe
        • +

      • Chat and communications via canvas.uio.no

      • Slack channel: machinelearninguio.slack.com
    @@ -330,13 +319,7 @@ MathJax.Hub.Config({

  • Office hours: Anytime! Individual or group office hours can be arranged either in person or via zoom. Feel free to send an email for planning.

    • -

  • Øyvind Sigmundson Schøyen, oyvinssc@student.matnat.uio.no
    • -

  • Stian Dysthe Bilek stian.bilek@fys.uio.no

  • Ida Torkjellsdatter Storehaug, i.t.storehaug@fys.uio.no
    • -

  • Sigurd Sørlie Rustad, s.s.rustad@fys.uio.no
    • -

  • Behnoosh Ashrafi, behnoosh.ashrafi@fys.uio.no
    • -

  • Frida Marie Engøy Westbye, f.m.e.westby@fys.uio.no
    • -

  • Joao Guilherme Carvalho Inacio, joaogca@fys.uio.no
    • diff --git a/doc/pub/week34/html/week34-solarized.html b/doc/pub/week34/html/week34-solarized.html index 034530bcf..cdbbb4816 100644 --- a/doc/pub/week34/html/week34-solarized.html +++ b/doc/pub/week34/html/week34-solarized.html @@ -65,7 +65,6 @@ div.toc p,a { {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -297,28 +296,29 @@ MathJax.Hub.Config({
    -

    Week 34, August 22-26, 2022

    +

    Week 34, August 21-25, 2021












    Overview of first week

    +

    The sessions on Tuesdays and Wednesdays last four hours and will include partly lectures in a flipped mode (promoting active learning) and work on exercices and projects. +The sessions will begin with lectures and questions and answers about the material to be covered every week. There are four groups, Tuesdays 815am-12pm and 1215pm-4pm and +Wednesdays 815am-12pm and 1215pm-4pm. Please sign up as soon as possible for one of the groups. Max capacity per group is 30-40 persons. +

    + +

    On Thursdays we have a regular lecture. These lectures start at 1215pm and end at 2pm. +The first week we wtart with simple linear regression, a repetition of linear algebra and elements of statistics needed for the course. +

    +

      -
    • Wednesday August 24: Introduction to software and repetition of Python Programming
      • -
    • Thursday August 25: Computer lab in the morning, First lecture 1215pm-2pm: Presentation of the course, aims and content
      • -
    • Thursday: Second Lecture: Start with simple linear regression and repetition of linear algebra and elements of statistics
      • - -
    • Friday August 26: Linear regression
      • - -
    • Computer lab: Wednesdays, 8am-6pm and Thursdays 8am-12pm and additional self study 4pm-6pm. First time: Wednesday August 24.
      • +
    • August 22: Presentation of the course, aims and content. Introduction to software and repetition of Python Programming, linear algebra and basic elements of statistics. Please select group.
      • +
    • August 23: Presentation of the course, aims and content. Introduction to software and repetition of Python Programming, linear algebra and basic elements of statistics. Please select group.
      • +
    • August 24: Lecture: Linear regression, examples and theory
    @@ -340,13 +340,6 @@ MathJax.Hub.Config({
    -









    -

    Thursday August 25

    - -

    The lectures will be recorded and updated videos will be posted after the lectures.

    - -

    Zoom link for lectures: https://msu.zoom.us/j/91706435521?pwd=Zll6dU1lRVpEbmlMWU9za1dyT0gvQT09

    -









    Lectures and ComputerLab

    @@ -354,7 +347,8 @@ MathJax.Hub.Config({

      -
    • Lectures: Thursday (12.15pm-2pm and Friday (12.15pm-2pm).
      • +
    • The sessions on Tuesdays and Wednesdays last four hours and will include partly lectures in a flipped mode (promoting active learning) and work on exercices and projects.
      • +
    • Thursdays: regular lectures (12.15pm-2pm)
    • Weekly reading assignments and videos needed to solve projects and exercises.
    • Weekly exercises when not working on projects. You can hand in exercises if you want.
    • Detailed lecture notes, exercises, all programs presented, projects etc can be found at the homepage of the course.
      • @@ -368,7 +362,7 @@ MathJax.Hub.Config({

      Communication channels

        -
      • Chat and communications via canvas.uio.no, GDPR safe
        • +
      • Chat and communications via canvas.uio.no
      • Slack channel: machinelearninguio.slack.com










      @@ -406,13 +400,7 @@ MathJax.Hub.Config({
    • Office: Department of Physics, University of Oslo, Eastern wing, room FØ470
    • Office hours: Anytime! Individual or group office hours can be arranged either in person or via zoom. Feel free to send an email for planning.
    -
  • Øyvind Sigmundson Schøyen, oyvinssc@student.matnat.uio.no
    • -
  • Stian Dysthe Bilek stian.bilek@fys.uio.no
  • Ida Torkjellsdatter Storehaug, i.t.storehaug@fys.uio.no
    • -
  • Sigurd Sørlie Rustad, s.s.rustad@fys.uio.no
    • -
  • Behnoosh Ashrafi, behnoosh.ashrafi@fys.uio.no
    • -
  • Frida Marie Engøy Westbye, f.m.e.westby@fys.uio.no
    • -
  • Joao Guilherme Carvalho Inacio, joaogca@fys.uio.no
    • @@ -4256,7 +4244,7 @@ Add now a model which allows you to make polynomials up to degree \( 15 \). Per
    - © 1999-2022, Morten Hjorth-Jensen. Released under CC Attribution-NonCommercial 4.0 license + © 1999-2023, Morten Hjorth-Jensen. Released under CC Attribution-NonCommercial 4.0 license
    diff --git a/doc/pub/week34/html/week34.html b/doc/pub/week34/html/week34.html index ae043429c..27f69939a 100644 --- a/doc/pub/week34/html/week34.html +++ b/doc/pub/week34/html/week34.html @@ -142,7 +142,6 @@ div.toc p,a { {'highest level': 2, 'sections': [('Overview of first week', 2, None, 'overview-of-first-week'), ('Reading Recommendations', 2, None, 'reading-recommendations'), - ('Thursday August 25', 2, None, 'thursday-august-25'), ('Lectures and ComputerLab', 2, None, 'lectures-and-computerlab'), ('Communication channels', 2, None, 'communication-channels'), ('Course Format', 2, None, 'course-format'), @@ -374,28 +373,29 @@ MathJax.Hub.Config({
    -

    Week 34, August 22-26, 2022

    +

    Week 34, August 21-25, 2021












    Overview of first week

    +

    The sessions on Tuesdays and Wednesdays last four hours and will include partly lectures in a flipped mode (promoting active learning) and work on exercices and projects. +The sessions will begin with lectures and questions and answers about the material to be covered every week. There are four groups, Tuesdays 815am-12pm and 1215pm-4pm and +Wednesdays 815am-12pm and 1215pm-4pm. Please sign up as soon as possible for one of the groups. Max capacity per group is 30-40 persons. +

    + +

    On Thursdays we have a regular lecture. These lectures start at 1215pm and end at 2pm. +The first week we wtart with simple linear regression, a repetition of linear algebra and elements of statistics needed for the course. +

    +

      -
    • Wednesday August 24: Introduction to software and repetition of Python Programming
      • -
    • Thursday August 25: Computer lab in the morning, First lecture 1215pm-2pm: Presentation of the course, aims and content
      • -
    • Thursday: Second Lecture: Start with simple linear regression and repetition of linear algebra and elements of statistics
      • - -
    • Friday August 26: Linear regression
      • - -
    • Computer lab: Wednesdays, 8am-6pm and Thursdays 8am-12pm and additional self study 4pm-6pm. First time: Wednesday August 24.
      • +
    • August 22: Presentation of the course, aims and content. Introduction to software and repetition of Python Programming, linear algebra and basic elements of statistics. Please select group.
      • +
    • August 23: Presentation of the course, aims and content. Introduction to software and repetition of Python Programming, linear algebra and basic elements of statistics. Please select group.
      • +
    • August 24: Lecture: Linear regression, examples and theory
    @@ -417,13 +417,6 @@ MathJax.Hub.Config({
    -









    -

    Thursday August 25

    - -

    The lectures will be recorded and updated videos will be posted after the lectures.

    - -

    Zoom link for lectures: https://msu.zoom.us/j/91706435521?pwd=Zll6dU1lRVpEbmlMWU9za1dyT0gvQT09

    -









    Lectures and ComputerLab

    @@ -431,7 +424,8 @@ MathJax.Hub.Config({

      -
    • Lectures: Thursday (12.15pm-2pm and Friday (12.15pm-2pm).
      • +
    • The sessions on Tuesdays and Wednesdays last four hours and will include partly lectures in a flipped mode (promoting active learning) and work on exercices and projects.
      • +
    • Thursdays: regular lectures (12.15pm-2pm)
    • Weekly reading assignments and videos needed to solve projects and exercises.
    • Weekly exercises when not working on projects. You can hand in exercises if you want.
    • Detailed lecture notes, exercises, all programs presented, projects etc can be found at the homepage of the course.
      • @@ -445,7 +439,7 @@ MathJax.Hub.Config({

      Communication channels

        -
      • Chat and communications via canvas.uio.no, GDPR safe
        • +
      • Chat and communications via canvas.uio.no
      • Slack channel: machinelearninguio.slack.com










      @@ -483,13 +477,7 @@ MathJax.Hub.Config({
    • Office: Department of Physics, University of Oslo, Eastern wing, room FØ470
    • Office hours: Anytime! Individual or group office hours can be arranged either in person or via zoom. Feel free to send an email for planning.
    -
  • Øyvind Sigmundson Schøyen, oyvinssc@student.matnat.uio.no
    • -
  • Stian Dysthe Bilek stian.bilek@fys.uio.no
  • Ida Torkjellsdatter Storehaug, i.t.storehaug@fys.uio.no
    • -
  • Sigurd Sørlie Rustad, s.s.rustad@fys.uio.no
    • -
  • Behnoosh Ashrafi, behnoosh.ashrafi@fys.uio.no
    • -
  • Frida Marie Engøy Westbye, f.m.e.westby@fys.uio.no
    • -
  • Joao Guilherme Carvalho Inacio, joaogca@fys.uio.no
    • @@ -4333,7 +4321,7 @@ Add now a model which allows you to make polynomials up to degree \( 15 \). Per
    - © 1999-2022, Morten Hjorth-Jensen. Released under CC Attribution-NonCommercial 4.0 license + © 1999-2023, Morten Hjorth-Jensen. Released under CC Attribution-NonCommercial 4.0 license
    diff --git a/doc/pub/week34/ipynb/ipynb-week34-src.tar.gz b/doc/pub/week34/ipynb/ipynb-week34-src.tar.gz index 694bc6ed6575860b7c7ef7886e594457d2f12df2..f97b39f6a978e7e21a9ce07e700887f956d595ee 100644 GIT binary patch delta 22 ecmcb!g6+-" - ] - }, - { - "cell_type": "markdown", - "id": "1983550b", + "id": "5b033472", "metadata": { "editable": true }, "source": [ "## Lectures and ComputerLab\n", "\n", - " * Lectures: Thursday (12.15pm-2pm and Friday (12.15pm-2pm). \n", + " * The sessions on Tuesdays and Wednesdays last four hours and will include partly lectures in a flipped mode (promoting active learning) and work on exercices and projects.\n", + "\n", + " * Thursdays: regular lectures (12.15pm-2pm) \n", "\n", " * Weekly reading assignments and videos needed to solve projects and exercises.\n", "\n", @@ -108,21 +95,21 @@ }, { "cell_type": "markdown", - "id": "62accf39", + "id": "02792bce", "metadata": { "editable": true }, "source": [ "## Communication channels\n", "\n", - "* Chat and communications via , GDPR safe\n", + "* Chat and communications via \n", "\n", "* **Slack** channel: machinelearninguio.slack.com" ] }, { "cell_type": "markdown", - "id": "9e02f6c0", + "id": "123e4cb2", "metadata": { "editable": true }, @@ -146,7 +133,7 @@ }, { "cell_type": "markdown", - "id": "6ba01c09", + "id": "a815a674", "metadata": { "editable": true }, @@ -162,24 +149,12 @@ "\n", " * **Office hours**: *Anytime*! Individual or group office hours can be arranged either in person or via zoom. Feel free to send an email for planning. \n", "\n", - "* Øyvind Sigmundson Schøyen, oyvinssc@student.matnat.uio.no\n", - "\n", - "* Stian Dysthe Bilek stian.bilek@fys.uio.no\n", - "\n", - "* Ida Torkjellsdatter Storehaug, i.t.storehaug@fys.uio.no\n", - "\n", - "* Sigurd Sørlie Rustad, s.s.rustad@fys.uio.no\n", - "\n", - "* Behnoosh Ashrafi, behnoosh.ashrafi@fys.uio.no\n", - "\n", - "* Frida Marie Engøy Westbye, f.m.e.westby@fys.uio.no\n", - "\n", - "* Joao Guilherme Carvalho Inacio, joaogca@fys.uio.no" + "* Ida Torkjellsdatter Storehaug, i.t.storehaug@fys.uio.no" ] }, { "cell_type": "markdown", - "id": "7a82caa0", + "id": "9a531853", "metadata": { "editable": true }, @@ -197,7 +172,7 @@ }, { "cell_type": "markdown", - "id": "374d3c7f", + "id": "4e195b38", "metadata": { "editable": true }, @@ -221,7 +196,7 @@ }, { "cell_type": "markdown", - "id": "506701fc", + "id": "22738da1", "metadata": { "editable": true }, @@ -241,7 +216,7 @@ }, { "cell_type": "markdown", - "id": "147bcf0c", + "id": "0c3d738c", "metadata": { "editable": true }, @@ -285,7 +260,7 @@ }, { "cell_type": "markdown", - "id": "44fc4e15", + "id": "dbaf4234", "metadata": { "editable": true }, @@ -320,7 +295,7 @@ }, { "cell_type": "markdown", - "id": "eba2adf1", + "id": "7384883a", "metadata": { "editable": true }, @@ -347,7 +322,7 @@ }, { "cell_type": "markdown", - "id": "b4690e55", + "id": "c75a1d5b", "metadata": { "editable": true }, @@ -363,7 +338,7 @@ }, { "cell_type": "markdown", - "id": "ce9f12f4", + "id": "a6d47775", "metadata": { "editable": true }, @@ -397,7 +372,7 @@ }, { "cell_type": "markdown", - "id": "a600ec2f", + "id": "897e445c", "metadata": { "editable": true }, @@ -440,7 +415,7 @@ }, { "cell_type": "markdown", - "id": "0baf1ddb", + "id": "d2689464", "metadata": { "editable": true }, @@ -513,7 +488,7 @@ }, { "cell_type": "markdown", - "id": "7dc8288b", + "id": "75f2d7ca", "metadata": { "editable": true }, @@ -542,7 +517,7 @@ }, { "cell_type": "markdown", - "id": "812298ca", + "id": "c97b7db8", "metadata": { "editable": true }, @@ -560,7 +535,7 @@ }, { "cell_type": "markdown", - "id": "28829233", + "id": "775723d5", "metadata": { "editable": true }, @@ -572,7 +547,7 @@ }, { "cell_type": "markdown", - "id": "68fc797e", + "id": "9707050f", "metadata": { "editable": true }, @@ -607,7 +582,7 @@ }, { "cell_type": "markdown", - "id": "a10ba7ce", + "id": "dee9990f", "metadata": { "editable": true }, @@ -637,7 +612,7 @@ }, { "cell_type": "markdown", - "id": "f82b64a1", + "id": "9aa788df", "metadata": { "editable": true }, @@ -668,7 +643,7 @@ }, { "cell_type": "markdown", - "id": "ba86b8a5", + "id": "1c750909", "metadata": { "editable": true }, @@ -707,7 +682,7 @@ }, { "cell_type": "markdown", - "id": "0b806868", + "id": "6c127b62", "metadata": { "editable": true }, @@ -740,7 +715,7 @@ }, { "cell_type": "markdown", - "id": "15fa5438", + "id": "40bf662f", "metadata": { "editable": true }, @@ -775,7 +750,7 @@ }, { "cell_type": "markdown", - "id": "dcaf920d", + "id": "21683bbf", "metadata": { "editable": true }, @@ -799,7 +774,7 @@ }, { "cell_type": "markdown", - "id": "7048c23a", + "id": "48c2b586", "metadata": { "editable": true }, @@ -826,7 +801,7 @@ }, { "cell_type": "markdown", - "id": "ce91a12a", + "id": "ba434e7c", "metadata": { "editable": true }, @@ -836,7 +811,7 @@ }, { "cell_type": "markdown", - "id": "c66e74b5", + "id": "9bd080e3", "metadata": { "editable": true }, @@ -850,7 +825,7 @@ }, { "cell_type": "markdown", - "id": "a417fbb8", + "id": "6518ee4d", "metadata": { "editable": true }, @@ -871,7 +846,7 @@ }, { "cell_type": "markdown", - "id": "08f8532b", + "id": "8ffd703e", "metadata": { "editable": true }, @@ -883,7 +858,7 @@ }, { "cell_type": "markdown", - "id": "9910bcf2", + "id": "ff96b37b", "metadata": { "editable": true }, @@ -906,7 +881,7 @@ }, { "cell_type": "markdown", - "id": "8f7cf8b9", + "id": "371a4508", "metadata": { "editable": true }, @@ -916,7 +891,7 @@ }, { "cell_type": "markdown", - "id": "c738c262", + "id": "b4e26aa9", "metadata": { "editable": true }, @@ -928,7 +903,7 @@ }, { "cell_type": "markdown", - "id": "04ec5cd8", + "id": "a94594a5", "metadata": { "editable": true }, @@ -949,7 +924,7 @@ }, { "cell_type": "markdown", - "id": "3a760182", + "id": "5222bd5a", "metadata": { "editable": true }, @@ -977,7 +952,7 @@ }, { "cell_type": "markdown", - "id": "689e0dbb", + "id": "1b0d7493", "metadata": { "editable": true }, @@ -1003,7 +978,7 @@ }, { "cell_type": "markdown", - "id": "b84305a6", + "id": "94ed4c6a", "metadata": { "editable": true }, @@ -1015,7 +990,7 @@ { "cell_type": "code", "execution_count": 1, - "id": "db4d4e24", + "id": "b1459fc4", "metadata": { "collapsed": false, "editable": true @@ -1027,7 +1002,7 @@ }, { "cell_type": "markdown", - "id": "c4611c91", + "id": "04705cca", "metadata": { "editable": true }, @@ -1038,7 +1013,7 @@ { "cell_type": "code", "execution_count": 2, - "id": "55e4c4d1", + "id": "2a1f8b90", "metadata": { "collapsed": false, "editable": true @@ -1052,7 +1027,7 @@ }, { "cell_type": "markdown", - "id": "3ca4c232", + "id": "b9be8d3a", "metadata": { "editable": true }, @@ -1064,7 +1039,7 @@ { "cell_type": "code", "execution_count": 3, - "id": "8a5f859e", + "id": "7dd99a57", "metadata": { "collapsed": false, "editable": true @@ -1078,7 +1053,7 @@ }, { "cell_type": "markdown", - "id": "c27c845f", + "id": "a569f5be", "metadata": { "editable": true }, @@ -1090,7 +1065,7 @@ { "cell_type": "code", "execution_count": 4, - "id": "722079c8", + "id": "6864f83f", "metadata": { "collapsed": false, "editable": true @@ -1104,7 +1079,7 @@ }, { "cell_type": "markdown", - "id": "796e5e66", + "id": "ab1171d1", "metadata": { "editable": true }, @@ -1121,7 +1096,7 @@ { "cell_type": "code", "execution_count": 5, - "id": "bc5c9093", + "id": "9bc655ea", "metadata": { "collapsed": false, "editable": true @@ -1138,7 +1113,7 @@ }, { "cell_type": "markdown", - "id": "de1a7351", + "id": "6efdbe8e", "metadata": { "editable": true }, @@ -1150,7 +1125,7 @@ { "cell_type": "code", "execution_count": 6, - "id": "4383fc1c", + "id": "f44de584", "metadata": { "collapsed": false, "editable": true @@ -1164,7 +1139,7 @@ }, { "cell_type": "markdown", - "id": "7c398d65", + "id": "45c78014", "metadata": { "editable": true }, @@ -1175,7 +1150,7 @@ { "cell_type": "code", "execution_count": 7, - "id": "b202b0ce", + "id": "126d19b8", "metadata": { "collapsed": false, "editable": true @@ -1189,7 +1164,7 @@ }, { "cell_type": "markdown", - "id": "0274dfee", + "id": "bd7e9040", "metadata": { "editable": true }, @@ -1200,7 +1175,7 @@ { "cell_type": "code", "execution_count": 8, - "id": "7a5fd026", + "id": "5feccba1", "metadata": { "collapsed": false, "editable": true @@ -1214,7 +1189,7 @@ }, { "cell_type": "markdown", - "id": "729865a6", + "id": "26165fb9", "metadata": { "editable": true }, @@ -1229,7 +1204,7 @@ { "cell_type": "code", "execution_count": 9, - "id": "4f4b745c", + "id": "8e594928", "metadata": { "collapsed": false, "editable": true @@ -1243,7 +1218,7 @@ }, { "cell_type": "markdown", - "id": "26815822", + "id": "79f971ac", "metadata": { "editable": true }, @@ -1254,7 +1229,7 @@ { "cell_type": "code", "execution_count": 10, - "id": "579e0d21", + "id": "b8a4cedd", "metadata": { "collapsed": false, "editable": true @@ -1269,7 +1244,7 @@ }, { "cell_type": "markdown", - "id": "d0dc6938", + "id": "65345a9a", "metadata": { "editable": true }, @@ -1280,7 +1255,7 @@ { "cell_type": "code", "execution_count": 11, - "id": "44015203", + "id": "5a9c43ea", "metadata": { "collapsed": false, "editable": true @@ -1295,7 +1270,7 @@ }, { "cell_type": "markdown", - "id": "bfb3fa9a", + "id": "54e140cf", "metadata": { "editable": true }, @@ -1306,7 +1281,7 @@ { "cell_type": "code", "execution_count": 12, - "id": "fb3b9f2b", + "id": "929cdd8e", "metadata": { "collapsed": false, "editable": true @@ -1322,7 +1297,7 @@ }, { "cell_type": "markdown", - "id": "c8bc956f", + "id": "bbd189c9", "metadata": { "editable": true }, @@ -1333,7 +1308,7 @@ { "cell_type": "code", "execution_count": 13, - "id": "6e027eca", + "id": "7d3a1475", "metadata": { "collapsed": false, "editable": true @@ -1349,7 +1324,7 @@ }, { "cell_type": "markdown", - "id": "1de6e120", + "id": "87ba8a4a", "metadata": { "editable": true }, @@ -1360,7 +1335,7 @@ { "cell_type": "code", "execution_count": 14, - "id": "d4ce3e79", + "id": "734aee9d", "metadata": { "collapsed": false, "editable": true @@ -1376,7 +1351,7 @@ }, { "cell_type": "markdown", - "id": "b1d12829", + "id": "1417354f", "metadata": { "editable": true }, @@ -1388,7 +1363,7 @@ }, { "cell_type": "markdown", - "id": "a0a91ed4", + "id": "82ec7f3f", "metadata": { "editable": true }, @@ -1403,7 +1378,7 @@ }, { "cell_type": "markdown", - "id": "2bfff358", + "id": "75c34e45", "metadata": { "editable": true }, @@ -1413,7 +1388,7 @@ }, { "cell_type": "markdown", - "id": "0e88a0f5", + "id": "65b384a8", "metadata": { "editable": true }, @@ -1425,7 +1400,7 @@ }, { "cell_type": "markdown", - "id": "d93bbf1e", + "id": "702133b2", "metadata": { "editable": true }, @@ -1436,7 +1411,7 @@ }, { "cell_type": "markdown", - "id": "881fd5ff", + "id": "77e24131", "metadata": { "editable": true }, @@ -1451,7 +1426,7 @@ }, { "cell_type": "markdown", - "id": "f4b1c419", + "id": "8a5ce834", "metadata": { "editable": true }, @@ -1466,7 +1441,7 @@ { "cell_type": "code", "execution_count": 15, - "id": "b8c8a21d", + "id": "ce192031", "metadata": { "collapsed": false, "editable": true @@ -1493,7 +1468,7 @@ { "cell_type": "code", "execution_count": 16, - "id": "04a8d954", + "id": "7b7f083f", "metadata": { "collapsed": false, "editable": true @@ -1517,7 +1492,7 @@ }, { "cell_type": "markdown", - "id": "45aa77ad", + "id": "1711f18d", "metadata": { "editable": true }, @@ -1543,7 +1518,7 @@ { "cell_type": "code", "execution_count": 17, - "id": "1492de5a", + "id": "2dbf31a8", "metadata": { "collapsed": false, "editable": true @@ -1563,7 +1538,7 @@ }, { "cell_type": "markdown", - "id": "2cd16b38", + "id": "c6f2622c", "metadata": { "editable": true }, @@ -1577,7 +1552,7 @@ { "cell_type": "code", "execution_count": 18, - "id": "e2ef3861", + "id": "eb054750", "metadata": { "collapsed": false, "editable": true @@ -1590,7 +1565,7 @@ }, { "cell_type": "markdown", - "id": "8dee411e", + "id": "d369aa05", "metadata": { "editable": true }, @@ -1601,7 +1576,7 @@ { "cell_type": "code", "execution_count": 19, - "id": "d1b89a74", + "id": "acd40128", "metadata": { "collapsed": false, "editable": true @@ -1613,7 +1588,7 @@ }, { "cell_type": "markdown", - "id": "f378c18f", + "id": "a6ef2276", "metadata": { "editable": true }, @@ -1624,7 +1599,7 @@ { "cell_type": "code", "execution_count": 20, - "id": "6634a075", + "id": "d1de36ed", "metadata": { "collapsed": false, "editable": true @@ -1642,7 +1617,7 @@ }, { "cell_type": "markdown", - "id": "7e24729b", + "id": "096297a4", "metadata": { "editable": true }, @@ -1654,7 +1629,7 @@ { "cell_type": "code", "execution_count": 21, - "id": "56576449", + "id": "70d5e856", "metadata": { "collapsed": false, "editable": true @@ -1678,7 +1653,7 @@ }, { "cell_type": "markdown", - "id": "1eb7500f", + "id": "13a7b26c", "metadata": { "editable": true }, @@ -1689,7 +1664,7 @@ { "cell_type": "code", "execution_count": 22, - "id": "2304f0f7", + "id": "9bea2b8e", "metadata": { "collapsed": false, "editable": true @@ -1718,7 +1693,7 @@ }, { "cell_type": "markdown", - "id": "59007e7f", + "id": "b040508c", "metadata": { "editable": true }, @@ -1729,7 +1704,7 @@ { "cell_type": "code", "execution_count": 23, - "id": "9fbbdf2f", + "id": "c4e9597d", "metadata": { "collapsed": false, "editable": true @@ -1744,7 +1719,7 @@ }, { "cell_type": "markdown", - "id": "c663e755", + "id": "e939c3fb", "metadata": { "editable": true }, @@ -1761,7 +1736,7 @@ }, { "cell_type": "markdown", - "id": "51a9a99e", + "id": "c634e587", "metadata": { "editable": true }, @@ -1775,7 +1750,7 @@ }, { "cell_type": "markdown", - "id": "ce8da9ff", + "id": "53e850a7", "metadata": { "editable": true }, @@ -1806,7 +1781,7 @@ }, { "cell_type": "markdown", - "id": "cfe9b508", + "id": "5f0352b5", "metadata": { "editable": true }, @@ -1818,7 +1793,7 @@ }, { "cell_type": "markdown", - "id": "7d6e00da", + "id": "50a76246", "metadata": { "editable": true }, @@ -1846,7 +1821,7 @@ { "cell_type": "code", "execution_count": 24, - "id": "a9606bc9", + "id": "97ab9bf3", "metadata": { "collapsed": false, "editable": true @@ -1876,7 +1851,7 @@ }, { "cell_type": "markdown", - "id": "f3f88b89", + "id": "79c4ffaf", "metadata": { "editable": true }, @@ -1893,7 +1868,7 @@ }, { "cell_type": "markdown", - "id": "fc07fb55", + "id": "6fb7221b", "metadata": { "editable": true }, @@ -1905,7 +1880,7 @@ }, { "cell_type": "markdown", - "id": "2e5a0910", + "id": "67fa12a6", "metadata": { "editable": true }, @@ -1926,7 +1901,7 @@ }, { "cell_type": "markdown", - "id": "89ecf07f", + "id": "10a187e9", "metadata": { "editable": true }, @@ -1939,7 +1914,7 @@ }, { "cell_type": "markdown", - "id": "4f6ba950", + "id": "42af200e", "metadata": { "editable": true }, @@ -1970,7 +1945,7 @@ }, { "cell_type": "markdown", - "id": "9dfa5f4d", + "id": "78c0f577", "metadata": { "editable": true }, @@ -1982,7 +1957,7 @@ }, { "cell_type": "markdown", - "id": "589f2cea", + "id": "55a74e2a", "metadata": { "editable": true }, @@ -2000,7 +1975,7 @@ { "cell_type": "code", "execution_count": 25, - "id": "86df2675", + "id": "d9d200be", "metadata": { "collapsed": false, "editable": true @@ -2027,7 +2002,7 @@ }, { "cell_type": "markdown", - "id": "a9bc3dfd", + "id": "fc2b36e4", "metadata": { "editable": true }, @@ -2049,7 +2024,7 @@ { "cell_type": "code", "execution_count": 26, - "id": "ac29f7b2", + "id": "ca057525", "metadata": { "collapsed": false, "editable": true @@ -2087,7 +2062,7 @@ }, { "cell_type": "markdown", - "id": "59b2d48d", + "id": "732324a0", "metadata": { "editable": true }, @@ -2098,7 +2073,7 @@ }, { "cell_type": "markdown", - "id": "aac06295", + "id": "70895299", "metadata": { "editable": true }, @@ -2111,7 +2086,7 @@ }, { "cell_type": "markdown", - "id": "9f62fcd2", + "id": "c3bbb0d1", "metadata": { "editable": true }, @@ -2132,7 +2107,7 @@ }, { "cell_type": "markdown", - "id": "8ef19fe4", + "id": "1767c26e", "metadata": { "editable": true }, @@ -2144,7 +2119,7 @@ }, { "cell_type": "markdown", - "id": "f2318bd3", + "id": "c8ca6537", "metadata": { "editable": true }, @@ -2154,7 +2129,7 @@ }, { "cell_type": "markdown", - "id": "929098f2", + "id": "50349de0", "metadata": { "editable": true }, @@ -2166,7 +2141,7 @@ }, { "cell_type": "markdown", - "id": "a30c5651", + "id": "9318ecd0", "metadata": { "editable": true }, @@ -2178,7 +2153,7 @@ }, { "cell_type": "markdown", - "id": "66522899", + "id": "cc53d147", "metadata": { "editable": true }, @@ -2190,7 +2165,7 @@ }, { "cell_type": "markdown", - "id": "7b61dce7", + "id": "edad0a7f", "metadata": { "editable": true }, @@ -2201,7 +2176,7 @@ }, { "cell_type": "markdown", - "id": "7ef2a9b6", + "id": "50254c3e", "metadata": { "editable": true }, @@ -2213,7 +2188,7 @@ }, { "cell_type": "markdown", - "id": "e52d8ecc", + "id": "ad420692", "metadata": { "editable": true }, @@ -2235,7 +2210,7 @@ }, { "cell_type": "markdown", - "id": "79b2d5fb", + "id": "81fdcf9a", "metadata": { "editable": true }, @@ -2247,7 +2222,7 @@ }, { "cell_type": "markdown", - "id": "b1a03444", + "id": "55024c18", "metadata": { "editable": true }, @@ -2263,7 +2238,7 @@ { "cell_type": "code", "execution_count": 27, - "id": "5c148a11", + "id": "d7e5f6d9", "metadata": { "collapsed": false, "editable": true @@ -2304,7 +2279,7 @@ }, { "cell_type": "markdown", - "id": "bd8f485a", + "id": "60039a8f", "metadata": { "editable": true }, @@ -2321,7 +2296,7 @@ }, { "cell_type": "markdown", - "id": "0e1bcad9", + "id": "607bc15d", "metadata": { "editable": true }, @@ -2333,7 +2308,7 @@ }, { "cell_type": "markdown", - "id": "77c182c5", + "id": "d30bdd43", "metadata": { "editable": true }, @@ -2343,7 +2318,7 @@ }, { "cell_type": "markdown", - "id": "b3a937e5", + "id": "c513d149", "metadata": { "editable": true }, @@ -2355,7 +2330,7 @@ }, { "cell_type": "markdown", - "id": "9506240c", + "id": "a7e27228", "metadata": { "editable": true }, @@ -2365,7 +2340,7 @@ }, { "cell_type": "markdown", - "id": "710a3984", + "id": "4ba1cfee", "metadata": { "editable": true }, @@ -2377,7 +2352,7 @@ }, { "cell_type": "markdown", - "id": "3c55c29f", + "id": "2db49d17", "metadata": { "editable": true }, @@ -2387,7 +2362,7 @@ }, { "cell_type": "markdown", - "id": "246e391a", + "id": "da096e53", "metadata": { "editable": true }, @@ -2399,7 +2374,7 @@ }, { "cell_type": "markdown", - "id": "6ae81f1a", + "id": "21b79e34", "metadata": { "editable": true }, @@ -2415,7 +2390,7 @@ }, { "cell_type": "markdown", - "id": "67cf807f", + "id": "172144e2", "metadata": { "editable": true }, @@ -2427,7 +2402,7 @@ }, { "cell_type": "markdown", - "id": "d3478abe", + "id": "f76623f6", "metadata": { "editable": true }, @@ -2438,7 +2413,7 @@ }, { "cell_type": "markdown", - "id": "69c8cc81", + "id": "45014224", "metadata": { "editable": true }, @@ -2450,7 +2425,7 @@ }, { "cell_type": "markdown", - "id": "73891a3e", + "id": "b73e7d9b", "metadata": { "editable": true }, @@ -2464,7 +2439,7 @@ }, { "cell_type": "markdown", - "id": "1771ab1c", + "id": "11de4e65", "metadata": { "editable": true }, @@ -2476,7 +2451,7 @@ }, { "cell_type": "markdown", - "id": "bbfd0570", + "id": "38bd248a", "metadata": { "editable": true }, @@ -2501,7 +2476,7 @@ }, { "cell_type": "markdown", - "id": "12fb776a", + "id": "fff0cb81", "metadata": { "editable": true }, @@ -2518,7 +2493,7 @@ { "cell_type": "code", "execution_count": 28, - "id": "8fe43f88", + "id": "20f307dc", "metadata": { "collapsed": false, "editable": true @@ -2562,7 +2537,7 @@ }, { "cell_type": "markdown", - "id": "a55a4ab7", + "id": "54295455", "metadata": { "editable": true }, @@ -2573,7 +2548,7 @@ { "cell_type": "code", "execution_count": 29, - "id": "7b976c32", + "id": "91bec0b0", "metadata": { "collapsed": false, "editable": true @@ -2595,7 +2570,7 @@ }, { "cell_type": "markdown", - "id": "8c439ede", + "id": "50726791", "metadata": { "editable": true }, @@ -2612,7 +2587,7 @@ { "cell_type": "code", "execution_count": 30, - "id": "23d51f1a", + "id": "8a686e04", "metadata": { "collapsed": false, "editable": true @@ -2633,7 +2608,7 @@ }, { "cell_type": "markdown", - "id": "90eb92c8", + "id": "649a6dff", "metadata": { "editable": true }, @@ -2647,7 +2622,7 @@ { "cell_type": "code", "execution_count": 31, - "id": "15f2baf2", + "id": "040c58f8", "metadata": { "collapsed": false, "editable": true @@ -2676,7 +2651,7 @@ }, { "cell_type": "markdown", - "id": "befc27ff", + "id": "8f4c4f79", "metadata": { "editable": true }, @@ -2696,7 +2671,7 @@ { "cell_type": "code", "execution_count": 32, - "id": "86cd37f5", + "id": "d174326c", "metadata": { "collapsed": false, "editable": true @@ -2713,7 +2688,7 @@ }, { "cell_type": "markdown", - "id": "10fca599", + "id": "02fe9e7b", "metadata": { "editable": true }, @@ -2725,7 +2700,7 @@ { "cell_type": "code", "execution_count": 33, - "id": "27b9f592", + "id": "9f40b296", "metadata": { "collapsed": false, "editable": true @@ -2743,7 +2718,7 @@ }, { "cell_type": "markdown", - "id": "04913591", + "id": "df67394a", "metadata": { "editable": true }, @@ -2754,7 +2729,7 @@ { "cell_type": "code", "execution_count": 34, - "id": "219fd1e7", + "id": "483a3003", "metadata": { "collapsed": false, "editable": true @@ -2767,7 +2742,7 @@ }, { "cell_type": "markdown", - "id": "966e30a3", + "id": "84d7ccc0", "metadata": { "editable": true }, @@ -2779,7 +2754,7 @@ { "cell_type": "code", "execution_count": 35, - "id": "16bb2591", + "id": "f841774c", "metadata": { "collapsed": false, "editable": true @@ -2810,7 +2785,7 @@ }, { "cell_type": "markdown", - "id": "f83ee0c1", + "id": "7bafac14", "metadata": { "editable": true }, @@ -2823,7 +2798,7 @@ { "cell_type": "code", "execution_count": 36, - "id": "a4708c34", + "id": "bcd4940d", "metadata": { "collapsed": false, "editable": true @@ -2864,7 +2839,7 @@ }, { "cell_type": "markdown", - "id": "93b15aa2", + "id": "f7ed5889", "metadata": { "editable": true }, @@ -2878,7 +2853,7 @@ { "cell_type": "code", "execution_count": 37, - "id": "08e2719f", + "id": "c66fefc2", "metadata": { "collapsed": false, "editable": true @@ -2918,7 +2893,7 @@ }, { "cell_type": "markdown", - "id": "63542676", + "id": "803690d2", "metadata": { "editable": true }, @@ -2938,7 +2913,7 @@ }, { "cell_type": "markdown", - "id": "efc7df93", + "id": "8e3ea27b", "metadata": { "editable": true }, @@ -2970,7 +2945,7 @@ }, { "cell_type": "markdown", - "id": "755ff80a", + "id": "23a1e477", "metadata": { "editable": true }, @@ -2992,7 +2967,7 @@ }, { "cell_type": "markdown", - "id": "9ad8b592", + "id": "3084884c", "metadata": { "editable": true }, @@ -3020,7 +2995,7 @@ }, { "cell_type": "markdown", - "id": "c6d7a4fc", + "id": "358b80f7", "metadata": { "editable": true }, @@ -3035,7 +3010,7 @@ }, { "cell_type": "markdown", - "id": "33536588", + "id": "f97e8e1b", "metadata": { "editable": true }, @@ -3047,7 +3022,7 @@ }, { "cell_type": "markdown", - "id": "a937158d", + "id": "28b8bf7f", "metadata": { "editable": true }, @@ -3062,7 +3037,7 @@ }, { "cell_type": "markdown", - "id": "ccc87e8b", + "id": "f7ad0a59", "metadata": { "editable": true }, @@ -3075,7 +3050,7 @@ }, { "cell_type": "markdown", - "id": "289754a7", + "id": "f2dfd753", "metadata": { "editable": true }, @@ -3087,7 +3062,7 @@ }, { "cell_type": "markdown", - "id": "ded29b28", + "id": "13175ab8", "metadata": { "editable": true }, @@ -3097,7 +3072,7 @@ }, { "cell_type": "markdown", - "id": "2845a376", + "id": "f4720879", "metadata": { "editable": true }, @@ -3108,7 +3083,7 @@ }, { "cell_type": "markdown", - "id": "e14eeccb", + "id": "83b4c867", "metadata": { "editable": true }, @@ -3126,7 +3101,7 @@ }, { "cell_type": "markdown", - "id": "3edddc3c", + "id": "8d7e4f9b", "metadata": { "editable": true }, @@ -3137,7 +3112,7 @@ }, { "cell_type": "markdown", - "id": "63da7ce1", + "id": "51b7ef79", "metadata": { "editable": true }, @@ -3149,7 +3124,7 @@ }, { "cell_type": "markdown", - "id": "47e584dd", + "id": "a19c961c", "metadata": { "editable": true }, @@ -3159,7 +3134,7 @@ }, { "cell_type": "markdown", - "id": "0e496077", + "id": "f0049167", "metadata": { "editable": true }, @@ -3171,7 +3146,7 @@ }, { "cell_type": "markdown", - "id": "d83122dd", + "id": "3dd5fc28", "metadata": { "editable": true }, @@ -3181,7 +3156,7 @@ }, { "cell_type": "markdown", - "id": "5e1b3000", + "id": "c0d52e5c", "metadata": { "editable": true }, @@ -3193,7 +3168,7 @@ }, { "cell_type": "markdown", - "id": "2b3f7f6f", + "id": "d30297f1", "metadata": { "editable": true }, @@ -3203,7 +3178,7 @@ }, { "cell_type": "markdown", - "id": "4bce867e", + "id": "b356125f", "metadata": { "editable": true }, @@ -3222,7 +3197,7 @@ }, { "cell_type": "markdown", - "id": "f3ba8b91", + "id": "83b790f1", "metadata": { "editable": true }, @@ -3232,7 +3207,7 @@ }, { "cell_type": "markdown", - "id": "b91e644c", + "id": "123fb781", "metadata": { "editable": true }, @@ -3244,7 +3219,7 @@ }, { "cell_type": "markdown", - "id": "c5c11ca9", + "id": "eb2f6a74", "metadata": { "editable": true }, @@ -3254,7 +3229,7 @@ }, { "cell_type": "markdown", - "id": "6183e1b9", + "id": "aec9b035", "metadata": { "editable": true }, @@ -3270,7 +3245,7 @@ }, { "cell_type": "markdown", - "id": "dbf22cce", + "id": "35dd947d", "metadata": { "editable": true }, @@ -3290,7 +3265,7 @@ }, { "cell_type": "markdown", - "id": "d0511b33", + "id": "9942691b", "metadata": { "editable": true }, @@ -3300,7 +3275,7 @@ }, { "cell_type": "markdown", - "id": "1e0aa89f", + "id": "f6b1ebe5", "metadata": { "editable": true }, @@ -3311,7 +3286,7 @@ }, { "cell_type": "markdown", - "id": "dd0bb4e6", + "id": "41efb12a", "metadata": { "editable": true }, @@ -3330,7 +3305,7 @@ }, { "cell_type": "markdown", - "id": "df197ebf", + "id": "b8de279f", "metadata": { "editable": true }, @@ -3340,7 +3315,7 @@ }, { "cell_type": "markdown", - "id": "5b2fd58d", + "id": "b65f3bcc", "metadata": { "editable": true }, @@ -3352,7 +3327,7 @@ }, { "cell_type": "markdown", - "id": "6c4ab175", + "id": "1d1e67a9", "metadata": { "editable": true }, @@ -3362,7 +3337,7 @@ }, { "cell_type": "markdown", - "id": "5ece20c3", + "id": "c22c2446", "metadata": { "editable": true }, @@ -3373,7 +3348,7 @@ }, { "cell_type": "markdown", - "id": "1511e733", + "id": "d021eef7", "metadata": { "editable": true }, @@ -3393,7 +3368,7 @@ }, { "cell_type": "markdown", - "id": "26c09167", + "id": "5287fa80", "metadata": { "editable": true }, @@ -3405,7 +3380,7 @@ }, { "cell_type": "markdown", - "id": "0dfce368", + "id": "492a5e71", "metadata": { "editable": true }, @@ -3420,7 +3395,7 @@ { "cell_type": "code", "execution_count": 38, - "id": "a02af8bf", + "id": "b0fc9b6f", "metadata": { "collapsed": false, "editable": true @@ -3500,7 +3475,7 @@ }, { "cell_type": "markdown", - "id": "8c558c30", + "id": "2a9d0474", "metadata": { "editable": true }, @@ -3510,7 +3485,7 @@ }, { "cell_type": "markdown", - "id": "5f7f5cbb", + "id": "a99e38eb", "metadata": { "editable": true }, @@ -3522,7 +3497,7 @@ }, { "cell_type": "markdown", - "id": "d8a90246", + "id": "4ac7a2b1", "metadata": { "editable": true }, @@ -3532,7 +3507,7 @@ }, { "cell_type": "markdown", - "id": "2d0376b8", + "id": "e4e8d675", "metadata": { "editable": true }, @@ -3543,7 +3518,7 @@ }, { "cell_type": "markdown", - "id": "0dee1047", + "id": "f453388f", "metadata": { "editable": true }, @@ -3555,7 +3530,7 @@ }, { "cell_type": "markdown", - "id": "1b0e9477", + "id": "0ca2bd2a", "metadata": { "editable": true }, @@ -3565,7 +3540,7 @@ }, { "cell_type": "markdown", - "id": "21dd0599", + "id": "011fab43", "metadata": { "editable": true }, @@ -3577,7 +3552,7 @@ }, { "cell_type": "markdown", - "id": "9a0b3fd5", + "id": "6f1a89f1", "metadata": { "editable": true }, @@ -3587,7 +3562,7 @@ }, { "cell_type": "markdown", - "id": "f851fcf3", + "id": "cbe0488e", "metadata": { "editable": true }, @@ -3599,7 +3574,7 @@ }, { "cell_type": "markdown", - "id": "f7956814", + "id": "d69aeae7", "metadata": { "editable": true }, @@ -3612,7 +3587,7 @@ }, { "cell_type": "markdown", - "id": "5d3e391b", + "id": "eecabd22", "metadata": { "editable": true }, @@ -3624,7 +3599,7 @@ }, { "cell_type": "markdown", - "id": "aa655bc0", + "id": "0e7e41e4", "metadata": { "editable": true }, @@ -3634,7 +3609,7 @@ }, { "cell_type": "markdown", - "id": "eb69ddf7", + "id": "6046894e", "metadata": { "editable": true }, @@ -3646,7 +3621,7 @@ }, { "cell_type": "markdown", - "id": "4240c329", + "id": "1e216693", "metadata": { "editable": true }, @@ -3658,7 +3633,7 @@ }, { "cell_type": "markdown", - "id": "c8d6ed49", + "id": "b9b34e74", "metadata": { "editable": true }, @@ -3669,7 +3644,7 @@ }, { "cell_type": "markdown", - "id": "6e01fe35", + "id": "54e13e51", "metadata": { "editable": true }, @@ -3681,7 +3656,7 @@ }, { "cell_type": "markdown", - "id": "57c2c2e0", + "id": "fd0791ed", "metadata": { "editable": true }, @@ -3700,7 +3675,7 @@ }, { "cell_type": "markdown", - "id": "eb8f0b0b", + "id": "6e769774", "metadata": { "editable": true }, @@ -3713,7 +3688,7 @@ }, { "cell_type": "markdown", - "id": "59a55494", + "id": "6a1d0a9d", "metadata": { "editable": true }, @@ -3723,7 +3698,7 @@ }, { "cell_type": "markdown", - "id": "f9706db4", + "id": "05b8d1dc", "metadata": { "editable": true }, @@ -3735,7 +3710,7 @@ }, { "cell_type": "markdown", - "id": "391d3e6e", + "id": "c89d2605", "metadata": { "editable": true }, @@ -3745,7 +3720,7 @@ }, { "cell_type": "markdown", - "id": "e5907770", + "id": "3707f261", "metadata": { "editable": true }, @@ -3757,7 +3732,7 @@ }, { "cell_type": "markdown", - "id": "b2e693d3", + "id": "876b3e33", "metadata": { "editable": true }, @@ -3767,7 +3742,7 @@ }, { "cell_type": "markdown", - "id": "39855267", + "id": "45ab3abb", "metadata": { "editable": true }, @@ -3779,7 +3754,7 @@ }, { "cell_type": "markdown", - "id": "00c84068", + "id": "e0871880", "metadata": { "editable": true }, @@ -3790,7 +3765,7 @@ }, { "cell_type": "markdown", - "id": "0f73dc5e", + "id": "3f69f61f", "metadata": { "editable": true }, @@ -3802,7 +3777,7 @@ }, { "cell_type": "markdown", - "id": "73fa2c51", + "id": "c177205c", "metadata": { "editable": true }, @@ -3812,7 +3787,7 @@ }, { "cell_type": "markdown", - "id": "0bdc8421", + "id": "cda5d7f5", "metadata": { "editable": true }, @@ -3824,7 +3799,7 @@ }, { "cell_type": "markdown", - "id": "29cd76b9", + "id": "da311ad8", "metadata": { "editable": true }, @@ -3834,7 +3809,7 @@ }, { "cell_type": "markdown", - "id": "73cdef0f", + "id": "69d4e696", "metadata": { "editable": true }, @@ -3846,7 +3821,7 @@ }, { "cell_type": "markdown", - "id": "f98b7781", + "id": "171e8b95", "metadata": { "editable": true }, @@ -3867,7 +3842,7 @@ }, { "cell_type": "markdown", - "id": "29f14ea5", + "id": "ad764fd3", "metadata": { "editable": true }, @@ -3880,7 +3855,7 @@ }, { "cell_type": "markdown", - "id": "65d2f9bd", + "id": "ab3067d7", "metadata": { "editable": true }, @@ -3892,7 +3867,7 @@ }, { "cell_type": "markdown", - "id": "f42863bf", + "id": "ec8bdd6f", "metadata": { "editable": true }, @@ -3904,7 +3879,7 @@ }, { "cell_type": "markdown", - "id": "9af5c5f1", + "id": "454724fc", "metadata": { "editable": true }, @@ -3916,7 +3891,7 @@ }, { "cell_type": "markdown", - "id": "dac242db", + "id": "1c408ae8", "metadata": { "editable": true }, @@ -3928,7 +3903,7 @@ }, { "cell_type": "markdown", - "id": "0471b4e6", + "id": "de6f05cf", "metadata": { "editable": true }, @@ -3939,7 +3914,7 @@ }, { "cell_type": "markdown", - "id": "a435f9cd", + "id": "f6a688d5", "metadata": { "editable": true }, @@ -3951,7 +3926,7 @@ }, { "cell_type": "markdown", - "id": "0e19c1a6", + "id": "9092b7cc", "metadata": { "editable": true }, @@ -3961,7 +3936,7 @@ }, { "cell_type": "markdown", - "id": "449e1908", + "id": "3c50ce0c", "metadata": { "editable": true }, @@ -3973,7 +3948,7 @@ }, { "cell_type": "markdown", - "id": "d6567371", + "id": "be6ae23e", "metadata": { "editable": true }, @@ -3983,7 +3958,7 @@ }, { "cell_type": "markdown", - "id": "3346e5aa", + "id": "3df72215", "metadata": { "editable": true }, @@ -3995,7 +3970,7 @@ }, { "cell_type": "markdown", - "id": "a3457842", + "id": "3f692050", "metadata": { "editable": true }, @@ -4007,7 +3982,7 @@ }, { "cell_type": "markdown", - "id": "f30564cb", + "id": "770aa4d1", "metadata": { "editable": true }, @@ -4021,7 +3996,7 @@ { "cell_type": "code", "execution_count": 39, - "id": "0fe211b5", + "id": "8b62b97a", "metadata": { "collapsed": false, "editable": true @@ -4036,7 +4011,7 @@ }, { "cell_type": "markdown", - "id": "725ef5c1", + "id": "861391d4", "metadata": { "editable": true }, @@ -4047,7 +4022,7 @@ { "cell_type": "code", "execution_count": 40, - "id": "6b25f80d", + "id": "1f28391f", "metadata": { "collapsed": false, "editable": true @@ -4060,7 +4035,7 @@ }, { "cell_type": "markdown", - "id": "d8090615", + "id": "527f08f7", "metadata": { "editable": true }, @@ -4071,7 +4046,7 @@ { "cell_type": "code", "execution_count": 41, - "id": "8708be45", + "id": "90f31052", "metadata": { "collapsed": false, "editable": true @@ -4094,7 +4069,7 @@ }, { "cell_type": "markdown", - "id": "345efc98", + "id": "78c17aa0", "metadata": { "editable": true }, @@ -4108,7 +4083,7 @@ { "cell_type": "code", "execution_count": 42, - "id": "7d955990", + "id": "b5425735", "metadata": { "collapsed": false, "editable": true @@ -4121,7 +4096,7 @@ }, { "cell_type": "markdown", - "id": "90314cab", + "id": "ec0d4420", "metadata": { "editable": true }, @@ -4132,7 +4107,7 @@ { "cell_type": "code", "execution_count": 43, - "id": "6614ffa8", + "id": "f81ed333", "metadata": { "collapsed": false, "editable": true @@ -4144,7 +4119,7 @@ }, { "cell_type": "markdown", - "id": "13baa1f4", + "id": "97278c6c", "metadata": { "editable": true }, @@ -4155,7 +4130,7 @@ { "cell_type": "code", "execution_count": 44, - "id": "01782bdc", + "id": "9f9ec211", "metadata": { "collapsed": false, "editable": true @@ -4171,7 +4146,7 @@ }, { "cell_type": "markdown", - "id": "3914a7c7", + "id": "a4cecfe7", "metadata": { "editable": true }, @@ -4182,7 +4157,7 @@ { "cell_type": "code", "execution_count": 45, - "id": "74b88e6e", + "id": "31da48f3", "metadata": { "collapsed": false, "editable": true @@ -4196,7 +4171,7 @@ }, { "cell_type": "markdown", - "id": "f034e77f", + "id": "419dc8ba", "metadata": { "editable": true }, @@ -4218,7 +4193,7 @@ }, { "cell_type": "markdown", - "id": "866a70c9", + "id": "420c7b42", "metadata": { "editable": true }, @@ -4230,7 +4205,7 @@ }, { "cell_type": "markdown", - "id": "acbc6741", + "id": "0a06e0b9", "metadata": { "editable": true }, @@ -4240,7 +4215,7 @@ }, { "cell_type": "markdown", - "id": "b040f040", + "id": "1000de06", "metadata": { "editable": true }, @@ -4252,7 +4227,7 @@ }, { "cell_type": "markdown", - "id": "7dfd9623", + "id": "73f67d80", "metadata": { "editable": true }, @@ -4264,7 +4239,7 @@ }, { "cell_type": "markdown", - "id": "42e76094", + "id": "6448695e", "metadata": { "editable": true }, @@ -4274,7 +4249,7 @@ }, { "cell_type": "markdown", - "id": "55caf85d", + "id": "a14f40ef", "metadata": { "editable": true }, @@ -4286,7 +4261,7 @@ }, { "cell_type": "markdown", - "id": "55c69b64", + "id": "e697cd57", "metadata": { "editable": true }, @@ -4296,7 +4271,7 @@ }, { "cell_type": "markdown", - "id": "9b7e44c2", + "id": "0f396cb0", "metadata": { "editable": true }, @@ -4308,7 +4283,7 @@ }, { "cell_type": "markdown", - "id": "cce0cbe4", + "id": "3037f02c", "metadata": { "editable": true }, @@ -4318,7 +4293,7 @@ }, { "cell_type": "markdown", - "id": "727b964f", + "id": "15ffb26d", "metadata": { "editable": true }, @@ -4330,7 +4305,7 @@ }, { "cell_type": "markdown", - "id": "dc15e6bd", + "id": "3b3e73dd", "metadata": { "editable": true }, @@ -4342,7 +4317,7 @@ }, { "cell_type": "markdown", - "id": "26748724", + "id": "7fcc610b", "metadata": { "editable": true }, @@ -4352,7 +4327,7 @@ }, { "cell_type": "markdown", - "id": "c53c6b65", + "id": "09f8e25c", "metadata": { "editable": true }, @@ -4364,7 +4339,7 @@ }, { "cell_type": "markdown", - "id": "77ac7ef5", + "id": "d744e021", "metadata": { "editable": true }, @@ -4374,7 +4349,7 @@ }, { "cell_type": "markdown", - "id": "325b27ee", + "id": "a5a7a2aa", "metadata": { "editable": true }, @@ -4386,7 +4361,7 @@ }, { "cell_type": "markdown", - "id": "b1a1a304", + "id": "53359526", "metadata": { "editable": true }, @@ -4398,7 +4373,7 @@ }, { "cell_type": "markdown", - "id": "eb7d8654", + "id": "8af8a357", "metadata": { "editable": true }, @@ -4410,7 +4385,7 @@ }, { "cell_type": "markdown", - "id": "08a098f5", + "id": "e7a903ee", "metadata": { "editable": true }, @@ -4420,7 +4395,7 @@ }, { "cell_type": "markdown", - "id": "cefb6456", + "id": "d4701303", "metadata": { "editable": true }, @@ -4432,7 +4407,7 @@ }, { "cell_type": "markdown", - "id": "c59d15b2", + "id": "7fdf72d8", "metadata": { "editable": true }, @@ -4442,7 +4417,7 @@ }, { "cell_type": "markdown", - "id": "6bd24483", + "id": "b22620a6", "metadata": { "editable": true }, @@ -4454,7 +4429,7 @@ }, { "cell_type": "markdown", - "id": "2e175e13", + "id": "541e3a45", "metadata": { "editable": true }, @@ -4464,7 +4439,7 @@ }, { "cell_type": "markdown", - "id": "1cc534f7", + "id": "f79a7cbe", "metadata": { "editable": true }, @@ -4476,7 +4451,7 @@ }, { "cell_type": "markdown", - "id": "f0fe00a3", + "id": "5b0ecfb4", "metadata": { "editable": true }, @@ -4487,7 +4462,7 @@ }, { "cell_type": "markdown", - "id": "2e299368", + "id": "a3bb87d4", "metadata": { "editable": true }, @@ -4499,7 +4474,7 @@ }, { "cell_type": "markdown", - "id": "8f92c9ce", + "id": "a7147ddc", "metadata": { "editable": true }, @@ -4509,7 +4484,7 @@ }, { "cell_type": "markdown", - "id": "bb1cfee8", + "id": "2b6fc16a", "metadata": { "editable": true }, @@ -4521,7 +4496,7 @@ }, { "cell_type": "markdown", - "id": "f7e3f8be", + "id": "8bf19f5c", "metadata": { "editable": true }, @@ -4531,7 +4506,7 @@ }, { "cell_type": "markdown", - "id": "7ac4ae43", + "id": "50203e47", "metadata": { "editable": true }, @@ -4543,7 +4518,7 @@ }, { "cell_type": "markdown", - "id": "b4ad0e6f", + "id": "ab63c9d4", "metadata": { "editable": true }, @@ -4556,7 +4531,7 @@ }, { "cell_type": "markdown", - "id": "f228e97e", + "id": "be284b0d", "metadata": { "editable": true }, @@ -4568,7 +4543,7 @@ }, { "cell_type": "markdown", - "id": "181ea707", + "id": "9829a688", "metadata": { "editable": true }, @@ -4580,7 +4555,7 @@ }, { "cell_type": "markdown", - "id": "4180a675", + "id": "40bc361c", "metadata": { "editable": true }, @@ -4592,7 +4567,7 @@ }, { "cell_type": "markdown", - "id": "776f9f14", + "id": "4d180456", "metadata": { "editable": true }, @@ -4604,7 +4579,7 @@ }, { "cell_type": "markdown", - "id": "6c294743", + "id": "01b1a335", "metadata": { "editable": true }, @@ -4616,7 +4591,7 @@ }, { "cell_type": "markdown", - "id": "0f0fd575", + "id": "8e216892", "metadata": { "editable": true }, @@ -4626,7 +4601,7 @@ }, { "cell_type": "markdown", - "id": "9ffd736e", + "id": "7e30b3a5", "metadata": { "editable": true }, @@ -4638,7 +4613,7 @@ }, { "cell_type": "markdown", - "id": "6537726e", + "id": "9166f007", "metadata": { "editable": true }, @@ -4650,7 +4625,7 @@ }, { "cell_type": "markdown", - "id": "051c912a", + "id": "ce256b25", "metadata": { "editable": true }, @@ -4663,7 +4638,7 @@ }, { "cell_type": "markdown", - "id": "bd97adf9", + "id": "35398df7", "metadata": { "editable": true }, @@ -4690,7 +4665,7 @@ }, { "cell_type": "markdown", - "id": "a81774e3", + "id": "f9bb7308", "metadata": { "editable": true }, @@ -4701,7 +4676,7 @@ { "cell_type": "code", "execution_count": 46, - "id": "f2e489dd", + "id": "6318be3d", "metadata": { "collapsed": false, "editable": true @@ -4797,7 +4772,7 @@ }, { "cell_type": "markdown", - "id": "c3c6be9e", + "id": "7a115117", "metadata": { "editable": true }, @@ -4812,7 +4787,7 @@ }, { "cell_type": "markdown", - "id": "66d6c437", + "id": "8b8f2e56", "metadata": { "editable": true }, @@ -4834,7 +4809,7 @@ { "cell_type": "code", "execution_count": 47, - "id": "18802a32", + "id": "76340bb6", "metadata": { "collapsed": false, "editable": true @@ -4909,7 +4884,7 @@ }, { "cell_type": "markdown", - "id": "4b7c3589", + "id": "a769239f", "metadata": { "editable": true }, @@ -4920,7 +4895,7 @@ }, { "cell_type": "markdown", - "id": "44324cee", + "id": "013ce46c", "metadata": { "editable": true }, @@ -4989,7 +4964,7 @@ }, { "cell_type": "markdown", - "id": "3136eb88", + "id": "2d69977f", "metadata": { "editable": true }, @@ -5003,7 +4978,7 @@ { "cell_type": "code", "execution_count": 48, - "id": "b638c521", + "id": "eff97f63", "metadata": { "collapsed": false, "editable": true @@ -5016,7 +4991,7 @@ }, { "cell_type": "markdown", - "id": "3c80bc67", + "id": "31abf8fe", "metadata": { "editable": true }, @@ -5030,7 +5005,7 @@ }, { "cell_type": "markdown", - "id": "4a9232c9", + "id": "522111fe", "metadata": { "editable": true }, @@ -5043,7 +5018,7 @@ }, { "cell_type": "markdown", - "id": "925cb898", + "id": "accb4df8", "metadata": { "editable": true }, @@ -5054,7 +5029,7 @@ }, { "cell_type": "markdown", - "id": "e16fc5b3", + "id": "5e9a411b", "metadata": { "editable": true }, @@ -5066,7 +5041,7 @@ }, { "cell_type": "markdown", - "id": "e2cf64e6", + "id": "5c609893", "metadata": { "editable": true }, @@ -5076,7 +5051,7 @@ }, { "cell_type": "markdown", - "id": "673b3162", + "id": "5766faaf", "metadata": { "editable": true }, @@ -5088,7 +5063,7 @@ }, { "cell_type": "markdown", - "id": "890b30c7", + "id": "9006a8f1", "metadata": { "editable": true }, @@ -5104,7 +5079,7 @@ { "cell_type": "code", "execution_count": 49, - "id": "c9d763f8", + "id": "e6c14494", "metadata": { "collapsed": false, "editable": true @@ -5155,7 +5130,7 @@ }, { "cell_type": "markdown", - "id": "8ceddba9", + "id": "9730a2c4", "metadata": { "editable": true }, @@ -5165,7 +5140,7 @@ }, { "cell_type": "markdown", - "id": "f5dd449b", + "id": "daeaaf0f", "metadata": { "editable": true }, @@ -5211,7 +5186,7 @@ { "cell_type": "code", "execution_count": 50, - "id": "631cc02c", + "id": "cefa7794", "metadata": { "collapsed": false, "editable": true @@ -5224,7 +5199,7 @@ }, { "cell_type": "markdown", - "id": "e9c59ae1", + "id": "c7966ef5", "metadata": { "editable": true }, @@ -5235,7 +5210,7 @@ { "cell_type": "code", "execution_count": 51, - "id": "9d829735", + "id": "c9f5c7cc", "metadata": { "collapsed": false, "editable": true @@ -5250,7 +5225,7 @@ }, { "cell_type": "markdown", - "id": "96f9855e", + "id": "160ac4f4", "metadata": { "editable": true }, @@ -5268,7 +5243,7 @@ { "cell_type": "code", "execution_count": 52, - "id": "811a5036", + "id": "aee09a64", "metadata": { "collapsed": false, "editable": true @@ -5285,7 +5260,7 @@ }, { "cell_type": "markdown", - "id": "670b2fa6", + "id": "b5f0495e", "metadata": { "editable": true }, @@ -5295,7 +5270,7 @@ }, { "cell_type": "markdown", - "id": "0c951368", + "id": "ebf2a47a", "metadata": { "editable": true }, @@ -5306,7 +5281,7 @@ }, { "cell_type": "markdown", - "id": "5440597d", + "id": "18bae332", "metadata": { "editable": true }, @@ -5317,7 +5292,7 @@ }, { "cell_type": "markdown", - "id": "379708c0", + "id": "3c68041a", "metadata": { "editable": true }, diff --git a/doc/src/week34/week34.do.txt b/doc/src/week34/week34.do.txt index 9716996fa..136e16466 100644 --- a/doc/src/week34/week34.do.txt +++ b/doc/src/week34/week34.do.txt @@ -7,13 +7,18 @@ DATE: Week 34, August 21-25, 2021 !split ===== Overview of first week ===== +The sessions on Tuesdays and Wednesdays last four hours and will include partly lectures in a flipped mode (promoting active learning) and work on exercices and projects. +The sessions will begin with lectures and questions and answers about the material to be covered every week. There are four groups, Tuesdays 815am-12pm and 1215pm-4pm and +Wednesdays 815am-12pm and 1215pm-4pm. Please sign up as soon as possible for one of the groups. Max capacity per group is 30-40 persons. + +On Thursdays we have a regular lecture. These lectures start at 1215pm and end at 2pm. +The first week we wtart with simple linear regression, a repetition of linear algebra and elements of statistics needed for the course. + + !bblock - * August 22: First lecture 1215pm-2pm: Presentation of the course, aims and contentIntroduction to software and repetition of Python Programming - * August 23: - * August 24: - * Thursday: Second Lecture: Start with simple linear regression and repetition of linear algebra and elements of statistics - * Friday August 26: Linear regression - * Computer lab: Wednesdays, 8am-6pm and Thursdays 8am-12pm and additional self study 4pm-6pm. First time: Wednesday August 24. + * August 22: Presentation of the course, aims and content. Introduction to software and repetition of Python Programming, linear algebra and basic elements of statistics. Please select group. + * August 23: Presentation of the course, aims and content. Introduction to software and repetition of Python Programming, linear algebra and basic elements of statistics. Please select group. + * August 24: Lecture: Linear regression, examples and theory !eblock !split @@ -30,16 +35,13 @@ Reading recommendations this week: Refresh linear algebra, GBC chapters 1 and 2. !eblock -!split -===== Tuesday August 22 and Wednesday August 23 ===== - - !split ===== Lectures and ComputerLab ===== !bblock - * Lectures: Thursday (12.15pm-2pm and Friday (12.15pm-2pm). + * The sessions on Tuesdays and Wednesdays last four hours and will include partly lectures in a flipped mode (promoting active learning) and work on exercices and projects. + * Thursdays: regular lectures (12.15pm-2pm) * Weekly reading assignments and videos needed to solve projects and exercises. * Weekly exercises when not working on projects. You can hand in exercises if you want. * Detailed lecture notes, exercises, all programs presented, projects etc can be found at the homepage of the course.