A Understanding the Cost Function in Machine Learning: A Practical Guide

emmasaunders12
Messages
43
Reaction score
0
Could someone please help me work through the differentiation in a paper (not homework), I am having trouble finding out how they came up with their cost function.

The loss function is L=wE, where E=(G-Gest)^2 and G=F'F

The derivative of the loss function wrt F is proportional to F'(G-Gest)

Can't seem to figure it out.

Thanks

Emma
 
Last edited:
Physics news on Phys.org
I have some trouble to understand you:

Do all functions depend on, say time ##t##, which the primes refer to? And why isn't ##G-G=0##? I first thought it could be the strange notation of a function, but then you defined a single ##G##. And last, could it be ##L \propto F(G-G)'##?
 
fresh_42 said:
I have some trouble to understand you:

Do all functions depend on, say time ##t##, which the primes refer to? And why isn't ##G-G=0##? I first thought it could be the strange notation of a function, but then you defined a single ##G##. And last, could it be ##L \propto F(G-G)'##?

Thanks for the response, its the loss function of a neural network, so I've corrected to G and Gest, primes refer to transpose
 
emmasaunders12 said:
Thanks for the response, its the loss function of a neural network, so I've corrected to G and Gest, primes refer to transpose
Perhaps someone else can help, but without a lot more context I have no idea what mathematically we are dealing with here.
 
PeroK said:
Perhaps someone else can help, but without a lot more context I have no idea what mathematically we are dealing with here.

The specific problem is described on page 4 here https://arxiv.org/pdf/1505.07376v3.pdf
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top