<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/user/analyst/course"><title>BibSonomy bookmarks for /user/analyst/course</title><link>https://www.bibsonomy.org/user/analyst/course</link><description>BibSonomy RSS Feed for /user/analyst/course</description><items><rdf:Seq><rdf:li rdf:resource="http://www.math.wsu.edu/math/faculty/bkrishna/Teaching.html"/><rdf:li rdf:resource="https://cglab.gist.ac.kr/courses/spring2020CG/"/><rdf:li rdf:resource="https://mit6874.github.io/"/><rdf:li rdf:resource="https://www.cs.purdue.edu/homes/csjgwang/cloudb/"/><rdf:li rdf:resource="https://www.domestika.org/en/courses/1880-designing-products-of-the-future"/><rdf:li rdf:resource="https://xuwd11.github.io/am207/material.html"/><rdf:li rdf:resource="https://www.cs.ox.ac.uk/people/varun.kanade/teaching/CLT-MT2018/lectures/"/><rdf:li rdf:resource="https://courses.maths.ox.ac.uk/node/49612/materials"/><rdf:li rdf:resource="https://courses.maths.ox.ac.uk/node/48839"/><rdf:li rdf:resource="https://cwkx.github.io/teaching.html"/><rdf:li rdf:resource="https://www.cl.cam.ac.uk/teaching/2021/DataSciII/materials.html"/><rdf:li rdf:resource="https://eecs.scripts.mit.edu/eduportal/__How_Courses_Will_Be_Taught_Online_or_Oncampus__/F/2020/"/><rdf:li rdf:resource="https://www.ipb.uni-bonn.de/teaching/"/><rdf:li rdf:resource="https://www.ipb.uni-bonn.de/teaching/cpp-2020/"/><rdf:li rdf:resource="https://cs330.stanford.edu/"/><rdf:li rdf:resource="https://simons.berkeley.edu/programs/rl20"/><rdf:li rdf:resource="https://simons.berkeley.edu/programs/dl2019"/><rdf:li rdf:resource="https://theoremoftheweek.wordpress.com/2017/02/14/groups-and-group-actions-lecture-0-3/"/><rdf:li rdf:resource="https://wordpress.discretization.de/geometryprocessingandapplicationsws19/2019/10/17/lecture-progress/"/><rdf:li rdf:resource="https://web.stanford.edu/class/ee270/"/></rdf:Seq></items></channel><item rdf:about="http://www.math.wsu.edu/math/faculty/bkrishna/Teaching.html"><title>Courses taught by Bala Krishnamoorthy</title><description>WSU</description><link>http://www.math.wsu.edu/math/faculty/bkrishna/Teaching.html</link><dc:creator>analyst</dc:creator><dc:date>2022-02-16T07:58:40+01:00</dc:date><dc:subject>collection course mathematics </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;WSU&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/collection"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/mathematics"/></rdf:Bag></taxo:topics></item><item rdf:about="https://cglab.gist.ac.kr/courses/spring2020CG/"><title>Computer Graphics - Spring 2020 @ GIST</title><description>CGLab (since 2016.09) focuses on conducting research on photorealistic rendering, which includes a variety of optimization techniques for ray tracing. The main applications of photorealistic rendering are CG movies, animations, 3D games and immersive technology (AR and VR).</description><link>https://cglab.gist.ac.kr/courses/spring2020CG/</link><dc:creator>analyst</dc:creator><dc:date>2022-01-05T20:36:55+01:00</dc:date><dc:subject>2020 course graphics korea </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;CGLab (since 2016.09) focuses on conducting research on photorealistic rendering, which includes a variety of optimization techniques for ray tracing. The main applications of photorealistic rendering are CG movies, animations, 3D games and immersive technology (AR and VR).&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/2020"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphics"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/korea"/></rdf:Bag></taxo:topics></item><item rdf:about="https://mit6874.github.io/"><title>6.874 Computational Systems Biology: Deep Learning in the Life Sciences - Spring 2021</title><description>Course materials and notes for MIT class 6.802 / 6.874 / 20.390 / 20.490 / HST.506 Computational Systems Biology: Deep Learning in the Life Sciences</description><link>https://mit6874.github.io/</link><dc:creator>analyst</dc:creator><dc:date>2021-07-16T10:40:31+02:00</dc:date><dc:subject>2021 biology course mit </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Course materials and notes for MIT class 6.802 / 6.874 / 20.390 / 20.490 / HST.506 Computational Systems Biology: Deep Learning in the Life Sciences&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/2021"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/biology"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/mit"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.cs.purdue.edu/homes/csjgwang/cloudb/"><title>CS590: Cloud-Native Database Systems | Purdue</title><description></description><link>https://www.cs.purdue.edu/homes/csjgwang/cloudb/</link><dc:creator>analyst</dc:creator><dc:date>2021-07-05T08:38:16+02:00</dc:date><dc:subject>2021 cloud course database </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2021-07-05T08:38:16+02:00&#034; href=&#034;https://www.cs.purdue.edu/homes/csjgwang/cloudb/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.cs.purdue.edu/homes/csjgwang/cloudb/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/2021"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cloud"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/database"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.domestika.org/en/courses/1880-designing-products-of-the-future"><title>Designing Products of the Future (Cecilia Tham). Online Course | Domestika</title><description></description><link>https://www.domestika.org/en/courses/1880-designing-products-of-the-future</link><dc:creator>analyst</dc:creator><dc:date>2021-06-25T17:08:11+02:00</dc:date><dc:subject>course design research </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2021-06-25T17:08:11+02:00&#034; href=&#034;https://www.domestika.org/en/courses/1880-designing-products-of-the-future&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.domestika.org/en/courses/1880-designing-products-of-the-future&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/design"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/research"/></rdf:Bag></taxo:topics></item><item rdf:about="https://xuwd11.github.io/am207/material.html"><title>AM 207 - Stochastic Methods for Data Analysis, Inference, and Optimization</title><description></description><link>https://xuwd11.github.io/am207/material.html</link><dc:creator>analyst</dc:creator><dc:date>2021-04-28T06:43:53+02:00</dc:date><dc:subject>2018 collection course harvard lecture machine-learning probability statistics video </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2021-04-28T06:43:53+02:00&#034; href=&#034;https://xuwd11.github.io/am207/material.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://xuwd11.github.io/am207/material.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/2018"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/collection"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/harvard"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lecture"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/probability"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/statistics"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/video"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.cs.ox.ac.uk/people/varun.kanade/teaching/CLT-MT2018/lectures/"><title>Computational Learning Theory - Michaelmas Term 2018</title><description></description><link>https://www.cs.ox.ac.uk/people/varun.kanade/teaching/CLT-MT2018/lectures/</link><dc:creator>analyst</dc:creator><dc:date>2021-03-23T04:02:41+01:00</dc:date><dc:subject>2018 collection course lecture machine-learning oxford </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2021-03-23T04:02:41+01:00&#034; href=&#034;https://www.cs.ox.ac.uk/people/varun.kanade/teaching/CLT-MT2018/lectures/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.cs.ox.ac.uk/people/varun.kanade/teaching/CLT-MT2018/lectures/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/2018"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/collection"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lecture"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/oxford"/></rdf:Bag></taxo:topics></item><item rdf:about="https://courses.maths.ox.ac.uk/node/49612/materials"><title>C6.5 Theories of Deep Learning (2020-2021) | Mathematical Institute Course Management</title><description></description><link>https://courses.maths.ox.ac.uk/node/49612/materials</link><dc:creator>analyst</dc:creator><dc:date>2021-03-23T03:56:29+01:00</dc:date><dc:subject>2021 collection course deep-learning mathematics oxford slide </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2021-03-23T03:56:29+01:00&#034; href=&#034;https://courses.maths.ox.ac.uk/node/49612/materials&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://courses.maths.ox.ac.uk/node/49612/materials&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/2021"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/collection"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/deep-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/mathematics"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/oxford"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/slide"/></rdf:Bag></taxo:topics></item><item rdf:about="https://courses.maths.ox.ac.uk/node/48839"><title>B3.2 Geometry of Surfaces - Material for the year 2020-2021 | Mathematical Institute Course Management</title><description></description><link>https://courses.maths.ox.ac.uk/node/48839</link><dc:creator>analyst</dc:creator><dc:date>2021-03-23T02:15:58+01:00</dc:date><dc:subject>collection course geometry lecture oxford </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2021-03-23T02:15:58+01:00&#034; href=&#034;https://courses.maths.ox.ac.uk/node/48839&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://courses.maths.ox.ac.uk/node/48839&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/collection"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/geometry"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lecture"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/oxford"/></rdf:Bag></taxo:topics></item><item rdf:about="https://cwkx.github.io/teaching.html"><title>Deep Learning &amp; Reinforcement Learning</title><description>Chris G. Willcocks, Durham University</description><link>https://cwkx.github.io/teaching.html</link><dc:creator>analyst</dc:creator><dc:date>2021-02-24T19:51:41+01:00</dc:date><dc:subject>collection course deep-learning lecture reinforcement-learning </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Chris G. Willcocks, Durham University&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/collection"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/deep-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lecture"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/reinforcement-learning"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.cl.cam.ac.uk/teaching/2021/DataSciII/materials.html"><title>Data Science: principles and practice – Course materials</title><description></description><link>https://www.cl.cam.ac.uk/teaching/2021/DataSciII/materials.html</link><dc:creator>analyst</dc:creator><dc:date>2021-01-18T18:03:54+01:00</dc:date><dc:subject>2021 course lecture machine-learning uk </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2021-01-18T18:03:54+01:00&#034; href=&#034;https://www.cl.cam.ac.uk/teaching/2021/DataSciII/materials.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.cl.cam.ac.uk/teaching/2021/DataSciII/materials.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/2021"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lecture"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/uk"/></rdf:Bag></taxo:topics></item><item rdf:about="https://eecs.scripts.mit.edu/eduportal/__How_Courses_Will_Be_Taught_Online_or_Oncampus__/F/2020/"><title>MIT EECS Education Portal - Fall, 2020</title><description>Courses offered in Fall-2020 </description><link>https://eecs.scripts.mit.edu/eduportal/__How_Courses_Will_Be_Taught_Online_or_Oncampus__/F/2020/</link><dc:creator>analyst</dc:creator><dc:date>2020-10-30T09:03:36+01:00</dc:date><dc:subject>2020 collection computer-science course mit </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Courses offered in Fall-2020 &lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/2020"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/collection"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/computer-science"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/mit"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.ipb.uni-bonn.de/teaching/"><title>Teaching – StachnissLab</title><description>- Modern C++ for Computer Vision
- 3D Coordinate Systems
- Photogrammetry I
- Mobile Sensing and Robotics I
- Photogrammetry II
- Mobile Sensing and Robotics II
- Techniques for Self-Driving Cars
- Master Project</description><link>https://www.ipb.uni-bonn.de/teaching/</link><dc:creator>analyst</dc:creator><dc:date>2020-10-22T08:21:21+02:00</dc:date><dc:subject>collection computer-vision course germany robotics </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;- Modern C++ for Computer Vision
- 3D Coordinate Systems
- Photogrammetry I
- Mobile Sensing and Robotics I
- Photogrammetry II
- Mobile Sensing and Robotics II
- Techniques for Self-Driving Cars
- Master Project&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/collection"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/computer-vision"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/germany"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/robotics"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.ipb.uni-bonn.de/teaching/cpp-2020/"><title>Modern C++ Course for CV (2020) – StachnissLab</title><description></description><link>https://www.ipb.uni-bonn.de/teaching/cpp-2020/</link><dc:creator>analyst</dc:creator><dc:date>2020-10-22T08:19:36+02:00</dc:date><dc:subject>2020 c++ computer-vision course germany robotics </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2020-10-22T08:19:36+02:00&#034; href=&#034;https://www.ipb.uni-bonn.de/teaching/cpp-2020/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.ipb.uni-bonn.de/teaching/cpp-2020/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/2020"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/c++"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/computer-vision"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/germany"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/robotics"/></rdf:Bag></taxo:topics></item><item rdf:about="https://cs330.stanford.edu/"><title>CS 330: Deep Multi-Task and Meta Learning</title><description>While deep learning has achieved remarkable success in supervised and reinforcement learning problems, such as image classification, speech recognition, and game playing, these models are, to a large degree, specialized for the single task they are trained for. This course will cover the setting where there are multiple tasks to be solved, and study how the structure arising from multiple tasks can be leveraged to learn more efficiently or effectively. This includes:
- goal-conditioned reinforcement learning techniques that leverage the structure of the provided goal space to learn many tasks significantly faster
- meta-learning methods that aim to learn efficient learning algorithms that can learn new tasks quickly
- curriculum and lifelong learning, where the problem requires learning a sequence of tasks, leveraging their shared structure to enable knowledge transfer

