Video yükleniyor...

Video Yüklenemedi

Ana Sayfaya Dön

Softmax vs Sigmoid ✍️ Interact 👉 = Softmax = Softmax is how deep networks turn raw scores into a probability distribution — the final layer of every classifier, and the core of every attention head in a transformer. To see what it does, picture five boba tea shops on...

ProfTomYeh's profile picture

Tom Yeh

65,067 subscribers

74,410 görüntüleme • 3 ay önce •via X (Twitter)

LIVE

Anya Rossi• Live Now

Private livecam show

0 Yorum

Yorum bulunmuyor

Orijinal gönderinin yorumları burada görünecek

Benzer Videolar

ReLU vs Leaky ReLU 👉 = ReLU = ReLU is the default activation in modern deep learning — cheap to compute, and stable enough to train networks hundreds of layers deep. To see what it does, picture five boba tea shops on the same block — 𝚊, 𝚋, 𝚌, 𝚍, 𝚎 — each running their own books. Each value is a shop's monthly profit — receipts minus rent, ingredients, and wages. When profit is positive, the shop stays open and the owner pockets every dollar. When profit turns negative, the shop runs out of cash and shutters — the lights go off, the books are wiped to zero. ReLU is exactly that rule, applied one shop at a time. Read the diagram left to right. The first column is the raw value x — each shop's profit at month's end. The second column is the gate: 1 if the shop is open (x > 0), 0 if it has shuttered. The last column is the ReLU output: open shops pass their profit through untouched, while shuttered ones are zeroed out. Five rows means five parallel shops on the same block, each evaluated independently. That's why ReLU is called an element-wise activation: every neuron decides its own fate. = LeakyRelu = Plain ReLU wipes negative values to zero — clean, but a shop that shutters can never recover, since both its output and its gradient stay pinned at zero. This is the dying ReLU problem, and in deep networks it can quietly kill a meaningful fraction of the units. Leaky ReLU is the one-line fix: instead of shuttering, the shop files for Chapter 11 protection and keeps the lights on at reduced capacity. Its debt is restructured down to a fraction α (typically 0.1) — the rest is forgiven, and the shop is wounded, not killed. A small negative signal still flows through, so the gradient survives, and the shop can crawl back to life if a TikTok goes viral. Read the diagram left to right. The first column is the raw value x — each shop's profit at month's end. The second column is the leakage α — the fraction of the loss held over after restructuring (default 0.1, editable). The third column is the gate: 1 for shops still in the black, α for those operating under bankruptcy protection. The last column is the Leaky ReLU output: y = x · gate. Profitable shops pass through untouched; struggling ones shrink by a factor of α but still carry a sign. Five rows means five parallel shops, each evaluated independently. Like ReLU, this is an element-wise activation: every neuron's fate is decided on its own merits. #aibyhahd
0:18

ReLU vs Leaky ReLU 👉 = ReLU = ReLU is the default activation in modern deep learning — cheap to compute, and stable enough to train networks hundreds of layers deep. To see what it does, picture five boba tea shops on the same block — 𝚊, 𝚋, 𝚌, 𝚍, 𝚎 — each running their own books. Each value is a shop's monthly profit — receipts minus rent, ingredients, and wages. When profit is positive, the shop stays open and the owner pockets every dollar. When profit turns negative, the shop runs out of cash and shutters — the lights go off, the books are wiped to zero. ReLU is exactly that rule, applied one shop at a time. Read the diagram left to right. The first column is the raw value x — each shop's profit at month's end. The second column is the gate: 1 if the shop is open (x > 0), 0 if it has shuttered. The last column is the ReLU output: open shops pass their profit through untouched, while shuttered ones are zeroed out. Five rows means five parallel shops on the same block, each evaluated independently. That's why ReLU is called an element-wise activation: every neuron decides its own fate. = LeakyRelu = Plain ReLU wipes negative values to zero — clean, but a shop that shutters can never recover, since both its output and its gradient stay pinned at zero. This is the dying ReLU problem, and in deep networks it can quietly kill a meaningful fraction of the units. Leaky ReLU is the one-line fix: instead of shuttering, the shop files for Chapter 11 protection and keeps the lights on at reduced capacity. Its debt is restructured down to a fraction α (typically 0.1) — the rest is forgiven, and the shop is wounded, not killed. A small negative signal still flows through, so the gradient survives, and the shop can crawl back to life if a TikTok goes viral. Read the diagram left to right. The first column is the raw value x — each shop's profit at month's end. The second column is the leakage α — the fraction of the loss held over after restructuring (default 0.1, editable). The third column is the gate: 1 for shops still in the black, α for those operating under bankruptcy protection. The last column is the Leaky ReLU output: y = x · gate. Profitable shops pass through untouched; struggling ones shrink by a factor of α but still carry a sign. Five rows means five parallel shops, each evaluated independently. Like ReLU, this is an element-wise activation: every neuron's fate is decided on its own merits. #aibyhahd

Tom Yeh

32,561 görüntüleme • 4 ay önce

Transformer by hand ✍️ ~ 6 steps walkthrough below Open the hood of a transformer and the parts list is overwhelming: embeddings, positional encoding, attention weighting, self-attention, cross-attention, multi-head attention, layer norm, skip connections, softmax, linear, Nx, shifted right, query, key, value, masking. Which of those actually make the car run? Two of them. Attention weighting and the feed-forward network. Everything else is an enhancement to make it run faster and longer, which is how we got from a car to a truck, and to the word "large" in large language model. So I drew and calculated those two parts entirely by hand. Goal: push five features through one transformer block, filling in every cell yourself. 1. Given Five positions of input features, arriving from the previous block. 2. Attention matrix Let us feed all five features to a query-key module (QK) and read back an attention weight matrix, A. The details of that module are a post of their own. 3. Attention weighting We multiply the input features by A to get the attention weighted features, Z. Still five positions. The effect is to combine features *across positions*, horizontally: X1 becomes X1 + X2, X2 becomes X2 + X3, and so on. 4. First layer Let us feed all five weighted features into the first layer of the FFN. Multiply by the weights and biases. This time the combining happens *across feature dimensions*, vertically, and each feature grows from 3 numbers to 4. Note that every position goes through the same weight matrix. That is what "position-wise" means. 5. ReLU We cross out the negatives. They become zeros. 6. Second layer Let us bring it back down: 4 dimensions to 3. The output feeds the next block, which has a completely separate set of parameters, and the whole thing runs again. You have just calculated a transformer block by hand. ✍️ The takeaway: the two parts are doing two different jobs, and neither one alone is enough. Attention mixes *across positions*, so a feature can see its neighbours. The FFN mixes *across feature dimensions*, so each position can think about itself. Horizontal, then vertical. Then that pattern repeats N times, each block with its own separate set of weights. That is the Nx from the list up top, and that is what makes the transformer run. 💾 Save this post! #AIbyHand #Transformers #DeepLearning
0:12

