To optimise a neural network can require selecting the best combination of a large set of parameters. For a simple case, suppose that a neural network has just two parameters x and y. The network is only feasible if y ≥ −1, x ≤ 3 and y ≤ x. An analyst establishes that the performance function of the network is f(x,y) = xy² + x² - 4xy. (a) Find Vf(x, y). (b) Find the Hessian matrix H(x, y) for f. (c) Locate and classify all stationary points of f(x, y). (d) Draw a rough sketch showing the feasible region of parameters, along with the locations of the stationary points. (e) For what values of x and y is the maximum performance of the network achieved, and for what values is the minimum achieved?
To optimise a neural network can require selecting the best combination of a large set of parameters. For a simple case, suppose that a neural network has just two parameters x and y. The network is only feasible if y ≥ −1, x ≤ 3 and y ≤ x. An analyst establishes that the performance function of the network is f(x,y) = xy² + x² - 4xy. (a) Find Vf(x, y). (b) Find the Hessian matrix H(x, y) for f. (c) Locate and classify all stationary points of f(x, y). (d) Draw a rough sketch showing the feasible region of parameters, along with the locations of the stationary points. (e) For what values of x and y is the maximum performance of the network achieved, and for what values is the minimum achieved?
Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter9: Systems Of Equations And Inequalities
Section9.9: Properties Of Determinants
Problem 46E
Related questions
Question
100%
![1. To optimise a neural network can require selecting the best combination of a large set of
parameters. For a simple case, suppose that a neural network has just two parameters x
and y. The network is only feasible if y ≥ −1, x ≤ 3 and y ≤ x. An analyst establishes
that the performance function of the network is
f(x,y) = xy² + x² − 4xy.
(a) Find Vf(x, y).
(b) Find the Hessian matrix H(x, y) for f.
(c) Locate and classify all stationary points of f(x, y).
(d) Draw a rough sketch showing the feasible region of parameters, along with the
locations of the stationary points.
(e) For what values of x and y is the maximum performance of the network achieved,
and for what values is the minimum achieved?](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F9f9c13e2-5c54-4ec3-b4e3-dc49b76d4e30%2Fe8915e16-4773-43be-9c98-44871df2f713%2Fchfjk_processed.png&w=3840&q=75)
Transcribed Image Text:1. To optimise a neural network can require selecting the best combination of a large set of
parameters. For a simple case, suppose that a neural network has just two parameters x
and y. The network is only feasible if y ≥ −1, x ≤ 3 and y ≤ x. An analyst establishes
that the performance function of the network is
f(x,y) = xy² + x² − 4xy.
(a) Find Vf(x, y).
(b) Find the Hessian matrix H(x, y) for f.
(c) Locate and classify all stationary points of f(x, y).
(d) Draw a rough sketch showing the feasible region of parameters, along with the
locations of the stationary points.
(e) For what values of x and y is the maximum performance of the network achieved,
and for what values is the minimum achieved?
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 7 steps with 78 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
![College Algebra (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781305652231/9781305652231_smallCoverImage.gif)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
![College Algebra (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781305652231/9781305652231_smallCoverImage.gif)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning