Muma: 선형 시간 시퀀스 모델링을 위한 선택적 상태 공간

### Mamba: 선택적 상태 공간을 사용한 선형 시간 시퀀스 모델링 아키텍처
* 맘바는 구조화된 상태 공간 모델의 입력 독립성 제약을 완화하는 새로운 접근 방식인 **선택적 상태 공간**을 도입하여 현재 입력에 따라 시간 스텝에서 시간 스텝으로 전환하도록 하는 아키텍처입니다.
* ⚖ 구조화된 상태 공간의 선형적 백본을 유지하면서 입력에 따른 전환을 허용함으로써, 맘바는 **완전 반복 모델의 효율성**과 **트랜스포머의 컨텍스트 기반 추론 기능** 간에 균형을 맞춥니다.
* 🔢 훈련 중에는 **Mamba가 트랜스포머처럼 시퀀스의 모든 전진 패스를 한 번에 계산**하는 반면, 추론 중에는 **단계당 일정한 시간만 소요되는 단순 반복 모델**처럼 작동합니다.
* 💨 Mamba의 메모리와 연산은 시퀀스 길이에 따라 선형적으로 확장되며, **DNA 모델링 및 오디오 파형과 같이 컨텍스트가 긴 시나리오에서 탁월한 성능**을 발휘합니다.
* 입력 의존적 전환으로 인한 계산 복잡성 증가를 완화하기 위해 Mamba는 **컨볼루션 대신 스캔 작업**을 통해 반복적으로 모델을 계산하는 하드웨어 인식 알고리즘을 활용합니다.
* 📈 스케일링 법칙에 따르면, **맘바는 다른 모든 주의가 필요 없는 모델보다 성능이 뛰어나며 대규모 언어 모델링 작업에서 강력한 트랜스포머 베이스라인의 성능과 일치하는 최초의 모델**입니다.
* 맘바의 핵심 연산은 **입력 투영, 1D 컨볼루션 적용, 파라미터 이산화, 반복 상태 계산, 출력 생성**로 이루어집니다.
* 📦 Mamba의 코드베이스에는 **Python, GPU, 반복 추론, 병렬 학습용 버전 등 다양한 아키텍처 구현**이 포함되어 있어 모델을 포괄적으로 이해할 수 있습니다.

선택적 상태 공간을 사용한 맘바 선형 시간 시퀀스 모델링은 S4의 입력 독립성을 완화하여 강력한 트랜스포머 경쟁자로서의 잠재력을 보여줍니다.

hello today we're going to look at Muma linear time sequence modeling with Selective State Spaces by Albert goo and Tre da I know I'm a bit late on this paper uh but I still thought I'd give it a look and excuse the lack of face cam today. I know it's a tragic loss to not see my face while doing these reviews. I hope you can survive it. uh so Mamba has been really big uh hailed as a potential competitor to Transformers. uh has better scaling property scales to really long sequences and so on. and yeah I wanted to know what it is. and I wanted to know essentially two things like how does it differ from all the other stuff that exists today. uh because there there's so much stuff. for example there are so there are the Transformers. and those obviously have their advantages and problems. then there are on are like rnns like recurrent neural networks. and then there are these you know State space models like S4 or something like this. and there's always interesting tradeoffs between all of

those notably um what will see is in the Transformer you have if you have a sequence of stuff. You have attention that's essentially anything can look at anything else. And if you have causal attention, if I look at this input, I'm able to selectively look back at another input and sort of use that in the computation uh of the next layer here. Okay, so a Transformer is able to dynamically and selectively look at individual elements of the past and address each one individually. But obviously you have a problem with that. So the problem with that is that you have like L square when L is the sequence length l squ computations or n SL or n l squ uh memory requirements in order to do this rnns on the other hand. If you have a sequence there they if you consider this um this particular input and you want to compute the next layer, you can only look back one time step. In fact, you can't even look at the last input. You what you will do is from each input you will compute a

