HN user

mentalically

27 karma
Posts5
Comments20
View on HN

Well done. I'd change a few things to make things technically more precise. In a few places you use words like "learnable" parameter but I think this tends to confuse people more than help them understand what is going on. People can learn but parameters can only be modified according to some rule that minimizes or maximizes some objective function of those parameters. People who understand the technical details tend to use words/phrases like "learning" as shorthand but in an introductory post like this it is useful to be technically precise and not use anthropomorphisms that can confuse beginners.

What are you confused about? Their value proposition is very simple and obvious, custom hardware with a compiler that transforms existing graphs into a format that can run at lower cost and higher efficiency because it utilizes a special instruction set only available on Cerebras silicon.

I wonder how long it will go before it devolves into complete incoherence. It already seems incoherent so probably in a few updates it will be completely unreadable.

That's correct and if you read the whole thing you will realize that it is followed by "... to leap over GPUs" which indicates that they're not literally referring to optimizing the weights of the graph on a new architecture or freshly initialized variables on existing ones.

The value proposition of Cerebras is that they can compile existing graphs to their hardware and allow inference at lower costs and higher efficiencies. The title does not say anything about creating or optimizing new architectures from scratch.

In the most general case there is no technique that can determine if two programs are equivalent other than running both programs on some set of inputs and verifying that the outputs (after termination) are the same. Every other technique must cut out all possible sources of non-termination to get around the halting problem in order to make the resulting equivalence relation on the set of programs effectively computable and constructively provable.