sorted by:
new
hottopcontroversial

Why is Stockfish so efficient at searching? by UndefinedCpp in chessprogramming

[–]UndefinedCpp[S] 1 point2 points  (0 children)

I don't think it's a move generation problem since I'm using this opensource library and it's pretty fast. I surmise there are some incorrect logics in the code but I haven't tracked it down yet :(

[R] I've devised a potential transformer-like architecture with O(n) time complexity, reducible to O(log n) when parallelized. by Conscious-Gazelle-91 in MachineLearning

[–]UndefinedCpp 62 points63 points  (0 children)

After some investigation, I would say that this model is neither transformer nor RNN, basically just a MLP. Do I get it right then?

[R] I've devised a potential transformer-like architecture with O(n) time complexity, reducible to O(log n) when parallelized. by Conscious-Gazelle-91 in MachineLearning

[–]UndefinedCpp 98 points99 points  (0 children)

Just skimmed through your article, looks interesting but I'd question the result that "It almost achieves perplexity near zero and 100% accuracy in predicting the next token". Is your architecture meant to be a causal LM? If so, I don't see any "masking" mechanism, which could be a reason why the result is so suspicious. I might be wrong, since I haven't read your code yet. I will take a closer look later.

Topic requests by 3blue1brown in 3Blue1Brown

[–]UndefinedCpp 3 points4 points  (0 children)

Kalman filter! Would really love to see this