hidden state. So there's going to be some sort of a box here, and you will update the box, and then the next thing will come, and it will update the box, and then the next thing will come, and it will update the box, and so on. So you're only allowed to look at the last box and the current input if you want to decide what the next box here should be. And from the box, you obviously then compute the outputs. So this is super restrictive in that you can only ever look at the last hidden state and the current input in order to compute the current output and the next hidden state. But also, also this essentially scales to infinite lengths because instead of having, you know, this much requirement of memory, it only has, actually, it doesn't even, it has L computation. So you compute as many elements as you have, right? But then the memory requirements are really, they're really all of one. They're really only how big is the hidden state and how big are the inputs and outputs now.

if you want to do backprop here, that's when it becomes, you know, a bit more iffy. Then you will actually have to remember the whole sequence of intermediate values in order to backpropagate. So, or in use a thing that's called backprop through time. And I know, I know this is super old school and before most of you were born, but again consider the thing where you compute the hidden state out of the last hidden state and the current input. You compute the next hidden state from that, and eventually you'll have some sort of output. Let's say the whole sequence only has one output. You can do this with many outputs too, but what you want to know is, well, how does the weights that compute this particular um transition here or this particular one, how should I change that because I have some sort of loss over here. Well, you need to backprop through all of these computations. So, through all of the computations that generate the hidden states from each other, and then back through this computation. In order to do that.

called back propop through time and because you com you back propop through so many time steps. This is often either prohibitively expensive memory-wise, or you'll just get this Vanishing or exploding gradient problems because essentially uh you have operation upon operation upon operation, which are often multiplications. Solutions to that are things like the lstm, um, that have built-in gating mechanisms, but the important part to know is there is a hidden State and that goes through some trans so there is a function and the function of the next hidden state t + 1 depends on the last hidden State and the current input let's t + one some yeah, and this function here can be pretty much anything. In an lstm it's a complicated gating thing. In a simple recurrent Network it's just I multiply the last hidden state by some weight and then this by some weight, but it is a and then and then I add an on linearity or something like this. Now what about the this S4 type of thing and that's where this paper starts.

off this paper starts off by saying hey look these these uh State space models they've been pretty we've built some of these and they have some nice properties. What are those nice properties? The nice properties are that they essentially are an RNN, essentially, but when they have a sequence and uh a sequence of inputs, they can essentially compute all of the outputs if there are multiple outputs or that single output over here in one swoop. So they can essentially compute it like Zoom um in one big swoop. And so if they have all the inputs, uh they can just formulate this as a convolution operator. And there are multiple reasons why that's the case, but um two main reasons. First reason, there is no nonlinearity going from the last hidden state to the next hidden state, right? So that this this is a completely linear uh transition, if you will. I'm we'll we'll go a little bit into what I mean by this, obviously here um here some kind of X is coming in and that doesn't necessarily need to be linear, but sort

of the backbone of this going through time from hidden state to hidden state are linear computations. Um, so no nonlinearity involved in that. That what does that what that will mean is that essentially the whole this whole path here, this whole back prop through time thing is going to be at least the path that goes back the hidden states until it, you know, branches off into the individual elements. That is essentially one big matrix multip like one big linear operation and, uh, that is a lot more well-behaved than if you also have the, uh, nonlinearities in between. Now, obviously you can still have, uh, exploding or vanishing gradients and so on, so you could also, um, you can still have that, but it is a lot more easy, let's say, than having complicated gating mechanisms there. And what it means is that you can just kind of jump ahead to any point that you want because you can always, you always know what the full operation is, you always have a closed form to that. Um, second, okay, what's second, uh, there is no time dependence so

there's no time uh dependence of these things, and no input dependence. What that means is that the transition from State one to state two is going to be the same as the transition from state two to state three. Now, again, there is going to be inputs in these, um, that obviously don't always compute the same function, but the transition between the time steps and how you incorporate new information is always the same. So, all the matrices that are involved in here essentially are all the same and not dependent on the input at all. And therefore, you can just kind of precompute all of the aggregation right here, and then all you have to do is kind of multiply in your individual inputs from the time steps, and you can just compute the whole thing as one big computation. So, that's what we're going to look at. The question is where do the these, uh, where does Mamba fit in? Mamba is an architecture that makes use of what they call Selective State spaces, and selective State spaces relaxes this property of s for a bit and

