afireohno
afireohno t1_j920tja wrote
Reply to comment by saturn_since_day1 in [D] Please stop by [deleted]
Have you posted actual technical details to share and get feedback? As a long time member of this sub I would be interested, and I don’t think I’m alone here.
afireohno t1_j8qg9eq wrote
Reply to comment by maizeq in [R] RWKV-4 14B release (and ChatRWKV) - a surprisingly strong RNN Language Model by bo_peng
There is some work on Frustratingly Short Attention Spans in Neural Language Modeling
afireohno t1_j0aqu8w wrote
Reply to comment by J00Nnn in [Research] Graph Embeddings for Graph shape? by J00Nnn
Use a pairwise loss.
afireohno t1_iwn5dcr wrote
Reply to comment by Devinco001 in [D] Spellcheck and Levenshtein distance by Devinco001
Glad it was helpful!
afireohno t1_iwjy4d8 wrote
Reply to [D] Spellcheck and Levenshtein distance by Devinco001
You could use a BK-tree.
afireohno t1_isblrse wrote
Reply to comment by kajladk in [N] First RTX 4090 ML benchmarks by killver
>average fps across multiple runs gives a more realistic performance and eliminates any outliers
Thanks for the laugh. I'll just leave this here so you can read about why the mean (average) is not a robust measure of central tendency because it is easily skewed by outliers.
afireohno t1_j9230xx wrote
Reply to [D] Formalising information flow in NN by bjergerk1ng
There are two lines of work that come to mind you might be interested in.
Edit: Spelling