Transformer by hand ✍️ ~ 6 steps walkthrough below Open the hood of a transformer and the parts list is overwhelming: embeddings, positional encoding, attention weighting, self-attention, cross-attention, multi-head attention, layer norm, skip connections, softmax, linear, Nx, shifted right, query, key, value, masking. Which of those actually make the car run? Two of them. Attention weighting and the feed-forward network. Everything else is an enhancement to make it run faster and longer, which is how we got from a car to a truck, and to the word "large" in large language model. So I drew and calculated those two parts entirely by hand. Goal: push five features through one transformer block, filling in every cell yourself. 1. Given Five positions of input features, arriving from the previous block. 2. Attention matrix Let us feed all five features to a query-key module (QK) and read back an attention weight matrix, A. The details of that module are a post of their own. 3. Attention weighting We multiply the input features by A to get the attention weighted features, Z. Still five positions. The effect is to combine features *across positions*, horizontally: X1 becomes X1 + X2, X2 becomes X2 + X3, and so on. 4. First layer Let us feed all five weighted features into the first layer of the FFN. Multiply by the weights and biases. This time the combining happens *across feature dimensions*, vertically, and each feature grows from 3 numbers to 4. Note that every position goes through the same weight matrix. That is what "position-wise" means. 5. ReLU We cross out the negatives. They become zeros. 6. Second layer Let us bring it back down: 4 dimensions to 3. The output feeds the next block, which has a completely separate set of parameters, and the whole thing runs again. You have just calculated a transformer block by hand. ✍️ The takeaway: the two parts are doing two different jobs, and neither one alone is enough. Attention mixes *across positions*, so a feature can see its neighbours. The FFN mixes *across feature dimensions*, so each position can think about itself. Horizontal, then vertical. Then that pattern repeats N times, each block with its own separate set of weights. That is the Nx from the list up top, and that is what makes the transformer run. 💾 Save this post! #AIbyHand #Transformers #DeepLearning

Tom Yeh

26,089 görüntüleme • 1 ay önce

MLP in PyTorch by hand ✍️ ~ 7 steps walkthrough below Goal: fill in every blank in the PyTorch code to build a multi-layer perceptron. 1. Given Let us start with a code template on the left and the network it is supposed to build on the right. Every blank in the code can be worked out from the picture. 2. Linear layer We count: 3 features in, 4 features out. So the weight matrix is 4 by 3. There is an extra column for the biases, which means bias = T. 3. ReLU Let us apply the activation. ReLU crosses out the negatives, so -1 becomes 0. 4. Linear layer The input size is 4, because that is what the previous layer put out. The output size is 2. A 2 by 4 weight matrix, and this time no extra column, so bias = F. 5. ReLU We cross out the negatives again. 6. Linear layer Two features in, five out. A 5 by 2 weight matrix, with a bias column, so bias = T. 7. Sigmoid Let us finish. Sigmoid squashes the raw scores (3, 0, -2, 5, -5) into probabilities between 0 and 1. You have just implemented a three-layer deep neural network by hand. ✍️ == Story == Three years ago I gave this exercise to my students, to connect the code to the math. They found it odd. Every other AI course they were taking lived inside a Jupyter notebook, and here I was handing out paper. Three years later, my colleagues are the ones rushing to move their materials to paper. The exercise has not changed. Paper still asks the one thing a notebook lets you skip: do you actually understand what the code is doing? If you can tell me why the weight matrix is 4 by 3, and why bias is F on the second layer, you understand nn.Linear better than someone who has been copy-pasting it for a year. 💾 Save this post! #AIbyHand #PyTorch #DeepLearning
0:14

MLP in PyTorch by hand ✍️ ~ 7 steps walkthrough below Goal: fill in every blank in the PyTorch code to build a multi-layer perceptron. 1. Given Let us start with a code template on the left and the network it is supposed to build on the right. Every blank in the code can be worked out from the picture. 2. Linear layer We count: 3 features in, 4 features out. So the weight matrix is 4 by 3. There is an extra column for the biases, which means bias = T. 3. ReLU Let us apply the activation. ReLU crosses out the negatives, so -1 becomes 0. 4. Linear layer The input size is 4, because that is what the previous layer put out. The output size is 2. A 2 by 4 weight matrix, and this time no extra column, so bias = F. 5. ReLU We cross out the negatives again. 6. Linear layer Two features in, five out. A 5 by 2 weight matrix, with a bias column, so bias = T. 7. Sigmoid Let us finish. Sigmoid squashes the raw scores (3, 0, -2, 5, -5) into probabilities between 0 and 1. You have just implemented a three-layer deep neural network by hand. ✍️ == Story == Three years ago I gave this exercise to my students, to connect the code to the math. They found it odd. Every other AI course they were taking lived inside a Jupyter notebook, and here I was handing out paper. Three years later, my colleagues are the ones rushing to move their materials to paper. The exercise has not changed. Paper still asks the one thing a notebook lets you skip: do you actually understand what the code is doing? If you can tell me why the weight matrix is 4 by 3, and why bias is F on the second layer, you understand nn.Linear better than someone who has been copy-pasting it for a year. 💾 Save this post! #AIbyHand #PyTorch #DeepLearning

Tom Yeh

13,318 görüntüleme • 1 ay önce

We removed 93.25% of the connections in our Un-0 image model, fully expecting to pay for it in quality. But it got better. FID 7.15 on ImageNet 64x64, roughly 1.9 ahead of the dense baseline at matched size. Same family of model, a fraction of the couplings, a better score. Here is why that is not as strange as it sounds. Un-0 is a coupled oscillator model, and in the dense version every oscillator talks to every other one. That sounds like a strength, but it means the whole system can fall into catastrophic synchronization: everything locks into step, gradients go flat, and learning stalls. Sparser connectivity leaves room for coherent and incoherent activity to coexist. The dynamics stay alive, and the model keeps learning. Connectivity turns out to be a control knob, not a dial you turn up until it stops. Learn more here:
0:12

We removed 93.25% of the connections in our Un-0 image model, fully expecting to pay for it in quality. But it got better. FID 7.15 on ImageNet 64x64, roughly 1.9 ahead of the dense baseline at matched size. Same family of model, a fraction of the couplings, a better score. Here is why that is not as strange as it sounds. Un-0 is a coupled oscillator model, and in the dense version every oscillator talks to every other one. That sounds like a strength, but it means the whole system can fall into catastrophic synchronization: everything locks into step, gradients go flat, and learning stalls. Sparser connectivity leaves room for coherent and incoherent activity to coexist. The dynamics stay alive, and the model keeps learning. Connectivity turns out to be a control knob, not a dial you turn up until it stops. Learn more here:

Unconventional AI

36,350 görüntüleme • 16 gün önce

🎉 Five Weeks, Five Free GSAP Resources! Hey everyone! We’re super excited to partner with Codrops and GSAP to celebrate the news that GSAP’s club plugins are now 100% free thanks to Webflow's support. To mark the occasion, we’ll be dropping one free GSAP resource every week for the next five weeks—each fully packaged as a Webflow clonable and a CodePen so you can plug it straight into your own projects. Each resource will feature at least one of those previously paid plugins, to hopefully spark some ideas and inspire your next interactive build. We’re kicking things off with a 'Glowing Interactive Dots Grid' powered by the InertiaPlugin. See how a simple dot matrix can come alive—glowing, springing, and rippling with realistic momentum under your cursor. Grab the CodePen or the Webflow cloneable, tweak the settings, and have a play with it! Sign up for our newsletter through the footer of our website to get all the free stuff in your inbox!
0:10