what I mean by that the property that the transition from time step to time step is independent of the input it relax access that a little bit and therefore it moves S4 a little bit closer into the direction of lsms and and but it remains it retains this property that um the the backbone here is computable by one swoop um and we're going to they're going to do this as a as a prefix sum as a parallel scan. It's it's computable as one swoop and therefore during training it looks more like a Transformer where you can just compute all of the forward passes of the whole sequence in one go instead of like the lstm where the forward pass no matter whether you know all the inputs already you have to compute the forward pass one after another so during training it looks more like a Transformer and during inference it actually looks more like an like an LM. All right so we'll dive into the paper and I just I have a few sections highlighted not too much especially the

experimental result. You're very welcome to look at those. The result is going to be that it is a strong competitor to Transformers. So far, they have not made experiments up to the big like up to the big Transformers and big. So, I believe they've made experiments up to about 1 billion parameters. That's obviously really big in conventional terms, but for language modeling, the smallest ones start at like 7 billion. So, that remains to be seen. But the scaling laws seem to be promising. The other thing is that they say themselves it really excels at when you need really, really long sequences like DNA modeling or audio waveforms and so on. They having a long context and being efficient with that is probably more important than this, you know, super ability to of Transformers to focus in on individual states. All right, so they say structured State space models, sorry, have been developed to address Transformers' computational efficiency on Long sequences, but they've not performed as well as attention on important modalities such as language. We identify

a key weakness of such models is their inability to perform context-based reasoning. What does that mean? They say we propose a new class of selective St spat model, right? The Selective is the difference instead of the structured that improves on prior work on several axes to achieve the modeling power of Transformers while scaling linearly in sequence length. So they say the key ability limitation of Prior models, the ability to efficiently select data in an input-dependent manner. Again, what does that mean? You have a previous hidden State, you have a current input, and you want to build the next hidden state t + one. What structured State space models do is they have they'll have some kind of parameterized function. Let's call that a, and they'll have some sort of uh, they'll have some sort here. Let's call that b, even though like it's it's slightly different but and the result is going to be that HT + 1 is going to be equal to something like a HT plus b x. Okay, again, not exact.

representation. But in principle, this and this is in SSMS. Like, it's going to be completely fixed for the whole sequence always. So you learn one set of parameters for, you know, 1 A and 1 B for the entire model. Okay. Now, this obviously is very, very different from Transformers where, like, the attention matrix is built dynamically at each single forward pass. You know, for each single, uh, for each single token, you compute queries and keys and values, and therefore the aggregation, how you build the next hidden state, is very dependent on, on everything, on the input, on the past, and so on. Uh, in this particular case, super fixed. You can see this is even more restrictive than something like an LSTM. Like, in something like an LSTM, as we discussed before, what you can do is you can make this and this actually dependent on the last hidden state. So in an LSTM, you'll see that the last hidden state will be transformed into, you know, and then this gives you the A matrix, like in a, in some sort of a gating way, and then

X will be multiplied by a and so on. So, um, I don't have an LSTM cell in my head, but in an LSTM, the propagation of the signals can be dependent on the previous hidden state and on the input. Okay, and that's the difference, uh, between the state space models and like the fully, like general recurrent networks. What, as what Muma is going to do, Mumb is going to say, we allow the transition to be dependent on the current input, not on the previous hidden state, but on the current input. And you should already be able to see if you do that, it still means that sort of this backbone going from hidden, uh, going from hidden state to next hidden state is going to be a fixed computation, uh, given by this a matrix. And that's why we can sort of precompute it throughout all of time because that a is going to be fixed and not dependent on the input. Although what we'll see is that in fact how, uh, the, uh, how the input is computed into and in the next hidden state is

