联系我们： 手动添加方式: 微信>添加朋友>企业微信联系人>13262280223 或者 QQ: 1483266981

You need to solve each of the following problems. You must also include a brief report
describing and discussing your solutions to the problems. Students can do the assignment in
groups or individuals.
● This assignment is worth 15% of the total mark for COMP532
● 80% of the assignment marks will be awarded for correctness of results
● 20% of the assignment marks will be awarded for the quality of the accompanying report
● Students will do the assignment in groups
● The assignment marks will be awarded for correctness of results
● We expect 5 students in one group (it would be fine to have groups of 1, 2, 3, and 4 as
well, but it is suggested to have groups of 5), please find your team members on your
own.
● Only one single submission is needed for each group
● The same marks will be granted to all the members in the same group
● Please list all your group members (names, emails, student ids) in your submitted report
Submission Instructions
● Deadline: 15 MAR 2023 17:00 (UK Time)
● Send all solutions as a single PDF document containing your answers, results, and
discussion of the results. Attach the source code for the programming problems as
separate files.
● Submit your solution via Canvas.
● Penalties for late submission apply in accordance with departmental policy as set
out in the student handbook, which can be found at
https://intranet.csc.liv.ac.uk/student/msc-handbook.pdf and the University Code of
Practice on Assessment, found at
https://www.liverpool.ac.uk/media/livacuk/tqsd/code-of-practice-on-assessment/code_of_
practice_on_assessment.pdf
Problem 1 (40 marks)
Implement a multi-armed bandit algorithm. Similar to Figure 2.1 in the Sutton & Barto book (
Reinforcement Learning: An Introduction), provide a solution for a n-armed bandit, where n can
be 8 or 10.
Prepare a report explaining your solution and containing your results, and discussion of the
results.
Attach the source code as separate files. For example, .ipnb – an ipython notebook file.
Problem 2 (30 marks)
Explain exploration and exploitation for multi-armed bandits.
Problem 3 (30 marks)
Explain action-value methods.