![]() |
#11
|
|||
|
|||
![]() Quote:
Last edited by cassio; 05-14-2012 at 12:37 PM. Reason: grammar |
#12
|
|||
|
|||
![]()
I don't think that's the way we are to read the homework. Notice problem 8, where it says,
"10 input units (including the constant value)...and 36 hidden units (include the constant inputs of each hidden layer). The "including" part important in the counting. |
#13
|
|||
|
|||
![]()
Has anybody got the correct answer? My answer was wrong and I can't see where is a mistake in my reasoning.
The maximum number of weights should be for the network looking like 10-18-18-1 (including constant nodes in the first three layers), right? But number of weights for it is not one in the answer key. |
#14
|
|||
|
|||
![]()
I got this one right. I used Excel (of all things) to explore all arrangements with one and two hidden layers, and also looked at portions of arrangements with more hidden layers. The spreadsheet does the arithmetic with simple copied formulas and gives the correct answer without too much work.
|
#15
|
|||
|
|||
![]()
Oh, I see. My stupid blunder.
Thnx! ![]() |
#16
|
|||
|
|||
![]()
Now I feel like an idiot!
![]() You could also have used goal seek in Excel. |
#17
|
|||
|
|||
![]()
In case anyone is curious, there are 9227465 possible networks that satisfy the constraints of this problem.
|
#18
|
|||
|
|||
![]() Quote:
![]() ![]() |
#19
|
||||
|
||||
![]()
In the statement of this problem (preamble before Problem 9), the constant variables
![]()
__________________
Where everyone thinks alike, no one thinks very much |
#20
|
|||
|
|||
![]()
Professor, after the deadline, could you please post an explanation to this and Question 9, if there's a general case analytical solution, or if there's any other straightforward method?
|
![]() |
Thread Tools | |
Display Modes | |
|
|