🎉 Five Weeks, Five Free GSAP Resources! Hey everyone! We’re super excited to partner with Codrops and GSAP to celebrate the news that GSAP’s club plugins are now 100% free thanks to Webflow's support. To mark the occasion, we’ll be dropping one free GSAP resource every week for the next five weeks—each fully packaged as a Webflow clonable and a CodePen so you can plug it straight into your own projects. Each resource will feature at least one of those previously paid plugins, to hopefully spark some ideas and inspire your next interactive build. We’re kicking things off with a 'Glowing Interactive Dots Grid' powered by the InertiaPlugin. See how a simple dot matrix can come alive—glowing, springing, and rippling with realistic momentum under your cursor. Grab the CodePen or the Webflow cloneable, tweak the settings, and have a play with it! Sign up for our newsletter through the footer of our website to get all the free stuff in your inbox!

Osmo

13,494 görüntüleme • 1 yıl önce

Self Attention vs Cross Attention by hand ✍️ Resize the matrices yourself 👉 Two attention mechanisms, side by side. Both project X into queries; both compute attention via S = Kᵀ × Q and F = V × A. The only difference is the source of K and V. Self attention uses X for everything. Q, K, and V all come from projecting X. Each X token attends to every other X token. The score matrix S is square — 128 × 128. Cross attention uses X for queries and a second sequence E for keys and values. Each X token attends to every E token instead. The score matrix S is rectangular — 64 × 128. Notice what's shared and what's not: X is the same in both — same 36 × 128 input. Q and K share the 16 dimension — that's what makes the dot product Kᵀ × Q valid in either case. V dimensions are independent: self-attention uses 12, cross-attention uses 12. The choice doesn't depend on which mechanism you're using; it depends on what output dimension your downstream layer expects.
0:18

Self Attention vs Cross Attention by hand ✍️ Resize the matrices yourself 👉 Two attention mechanisms, side by side. Both project X into queries; both compute attention via S = Kᵀ × Q and F = V × A. The only difference is the source of K and V. Self attention uses X for everything. Q, K, and V all come from projecting X. Each X token attends to every other X token. The score matrix S is square — 128 × 128. Cross attention uses X for queries and a second sequence E for keys and values. Each X token attends to every E token instead. The score matrix S is rectangular — 64 × 128. Notice what's shared and what's not: X is the same in both — same 36 × 128 input. Q and K share the 16 dimension — that's what makes the dot product Kᵀ × Q valid in either case. V dimensions are independent: self-attention uses 12, cross-attention uses 12. The choice doesn't depend on which mechanism you're using; it depends on what output dimension your downstream layer expects.

Tom Yeh

61,300 görüntüleme • 4 ay önce

How to make near-unfair progress in the gym: - 4 to 6 reps, heavy, to failure or one off it - Add weight before you add anything else - Same handful of lifts, week after week, going up - Rest three minutes so the next set is actually hard - Chase the number in the logbook, never the pump - Five lifts, out in under an hour - Two proper rest days a week, minimum - Hit each muscle two or three times over the week, not once into the ground - Eat the animal, especially the fat - Get your protein up and your fussiness down - Sleep like it is part of the programme, because it is Do this and you'll be the person others quietly wonder about in a year. Boringly simple, and almost nobody has the patience to be this unimpressive for long enough.
0:17

How to make near-unfair progress in the gym: - 4 to 6 reps, heavy, to failure or one off it - Add weight before you add anything else - Same handful of lifts, week after week, going up - Rest three minutes so the next set is actually hard - Chase the number in the logbook, never the pump - Five lifts, out in under an hour - Two proper rest days a week, minimum - Hit each muscle two or three times over the week, not once into the ground - Eat the animal, especially the fat - Get your protein up and your fussiness down - Sleep like it is part of the programme, because it is Do this and you'll be the person others quietly wonder about in a year. Boringly simple, and almost nobody has the patience to be this unimpressive for long enough.

Sama Hoole

102,095 görüntüleme • 1 ay önce

Batch Normalization by hand ✍️ ~ 7 steps walkthrough below Batch normalization is common practice for improving training and achieving faster convergence. It sounds simple. But it is often misunderstood. 🤔 Does batch normalization involve trainable parameters, tunable hyper-parameters, or both? 🤔 Is batch normalization applied to inputs, features, weights, biases, or outputs? 🤔 How is batch normalization different from layer normalization? So I drew and calculated one entirely by hand. Goal: normalize a mini-batch of 4 examples to mean 0 and variance 1, then let the network scale it back. = 1. Given = A mini-batch of 4 training examples, each with 3 features. = 2. Linear layer = Let us multiply by the weights and add the biases. Batch norm sits after this, which answers the second question: what gets normalized is features, not inputs, weights or biases. = 3. ReLU = We apply the activation, and -2 becomes 0. Negative values are suppressed before any statistic is taken. = 4. Batch statistics = Let us compute the sum, mean, variance and standard deviation, one row at a time. A row is a feature and the four columns are the four examples, so every number here measures one feature against the rest of the batch. That is the "batch" in batch normalization, and it is exactly what layer normalization does not do. The statistics are rounded to whole numbers, which is what keeps the rest of the page doable in pen. = 5. Shift to mean 0 = We subtract the mean, in green. The four values in each feature now average to zero. = 6. Scale to variance 1 = Let us divide by the standard deviation, in orange. Each feature now has variance one, whatever scale it arrived at. = 7. Scale and shift = We multiply by a linear transformation and pass the result on. The diagonal and the last column are trainable, so having just forced every feature to mean 0 and variance 1, we hand the network the means to undo it. The outputs: Mean of each feature = [2, 1, 2] Std dev of each feature = [1, 1, 2] To the next layer = [2, -2, 2, 0], [-3, 3, 6, -3], [2, 0, 1, 2] The answers: 🤔 Both. The scale and shift are trainable, the statistics are not. Epsilon and the momentum on the running statistics are the hyper-parameters, and one mini-batch by hand needs neither. 🤔 Features, after the linear layer, not inputs, weights or biases. 🤔 Batch norm measures across the batch, one feature at a time. Layer norm measures across the features, one example at a time. 💾 Save this post!
0:17