going to be um influenced by the by the input, but not by the previous hidden State. Okay, so I hope I've made this clear. A is going to be dependent on the input. B is going to be dependent on the input, but they're not going to be dependent on the last hidden state or anything of the past. So it's kind of a tradeoff between the state space models of the past and recurrent neuron networks, um, yeah. So they say, Okay, this poses a challenge for the computation of the model. All prior, sorry, all prior SSM models must be time and input invariant in order to be computationally efficient. We overcome this with a hardware-aware algorithm that computes the model recurrently with a scan instead of a convolution. So they say, Essentially, we sort of make it really fast on GPU even though we have an algorithmically a different, we have a different algorithm. We need to compute something making the actual recurrence or actually recurrently, but we do it in a way that fits really well.

on Two GPUs. And therefore, uh, it's actually in, in the end, it's actually faster. And yeah, they make this into a model, um, called Mamba. Uh, Mamba is Mumbo is not the same as selective State spaces. Selective State space, uh, are a part of Mamba, uh, and then combined with some other stuff like, uh, 1D convolutions and up projections and gating, that becomes the Mamba architecture. It's attention free, uh, therefore, it's, it avoids the quadratic bottlenecks of attention of attention-based models such as Transformers. So they say these are fully recurrent models with the key prop property, uh, for example, high-quality selectivity brings strong performance and on dense modalities such as language and genomics. I think that's going to be the biggest sticking points. So they have recognized that, you know, this super scalable thing like S4 is not really suitable for language because you need to be a little bit data dependent in your transitions from, you know, through the hidden States. And now they say, well

selectivity brings strong performance. Which because they added selectivity, they added this dependence on the input of the transition. Um now gives them a bump in performance. The jury is still out whether in the future they'll say, Yeah, it's better, but still, in order to really reach the performance of Transformers, we also need to make that transition actually dependent on the hidden state. And at that point, we're back to essentially LSTMs. But it could be that the dependence on the input, just the input, um, already makes them as strong as Transformers on a lot of important benchmarks. Fast, fast training and inference, uh, computation memory scales linearly in sequence length during training and unrolling the model auto-regressively during inference requires only constant time per step since it does not require a cache of previous element. So there's no key-value cache FH and so like in Transformers, you literally just have to remember the last hidden state. And then producing one additional token during inference is just, it's just two matrix multiplications or something like this.

right, so no attention, no, no, nothing, just multiply it in and you have it, and long context, the quality and efficiency together yield the performance improvements on real data up to sequence length 1 million. All right, so this is the architecture is a bit distributed throughout the paper. This is the Selective State space part of this. There's going to be a more extensive thing here. So the Muma architecture consists of the part I've just shown you but also of other things. So you have to imagine these things are going to be layered on top of one another and then essentially you'll always consider the entire sequence as one during training. So if we go in here, this here, for example, this is a linear projection, so you project up in dimensions and you project each token individually like in a Transformer. Then you do a 1D convolution, there is some nonlinearity in there, then comes that SSM. Now in these two things, you want to consider the whole sequence as one.

during training right. However, in the projections right here, they, as far as I understand, go just individually over tokens like the MLPs in a Transformer. And then there is also this extra mechanism right here, which is a gating mechanism like you're used to from other gated architectures. Again, this doesn't go between time steps; that's important to note. This goes from layer to layer, right? So as you go up the layers, the time would be some sort. The time steps aren't even shown here. There's no time direction in this particular diagram. There are also residual connections that go out, out the way, and so on. Um, yeah. So, the Mamba is an architecture that includes this new selective State spaces. That selective State space layer looks about like this, and here we now have a Time direction, right? So here we now consider how do we compute one token in this sequence, given that we have to accumulate this hidden State over time. And again, we can do this either during training, where we try to compute all of them as fast as possible.

or during inference, where we just do one of these time steps. So as you can see, the backbone is just going to be we have this, we multiply, we essentially, there is a, there is a, this, this, a matrix right here that we're going to use, and there is the input that somehow comes in, and from these two things, we're going to produce that next hidden state. Now, what is all of this right here? Um, all of this is part of this state space architecture. How does that look? There is a technicality in here, which is called discretization. Now, the theory behind state space models and so on was developed for continuous time systems, and if you want to make them into discrete, you want to be sort of correct. You can't just, uh, you can't just apply the same thing. Um, if you do it in the way they do it here, it has some nice properties, such as I believe your, you're kind of time step independent, uh, you automatically scale the things to the correct scaling.

