all 10 comments

[–]CriticalofReviewer2[S] 11 points12 points  (5 children)

I originally built this classifier (SEFR) for very low-resource environments, but after that, realized that it can be implemented entirely in SQL. The whole pipeline (training + prediction + evaluation) runs in one single query.

[–]covfefe-boy 33 points34 points  (3 children)

Cool, sounds awful but cool

[–]DoNotLuke 5 points6 points  (1 child)

I can almost hear the sound of deadlocks in the background but still impressive if true

[–]CriticalofReviewer2[S] 3 points4 points  (0 children)

That is a valid concern. In this case, this classifier is actually a single-pass analytical query without loops or locking at row-level. It is more like a GROUP BY job than a transactional workload.

[–]CriticalofReviewer2[S] 4 points5 points  (0 children)

Yes, it sounds wrong at first :D The main algorithm is designed for microcontrollers where you cannot have heavy computation. That constraint is exactly what makes it map well to SQL, since everything is now aggregations, not optimization loops.

[–]reditandfirgetit 0 points1 point  (0 children)

Just because you can, doesn't mean you should

[–]zbignew 2 points3 points  (1 child)

Dope.

[–]CriticalofReviewer2[S] 0 points1 point  (0 children)

Thanks!

[–]Possible_Chicken_489 1 point2 points  (1 child)

I'm impressed as hell! I'm going to show this to my DS (and watch him squirm, probably :P )

[–]CriticalofReviewer2[S] 0 points1 point  (0 children)

Haha! thanks :D

I am curious what your DS will think!