Batch Normalization by hand ✍️ ~ 7 steps walkthrough below Batch normalization is common practice for improving training and achieving faster convergence. It sounds simple. But it is often misunderstood. 🤔 Does batch normalization involve trainable parameters, tunable hyper-parameters, or both? 🤔 Is batch normalization applied to inputs, features, weights, biases, or outputs? 🤔 How is batch normalization different from layer normalization? So I drew and calculated one entirely by hand. Goal: normalize a mini-batch of 4 examples to mean 0 and variance 1, then let the network scale it back. = 1. Given = A mini-batch of 4 training examples, each with 3 features. = 2. Linear layer = Let us multiply by the weights and add the biases. Batch norm sits after this, which answers the second question: what gets normalized is features, not inputs, weights or biases. = 3. ReLU = We apply the activation, and -2 becomes 0. Negative values are suppressed before any statistic is taken. = 4. Batch statistics = Let us compute the sum, mean, variance and standard deviation, one row at a time. A row is a feature and the four columns are the four examples, so every number here measures one feature against the rest of the batch. That is the "batch" in batch normalization, and it is exactly what layer normalization does not do. The statistics are rounded to whole numbers, which is what keeps the rest of the page doable in pen. = 5. Shift to mean 0 = We subtract the mean, in green. The four values in each feature now average to zero. = 6. Scale to variance 1 = Let us divide by the standard deviation, in orange. Each feature now has variance one, whatever scale it arrived at. = 7. Scale and shift = We multiply by a linear transformation and pass the result on. The diagonal and the last column are trainable, so having just forced every feature to mean 0 and variance 1, we hand the network the means to undo it. The outputs: Mean of each feature = [2, 1, 2] Std dev of each feature = [1, 1, 2] To the next layer = [2, -2, 2, 0], [-3, 3, 6, -3], [2, 0, 1, 2] The answers: 🤔 Both. The scale and shift are trainable, the statistics are not. Epsilon and the momentum on the running statistics are the hyper-parameters, and one mini-batch by hand needs neither. 🤔 Features, after the linear layer, not inputs, weights or biases. 🤔 Batch norm measures across the batch, one feature at a time. Layer norm measures across the features, one example at a time. 💾 Save this post!

Tom Yeh

20,848 görüntüleme • 1 ay önce

Shadow traffic proves a candidate is operationally sound. It can't tell you if users like it better. A/B testing belongs at the endpoint, not in your app code. Same endpoint name, API, and keys for your clients. No feature flags, no hash-mod-100 in client code, no spreadsheet explaining what group A vs B means. Split a live endpoint's traffic into one control and up to 20 variants, each with a fixed percentage. Ramp with a single call. Delete the experiment and 100% of traffic returns to the control, with nothing left to unwind. Read the full walkthrough:
0:15

Shadow traffic proves a candidate is operationally sound. It can't tell you if users like it better. A/B testing belongs at the endpoint, not in your app code. Same endpoint name, API, and keys for your clients. No feature flags, no hash-mod-100 in client code, no spreadsheet explaining what group A vs B means. Split a live endpoint's traffic into one control and up to 20 variants, each with a fixed percentage. Ramp with a single call. Delete the experiment and 100% of traffic returns to the control, with nothing left to unwind. Read the full walkthrough:

Together AI

15,317 görüntüleme • 11 gün önce

[Graph Convolutional Network] by hand ✍️ Graph Convolutional Networks (GCNs), introduced by Thomas Kipf and Max Welling in 2017, have emerged as a powerful tool in the analysis and interpretation of data structured as graphs. This exercise demonstrates how GCN works in a simple application: binary classification. -- Goal -- Predict if a node in a graph is X. -- Architecture -- 🟪 Graph Convolutional Network (GCN) 1. GCN1(4,3) 2. GCN2(3,3) 🟦 Fully Connected Network (FCN) 1. Linear1(3,5) 2. ReLU 3. Linear2(5,1) 4. Sigmoid Simplications: • Adjacent matrices are not normalized. • ReLU is applied to messages directly. -- Walkthrough -- [1] Given ↳ A graph with five nodes A, B, C, D, E [2] 🟩 Adjacency Matrix: Neighbors ↳ Add 1 for each edge to neighbors ↳ Repeat in both directions (e.g., A->C, C->A) ↳ Repeat for both GCN layers [3] 🟩 Adjacency Matrix: Self ↳ Add 1's for each self loop ↳ Equivalent to adding the identity matrix ↳ Repeat for both GCN layers [4] 🟪 GCN1: Messages ↳ Multiply the node embeddings 🟨 with weights and biases ↳ Apply ReLU (negatives → 0) ↳ The result is one message per node [5] 🟪 GCN1: Pooling ↳ Multiply the messages with the adjacent matrix ↳ The purpose is the pool messages from each node's neighbors as well as from the node itself. ↳ The result is a new feature per node [6] 🟪 GCN1: Visualize ↳ For node 1, visualize how messages are pooled to obtain a new feature for better understanding ↳ [3,0,1] + [1,0,0] = [4,0,1] [7] 🟪 GCN2: Messages ↳ Multiply the node features with weights and biases ↳ Apply ReLU (negatives → 0) ↳ The result is one message per node [8] 🟪 GCN2: Pooling ↳ Multiply the messages with the adjacent matrix ↳ The result is a new feature per node [9] 🟪 GCN2: Visualize ↳ For node 3, visualize how messages are pooled to obtain a new feature for better understanding ↳ [1,2,4] + [1,3,5] + [0,0,1] = [2,5,10] [10] 🟦 FCN: Linear 1 + ReLU ↳ Multiply node features with weights and biases ↳ Apply ReLU (negatives → 0) ↳ The result is a new feature per node ↳ Unlike in GCN layers, no messages from other nodes are included. [11] 🟦 FCN: Linear 2 ↳ Multiply node features with weights and biases [12] 🟦 FCN: Sigmoid ↳ Apply the Sigmoid activation function ↳ The purpose is to obtain a probability value for each node ↳ One way to calculate Sigmoid by hand ✍️ is to use the approximation below: • >= 3 → 1 • 0 → 0.5 • <= -3 → 0 -- Outputs -- A: 0 (Very unlikely) B: 1 (Very likely) C: 1 (Very likely) D: 1 (Very likely) E: 0.5 (Neutral)
0:12

[Graph Convolutional Network] by hand ✍️ Graph Convolutional Networks (GCNs), introduced by Thomas Kipf and Max Welling in 2017, have emerged as a powerful tool in the analysis and interpretation of data structured as graphs. This exercise demonstrates how GCN works in a simple application: binary classification. -- Goal -- Predict if a node in a graph is X. -- Architecture -- 🟪 Graph Convolutional Network (GCN) 1. GCN1(4,3) 2. GCN2(3,3) 🟦 Fully Connected Network (FCN) 1. Linear1(3,5) 2. ReLU 3. Linear2(5,1) 4. Sigmoid Simplications: • Adjacent matrices are not normalized. • ReLU is applied to messages directly. -- Walkthrough -- [1] Given ↳ A graph with five nodes A, B, C, D, E [2] 🟩 Adjacency Matrix: Neighbors ↳ Add 1 for each edge to neighbors ↳ Repeat in both directions (e.g., A->C, C->A) ↳ Repeat for both GCN layers [3] 🟩 Adjacency Matrix: Self ↳ Add 1's for each self loop ↳ Equivalent to adding the identity matrix ↳ Repeat for both GCN layers [4] 🟪 GCN1: Messages ↳ Multiply the node embeddings 🟨 with weights and biases ↳ Apply ReLU (negatives → 0) ↳ The result is one message per node [5] 🟪 GCN1: Pooling ↳ Multiply the messages with the adjacent matrix ↳ The purpose is the pool messages from each node's neighbors as well as from the node itself. ↳ The result is a new feature per node [6] 🟪 GCN1: Visualize ↳ For node 1, visualize how messages are pooled to obtain a new feature for better understanding ↳ [3,0,1] + [1,0,0] = [4,0,1] [7] 🟪 GCN2: Messages ↳ Multiply the node features with weights and biases ↳ Apply ReLU (negatives → 0) ↳ The result is one message per node [8] 🟪 GCN2: Pooling ↳ Multiply the messages with the adjacent matrix ↳ The result is a new feature per node [9] 🟪 GCN2: Visualize ↳ For node 3, visualize how messages are pooled to obtain a new feature for better understanding ↳ [1,2,4] + [1,3,5] + [0,0,1] = [2,5,10] [10] 🟦 FCN: Linear 1 + ReLU ↳ Multiply node features with weights and biases ↳ Apply ReLU (negatives → 0) ↳ The result is a new feature per node ↳ Unlike in GCN layers, no messages from other nodes are included. [11] 🟦 FCN: Linear 2 ↳ Multiply node features with weights and biases [12] 🟦 FCN: Sigmoid ↳ Apply the Sigmoid activation function ↳ The purpose is to obtain a probability value for each node ↳ One way to calculate Sigmoid by hand ✍️ is to use the approximation below: • >= 3 → 1 • 0 → 0.5 • <= -3 → 0 -- Outputs -- A: 0 (Very unlikely) B: 1 (Very likely) C: 1 (Very likely) D: 1 (Very likely) E: 0.5 (Neutral)