and so on. However, whenever you hear discretization, um, just you're free to also just kind of ignore it for the purposes of understanding what's going on from a deep learning perspective and from a data flow perspective. I'm sorry, Albert, if you're listening, this must be really offensive, um, and I apologize for that, uh, um. We can do another video where we dive into sort of into more of the background. Behind these models and so on, um, maybe not the best person to explain that, but we'll do our best to understand kind of what's going on here on a more high level. So you have they call them four parameters, okay. These are matrices or vectors that just have learnable parameters. You'll use this. This here is the S like a parameterization, um, parameterization. No, sorry, discretization param. This here controls how on hidden state is propagated forward. This here controls how much of the input is propagated into the new hidden state. And this here controls how the hidden state is com is processed into the, uh, output state so.

you can see the next hidden state is produced from the last hidden state, multiplied by what's called a bar. And a bar is simply a computation that results from this discretization parameter and the a matrix. Again, don't worry, just consider if you want, just consider this here to be a learnable m matrix, and this here to be a learnable matrix. And in that, you can see from this perspective, this is a super duper simple, like the most plain recurrent neural network there is, without even some any sort of nonlinearity around here. You can see this is just like a linear recurrent neural network, if you will, where you just kind of dampen in some way, in some multi-dimensional way, the last hidden state. And then you add a projected version of the input. The output is simply computed again as a linear function of the hidden state. Now, since everything is linear, what you can do is if you actually write this out, you actually write out, I want to compute, sorry, I want to compute Y3, what.

am I doing? I have an eraser. If you compute Y3, you can say, Oh well, that's just H3 uh ah3 plus bx3. Oh, but what's H3? Well, H3 is just ah H2. Oh, sorry, why is that that multiplied by C, right? Well, that's just a H2 plus b X2. And what's H2? Well, that's just a H1 plus b x X1. And so if I plug all of this in, I'm going to end up with Y3 is equal to C * um C * a * a time a uh H1. Let's say that's the initial hidden State um so you can see you can multiply this out what you'll end up with is like you can we you'll end up with like c a a a a uh uh B X1 c plus c a a a b X2 and so on so plus uh c a a b X3 so there's kind of the number of A's just different depending on how many time steps that particular X is in the

past. But you can see I can multiply all of this out, and what that allows me to do is that allows me to say, well, all of this here is just constant, no, not this, all without X. All of these matrices here are just constant learnable parameters. This too, this too. So I can just consider this as a vector, a dot product of c, a, a, a, a, b, c, a, a, a, b, c, a, a, b, and so on with X1, X2, X3, and so on. And this here I can perfectly precompute, you know. I just, after each learning step, uh, these, these are just learned parameters, therefore I can perfectly precompute that. And when a new sequence comes, I just dot product it in, and I have the full output. I have the output available instantly. And that's what they do over here. So you can see they built this kernel out of this, and then they can say, well, the output is simply going to be a multiply, the input as a vector by my kernel, and, but boom, I just have it all.

have it all available right um, and that's, and that is, uh, why, and you can hopefully see that this is a convolution, uh, so if you now, if you not only want one output, but you actually want each of the output of each of the time steps, this just results in a convolution operation, uh, that you can do, and that's why the S4s and so on were so extremely efficient because you can just compute all at the same time, all those linear, all is fixed, just forward prop is one convolution, back prop super easy, right, okay, that's it, and essentially in Mamba, we, we're not, we're or in structured State spaces, all we're doing is we're making a b c, and this Delta here input dependent, that's it, that's the whole, that's the whole thing, um, you can see this in the algorithm here, you can see, see you have the SSM here ABC go into it, in fact, no sorry, a bar and bar bar are computed from this thing right here, that's exactly the same here and here, but now instead of b c

