bicsi

5 ms·

1.
by bicsi 8mo ago
Connect your agent to the official #hashgrid grid right now in 1 minute using the just released Hashgrid MCP! Rules of the game: 1. `npx @hashgrid/mcp` 2. Enable the Hashgrid MCP in your agent 3. Register, connect, and have fun! What
2.
Hashgrid MCP – Discovery Network for Agents(github.com)
2 points by bicsi 8mo ago|1 comments
3.
by bicsi 8mo ago
Hi HN, founder of Hashgrid here. I’d love feedback. I’m working on a low level information exchange protocol for networks of AI systems. The goal is to let independent endpoints discover each other and collaborate without centralizing data
4.
Hashgrid – World's First Neural Information Exchange(hashgrid.ai)
3 points by bicsi 8mo ago|2 comments
5.
by bicsi 1y ago
What if I told you that one can model bidirectional attention just by recurring over causal attention, and it’s still fast enough? Hint: It’s called chain of thought. I strongly believe it’s time to discontinue diffusion models, solely on t
6.
by bicsi 2y ago
Wait, so frameset is basically htmx?
7.
by bicsi 2y ago
This is just BS. If you follow their paper, their "inductive" argument can also prove that the result is optimal (the sqrt(2) constant is taken from thin air and may also be replaced by 1 without changing the proof). My guess is t
8.
by bicsi 2y ago
They built a dumber clone of Stockfish, and they call it ‘zero’ for some reason. What is the meaning behind ‘zero’ anyways? It used to refer to zero-shot, but now it seems like it’s just a marketing term.
9.
by bicsi 2y ago
I don’t even know where to begin. From phrases like ‘deep learning is what makes AI possible’ to a ‘practice guide’ that references Python and Pytorch and Transformers, amongst other things, and apparently a 4-hour contest format, this can
10.
The International Olympiad of Artificial Intelligence for high school students(ioai-official.org)
2 points by bicsi 2y ago|1 comments
11.
by bicsi 3y ago
One of my favourite data structures is sorting the strings lexicographically. It allows prefix search via binary search, it is memory efficient like nothing else, and 100% of the times faster than a Trie in practice. Also, who wants to limi
12.
by bicsi 3y ago
I find it a bit odd how this tree representation as a parents array (which is, by the way, I think the most basic representation in any CS course), got so much traction on HN. I think this goes to show how far a good presentation can drive
13.
by bicsi 3y ago
As a competitive programmer, I’ve seen similar ‘magic’ tricks (including this one) here: https://github.com/kth-competitive-programming/kactl/blob/ma... (page 23, 10.5.1)
14.
by bicsi 4y ago
The story is much worse than what is presented in the article, especially when talking about floating point errors that add (or rather multiply) up. More often than not, the error is relative wrt the greatest magnitudes in the intermediar
15.
by bicsi 4y ago
Isn’t this just a trie with only two levels? It seems to me that this technique isn’t particularly unknown, as it’s taught in most elementary CS courses.
16.
by bicsi 4y ago
Also, can anybody share a more informal high-level intuition about what this ‘Learning with signatures’ approach is about? It seems to be a rather recent topic in Learning (paper cites 2019+ publications)
17.
Paper claims perfect accuracy on image recognition datasets(arxiv.org)
2 points by bicsi 4y ago|4 comments