Video wird geladen...

Video konnte nicht geladen werden

Zur Startseite

Your brain doesn't search through memories — it falls downhill on an energy landscape and lands in the nearest valley. This is the Hopfield network from 1982, and the same math now lives inside every transformer: the attention mechanism in modern LLMs is mathematically equivalent to a Hopfield network...

22,378 Aufrufe • vor 10 Tagen •via X (Twitter)

10 Kommentare

Profilbild von Filip M Madsen, PhD | Molecular Dominoes
Filip M Madsen, PhD | Molecular Dominoesvor 9 Tagen

Yes, a mathematician almost disproved life once because of this, using protein chemistry. Turns out all "life" = "falling towards the lowest state".

Profilbild von Lilith Datura
Lilith Daturavor 10 Tagen

True

Profilbild von บีมน้อย บีมน้อย
บีมน้อย บีมน้อยvor 10 Tagen

A mature approach to artificial intelligence balances technical performance with ethical considerations in large-scale production environments.

Profilbild von Elizabeth
Elizabethvor 9 Tagen

Energy landscape is correct. But it is not just the nearest. It is the deepest and largest cluster

Profilbild von Turner NextGen AI
Turner NextGen AIvor 10 Tagen

That’s not how intelligence should be represented. Because you have nothing to do with Movement sciences, and this is the biggest problem with using an LLM versus a movement based AI system an LLM system for whoever reason put the lexicons in under motion, sciences, not movement sciences so by mechanics is not an action or a functional movement. It is just a representation of a body in space so the fact that that LLM is not anchored in any kind of developmental sciences movement science biology for function you’re asking for intelligence to represent and reason off of something that can’t be reason and that’s where you get the hallucinations within the system and they can’t scale to the way that we want them to. I left an LLM background for my AI two years ago, but I’m still dealing with these lexicons or taxonomies.

Profilbild von Sun&Steelx
Sun&Steelxvor 10 Tagen

Pancomputationalism...

Profilbild von Sonechka 🌹🐻‍❄️7Сонечка
Sonechka 🌹🐻‍❄️7Сонечкаvor 10 Tagen

nothing lost everything is recorded from a somatic cell in the womb. our brain frequencies hop indeed.

Profilbild von Bernhard Mueller
Bernhard Muellervor 9 Tagen

That's exactly our implementation:

Profilbild von Colin Johnson
Colin Johnsonvor 9 Tagen

Correct.

Profilbild von nceladus
nceladusvor 10 Tagen

fascinating

Ähnliche Videos

Wow! This Changes Everything We Thought We Knew About Memory It is a groundbreaking big deal. TOU ARE MAKING GENERATIONAL MEMORIES RIGHT NOW IN EACH CELL! Scientists just found that your brain doesn’t just store memories — it stores the rules for how those memories will change in the future. A brand-new preprint from Stanford’s Greenleaf and Schnitzer labs (led by PhD student Yuxi Ke) drops a bombshell that feels like science fiction becoming reality overnight. For decades, neuroscientists have suspected that chromatin the DNA packaging material inside every cell nucleus might somehow “store” memory-related information. But what kind of information? Content? Timing? Rules? Now we have the answer! Using activity-dependent genetic tagging, fear conditioning, and single-nucleus multiome sequencing in the mouse medial prefrontal cortex (the brain’s long-term memory vault), the team tracked engram neurons for a full *month* after a memory was formed. What they discovered is electric: - One month after encoding, engram neurons have acquired a completely new chromatin landscape. - These chromatin changes are almost invisible at 7 days… but roar into existence by 28 days. - At recall, these engram cells don’t just “remember” better — they rewrite their entire transcriptional response. They preferentially fire up chromatin regulators, RNA processing machinery, and protein-turnover systems instead of simply boosting classic plasticity genes. In other words: the chromatin doesn’t just hold the memory of the past. It holds metaplastic instructions— rules that dictate how the neuron will respond the next time the memory is triggered. They call it chromatin metaplasticity. This is the “future tense of memory.” It is a massive deal 1. Memory is not just synapses. For 70+ years we’ve been obsessed with synaptic weights. This work proves the nucleus itself is a computational device that stores history-dependent rules. 2. It explains remote memory. The chromatin signature keeps maturing for weeks after the experience, perfectly matching the time course of systems consolidation into the cortex. 3. It’s energy-efficient genius. Instead of constantly maintaining memory proteins, the cell stores a silent, writable program that only activates when needed. Nature’s version of lazy evaluation. 4. It links development to adult memory. The late chromatin state is enriched for the exact same transcription-factor motifs used in embryonic development. Your adult brain is still running developmental software to lock in lifelong memories. 5. Huge therapeutic potential. If we can read or rewrite these chromatin metaplastic rules, we might one day boost failing remote memories in Alzheimer’s… or selectively dampen traumatic ones. This isn’t incremental. But a brand new layer of the memory code. And it explains WHY a person can receive memory from an organ transplant. It also explains generational traumas. Link: The future of neuroscience just got a lot more exciting and a lot more nuclear. Your chromatin is writing tomorrow’s memories today. And we finally have the first page of the instruction manual.

Brian Roemmele

45,345 Aufrufe • vor 1 Monat