Tom Yeh

46,779 görüntüleme • 2 yıl önce

whoever leaked this has bigger balls than sense Google Research and MIT ran the same agent jobs 260 different ways for Nature last month: they held the prompts, the tools and the compute budget identical and moved nothing but the wiring between the agents, and the same work swung from 70% worse than a single agent to 80.8% better, averaging out at 0.0% i ran my own single agent against the task list first and it cleared 6 of 10 alone, already past the line where a crew starts subtracting this is Graph Engineering, the layer that decides whether a crew is worth 80% more or 70% less, and it installs into the agent you already pay for: - score your solo agent on the real task first: above roughly 45% success that study predicts zero to negative returns from any crew you put around it - under that line, put one supervisor over the fan out: crews with no correction step amplified their own errors to 17.2x the single agent rate, supervised aggregation held it to 4.4x - give every worker one output and let none of them read a peer's draft, so a wrong step reaches the supervisor instead of four other agents - run the comparison again after every model upgrade, because a better model raises your baseline and a higher baseline is what makes a crew stop paying - keep the single agent alive as the control, the only number that says the wiring is earning its calls turns out the shape does not travel: the biggest win came off a finance task under one supervisor and the worst collapse off a planning task with independent agents my position, and it is the arguable one: a crew is a bet on your own diagram, and the model you pick moves that bet less than one arrow does bookmark this, the three moves that draw those arrows before you pay for one extra call are in the post below ↓
0:15

whoever leaked this has bigger balls than sense Google Research and MIT ran the same agent jobs 260 different ways for Nature last month: they held the prompts, the tools and the compute budget identical and moved nothing but the wiring between the agents, and the same work swung from 70% worse than a single agent to 80.8% better, averaging out at 0.0% i ran my own single agent against the task list first and it cleared 6 of 10 alone, already past the line where a crew starts subtracting this is Graph Engineering, the layer that decides whether a crew is worth 80% more or 70% less, and it installs into the agent you already pay for: - score your solo agent on the real task first: above roughly 45% success that study predicts zero to negative returns from any crew you put around it - under that line, put one supervisor over the fan out: crews with no correction step amplified their own errors to 17.2x the single agent rate, supervised aggregation held it to 4.4x - give every worker one output and let none of them read a peer's draft, so a wrong step reaches the supervisor instead of four other agents - run the comparison again after every model upgrade, because a better model raises your baseline and a higher baseline is what makes a crew stop paying - keep the single agent alive as the control, the only number that says the wiring is earning its calls turns out the shape does not travel: the biggest win came off a finance task under one supervisor and the worst collapse off a planning task with independent agents my position, and it is the arguable one: a crew is a bet on your own diagram, and the model you pick moves that bet less than one arrow does bookmark this, the three moves that draw those arrows before you pay for one extra call are in the post below ↓

Argona

889,668 görüntüleme • 15 gün önce

SOMEONE VIBE CODED AN APP THAT TURNS ANY PHOTO INTO A REAL PHYSICAL STAMP YOU CAN ORDER you snap a photo, it cuts it into a clean stamp design, and you can order the actual physical stamp to press onto anything. > take or upload any photo or image > it turns it into a proper stamp design automatically > all your designs are saved and sorted by date, so you can go back to any of them > order the real physical stamp right from the app and it ships to you > press it onto letters, packaging, cards, whatever you want so instead of paying a custom shop and waiting, you make your own stamp from a photo in a couple taps, then order it without ever leaving the app. the whole thing is dead simple and does one thing well, which is exactly why people love it
0:19

SOMEONE VIBE CODED AN APP THAT TURNS ANY PHOTO INTO A REAL PHYSICAL STAMP YOU CAN ORDER you snap a photo, it cuts it into a clean stamp design, and you can order the actual physical stamp to press onto anything. > take or upload any photo or image > it turns it into a proper stamp design automatically > all your designs are saved and sorted by date, so you can go back to any of them > order the real physical stamp right from the app and it ships to you > press it onto letters, packaging, cards, whatever you want so instead of paying a custom shop and waiting, you make your own stamp from a photo in a couple taps, then order it without ever leaving the app. the whole thing is dead simple and does one thing well, which is exactly why people love it

Om Patel

100,110 görüntüleme • 1 ay önce

⚽️ Cutback Small Sided Game 🗣️ This is a practice from drill library. This small-sided game is played with 4v4 teams and 4 neutral players positioned at the 4 corners of the grid, known as the 'cutback' zones. The objective is to score 1 goal to win the game. After each goal, the losing team will switch with the neutral players, ensuring that both teams get equal opportunities in different roles. The neutral players are restricted to 1 touch, and the team in possession is encouraged to use them to create goal-scoring chances through quick cutbacks, crosses, or switching the play. The attacking team should aim to exploit the neutral zones to stretch the defense, pull defenders out of position, and open up space for a final delivery into the box. The defenders will need to be aware of their positioning and try to prevent passes into the neutral zones by maintaining close coverage on their opponents.
0:16

⚽️ Cutback Small Sided Game 🗣️ This is a practice from drill library. This small-sided game is played with 4v4 teams and 4 neutral players positioned at the 4 corners of the grid, known as the 'cutback' zones. The objective is to score 1 goal to win the game. After each goal, the losing team will switch with the neutral players, ensuring that both teams get equal opportunities in different roles. The neutral players are restricted to 1 touch, and the team in possession is encouraged to use them to create goal-scoring chances through quick cutbacks, crosses, or switching the play. The attacking team should aim to exploit the neutral zones to stretch the defense, pull defenders out of position, and open up space for a final delivery into the box. The defenders will need to be aware of their positioning and try to prevent passes into the neutral zones by maintaining close coverage on their opponents.

The Coaches Zone

27,045 görüntüleme • 1 yıl önce

