KANMixer: a minimal KAN-centered mixer for long-term time series forecasting

Introduction to the show: ident: AI Radio. Generated commentary on the latest Artificial Intelligence papers.

Tom: Next we'll be talking about the paper "KANMixer: a minimal KAN-centered mixer for long-term time series forecasting".

Jane: The paper was written by Lingyu Jiang, Dengzhe Hou, Yuping Wang, Yao Su, Shuo Xing et al. from Tohoku University and University of Michigan and Texas A&M University and San Diego State University and Worcester Polytechnic Institute.

Tom: Stay tuned as we take you through the paper and discuss its implications.

Title: Tom: Welcome back to the arXiv radio hour, everyone. Today we're digging into a paper that's been making the rounds in the forecasting community — it's called "KANMixer: a minimal KAN-centered mixer for long-term time series forecasting." Jane, I've got to say, the title alone tells you exactly what the authors are trying to do — they want to keep it simple, they want to center everything around KAN, and they want to see if that actually works.

Jane: And Tom, for our listeners who haven't been following the KAN wave — KAN stands for Kolmogorov-Arnold Networks. They're a relatively new type of neural network that replaces the fixed activation functions you'd find in a standard MLP with learnable basis functions. Think of it like this: a regular neural network has a set of fixed curves it can use to shape its predictions, but a KAN can actually reshape those curves during training. That flexibility is the whole bet here.

Tom: And the bet seems to be paying off, because the paper reports that KANMixer gets the best MSE in sixteen out of twenty-eight benchmark settings, and best MAE in eleven. That's against nine different baselines, including some pretty heavy hitters like iTransformer and PatchTST.

Jane: Right, and what's striking to me is that they're doing this with a deliberately minimal architecture. No fancy decomposition modules, no patching, no attention mechanisms. Just a multi-scale pooling frontend, a KAN-based temporal mixing backbone, and KAN-based prediction heads. The authors are basically saying — look, we stripped away all the extra machinery, and the KAN core is doing the heavy lifting.

Tom: And that's a bold claim, because the field has been through this cycle before. Remember when DLinear showed that a simple linear model could beat complex Transformers? That shook things up. Now these authors are saying KAN might be the next step in that direction — a more expressive nonlinear core that doesn't need all the hand-crafted priors.

Jane: Exactly. And they're not just claiming it works — they're doing careful ablations to show *why* it works. They found that the prediction head is the most critical component, which is a really useful insight for anyone building forecasting models. But we'll get into that in a bit. First, let's talk about what KAN actually brings to the table here.

Tom: I think the most exciting part is that they're not just adding KAN to an existing architecture — they're building the whole model around it. And the results suggest that the adaptive nonlinearity of KAN is genuinely useful for capturing the kind of non-stationary patterns you see in real-world time series. Electricity demand, weather patterns, traffic — these all have local fluctuations that a fixed-form MLP might miss.

Jane: And that's the hook for our next segment — we're going to look at how they actually designed the architecture and what the main results show. Stay with us.

Summary: Tom: So we're back with "KANMixer: a minimal KAN-centered mixer for long-term time series forecasting." Jane, let's get into the actual architecture and the main results, because I think that's where the excitement really starts.

Jane: Absolutely. So the architecture has three main pieces. First, there's a multi-scale pooling frontend — they take the input and downsample it at multiple resolutions, so the model sees the series at different granularities. Then there's the temporal mixing backbone, which is a stack of KAN-based blocks that process these multi-scale representations. And finally, there are scale-specific KAN prediction heads that produce the forecasts.

Tom: And the key design choice here is that everything is KAN. The mixing, the feed-forward transformations, the prediction heads — all KAN. But they also did component-wise ablations where they replaced each KAN module with an MLP one at a time, and that's where the really interesting finding comes in.

Jane: Right — the prediction head is the most critical component. When they replaced the KAN prediction head with an MLP, the performance dropped the most. That's a really practical insight, because it suggests that if you have an existing forecasting architecture, you might not need to redesign the whole thing — just swapping in a KAN prediction head could give you a meaningful boost.

Tom: And that's the kind of finding that could have real impact, because it's actionable. But let's talk about the main results, because they're pretty impressive. On ETTh1, KANMixer improves MSE by an average of four point nine percent across horizons. On ETTm1 and ETTm2, it leads in three out of four horizon configurations each. And it's doing this with only 321 point 73K parameters.

Jane: That parameter efficiency is worth emphasizing. PatchTST, for comparison, uses three point seven five million parameters. So KANMixer is more than ten times smaller, and still competitive or better on many benchmarks. That's a big deal for deployment scenarios where you're constrained by memory or compute.

Tom: But it's not all roses. On Electricity, which has three hundred twenty-one variables, iTransformer wins because it has explicit cross-variate attention. And on Exchange Rate, Time-FFM benefits from cross-dataset pre-training. So KANMixer's channel-independent design has a clear limitation — it doesn't model relationships between variables.

Jane: And that's an honest limitation to report. The authors acknowledge that KANMixer should be viewed as a diagnostic and reference architecture for studying KAN in LTSF, rather than a production system. But even with that caveat, the results are strong enough to warrant attention.

Tom: And the fact that they're getting these results with a minimal design — no decomposition, no patching, no attention — really raises the question of whether the complexity in existing models is actually necessary. That's a provocative implication.

