algomanic
Re:Machine learning works spectacularly well, but mathematicians aren’...
on Friday December 04, 2015 @05:25PM (#10679625)
Interesting, thank you.
Re:Machine learning works spectacularly well, but mathematicians aren’...
on Friday December 04, 2015 @12:09PM (#10677505)
My understanding is that in SAT world, random instances are typically easily, even for large numbers of variables. Hard instances only exist in a very narrow band of instance space pertaining to the #constraints/#variables ratio. And yes, it seems like there should be some explanation for this, or maybe it's simply "your intuition for how hard problems should be is wrong".
Re:Machine learning works spectacularly well, but mathematicians aren’...
on Friday December 04, 2015 @10:26AM (#10676778)
Related: "On the Expressive Power of Deep Learning: A Tensor Analysis". http://arxiv.org/abs/1509.05009
Re:Machine learning works spectacularly well, but mathematicians aren’...
on Friday December 04, 2015 @10:18AM (#10676728)
Could you explain weight matrix "spurious interactions"?
Re:Machine learning works spectacularly well, but mathematicians aren’...
on Friday December 04, 2015 @08:37AM (#10676204)
The fact that the class of NN functions is universal is almost vacuous: the basic idea is that if you allow a "neuron" for every point in your input space then you can mimic any function you like (i.e. each neuron handles a single input). Obviously such representations become arbitrarily large.
Which almost immediately suggests a solution to why NN learning works: the processes that produce the types of datasets humans are interested in are produced by (effectively) polysized networks and you can probably say things like the probability of recovering a polysize function from polysize samples is high.