this and a being just simple parameters a is still a parameter however everything else you can see b c Delta is computed from the input. Okay, and that means it still means you can do the zoom thing but the zoom thing now you have to uh make that input dependent and specifically specifically everything gains a dimension so here see this has no this is the same for each time step this now is different for each time step. Okay, because each time step has a different input and therefore or the these things gain an extra Dimension and that's kind of bad because that makes them L times bigger than previously so what do we do in order to make that still fast they differentiate now between two things GPU high bandwidth memory and what's called SRAM so gpus have two different types of memory I didn't know before this paper but they have the main memory is kind of the slow memory that's this right here that's high bandwidth memory but that's slow even though it's high bandwidth um well I guess high bandwidth doesn't mean low ping all

right that's slow. And then SRAM is really small but is really fast. And they realize, hey, if we want to do the Matrix multiplications, these happen in this SRAM. That's essentially the cache, that's the fast stuff. The bulk of work is actually moving stuff between the two types of memory, moving stuff between the two is the slow thing. And therefore, we've just made that L times bigger, and therefore we made that moving L times slower because the multiplications aren't that slow. It's actually moving the stuff around. And therefore, they come up with a scheme where they don't have to move as much stuff. That's essentially it. You can look the code, but um, in the end, it just comes down to that. It comes down to moving stuff around. Moving big stuff around is slow. And therefore, they say, you know, instead of computing this kind of stuff, um, this kind of scan inputs in GPU, um, HPM, we load the parameters themselves directly to fast SRAM, perform the discretization and recurrence in SRAM, and then write.

the final outputs back to hbm. Uh, they save themselves. They actually don't save themselves an L. They save themselves an N. And N is the discretization expansion factor. So during this discretization, you kind of need to expand, um, ex-dimensionality, expand some of these things, and they save, save themselves that expansion, and therefore are a lot faster. Uh, yeah. So I'm not going to go deeper into this, except saying what they say down here, you know, um, they make use of this, uh, reduction of data movement, plus a recomputation of intermediate states, and that results in that the fused selective scan layer has the same memory requirements as an optimized transformer implementation with flash attention. And I believe that should give you a good, good idea of the combination of what kind of is required right here. So again, they can still do the zoom, um, except now the elements are input dependent, and therefore they have to do the zoom differently, and they do the zoom using not the convolution, because the convolution would require the kernel to be constant, but they now do it via

What's called the prefix sum, and the prefix sum is, and they call it a parallel scan, but it's essentially the thing that computes this a * a * a * B, and then a or c, a a a b, and then a * a * a * a * B, and so on, except now of course all of the A's are different, right, so it's now uh A1 * A2 * A3 * B3 A1 * A2, and also C C3, so you can see all of these are now different, so you can't do like the tricks from before anymore, and what they do is a prefix sum, and the prefix sum is just the simplest form is when you have an array like 1 5 9 2 uh to compute the sum, the cumulative sum like 1 six uh 15 17, so that the way you compute this in an efficient manner um you can then you can then use this down here for various things it's very simple right and this is useful in a lot of

algorithm but to avoid recomputing a lot of this stuff, you can use prefix sums to kind of precompute all of the sums or in this case all of the multiplications of different things together, and then you can use those. For example, if you say, What's the sum from here to here? you can just subtract from 17. You can subtract, uh, six or, one, sorry, one, and you can say, Ah, the sum here is 16, without having to compute it again. Same principle goes for how they make this here fast. The scaling laws look really scaly, uh, so they, the perplexity in language modeling, um, and that is models trained on the pile up to 1.3 billion parameters scales better than all other attention-free models and there is the first to match to perform performance of a very strong Transformer Plus+ recipe that has now become the standard, particularly as the sequence length grows. So the jury still out what happens at really large scales but already at this scale this looks quite promising. Um, DNA modeling and so on, Mamba superior to other things.

uh yeah, because long sequence lengths are really the strength of these kinds of models. And again, we'll have to see what the exact tradeoff is going to be, whether we need to make the um, the transitions input dependent or not. And yeah, you can see that uh, inference throughput on an a100 is good and actually gets more drastic and drastic as the batch size increases when you compare them to Transformers. All right, they have some ablations here. Um, it's say Mamba is a strong candidate, uh, to be a general sequence model backbone. And lastly, I think I have one more highlighted section where they discuss the intricacies of the of the um, of their efficient implementation. This section is also good. If you want to dive deeper into this, you can go into this section, especially they discuss what they transfer, how much elements they transfer, what that costs, and so on. So really reducing that memory transfer. And lastly, you can also dive into the code here on GitHub. If you do, I invite you to look at this Mamba simple Pi first. And in fact

there. In this code base, the same thing is going to be implemented multiple times. One time for Python, one time for GPU, and then again one time for inference where you do things recurrently, and one time for training where you compute everything kind of at the same time. And so, you'll find the same code written many, many times in different ways. I invite you to look at this step function right here, which is really, really good. And just assume you don't have any of the extras. So like this causal con 1D update, because that gives you a good idea. So see, there's first an input projection, then there is a con 1D like a convolution 1D convolution. Then there is the parameters here are this DT. They talk about sort of projecting this down and up and kind of putting it through a dimensionality bottleneck. The Matrix A is a parameter. It's just stored as log A and not as A itself. Where was I H where

was I oh here then we do the discretization. The discretization goes um you can see here. Discretization is done by multiplying this DT to a this DT to B. Then the recurrence is calculated. The state time da plus uh x * DB. So this is the main recurrence for the hidden State. The output is calculated uh by just multiplying the hidden state by C. And lastly, there is a recurrent there's this gating Connection in D which is exactly what we saw in the paper in this architecture diagram right right right right here right. So you have uh projections 1D convolution nonlinearity uh State space models with the with the discretization and recurrence computation uh gating pathway. This is with the Matrix D in the code out projection. And that's it all right. That was it for me for this architecture. I hope uh you got a little bit clearer on what Mambo does, how it can be used, and yeah it's exciting to go forward with these architectures. I hope you're having a good time. That was it for me. Merry

Mamba: Linear-Time Sequence Modeling with Selective State Spaces (Paper Explained)

I make videos about machine learning research papers, programming, and issues of the AI community, and the broader impact of AI in society.

Twitter: https://twitter.com/ykilcher
Discord: https://ykilcher.com/discord
BitChute: https://www.bitchute.com/channel/yannic-kilcher
LinkedIn: https://www.linkedin.com/in/ykilcher
BiliBili: https://space.bilibili.com/2017636191

If you want to support me, the best thing to do is to share out the content :)

If you want to support me financially (completely optional and voluntary, but a lot of people have asked for this):
SubscribeStar: https://www.subscribestar.com/yannickilcher
Patreon: https://www.patreon.com/yannickilcher
Bitcoin (BTC): bc1q49lsw3q325tr58ygf8sudx2dqfguclvngvy2cq
Ethereum (ETH): 0x7ad3513E3B8f66799f507Aa7874b1B0eBC7F85e2
Litecoin (LTC): LQW2TRyKYetVC8WjFkhpPhtpbDM4Vw7r9m
Monero (XMR): 4ACL8AGrEo5hAir8A9CeVrW8pEauWvnp1WnSDZxW7tziCDLhZAGsgzhRQABDnFy8yuM9fWJDviJPHKRjV4FWt19CJZN9D4n




Yannic Kilcher

선택적 상태 공간을 사용한 Muma 선형 시간 시퀀스 모델링

Muma는 트랜스포머, RNN, 상태 공간 모델과 경쟁하는 새로운 모델로, 긴 시퀀스에 대해 더 나은 확장 속성을 제공합니다.

트랜스포머의 동적이고 선택적인 주의와 달리, Muma의 접근 방식은 더 제한적이어서 마지막 숨겨진 상태와 현재 입력만 살펴볼 수 있습니다.

이러한 제한 덕분에 Muma는 최소한의 메모리 요구 사항으로 무한한 길이로 확장할 수 있지만, 시간에 따른 역전파에 문제가 있을 수 있습니다.

상태 공간 모델의 속성과 맘바의 소개

상태 공간 모델은 컨볼루션 연산자와 완전한 선형 전환을 사용하기 때문에 일련의 입력에 대한 모든 출력을 한 번에 계산할 수 있다는 좋은 특성을 가지고 있습니다.

