RDTvlokip's picture
πŸ‘‹ Open to Work

RDTvlokip PRO

RDTvlokip

AI & ML interests

I'm builds complete AI systems from the ground up, tokenizers, search engines, and small-scale language models to investigate, through exact mathematics and public experimentation, how language and intelligence emerge from minimal resources and pure signal.

Recent Activity

updated a model about 1 hour ago
RDTvlokip/RDTChess
repliedto their post about 4 hours ago
I published an article about training a network to write from reward alone. Code on GitHub with it. Then someone read the code. Dipankar Sarkar commented four times in a day. Each time he had run something first. He rebuilt my statistics in numpy because he had no torch installed. He found a bound I had missed. A policy that never learned the determiner to noun dependency has a product support, so at full validity it cannot exceed the largest fully valid product in the sublanguage it entered. That is 12 on one side and 24 on the other, computable before any training. Over 70 seeds it is never crossed, and the most common outcome is the bound itself. I had published one of those numbers as an interesting coincidence. Then four of my published numbers came apart. Three were a single seed. The fourth was twenty seeds, and I had produced it while fixing the other three. And the test I built to validate his bound tested nothing. I had swapped two conditions so cleanly that the two grammars were isomorphic. Seventy seeds would have returned the mirror image by construction. The real lesson: A relabelling can permute, but it cannot change a ratio. A perfectly symmetric control is often a perfectly empty one. None of my errors were in the reasoning. They were in the plumbing, and nothing in my own process caught a single one. Code, figures, and the notebook with eight dated refutations πŸ‘‡ πŸ”— https://huggingface.co/blog/RDTvlokip/i-published-my-rl-experiments πŸ’» https://github.com/RDTvlokip/RDTRL πŸ“¦ https://doi.org/10.5281/zenodo.21726216
posted an update about 4 hours ago
I trained a chess network with no search. One forward pass, 6.9 ms, no tree, no book. Then I spent a day finding out most of what I believed about it was wrong. The instrument: 23,845 Lichess puzzles, sampled per cell of (solution length Γ— rating band), because rating and length are confounded. Lines are forced β€” the network is queried at every move even after it has erred, so no step is measured on a pre-filtered sample. My first reading was backwards. I expected accuracy to collapse with solution length. At fixed rating it rises: a 2400-rated mate-in-1 is the hardest cell in the grid. Rating conserves difficulty, length dilutes it. The real signal was elsewhere. Five-move lines: 66% on the entry move, 91% on the last. Quiet entries at 2400+: 32.8%. The network executes tactics. It does not initiate them. Then I added Squeeze-and-Excitation. At 96Γ—4 it recovered 62% of what four extra layers had bought, for 34% of their compute. At 128Γ—8 the effect halved and the profile inverted β€” gains on captures, nothing on checks or quiet moves. Not an attenuated effect. A different one. Both my stated predictions failed, one in sign. The part that matters: I had fixed Holm-Bonferroni over the family of eight comparisons before looking. It killed two of my four positive results, including a +26 Elo duel at p = 0.028 I would have written up as a win. The real lesson: Building a sensitive instrument does not protect you from reading it backwards. What caught the errors was predictions written before measuring, a threshold fixed before looking, and three yardsticks that disagree often enough to keep all three. Every number, including the ones that contradict me πŸ‘‡ πŸ€— https://huggingface.co/RDTvlokip/RDTChess πŸ’» https://github.com/RDTvlokip/RDTChess β™ŸοΈ https://lichess.org/@/RDTChessBot
View all activity

Organizations

Blog-explorers's profile picture Hugging Face Discord Community's profile picture