Dropout by hand ✍️ ~ 10 steps walkthrough below Dropout is the simplest trick in deep learning that actually works: during training you randomly switch neurons off, so the network cannot lean on any one of them. It is two lines of code and almost nobody has worked through what those lines do to the numbers. So I drew and calculated one entirely by hand. Goal: train one pass through a small network with two dropout layers, then run inference with dropout switched off. The network: Linear(2,4), ReLU, Dropout(0.5), Linear(4,3), ReLU, Dropout(0.33), Linear(3,2). = 1. Given = A training set of two examples, X1 and X2, and the weight matrices for all three linear layers. = 2. Draw the first random numbers = Let us draw 4 random numbers, one per neuron in the first hidden layer. Above 0.5 we keep (◯), below we drop (╳). Here that gives [◯, ╳, ◯, ╳]. = 3. Build the first dropout matrix = We turn that pattern into a diagonal matrix. The scaling factor is 1/(1-p) = 2, so a kept neuron gets 2 and a dropped one gets 0. Multiplying by it does both jobs at once: it deletes the 2nd and 4th neurons and doubles the two that survive. = 4. Draw the second random numbers = Let us do it again for the 3 neurons in the next layer, this time against p = 0.33. The result is [◯, ◯, ╳]. = 5. Build the second dropout matrix = We set the diagonal to 1.5 where kept and 0 where dropped. Only the 3rd neuron goes. = 6. Feed forward = Let us run the whole thing top to bottom: one matrix multiplication per layer, ReLU setting the negatives to zero, and the two dropout matrices doing their work in between. The outputs Y come out at the bottom. = 7. MSE loss gradients = We compare Y against the targets Y', subtract, and multiply each element by 2. That is the whole gradient of the mean squared error. = 8. Update the weights = Let us push those gradients back through the network and update the weights (marked in light red). = 9. Deactivate dropout = Training is over, so we set both dropout matrices to the identity. Every neuron is back, and nothing is scaled. = 10. Feed forward again = One more pass, this time on unseen data, to make the prediction. You have just trained and run a network with dropout by hand. ✍️ The outputs: Training outputs Y = [-6, 9; 13, 4] Loss gradients = [-4, 4; 6, -2] Inference outputs = [13, 13; 4, 3] 💾 Save this post! #AIbyHand #Dropout #DeepLearning #NeuralNetworks

Tom Yeh

14,442 Aufrufe • vor 2 Monaten

Most people first see Euler’s Formula as a strange equation in a textbook. Then years later, they realize it quietly powers the modern world. Leonhard Euler discovered that these seemingly unrelated mathematical ideas: → exponential growth → imaginary numbers → sine waves → cosine waves → rotation … are all deeply connected through one identity: e^(iθ) = cos(θ) + i·sin(θ) At first glance it looks impossible. How can an exponential function suddenly produce circles and waves? The key insight is that multiplying by a complex exponential creates rotation. As the angle θ changes: - the cosine term tracks horizontal motion - the sine term tracks vertical motion - together they trace a perfect circle in the complex plane Euler showed that waves and rotation are mathematically the same phenomenon viewed differently. That single idea changed science and engineering forever. Today, Euler’s Formula sits underneath: → Fourier Transforms → signal processing → wireless communication → MRI scanners → quantum mechanics → electrical engineering → audio compression → radar systems → GPS → neural network frequency analysis Even modern AI systems indirectly rely on mathematics built on top of these foundations. The famous special case is Euler’s Identity: e^(iπ) + 1 = 0 Richard Feynman reportedly called it: "our jewel." Because it revealed that mathematics is not a collection of separate topics. It is one connected language describing reality itself.

Tech with Mak

25,504 Aufrufe • vor 4 Monaten

Backpropagation by hand ✍️ ~ 11 steps walkthrough below Backpropagation is the algorithm that actually trains a neural network, and it is where most people stop following along. It is not calculus you cannot do. It is matrix multiplication, working backward, one layer at a time. So I drew and calculated one entirely by hand. Goal: push the loss gradient back through a 3-layer network and land on a new value for every weight and bias. = 1. Given = A 3-layer perceptron, an input X, predictions Ypred = [0.5, 0.5, 0], and the truth Ytarget = [0, 1, 0]. = 2. Backprop gradient cells = Let us draw empty cells for every gradient we are about to compute. The shape of the answer comes first. = 3. Layer 3 softmax = We get dL/dz3 straight from Ypred minus Ytarget = [0.5, -0.5, 0]. No chain rule needed, and that shortcut is the whole reason softmax and cross-entropy are paired. = 4. Layer 3 weights and biases = Let us multiply dL/dz3 by [a2 | 1]. One multiplication gives the gradient for W3 and b3 together. = 5. Layer 2 activations = We multiply dL/dz3 by W3 to get dL/da2. The gradient moves back across a layer the same way the signal moved forward. = 6. Layer 2 ReLU = Let us pass it through the gate: keep the gradient where the activation was positive, zero it everywhere else. = 7. Layer 2 weights and biases = We multiply dL/dz2 by [a1 | 1]. The same figure as step 4, one layer up. = 8. Layer 1 activations = Let us multiply dL/dz2 by W2. = 9. Layer 1 ReLU = We apply the same gate again, now on a1. = 10. Layer 1 weights and biases = Let us multiply dL/dz1 by [x | 1], and every weight in the network now has a gradient. = 11. Update = We subtract, and the network has learned. In practice a learning rate scales this step. The gradients: dL/dz3 = [0.5, -0.5, 0] dL/da1 = [1, -2, 2, -1] dL/dz1 = [0, -2, 2, -1] The takeaway: matrix multiplication is all you need. Just like the forward pass, backpropagation is matrix multiplications end to end. You can do every one by hand, slowly and imperfectly, which is exactly why a GPU's ability to do them fast mattered so much to deep learning. 💾 Save this post!

Tom Yeh

962,430 Aufrufe • vor 2 Monaten