또한 이러한 모델은 시간이나 입력 의존성이 없기 때문에 집계를 미리 계산하고 전체 프로세스를 하나의 큰 계산으로 계산할 수 있습니다.

반면 맘바는 선택적 상태 공간을 도입하여 시간 단계 간 전이의 독립성을 완화하여 LSTM에 더 가깝지만, 학습 중에는 트랜스포머, 추론 중에는 LM과 유사하게 한 번에 계산할 수 있는 기능을 유지합니다.

선택적 상태 공간 모델은 특히 긴 시퀀스 처리와 효율적인 컨텍스트 모델링에서 트랜스포머의 강력한 경쟁자로서 가능성을 보여주고 있습니다.

이 모델은 긴 시퀀스에 대한 계산 효율성을 다루며, 시퀀스 길이를 선형적으로 확장하면서 트랜스포머의 모델링 성능을 향상시키는 것을 목표로 합니다.

선택적 상태 공간 모델은 이전의 숨겨진 상태가 아닌 현재 입력에 따라 전환을 허용하여 백본 전환을 위한 고정 계산을 제공한다는 점에서 트랜스포머 및 기존 순환 네트워크와 다름니다.

반복 모델을 위한 맘바 아키텍처

맘바 아키텍처는 컨볼루션 대신 스캔을 통해 반복적으로 모델을 계산하는 하드웨어 인식 알고리즘으로, GPU에서 빠르게 작동합니다.

선택적 상태 공간, 1D 컨볼루션, 상향 투영을 결합하여 주의 기반 모델의 병목 현상을 피하는 완전 반복 모델을 생성합니다.

이 아키텍처는 최대 100만 개의 시퀀스 길이의 실제 데이터에서 메모리 선형 확장과 성능 향상을 통해 빠른 훈련과 추론이 가능합니다.

맘바 아키텍처는 게이팅 메커니즘과 선택적 상태 공간 레이어를 계산에 사용하며, 시간 단계보다는 레이어 간 상호 작용에 중점을 둡니다.

여기에는 숨겨진 상태와 입력의 전파를 제어하기 위한 네 가지 주요 매개변수가 포함되어 있어 궁극적으로 비선형성이 없는 단순한 선형 순환 신경망을 생성합니다.

그런 다음 출력은 선형 계산에 중점을 두고 숨겨진 상태의 선형 함수로 계산됩니다.

신경망에서 컨볼루션 연산의 효율성

설명된 프로세스에는 학습된 파라미터를 기반으로 값을 미리 계산하여 새로운 시퀀스에 대한 출력을 빠르게 생성하는 과정이 포함됩니다.

이 접근 방식은 매우 효율적인 컨볼루션 연산으로 이어져 모든 선형 단계를 동시에 계산하고 쉽게 순방향 전파를 할 수 있습니다.

이 방법은 GPU 고대역폭 메모리와 SRAM을 차별화함으로써 연산의 차원이 증가하더라도 속도를 유지합니다.

SRAM이 매트릭스 곱셈에 미치는 영향

SRAM은 빠른 행렬 곱셈에 중요한 역할을 하며, 느린 프로세스는 메모리 간 데이터 이동입니다.

데이터 이동을 최적화하고 병렬 스캔을 사용하면 프로세스가 훨씬 빨라져 상당한 시간을 절약할 수 있습니다.

이러한 최적화를 통해 스케일링 법칙이 개선되고 언어 모델링에서 다른 주의가 필요 없는 모델보다 성능이 향상됩니다.

맘바 시퀀스 모델의 강점 및 구현

Mamba는 일반 시퀀스 모델 백본의 강력한 후보로 고려되고 있습니다.

Mamba의 효율적인 구현은 메모리 전송을 줄이는 데 중점을 두고 있으며 Python, GPU, 추론 및 훈련에 대한 다양한 구현을 제공합니다.

이 모델의 아키텍처에는 1D 컨볼루션, 이산화, 재귀 계산, 숨겨진 상태 투영을 위한 게이팅 경로가 포함됩니다.