Name: Machine Learning and Sorting
Start: 2025-09-29T23:00:00.000Z
Location: The Westbury

Sorting might sound like an undergraduate topic, but it turns out you can literally do Machine Learning by sorting data. This is the result of a theorem I proved in my paper, "[Sorting, Information, and Recursion](https://www.researchgate.net/publication/353958877_Sorting_Information_and_Recursion)", in which I prove that a list is sorted if and only if every entry is adjacent to its Nearest Neighbor.

We'll walk through the paper as a whole, which also presents what I believe to be the fastest known sorting algorithm, with a runtime of O(log(N)).

This means that you can do Machine Learning with an O(log(N)) algorithm, which is pretty impressive.

These techniques were implemented in the "Massive" version of my AutoML software [BlackTree](https://blacktreeautoml.com/), which can train and test 500,000 rows in about 10 minutes, running on an ordinary PC.

As you can tell, this is more than an academic result, it produced extremely powerful commercial software, which we will discuss as well.

See you all then!

Charles

New York Machine Learning Meetup Group

Charles Davi

Athang Bachhav

Nagalakshmi Ram

Jason Tarre

Karthik Uppulury

Oleksiy Ivanov

Shageenth

Sudeep Sureshbabu

Kevin

Mignonne S

Anne Hyacinthe

Cesar GR

jvporrino

Samantha

Jennifer Poueymirou

Jithendra Puppala

shiva.ahir

Michael Cavicchia

Magdalene 

Anthony Kraljic

Machine Learning and Sorting

The Westbury

New York Machine Learning Group

{networkName}を検索する

グループ

{PRO_NETWORK_NAME}はMeetup Proに登録しており、世界中の{PRO_GROUP_COUNT}のMeetupで{PRO_MEMBER_COUNT}人以上のメンバーが参加しています。Meetup Proは、ユーザー、パートナー、コントリビューター、メンバーのネットワークを管理できるプロフェッショナルなコミュニケーションツールです。

New York Machine Learning Group

New York Machine Learning Group

私たちについて

New York Machine Learning Groupを検索する

今後のイベント

グループ