Hacker Newsnew | past | comments | ask | show | jobs | submit | dicey's commentslogin

This reminds me somewhat of the iSAX papers from ~2010 [0], which was focused on time series but used a pretty cool method to binarize/discretize the real values data and do search. I wonder how folks building things like FAISS or vector DBs incorporate ideas like this , or if the two worlds don’t overlap very often.

[0]. https://www.cs.ucr.edu/~eamonn/iSAX_2.0.pdf


Super cool article - this was a good reminder for me that innovation is still happening in the BERT realm.

Honestly, for task specific tasks methods like this seem like the way to go over the more general LLM.

Does anyone know if there is any benchmarks that show LLM performance on classification tasks? It’d be interesting to have data to back that up.


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: