正在加载视频...

视频加载失败

加载此视频时出现问题。这可能是由于临时网络问题，或视频可能不可用。

Matrix Multiplication

Python Programming

214,396 subscribers

13,395 次观看 • 2 个月前 •via X (Twitter)

Anya Rossi• Live Now

Private livecam show

0 条评论

暂无评论

原始帖子的评论将显示在这里

相关视频

Matrix Multiplication in GPU/TPU

Matrix Multiplication in GPU/TPU

Mohit Mishra

29,471 次观看 • 8 个月前

Visualizing 3x3 Matrix Multiplication.

Visualizing 3x3 Matrix Multiplication.

The Math Flow

35,929 次观看 • 6 个月前

Visualization of cache-optimized matrix multiplication

Visualization of cache-optimized matrix multiplication

ℏεsam

99,369 次观看 • 1 年前

Visualization of cache-optimized matrix multiplication

Visualization of cache-optimized matrix multiplication

ℏεsam

214,601 次观看 • 1 年前

With clever mathematical tricks, computers can perform Matrix Multiplication faster! I go over some of the latest research in matrix algorithm development; specifically the improvements to Strassen found by Johannes Kepler University in May 2025:

With clever mathematical tricks, computers can perform Matrix Multiplication faster! I go over some of the latest research in matrix algorithm development; specifically the improvements to Strassen found by Johannes Kepler University in May 2025:

LaurieWired

17,691 次观看 • 1 年前

Writing a CUDA kernel requires a shift in mental model. Instead of one fast processor, you manage thousands of tiny threads. Here is the code and the logic explained for Matrix Multiplication.

Writing a CUDA kernel requires a shift in mental model. Instead of one fast processor, you manage thousands of tiny threads. Here is the code and the logic explained for Matrix Multiplication.

Ashutosh Maheshwari

189,009 次观看 • 9 个月前

When I learned the group e^iθ under complex multiplication is isomorphic to the group of SO(2) matrices under matrix multiplication , it changed everything. I knew love for the first time, my wife came back, I quit fentanyl and started reading romantic fiction. U(1) - SO(2) isomorphism fixed my credit score and my relationship with my father.

When I learned the group e^iθ under complex multiplication is isomorphic to the group of SO(2) matrices under matrix multiplication , it changed everything. I knew love for the first time, my wife came back, I quit fentanyl and started reading romantic fiction. U(1) - SO(2) isomorphism fixed my credit score and my relationship with my father.

Lucid™

50,046 次观看 • 2 个月前

Introducing Operation Matrix Because Matrix operations generally break kids’ brains on whiteboards… Matrices aren't just numbers- they are transformations in space Now can actually SEE the geometry: every addition, multiplication, inverse, eigenvalue, and eigenvector becomes a transformation in real-time space. What it visualizes: • Basic ops (add/subtract/multiply) • Transpose, Invert, Adjugated • Cross products + Determinant • Matrix powers + Eigenvalues/Eigenvectors #LinearAlgebra #CreativeCoding #ThreeJS #ReactThreeFiber #MathVisualization #EdTech #WebGL #STEM React-three-fiber Three.js

Introducing Operation Matrix Because Matrix operations generally break kids’ brains on whiteboards… Matrices aren't just numbers- they are transformations in space Now can actually SEE the geometry: every addition, multiplication, inverse, eigenvalue, and eigenvector becomes a transformation in real-time space. What it visualizes: • Basic ops (add/subtract/multiply) • Transpose, Invert, Adjugated • Cross products + Determinant • Matrix powers + Eigenvalues/Eigenvectors #LinearAlgebra #CreativeCoding #ThreeJS #ReactThreeFiber #MathVisualization #EdTech #WebGL #STEM React-three-fiber Three.js

shadows

58,889 次观看 • 5 个月前

