Thought about how cool it would be to use machine learning to generate machine learning algorithms and how that could be the basis of artificial "life". Maybe start with a minimal implementation 'bootstrap protozoa' that can evolve to highly complicated forms. Then realised that since Machine Learning processes takes a long time that would take forever making auto evolving computer life forms a long way away. Althoug…
Machine learning works spectacularly well, but mathematicians aren’t sure why
41–50 of 137 posts
Re: Machine learning works spectacularly well, but mathematicians aren’t sure why
#42One problem with understanding ANNs is that the weight matrix carries a lot of spurious interactions. Running perturbation analysis you can see that many of the interactions do not contribute to the information processing of the circuit. This is the same for Gene Regulatory Networks. I wrote a paper published in Nature's "Systems Biology" entitled Survival of the Sparsest Gene Networks are Parsimonious. It's been cit…
Could you explain weight matrix "spurious interactions"?
Let's say a specific problem has only one very specific set of connections that matters. You'll eventually add up with weights that reflects that, but that doesn't prevent a lot of other connections from having weights set during training, but that may end up being cancelled out or reduced enough to have no meaningful impact whatsoever on the end result.
Re: Machine learning works spectacularly well, but mathematicians aren’t sure why
#43Neural networks is advanced curve fitting -- That's why. It isn't really all that magical or mysterious.
It really kinda is. In the Ilya Sutskever Talking Machines podcast[1] he describes exactly how it is "magic". He talks about how there is no theoretical basis to think that a deep neural network should converge, and prior to around 2006 the accepted wisdom was that networks deep enough to outperform other methods of machine learning were useless because they couldn't be trained. And then they discovered how to initia…
This "magic" of converging networks reminds me of how ensemble methods, such as random forests, are effective but people aren't sure why. There's certainly (AFAIK) no theoretical grounds to say that a bunch of random decision trees should yield universally good results.
Re: Machine learning works spectacularly well, but mathematicians aren’t sure why
#44As for "spectacularly well" -- well, the person behind the curtain wiggling the levers retains a lot of influence. Garbage in, garbage out, remember? I'm reminded of the time Google Translate autodetected "Gesundheit" as Spanish. And Gmail kindly offering to translate "hahaha" from Portuguese, putting an ad for coconuts next to it. Data science is improving, but you might be surprised how slowly. Especially in the co…
I'm not sure how old you are, but what exactly are you expectations when you state Data science is improving, but you might be surprised how slowly. We have machines that can categorise pictures better that humans. In 2011 that seemed completely impossible.
A Google Image search for "Wonder Wheel" (the famous Coney Island Ferris Wheel) shows this spoked diagram within the first page of results:
http://searchengineland.com/figz/wp-content/seloads/2011/07/...
Also this year, Google Photos classified black people as gorillas.
http://www.usatoday.com/story/tech/2015/07/01/google-apologi...
Consumers are rarely exposed to the raw machine output -- for good reason. My experience building these sorts of systems is that they're pretty goofy and they fail unexpectedly. After chasing audio and video problems using custom software as well as three major toolkits, I find myself hyper-aware of the flaws in public systems.
Also common sense dictates that it's more about the data scientist on the way in and the UX person on the way out than the machine.
Re: Machine learning works spectacularly well, but mathematicians aren’t sure why
#45I can chime in for the theoretical computer scientists. Deep learning (in its simplest form) corresponds to the class of circuits whose gates are linear threshold functions. Our primary goal with such functions is not to show what problems can be solved by small circuits using linear threshold gates, but what problems cannot be solved with such circuits. Until last week [1], it was an open problem whether every funct…
Actually, there's been a few papers showing solid theoretical progress on understanding what structure in data deep networks are learning to represent. https://github.com/gregversteeg/CorEx http://arxiv.org/abs/1406.1222 http://arxiv.org/abs/1410.7404 Disclaimer: I reinvented the idea about a month or two ago, and ran into the existing papers when googling for joint entropy estimators after making some interesting gr…
Re: Machine learning works spectacularly well, but mathematicians aren’t sure why
#46Can anyone give me a pointer on what techniques the author is talking about for unsupervised learning at the end of the article?
Re: Machine learning works spectacularly well, but mathematicians aren’t sure why
#47Re: Machine learning works spectacularly well, but mathematicians aren’t sure why
#48Re: Machine learning works spectacularly well, but mathematicians aren’t sure why
#49Re: Machine learning works spectacularly well, but mathematicians aren’t sure why
#50You can download open source SAT solvers today that work spectacularly well on "real" SAT instances with millions and millions of variables and clauses. Yes, SAT is the quintessential NP-complete problem and in fact it is pretty easy to come up with a SAT instance with only a few tens of variables/clauses that would kill these solvers. But somehow these "hard" instances almost never occur in practical problems generated in hardware/software verification/synthesis as well as ton of other applications (planning, constraint programming etc.)
So this must there is some characteristic of the problems that we generate in practice that makes them "easy" but we don't have a good understanding of what this characteristic is. All we know, for now, is that we've somehow stumbled upon a near-perfect set of heuristics that work amazingly well on the SAT instances we encounter in practice.