The Flow has not summarised this story yet — read it at arXiv Machine Learning.
arXiv:2608. 00859v1 Announce Type: new Abstract: Kolmogorov--Arnold Networks (KANs) replace scalar edge weights with learnable univariate functions parameterized by multiple basis coefficients.
arXiv:2603. 06861v2 Announce Type: replace Abstract: Activation functions are fundamental to deep neural networks, governing gradient flow, optimization stability, and representational capacity.
arXiv:2509. 11285v2 Announce Type: replace-cross Abstract: Class-Incremental Learning (CIL) in deep neural networks is conventionally framed as an iterative gradient-based optimization problem, incurring high computational cost, hyperparameter sensitivity, and risk of catastrophic forgetting.
arXiv:2609. 22415v1 Announce Type: new Abstract: Complex-valued Transformers have inherited softmax attention over the raw complex inner product.
CRFCAN is a complex‑valued residual FFT convolutional attention network that jointly estimates channel and phase noise in sub‑THz OFDM systems. It embeds FFT and inverse FFT modules within residual groups to enable iterative feature interaction across time and frequency domains, and includes dedicated residual blocks for complex feature extraction and multiplicative phase‑distortion modeling. Simulation results show that CRFCAN outperforms conventional algorithms and state‑of‑the‑art deep learning models in NMSE and BER, while offering single‑shot, fixed‑complexity inference and good generalization to unseen phase‑noise models.
The paper introduces beignet, a neural field architecture that replaces the random Fourier feature embedding in physics-informed neural networks with a trainable multi‑resolution Fourier feature pyramid. By using Fourier interpolation and spectral derivatives, beignet efficiently computes spatial derivatives and scales accuracy through the feature pyramid rather than the neural network size. Experiments show that beignet achieves more accurate PDE solutions with fewer parameters than existing PINN methods and can reach machine‑precision residuals on the inviscid Burgers blowup problem using the Adam optimizer.