Skip to content

Details

Join Charles Davi, mathematician / lawyer, and founder of Black Tree AutoML. In a series of Lemmas and Corollaries, he proved that polynomial runtime algorithms can produce literally perfect deep learning classifications, given certain reasonable assumptions. As a practical matter, basically all real-world datasets conform to these assumptions to some degree, allowing deep learning problems to be solved in polynomial time, on ordinary consumer devices. Black Tree's accuracies are typically between 85% and 100%, for industry benchmark datasets, though the runtimes are simply unparalleled, and the fastest algorithms can classify 4,500 testing rows over 25,500 training rows in about 4 seconds, running on an ordinary laptop. These same algorithms allow an ordinary laptop to classify 500,000 rows in about 10 minutes.

You can download a completely Free Version of Black Tree from the website, which runs up to 2,500 rows / images.

Every month the deep learning community of New York gathers online to share discoveries and achievements and describe new techniques.

Join us online: https://us.bbcollab.com/guest/f0141bf7d0ce43a5969f001fab08a3a3

Artificial Intelligence
Machine Learning
Neural Networks
Predictive Analytics
Cognitive Science

Members are also interested in