[Discrete Fourier Transform] by Hand ✍️ In signal processing, the Discrete Fourier Transform (DFT) is no doubt the most important method. But the math involved is extremely complex, literally, involving a summation over a complex number term e^(-iwt). I developed this exercise to demonstrate that underneath such complexity, DFT is just a series of matrix multiplications you can calculate by hand. ✍️ Once you see that, it should not surprise you that a deep neural network, which is also a series of matrix multiplications, with activation functions in-between, can learn to perform DFT to process and analyze signals so effectively. How does DFT work? [1] Given ↳ Signals A, B, and C in the 🟧 frequency domain: ◦ A = cos(w) + 2cos(2w) ◦ B = cos(w) + cos(3w) + cos(4w) ◦ C = -cos(2w) + cos(3w) ◦ Each signal is a weighed sum of four cosine waves at frequencies 1w, 2w, 3w, and 4w. ◦ We will apply Inverse DFT to convert the signals to time domain representations, and then demonstrate DFT can convert back to their original frequency domain representations. ↳ Signal X in the 🟩 time domain. X is sampled at 10 time points 1t, 2t, …, 10t: ◦ X = [-2.5, -1.8, 3, -0.7, -1.0, -0.7, 3, -1.8, -2.5, 5] ◦ Suppose X is also a weighted sum of the same four cosine waves, but we don’t already know their weights. We will apply DFT to discover them. [2] 🟧 Frequency Matrix (F) ↳ Write the coefficients of A, B, C as a matrix F. Each signal is a row. Each frequency is a column. ↳ A → [1, 2, 0, 0] ↳ B → [1, 0, 1, 1] ↳ C → [0, 1-, 1, 0] [3] Cosine → Discrete ↳ Sample from the continuous cosine waves at discrete time points 1t, 2t, 3t, to 10t. [4] Cosine Matrix (W) ↳ Write the samples as a matrix, Each frequency is a row. Each time point is a column. [5] Inverse DFT: 🟧 Frequency → 🟩 Time ↳ Multiply the frequency matrix F and the cosine matrix W. ↳ The meaning of this multiplication is to linearly combine the four cosine waves (rows in W) into time-domain signals (rows in T) using the weights specified in F. ↳ The result is matrix T, which are signals A, B, C converted to the time domain. Each signal is a row. Each time point is a column. [6] Transpose ↳ Transpose T, converting each signal’s time domain representation from a row to a column. [7] DFT: 🟩 Time → 🟧 Frequency ↳ Multiply the cosine matrix W with the transpose of matrix T. ↳ The purpose of this multiplication is to take a dot-product between each time-domain signal (columns in the transpose of T) and each cosine wave (rows in W), which has the effect of projecting the signal onto a cosine wave to determine how much they are correlated. Zero means not correlated at all. ↳ The result is an intermediate version of the “recovered” frequency matrix where each column corresponds to a signal and each row corresponds to a frequency. ↳ Compared to the original frequency matrix F, this intermediate matrix has non-zero weights in the correct places, but scaled up by a factor of 5 (n/2, n=10). For example, signal A, originally [1,2,0,0], is recovered at [5,10,0,0]. [8] Scale ↳ Multiply each value by 2/n = 1/5 to scale down the intermediate matrix to match the magnitude of the original frequency matrix F. [9] Transpose ↳ Transpose the recovered frequency matrix back to the same orientation of the original frequency matrix F. ↳ Like magic 🪄, the result is identical to the original F, which means DFT successfully recovered the frequency components of signals A, B, C. [10] Apply DFT to X: 🟩 Time → 🟧 Frequency ↳ Now that we have some confidence in DFT’s ability to recover frequency components, we apply DFT to X’s time-domain representation by multiplying W with X. ↳ The result is the an intermediate matrix. [11] Scale ↳ Similarly, we scale down by a factor of 5 to obtain the recovered frequency components of X (a column). [12] Transpose ↳ Similarly, we transpose the recovered column to row to match the orientation of the frequency matrix. ↳ Using the coefficients [0,0,3,2], we can write the equation of X as 3cos(3w) + 2cos(4w). Notes: I hope this by hand exercise helps you understand the essence of DFT. But there is more technical details, such as: • Sine: The complete DFT math also includes sine waves that follow a similar calculation process. • Phase: Here, we assume all the cosine waves are aligned at the origin, namely, phase is 0. If a phase p is added, for example, cos(w+p), we will need to calculate the sine component and use their ratio to figure out what p is. • Magnitude: If phase is not zero, the magnitude will need to be calculated by combining both cosine and sine terms.
0:12

[Discrete Fourier Transform] by Hand ✍️ In signal processing, the Discrete Fourier Transform (DFT) is no doubt the most important method. But the math involved is extremely complex, literally, involving a summation over a complex number term e^(-iwt). I developed this exercise to demonstrate that underneath such complexity, DFT is just a series of matrix multiplications you can calculate by hand. ✍️ Once you see that, it should not surprise you that a deep neural network, which is also a series of matrix multiplications, with activation functions in-between, can learn to perform DFT to process and analyze signals so effectively. How does DFT work? [1] Given ↳ Signals A, B, and C in the 🟧 frequency domain: ◦ A = cos(w) + 2cos(2w) ◦ B = cos(w) + cos(3w) + cos(4w) ◦ C = -cos(2w) + cos(3w) ◦ Each signal is a weighed sum of four cosine waves at frequencies 1w, 2w, 3w, and 4w. ◦ We will apply Inverse DFT to convert the signals to time domain representations, and then demonstrate DFT can convert back to their original frequency domain representations. ↳ Signal X in the 🟩 time domain. X is sampled at 10 time points 1t, 2t, …, 10t: ◦ X = [-2.5, -1.8, 3, -0.7, -1.0, -0.7, 3, -1.8, -2.5, 5] ◦ Suppose X is also a weighted sum of the same four cosine waves, but we don’t already know their weights. We will apply DFT to discover them. [2] 🟧 Frequency Matrix (F) ↳ Write the coefficients of A, B, C as a matrix F. Each signal is a row. Each frequency is a column. ↳ A → [1, 2, 0, 0] ↳ B → [1, 0, 1, 1] ↳ C → [0, 1-, 1, 0] [3] Cosine → Discrete ↳ Sample from the continuous cosine waves at discrete time points 1t, 2t, 3t, to 10t. [4] Cosine Matrix (W) ↳ Write the samples as a matrix, Each frequency is a row. Each time point is a column. [5] Inverse DFT: 🟧 Frequency → 🟩 Time ↳ Multiply the frequency matrix F and the cosine matrix W. ↳ The meaning of this multiplication is to linearly combine the four cosine waves (rows in W) into time-domain signals (rows in T) using the weights specified in F. ↳ The result is matrix T, which are signals A, B, C converted to the time domain. Each signal is a row. Each time point is a column. [6] Transpose ↳ Transpose T, converting each signal’s time domain representation from a row to a column. [7] DFT: 🟩 Time → 🟧 Frequency ↳ Multiply the cosine matrix W with the transpose of matrix T. ↳ The purpose of this multiplication is to take a dot-product between each time-domain signal (columns in the transpose of T) and each cosine wave (rows in W), which has the effect of projecting the signal onto a cosine wave to determine how much they are correlated. Zero means not correlated at all. ↳ The result is an intermediate version of the “recovered” frequency matrix where each column corresponds to a signal and each row corresponds to a frequency. ↳ Compared to the original frequency matrix F, this intermediate matrix has non-zero weights in the correct places, but scaled up by a factor of 5 (n/2, n=10). For example, signal A, originally [1,2,0,0], is recovered at [5,10,0,0]. [8] Scale ↳ Multiply each value by 2/n = 1/5 to scale down the intermediate matrix to match the magnitude of the original frequency matrix F. [9] Transpose ↳ Transpose the recovered frequency matrix back to the same orientation of the original frequency matrix F. ↳ Like magic 🪄, the result is identical to the original F, which means DFT successfully recovered the frequency components of signals A, B, C. [10] Apply DFT to X: 🟩 Time → 🟧 Frequency ↳ Now that we have some confidence in DFT’s ability to recover frequency components, we apply DFT to X’s time-domain representation by multiplying W with X. ↳ The result is the an intermediate matrix. [11] Scale ↳ Similarly, we scale down by a factor of 5 to obtain the recovered frequency components of X (a column). [12] Transpose ↳ Similarly, we transpose the recovered column to row to match the orientation of the frequency matrix. ↳ Using the coefficients [0,0,3,2], we can write the equation of X as 3cos(3w) + 2cos(4w). Notes: I hope this by hand exercise helps you understand the essence of DFT. But there is more technical details, such as: • Sine: The complete DFT math also includes sine waves that follow a similar calculation process. • Phase: Here, we assume all the cosine waves are aligned at the origin, namely, phase is 0. If a phase p is added, for example, cos(w+p), we will need to calculate the sine component and use their ratio to figure out what p is. • Magnitude: If phase is not zero, the magnitude will need to be calculated by combining both cosine and sine terms.

