GistNoesis

9 ms·

61.
by GistNoesis 11mo ago
> a lot of network lock-in that an upstart would have to overcome by being way better at something PyTorch can never be good at Higher level code migration to the newer framework, is going to 0. You ask your favorite agent (or intern) to
62.
by GistNoesis 11mo ago
The choice of the dynamic computation graph [1] of PyTorch made it easier to debug and implement, leading to higher adoption, even though running speed was initially slower (and therefore training cost higher). Other decisions follow from t
63.
by GistNoesis 1y ago
>computing the exact gradient using calculus First of all, gradient computation with back-prop (aka reverse-mode automatic differentiation) is exact to numerical precision (except for edge-cases that are not relevant here) so it's n
64.
by GistNoesis 1y ago
How do I write my custom attractor equation ?
65.
by GistNoesis 1y ago
Can measurements and calibration be done easily at home to see if your sound system is well calibrated ? I was thinking of playing a pink noise on the speaker and recording it with a cheap microphone or displaying it with the Spectroid app,
66.
by GistNoesis 1y ago
Thanks, that the same approach I was suggesting in my other comment in this thread https://news.ycombinator.com/item?id=45628245 . But couldn't find literature specific to the Bezier curves to help break the communicat
67.
by GistNoesis 1y ago
I have written some gist to illustrate the approach I suggest. The code run but there may be bugs, and it don't use the appropriate optimizer. The purpose is to illustrate the optimisation approach. https://gist.github.com&#
68.
by GistNoesis 1y ago
The general technique is not recent I was taught it in school in global optimisation class more than 15 years ago. Here there is a small number of local minimum, the idea is to iterate over them in increasing order. Can't remember the
69.
by GistNoesis 1y ago
This is fundamentally a geometric problem and the author completely missed the geometry aspect by transforming everything into polynomials and root finding. The naive generic way of finding distances from point P to curve C([0,1]) is a proc
70.
by GistNoesis 1y ago
The answer is adaptability. In both cases for "Question Answering" it's about similarity search but there are two main orthogonal differences between RAG and Non-RAG : -Knowing the question at the time of index building -High
71.
by GistNoesis 1y ago
You may need to add some factor for the Hamming distance to make it admissible. On a 4x4 board each move change at most 4 bits. So 4 x the hamming distance should be OK. Edit: I 'm maybe getting this wrong confusing lower bound and upp
72.
by GistNoesis 1y ago
Have you tried some generic pathfinding algorithm like D star lite on the graph with heuristic being the hamming distance from current node to the start ? For the 4x4 board there is only 2^16 nodes, and 8*2^16 edges, so you can materialize
73.
by GistNoesis 1y ago
Aren't they supposed to escape their box and take over the world ? Isn't it the perfect recipe for disaster ? The AI that manage to escape probably won't be good for humans. The only question is how long will it take ? Did we
74.
by GistNoesis 1y ago
Being able to quantify the importance of the environment is one advantage of using a simulator based approach. You know what's happening, and you can simulate other environments by adding the relevant molecules around. Speeding-up the
75.
by GistNoesis 1y ago
Intellectually, I don't like this approach. Predicting the end-result from the sequence of protein directly is prone to miss any new phenomenon and would just regurgitate/interpolate the training datasets. I would much prefer an a
76.
by GistNoesis 1y ago
Do you mean something like an e-ink display like on the BMW iX flow https://www.youtube.com/watch?v=BpKO-VuHMFA
77.
by GistNoesis 1y ago
These optimizations are often hidden when the compiler need to do some loop interchange optimizations. If the order of the operations is important because you don't have associativity then you can't legally do it. You can have spe
78.
by GistNoesis 1y ago
The https://en.wikipedia.org/wiki/Z-fighting issue is the proof you often need those 64-bits. It's kind of a chicken and egg problem where people use floats because there are FPUs available. All the engineering ef
79.
by GistNoesis 1y ago
https://en.wikipedia.org/wiki/Fixed-point_arithmetic : allows you to have some thing which is integer math but works like floats. It's integer operations and bit shifts so really fast. The limitation is the minim
80.
by GistNoesis 1y ago
For a .exposed domain, it's not really shocking. The real shocking fact about floating point is that they are even used at all. It's throwing out of the window the most basic property operations on number should have : "assoc
81.
by GistNoesis 1y ago
Note here that "faster" here really means more speed and not an increase in the volume of data transferred : The light go through the air hollow-core so can go at near "c" (the speed of light in vacuum) speed, instead of
82.
by GistNoesis 1y ago
The practical reason is speed and low resources consumption. It's solving the Inverse Kinematics problem in the order of microseconds. It's almost a closed form solution. Typically it needs to be inside an embedded device, where m
83.
by GistNoesis 1y ago
Minesweeper is a probabilistic game, that's why you should use probabilistic tools to solve it. For example you can use a particle filter to approximate the distribution of mines. Every time you obtain new information you update the fi
84.
by GistNoesis 1y ago
My conviction is based on the interesting phenomenon of game tree collapsing. When you get better at the game, the number of "candidate" moves you need to explore goes down. For example when you are naive at chess you need to expl
85.
by GistNoesis 1y ago
>the absence of Bellman violations is necessary, but not sufficient It is sufficient though. All chess game ends in a finite number of moves. If you are consistent aka you have zero violation. Thinking backward (dynamic programming), you
86.
by GistNoesis 1y ago
>This comment and your other comments are simply wrong and full of nonsense That's because you are not understanding me. My conviction is the complexity of chess is not as high as we think, and that there exist a neural network of l
87.
by GistNoesis 1y ago
>"just train it until it is perfect" Yes that's exactly the problem with current approach based on a "valuation" function. They are not trying to aim for perfection, and therefore cannot make progress anymore. To
88.
by GistNoesis 1y ago
This is the precisely the point I am trying to make : A candidate solution function can take a very small finite space : much smaller than the number of gamestates. And we can invalidate a candidate solution by finding a single counter exam
89.
by GistNoesis 1y ago
We should have solved chess already. We should be aiming to solve chess, but we are not even trying. If the complexity of chess is finite this is possible. Chess AI have become so good that maybe there is no more progress to be made. We mus
90.
by GistNoesis 1y ago
It looks like a variant of "beam search" (using top-k instead of top-1), but it's not mentioned anywhere. What am I not getting ?

More ›