This is a great lecture at MIT by David Shirokoff on Markov Chains. He covers the fundamentals of Markov Chains using a simple particle movement example. He starts by explaining how a particle moves between two positions, A & B, with different probabilities. From there, the talk converts the problem into matrix form using a Markov matrix. The main topics covered are: - Transition probabilities - Markov matrices - Probability vectors - Matrix multiplication in Markov Chains - Finding probabilities after n steps - Eigenvalues and eigenvectors - Matrix diagonalization - Long-term steady state distribution

This is a great lecture at MIT by David Shirokoff on Markov Chains. He covers the fundamentals of Markov Chains using a simple particle movement example. He starts by explaining how a particle moves between two positions, A & B, with different probabilities. From there, the talk converts the problem into matrix form using a Markov matrix. The main topics covered are: - Transition probabilities - Markov matrices - Probability vectors - Matrix multiplication in Markov Chains - Finding probabilities after n steps - Eigenvalues and eigenvectors - Matrix diagonalization - Long-term steady state distribution

𝗿𝗮𝗺𝗮𝗸𝗿𝘂𝘀𝗵𝗻𝗮— 𝗲/𝗮𝗰𝗰

141,709 次观看 • 3 个月前

Matrix Multiplication on GPU/TPU by hand ✍️ I drew 91 frames to show how to divide large matrices into "tiles" to use accelerators such as GPU/TPU. If you like to learn more, check out our weekly workshops. Link 👇

Matrix Multiplication on GPU/TPU by hand ✍️ I drew 91 frames to show how to divide large matrices into "tiles" to use accelerators such as GPU/TPU. If you like to learn more, check out our weekly workshops. Link 👇

Tom Yeh

77,774 次观看 • 1 年前

Today Google DeepMind released AlphaEvolve: a Gemini coding agent for algorithm discovery. It beat the famous Strassen algorithm for matrix multiplication set 56 years ago. Google has been killing it recently. We had early access to the paper and interviewed the researchers.

Today Google DeepMind released AlphaEvolve: a Gemini coding agent for algorithm discovery. It beat the famous Strassen algorithm for matrix multiplication set 56 years ago. Google has been killing it recently. We had early access to the paper and interviewed the researchers.

Machine Learning Street Talk

58,517 次观看 • 1 年前

Today, the Pearl Protocol relies on INT-based matrix multiplication, which requires model quantization. To eliminate this overhead, we are developing our next-generation Proof of Useful Work to natively support floating-point computations. Launching soon, the initial release will support FP8, with FP4 to follow.

Today, the Pearl Protocol relies on INT-based matrix multiplication, which requires model quantization. To eliminate this overhead, we are developing our next-generation Proof of Useful Work to natively support floating-point computations. Launching soon, the initial release will support FP8, with FP4 to follow.

Pearl Research Labs

21,392 次观看 • 1 个月前

Proof of work has always demanded a brutal trade-off - to secure a monetary network, you burn energy on the scale of entire countries. Meanwhile, hundreds of billions poured into AI - all for one operation at massive scale - matrix multiplication. For years, these energy markets were disjoint. It was commonly believed that proof of work could never be implemented on top of real-world instances. They were wrong. The same matrix multiplication that powers AI can secure a monetary network as a by-product - every GPU cycle doing double duty. A currency backed by the most valuable computation on earth. A deep dive by Omri Weinstein ⤵️

Proof of work has always demanded a brutal trade-off - to secure a monetary network, you burn energy on the scale of entire countries. Meanwhile, hundreds of billions poured into AI - all for one operation at massive scale - matrix multiplication. For years, these energy markets were disjoint. It was commonly believed that proof of work could never be implemented on top of real-world instances. They were wrong. The same matrix multiplication that powers AI can secure a monetary network as a by-product - every GPU cycle doing double duty. A currency backed by the most valuable computation on earth. A deep dive by Omri Weinstein ⤵️

Pearl Research Labs

15,223 次观看 • 1 个月前