Tom Yeh

116,622 görüntüleme • 2 yıl önce

This seems like it would be on an episode of “I Shouldn’t Be Alive,” you and your friend go to the mall to get a nice outfit for an outing later. The department you need to go to is on the second floor, so you and your friend decide it would be quicker to go on the escalator. All of a sudden as you are approaching the middle of the escalator, you hear the escalator come to a screeching halt. You and your friend are now stranded in the middle of the escalator. Every second counts, it’s been two hours now since you’ve had food or water since you e been stuck on the escalator and time is ticking, do you risk an escape plan?
0:10

This seems like it would be on an episode of “I Shouldn’t Be Alive,” you and your friend go to the mall to get a nice outfit for an outing later. The department you need to go to is on the second floor, so you and your friend decide it would be quicker to go on the escalator. All of a sudden as you are approaching the middle of the escalator, you hear the escalator come to a screeching halt. You and your friend are now stranded in the middle of the escalator. Every second counts, it’s been two hours now since you’ve had food or water since you e been stuck on the escalator and time is ticking, do you risk an escape plan?

SonnyBoy🇺🇸

65,772 görüntüleme • 7 ay önce

If order to hit a big league fastball your brain needs to decide to pull the trigger roughly 25 feet from the ball reaching the plate…. In order to do that, your eyes must be oriented at a spot 25 feet to your left for a righty or 25 feet to your right if you are a lefty…. This begs the question what is the point of hitting off of a tee?…The body will never work the same vs a live ball…. Look how different Mike Trout looks when hitting off of a tee vs hitting a live ball…Watch his left arm and left shoulder do completely different things. The right forearm supinates vs an overhand pitch but it pronates vs the tee…. It’s a function of where the biceps inserts onto the radius. There isn’t a hitter on earth that will use the same swing mechanics off of a tee as they will vs an overhand pitch.
0:16

If order to hit a big league fastball your brain needs to decide to pull the trigger roughly 25 feet from the ball reaching the plate…. In order to do that, your eyes must be oriented at a spot 25 feet to your left for a righty or 25 feet to your right if you are a lefty…. This begs the question what is the point of hitting off of a tee?…The body will never work the same vs a live ball…. Look how different Mike Trout looks when hitting off of a tee vs hitting a live ball…Watch his left arm and left shoulder do completely different things. The right forearm supinates vs an overhand pitch but it pronates vs the tee…. It’s a function of where the biceps inserts onto the radius. There isn’t a hitter on earth that will use the same swing mechanics off of a tee as they will vs an overhand pitch.

Prehension Athletics

24,813 görüntüleme • 6 ay önce

A guy fed 4.2M expired US patents to Claude and found 6 products nobody manufactures anymore. p.s first one is already in production Every expired patent becomes public. All 4.2M of them are written in legal language nobody actually reads. He asked Claude to process the entire database and score each patent by its attractiveness. All the research, all the problems, all the solutions already documented, someone already paid for that. Just pick the best one and start cooking. Here's how it works: > Python scraper pulls expired patents from USPTO > converts docs to clean Markdown > scores each one 1-10 on viability > applies a filter: score 7+ only > only 1 in 80 selects It found 6 products in 3 weeks and the first one is already generating a profit. how many of those 4.2M are still waiting for you?
0:11

A guy fed 4.2M expired US patents to Claude and found 6 products nobody manufactures anymore. p.s first one is already in production Every expired patent becomes public. All 4.2M of them are written in legal language nobody actually reads. He asked Claude to process the entire database and score each patent by its attractiveness. All the research, all the problems, all the solutions already documented, someone already paid for that. Just pick the best one and start cooking. Here's how it works: > Python scraper pulls expired patents from USPTO > converts docs to clean Markdown > scores each one 1-10 on viability > applies a filter: score 7+ only > only 1 in 80 selects It found 6 products in 3 weeks and the first one is already generating a profit. how many of those 4.2M are still waiting for you?

Spivach

11,704 görüntüleme • 4 ay önce

PSA: $NAM Airdrop 🪂 - only a few hours left ➡️Claim closes on: 12th of Jan 2024, at 9am ➡️ The _ONLY_ place to claim ➡️Allocations have been adjusted recently - check if you have claimed to see if your number went up! ➡️US is sadly geoblocked 🔸Eligibility and How to Claim reminder ➡️ $OSMO snapshot: mainnet block 12146298 ➡️ $ATOM snapshots: block 17660694 (the last blocks before 1st of November 2023). To be eligible you need to have at least $100 USD staked ➡️In $OSMO: 280 $OSMO ➡️In $ATOM: 12.786667 $ATOM Beyond staking every account gets an Activity Score. The TLDR; of this scoring method is that it measures the engagement of the account on a decentralized network. The specific framework used in the RPGF Drop is an adaptation from Trusta AI ' Media Score, and was first introduced by Celestia on the Genesis Drop. Based on the mechanism, the score can be a minimum of 1.5 and a maximum of 15. The Activity Score is a points system that takes into account activity such as transactions, ibc transfers, the value of transactions, months active, etc. (the scoring details are linked in the announcement). The maximum points you can get on the Activity Score is 15. To determine the tier, the amount staked at the time is multiplied by the Activity Score. Then all eligible accounts are ranked by highest value to lowest and grouped into tiers: top 10%, 50-90%, and 0-50% ➡️Source: MEDIA SCORE as the Infrastructure for On-chain User Value Assessment: 🔸How to claim $NAM airdrop ➡️Get Namada Wallet Extension ➡️Go to ➡️Connect Wallet $ATOM $OSMO $STARS ➡️Connect $NAM Extension ➡️CLAIM $NAM ➡️Repeat for any additional chains / wallets 🔸Looking for an easy and super clear "how to claim video"? @L1am_Crypto & Stakecito Labs to the rescue 🫡 🔸$NAM airdrop beraindex overview: 🔸Stake $ATOM with our sponsor, Enigma , and don't miss out on future Airdrops 🥩 $ATOM 🫡
0:10

