Karthik Srinivasan on Nostr: npub15swlx…zx855 Very much! So how do we say one is more complicated than the ...
npub15swlxudlhx4ttcgsd4556zuqrl57qndxmt4n3dnzrkqn89nxv6lsjzx855 (npub15sw…x855)
Very much! So how do we say one is more complicated than the other... if all we are allowed to do are, here is x(input), here is y(output)... we got an excellent fit with the params we have defined (a) here in our model. We do a curve fit in ML. How do I map from the model complexity in ML to the model defined in those equations.
I know the question is silly, but if one even takes semi-seriously the claims that NN/ML will find new scientific laws, we should be able to understand known scientific laws in that language.
Very much! So how do we say one is more complicated than the other... if all we are allowed to do are, here is x(input), here is y(output)... we got an excellent fit with the params we have defined (a) here in our model. We do a curve fit in ML. How do I map from the model complexity in ML to the model defined in those equations.
I know the question is silly, but if one even takes semi-seriously the claims that NN/ML will find new scientific laws, we should be able to understand known scientific laws in that language.