How many of the big ideas of the past 15 years of AI are downstream of hardware constraints? The big hardware story over that period is that logic has become way cheaper than data transfer. Stacking huge numbers of matrix multiplies was perfect for this hardware regime, because matrix multiplication is logic-intensive but requires less data transfer. And so we got matmul-heavy deep learning. It's interesting to think about what AI would look like in a world where these costs didn't diverge so much.

How many of the big ideas of the past 15 years of AI are downstream of hardware constraints? The big hardware story over that period is that logic has become way cheaper than data transfer. Stacking huge numbers of matrix multiplies was perfect for this hardware regime, because matrix multiplication is logic-intensive but requires less data transfer. And so we got matmul-heavy deep learning. It's interesting to think about what AI would look like in a world where these costs didn't diverge so much.

Dwarkesh Patel

61,147 次观看 • 2 个月前

llm.c by Hand✍️ C programming + matrix multiplication by hand This combination is perhaps as low as we can get to explain how the Transformer works. Special thanks to Andrej Karpathy for encouraging early feedback and tetsuo //: 👾 for helping me understand the pragma magic. I hope this exercise can help people peak further into the LLM black box.

llm.c by Hand✍️ C programming + matrix multiplication by hand This combination is perhaps as low as we can get to explain how the Transformer works. Special thanks to Andrej Karpathy for encouraging early feedback and tetsuo //: 👾 for helping me understand the pragma magic. I hope this exercise can help people peak further into the LLM black box.

Tom Yeh

311,585 次观看 • 2 年前

📁Mo Gawdat, former Google X executive, says AI is no longer just writing code, it is correcting human mathematics. After 56 years using the same matrix multiplication method, AI realized the approach was flawed. It did not optimize software. It invented new math. The result was a 23% performance boost and the removal of hundreds of millions of dollars in costs and energy use.

📁Mo Gawdat, former Google X executive, says AI is no longer just writing code, it is correcting human mathematics. After 56 years using the same matrix multiplication method, AI realized the approach was flawed. It did not optimize software. It invented new math. The result was a 23% performance boost and the removal of hundreds of millions of dollars in costs and energy use.

Jon Hernandez

136,455 次观看 • 8 个月前

Fast matrix multiplication on GPUs has traditionally meant wrestling with threads, shared memory, and low-level hardware details. This webinar explores how NVIDIA’s CUDA Tile model—and its Julia port, cuTile.jl—makes high-performance GPU programming more accessible. Join Dr. Andy Terrel of NVIDIA and Dr. Tim Besard of JuliaHub to see real examples across linear algebra, AI inference, and HPC. Register here - #JuliaLang #GPUProgramming #CUDA #HPC #AIInfrastructure

Fast matrix multiplication on GPUs has traditionally meant wrestling with threads, shared memory, and low-level hardware details. This webinar explores how NVIDIA’s CUDA Tile model—and its Julia port, cuTile.jl—makes high-performance GPU programming more accessible. Join Dr. Andy Terrel of NVIDIA and Dr. Tim Besard of JuliaHub to see real examples across linear algebra, AI inference, and HPC. Register here - #JuliaLang #GPUProgramming #CUDA #HPC #AIInfrastructure

JuliaHub

10,255 次观看 • 4 个月前

As someone who's spent 3 years fine-tuning ML models, this lecture on neural networks from a Stanford math grad is the closest thing to a no-bullshit "day one of ML" briefing I've ever seen released publicly for free. Everyone thinks neural nets are magic. They aren't. They're 13,000 dials - a matrix multiplication, a sigmoid squish, done. Once you see the math, "AI" stops feeling mysterious. 18 minutes. Bookmark & watch today.

As someone who's spent 3 years fine-tuning ML models, this lecture on neural networks from a Stanford math grad is the closest thing to a no-bullshit "day one of ML" briefing I've ever seen released publicly for free. Everyone thinks neural nets are magic. They aren't. They're 13,000 dials - a matrix multiplication, a sigmoid squish, done. Once you see the math, "AI" stops feeling mysterious. 18 minutes. Bookmark & watch today.

fintex

332,082 次观看 • 1 个月前