PSA: $NAM Airdrop 🪂 - only a few hours left ➡️Claim closes on: 12th of Jan 2024, at 9am ➡️ The _ONLY_ place to claim ➡️Allocations have been adjusted recently - check if you have claimed to see if your number went up! ➡️US is sadly geoblocked 🔸Eligibility and How to Claim reminder ➡️ $OSMO snapshot: mainnet block 12146298 ➡️ $ATOM snapshots: block 17660694 (the last blocks before 1st of November 2023). To be eligible you need to have at least $100 USD staked ➡️In $OSMO: 280 $OSMO ➡️In $ATOM: 12.786667 $ATOM Beyond staking every account gets an Activity Score. The TLDR; of this scoring method is that it measures the engagement of the account on a decentralized network. The specific framework used in the RPGF Drop is an adaptation from Trusta AI ' Media Score, and was first introduced by Celestia on the Genesis Drop. Based on the mechanism, the score can be a minimum of 1.5 and a maximum of 15. The Activity Score is a points system that takes into account activity such as transactions, ibc transfers, the value of transactions, months active, etc. (the scoring details are linked in the announcement). The maximum points you can get on the Activity Score is 15. To determine the tier, the amount staked at the time is multiplied by the Activity Score. Then all eligible accounts are ranked by highest value to lowest and grouped into tiers: top 10%, 50-90%, and 0-50% ➡️Source: MEDIA SCORE as the Infrastructure for On-chain User Value Assessment: 🔸How to claim $NAM airdrop ➡️Get Namada Wallet Extension ➡️Go to ➡️Connect Wallet $ATOM $OSMO $STARS ➡️Connect $NAM Extension ➡️CLAIM $NAM ➡️Repeat for any additional chains / wallets 🔸Looking for an easy and super clear "how to claim video"? @L1am_Crypto & Stakecito Labs to the rescue 🫡 🔸$NAM airdrop beraindex overview: 🔸Stake $ATOM with our sponsor, Enigma , and don't miss out on future Airdrops 🥩 $ATOM 🫡

Grey Ledger

60,319 görüntüleme • 2 yıl önce

you don't need to re-explain your codebase's architecture to your agent every session. most tools stop at telling you what broke. sentrux is a real-time architectural sensor, it watches your codebase as a live treemap and turns file structure and dependencies into one continuous quality score. the loop is simple: codebase > agent scans structure and dependencies > sentrux scores 5 root cause metrics into one signal > agent sees exactly where risk concentrates > next session starts from a live map instead of a blind grep the binary carries zero built-in language knowledge, all 52 languages live in plugin.toml and tags.scm query files, so a new language needs zero rust code. small catch: it only scores the structure, it won't tell you why the cycle happened, that part's still on you. built pure Rust with no runtime dependencies, specifically so it could sit as one binary between an agent and a codebase without adding friction.
0:10

you don't need to re-explain your codebase's architecture to your agent every session. most tools stop at telling you what broke. sentrux is a real-time architectural sensor, it watches your codebase as a live treemap and turns file structure and dependencies into one continuous quality score. the loop is simple: codebase > agent scans structure and dependencies > sentrux scores 5 root cause metrics into one signal > agent sees exactly where risk concentrates > next session starts from a live map instead of a blind grep the binary carries zero built-in language knowledge, all 52 languages live in plugin.toml and tags.scm query files, so a new language needs zero rust code. small catch: it only scores the structure, it won't tell you why the cycle happened, that part's still on you. built pure Rust with no runtime dependencies, specifically so it could sit as one binary between an agent and a codebase without adding friction.

Simplifying AI

18,308 görüntüleme • 18 gün önce

whoever leaked this has bigger balls than sense SpaceXAI shipped five hireable workers for $200 a month, then wrote the catch into its own Grok Bot documentation and left the page up: all five run on one computer, so one sign-in hands the browser session, the files and the command-line credentials to every one of them the NSA, CISA and the cyber agencies of the UK, Canada, Australia and New Zealand had published the opposite instruction 103 days earlier: no broad or unrestricted access, low-risk and non-sensitive work only i ran four of mine on one account for a week, counting what each could reach: eleven signed-in apps, one browser profile, and deleting a bot left all of it standing Grok Bot is worth hiring five times over, and you can draw its blast radius before the second one exists: - sign in for the bot that needs the site, then open the others and see what they reach: that session is theirs the moment it exists - give each bot its own account on the app, since the docs tell you in writing to stop using separate bots as a security boundary - put the stop line in the description, as an approval controls the proposed action and leaves whatever already ran where it landed - cap the spend outside the product, because there is no bot-specific spend cap yet and the audit view of what they did is still coming - keep the money and the customer replies in your own hands, and let the other four start from scratch each morning on work that cannot bite one sign-in is also why this pays: five names finish inside your real tools instead of handing you drafts to paste my take, and it is the uncomfortable one: your real limit on Grok Bot is how many logins you will put on one machine, and the hiring was always the easy half bookmark this, the five descriptions that let bots hand work to each other and the one folder that survives an update are written out in the article ↓
0:15

whoever leaked this has bigger balls than sense SpaceXAI shipped five hireable workers for $200 a month, then wrote the catch into its own Grok Bot documentation and left the page up: all five run on one computer, so one sign-in hands the browser session, the files and the command-line credentials to every one of them the NSA, CISA and the cyber agencies of the UK, Canada, Australia and New Zealand had published the opposite instruction 103 days earlier: no broad or unrestricted access, low-risk and non-sensitive work only i ran four of mine on one account for a week, counting what each could reach: eleven signed-in apps, one browser profile, and deleting a bot left all of it standing Grok Bot is worth hiring five times over, and you can draw its blast radius before the second one exists: - sign in for the bot that needs the site, then open the others and see what they reach: that session is theirs the moment it exists - give each bot its own account on the app, since the docs tell you in writing to stop using separate bots as a security boundary - put the stop line in the description, as an approval controls the proposed action and leaves whatever already ran where it landed - cap the spend outside the product, because there is no bot-specific spend cap yet and the audit view of what they did is still coming - keep the money and the customer replies in your own hands, and let the other four start from scratch each morning on work that cannot bite one sign-in is also why this pays: five names finish inside your real tools instead of handing you drafts to paste my take, and it is the uncomfortable one: your real limit on Grok Bot is how many logins you will put on one machine, and the hiring was always the easy half bookmark this, the five descriptions that let bots hand work to each other and the one folder that survives an update are written out in the article ↓

Argona

689,721 görüntüleme • 13 gün önce