Jane: It is. And it connects to a broader debate in the field about whether the gains from increasingly complex architectures are real or just artifacts of evaluation settings. KANMixer is a counterpoint — a simple model that performs well because of the expressiveness of its core nonlinearity.

Tom: So what's the catch? What are the trade-offs? That's what we're going to dig into next — the ablations, the basis function choices, and the computational cost.

Improvements: Tom: Welcome back. We're still on "KANMixer: a minimal KAN-centered mixer for long-term time series forecasting." Jane, we've covered the architecture and the main results. Now let's talk about what the paper actually teaches us about how to use KAN effectively — because the ablations are where the real insights are.

Jane: Definitely. And the first big finding is about depth. They compared two three and four-layer KAN backbones, and the three-layer version performed best. The four-layer version was actually less stable — it occasionally diverged during training, though in fewer than five percent of runs. So there's a sweet spot, and it's not deeper.

Tom: That's interesting because in a lot of deep learning, more layers is better. But KAN seems to be different — the optimization gets harder as you stack more KAN layers. The authors suggest this is consistent with prior reports that KAN can be sensitive to initialization and gradient propagation in deeper stacks.

Jane: Right. And then there's the basis function ablation, which I think is one of the most practically useful findings in the paper. They compared B-spline, Chebyshev, Fourier, and Wavelet bases. And B-spline was the only one that consistently outperformed MLP across all prediction lengths. Chebyshev was less consistent, and Fourier and Wavelet both underperformed MLP.

Tom: That's a huge finding, because a lot of the KAN literature has focused on alternative bases for computational efficiency. But this paper shows that the choice of basis function is not a minor implementation detail — it's a primary design variable. The local support of B-splines seems to be what makes them work well for time series.

Jane: And that connects to the theoretical work showing that B-spline KAN is related to radial basis function networks. The local adaptivity is what lets the model capture non-stationary patterns without globally altering the representation. Fourier and Wavelet bases impose more global structure, and that hurts.

Tom: But here's the counterintuitive finding that really got me — decomposition. In a lot of MLP-based models like DLinear and TimeMixer, decomposing the series into trend and seasonal components helps. But in this paper, adding DFT or moving-average decomposition to KANMixer *hurt* performance. It degraded KAN by about zero point zero two five to zero point zero three three MSE, while it actually helped MLP slightly.

Jane: That's a really important result, because it suggests that structural priors developed for MLP-based models don't transfer to KAN-based models. The authors' interpretation is that KAN is already flexible enough to model trend and seasonal structure directly from raw inputs, so imposing decomposition just restricts what it can learn.

Tom: And that's the kind of finding that could change how people design forecasting models. If you're using KAN, you might want to drop the decomposition and let the KAN figure it out. But if you're using MLP, decomposition still helps. It's a genuine interaction between architecture and prior.

Jane: And then there's the multi-scale design. Removing it hurt KAN performance by about zero point zero two zero MSE. So KAN benefits from multi-resolution input enrichment, as long as that enrichment doesn't impose rigid structural constraints. That's a useful distinction — enrichment is good, decomposition is bad.

Tom: So the practical guidance is: use B-spline KAN, use a moderate depth of three blocks, put KAN in the prediction head, and skip the decomposition. That's a pretty actionable set of recommendations.

Jane: It is. But there's also the computational cost question. And that's where the paper is honest about a real bottleneck. Let's talk about that.

Conclusion: Tom: And we're wrapping up our discussion of "KANMixer: a minimal KAN-centered mixer for long-term time series forecasting." Jane, we've covered the architecture, the results, and the ablations. Let's pull it all together.

Jane: So the big picture is this — KANMixer shows that a minimal KAN-centered architecture can be competitive with much more complex models on long-term time series forecasting. It achieves the best MSE in sixteen of twenty-eight settings, and it does so with a fraction of the parameters of models like PatchTST.

Tom: And the ablations give us concrete guidance. B-spline bases are the way to go. Three blocks is the sweet spot for depth. The prediction head is where KAN matters most. And decomposition — which helps MLP — actually hurts KAN. That last finding is genuinely surprising and could reshape how people think about structural priors in forecasting.

Jane: But there are real limitations. The computational cost is a bottleneck — the B-spline variant takes about three times longer to train per epoch than the MLP baseline, largely because spline evaluation lacks optimized kernels. And the channel-independent design means it doesn't capture cross-variable relationships, which is why it loses on Electricity.

Tom: And the authors are upfront that this should be viewed as a diagnostic architecture for studying KAN, not a production system. But the insights are transferable — especially the finding about the prediction head. If you're building a forecasting model, swapping in a KAN prediction head might be a cheap win.

Jane: I think the broader implication is that the field has been layering on complexity — decomposition, patching, attention — and this paper suggests that a more expressive core nonlinearity might make some of that complexity unnecessary. That's a provocative idea, and it's one that deserves more investigation.

Tom: And the future work is clear — extending KANMixer with lightweight cross-variate modeling, developing better spline kernels, and testing whether the prediction-head finding transfers to Transformer-based models. There's a lot to build on here.

Jane: Absolutely. So we'll say goodbye to KANMixer and get ready for the next paper. Thanks for listening, everyone.

Tom: And remember — the paper is "KANMixer: a minimal KAN-centered mixer for long-term time series forecasting." If you're working on forecasting, this one's worth a read. See you next time.