This is a graduate-level course. By the end of the course, students will be able to understand and implement the state-of-the-art multi-task learning and meta-learning algorithms and be ready to conduct research on these topics.</description><link>https://cs330.stanford.edu/</link><dc:creator>analyst</dc:creator><dc:date>2020-10-13T13:11:38+02:00</dc:date><dc:subject>course machine-learning meta-learning stanford </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;While deep learning has achieved remarkable success in supervised and reinforcement learning problems, such as image classification, speech recognition, and game playing, these models are, to a large degree, specialized for the single task they are trained for. This course will cover the setting where there are multiple tasks to be solved, and study how the structure arising from multiple tasks can be leveraged to learn more efficiently or effectively. This includes:
- goal-conditioned reinforcement learning techniques that leverage the structure of the provided goal space to learn many tasks significantly faster
- meta-learning methods that aim to learn efficient learning algorithms that can learn new tasks quickly
- curriculum and lifelong learning, where the problem requires learning a sequence of tasks, leveraging their shared structure to enable knowledge transfer

This is a graduate-level course. By the end of the course, students will be able to understand and implement the state-of-the-art multi-task learning and meta-learning algorithms and be ready to conduct research on these topics.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/meta-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stanford"/></rdf:Bag></taxo:topics></item><item rdf:about="https://simons.berkeley.edu/programs/rl20"><title>Theory of Reinforcement Learning | Simons Institute for the Theory of Computing</title><description>This program aims to reunite researchers across disciplines that have played a role in developing the theory of reinforcement learning. It will review past developments and identify promising directions of research, with an emphasis on addressing existing open problems, ranging from the design of efficient, scalable algorithms for exploration to how to control learning and planning. It also aims to deepen the understanding of model-free vs. model-based learning and control, and the design of efficient methods to exploit structure and adapt to easier environments.</description><link>https://simons.berkeley.edu/programs/rl20</link><dc:creator>analyst</dc:creator><dc:date>2020-10-12T13:31:38+02:00</dc:date><dc:subject>2020 collection course reinforcement-learning tutorial workshop </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;This program aims to reunite researchers across disciplines that have played a role in developing the theory of reinforcement learning. It will review past developments and identify promising directions of research, with an emphasis on addressing existing open problems, ranging from the design of efficient, scalable algorithms for exploration to how to control learning and planning. It also aims to deepen the understanding of model-free vs. model-based learning and control, and the design of efficient methods to exploit structure and adapt to easier environments.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/2020"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/collection"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/reinforcement-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tutorial"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/workshop"/></rdf:Bag></taxo:topics></item><item rdf:about="https://simons.berkeley.edu/programs/dl2019"><title>Foundations of Deep Learning | Simons Institute for the Theory of Computing</title><description>The program focused on the following four themes:
- Optimization: How and why can deep models be fit to observed (training) data?
- Generalization: Why do these trained models work well on similar but unobserved (test) data?
- Robustness: How can we analyze and improve the performance of these models when applied outside their intended conditions?
- Generative methods: How can deep learning be used to model probability distributions?</description><link>https://simons.berkeley.edu/programs/dl2019</link><dc:creator>analyst</dc:creator><dc:date>2020-10-12T13:29:43+02:00</dc:date><dc:subject>2019 collection course deep-learning tutorial workshop </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;The program focused on the following four themes:
- Optimization: How and why can deep models be fit to observed (training) data?
- Generalization: Why do these trained models work well on similar but unobserved (test) data?
- Robustness: How can we analyze and improve the performance of these models when applied outside their intended conditions?
- Generative methods: How can deep learning be used to model probability distributions?&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/2019"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/collection"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/deep-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tutorial"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/workshop"/></rdf:Bag></taxo:topics></item><item rdf:about="https://theoremoftheweek.wordpress.com/2017/02/14/groups-and-group-actions-lecture-0-3/"><title>Groups and Group Actions: Lecture 0 | Theorem of the week</title><description>Welcome to the course blog for the Oxford first year Groups and Group Actions course (Hilary and Trinity Terms 2017).  I hope that this will be a useful resource to accompany the lectures, problems sheets and tutorials.  Please check back after each lecture for a new post.  In addition, I have a course page with some useful information, and…</description><link>https://theoremoftheweek.wordpress.com/2017/02/14/groups-and-group-actions-lecture-0-3/</link><dc:creator>analyst</dc:creator><dc:date>2020-10-01T10:32:33+02:00</dc:date><dc:subject>2017 article blog course group-theory oxford </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Welcome to the course blog for the Oxford first year Groups and Group Actions course (Hilary and Trinity Terms 2017).  I hope that this will be a useful resource to accompany the lectures, problems sheets and tutorials.  Please check back after each lecture for a new post.  In addition, I have a course page with some useful information, and…&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/2017"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/article"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/blog"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/group-theory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/oxford"/></rdf:Bag></taxo:topics></item><item rdf:about="https://wordpress.discretization.de/geometryprocessingandapplicationsws19/2019/10/17/lecture-progress/"><title>Geometry Processing and Applications WS19</title><description></description><link>https://wordpress.discretization.de/geometryprocessingandapplicationsws19/2019/10/17/lecture-progress/</link><dc:creator>analyst</dc:creator><dc:date>2020-07-01T20:40:16+02:00</dc:date><dc:subject>2019 collection course geometry germany lecture </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2020-07-01T20:40:16+02:00&#034; href=&#034;https://wordpress.discretization.de/geometryprocessingandapplicationsws19/2019/10/17/lecture-progress/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://wordpress.discretization.de/geometryprocessingandapplicationsws19/2019/10/17/lecture-progress/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/2019"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/collection"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/geometry"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/germany"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lecture"/></rdf:Bag></taxo:topics></item><item rdf:about="https://web.stanford.edu/class/ee270/"><title>EE 270 - Large Scale Matrix Computation, Optimization and Learning</title><description></description><link>https://web.stanford.edu/class/ee270/</link><dc:creator>analyst</dc:creator><dc:date>2020-05-30T21:08:35+02:00</dc:date><dc:subject>2019 course machine-learning matrix optimization stanford </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2020-05-30T21:08:35+02:00&#034; href=&#034;https://web.stanford.edu/class/ee270/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://web.stanford.edu/class/ee270/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/2019"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/matrix"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/optimization"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stanford"/></rdf:Bag></taxo:topics></item></rdf:RDF>