arXiv Machine Learning

Sparse Federated Echo State Networks for Time-Series Classification via Smooth-L1 Regularization

The paper introduces Smooth‑L1 regularized Echo State Networks (SL1ESN) that encourage sparsity in the readout layer while remaining differentiable for gradient‑based training. Using a twice‑differentiable Smooth‑L1 approximation, SL1ESN is trained centrally and via a second‑order federated aggregation scheme, achieving 75–95% sparsity across seven time‑series classification benchmarks. The resulting sparse models reduce storage, inference cost, and communication overhead, with only minor accuracy loss compared to dense baselines.

arXiv Machine Learning
Aug 6

Echo Flow Networks

arXiv:2509. 24122v3 Announce Type: replace Abstract: At the heart of time-series forecasting (TSF) lies a fundamental challenge: how can models efficiently and effectively capture long-range temporal dependencies across ever-growing sequences?

By Hongbo Liu, Jia Xu
arXiv Machine Learning
Jun 25

Frequency Domain Reservoir Computing

arXiv:2606. 24969v1 Announce Type: new Abstract: While the quadratic sequence-length bottleneck of transformers has fueled a resurgence in recurrent models, effectively capturing complex dynamics requires architectures that balance efficient training with highly expressive latent states.

By Klaus Schertler, Xiomara Runge, Andrea Ceni, David Kappel, Claudio Gallicchio
arXiv AI
Oct 26

Learning Structured Sparsity for Large Models: Bridging Model Compressibility and Efficient Inference

The paper introduces S‑SALAAD, a framework that jointly learns model weights, low‑rank, and structured sparse components during training. It supports hardware‑compatible sparsity patterns and couples structure learning with budget‑aware compression and dedicated CPU/GPU kernels, allowing efficient inference from a single checkpoint across multiple memory budgets. Experiments on Llama2 and Qwen3 demonstrate improved perplexity, memory usage, and latency on various hardware platforms compared to baselines.

By Tianxiang Xia, Kai Lion, Niao He, Michael Muehlebach, Melanie Zeilinger, Hao Ma
arXiv Machine Learning
Aug 31

DART-FL: Burst-Aware Multitask Federated Learning under Dynamic Inference Demand at the Edge

DART-FL is a multitask federated learning framework designed for edge devices that must balance online inference and model training under limited resources. It dynamically allocates resources between inference and training based on current inference backlog and service capacity, then distributes remaining training capacity among tasks using a queue‑aware scheduler that adjusts loss weights. Experiments on image classification datasets with synthetic and real workloads show that DART‑FL adapts to bursty inference demand, improving accuracy for high‑demand tasks while preserving overall multitask performance.

By Yiming Xie, Pinrui Yu, Geng Yuan, Xue Lin, Ningfang Mi
arXiv Machine Learning
Sep 7

Resilience Beyond Stationary Client Unavailability: Unlocking Efficient and Unbiased Federated Learning

The paper introduces FedSWE, a federated learning algorithm designed to handle non‑stationary and heterogeneous client availability without requiring prior real‑time knowledge of which devices are online. FedSWE compensates for missed computations, stabilizes global updates, and mixes local updates through implicit gossiping, all while adding only modest memory and computational overhead. The authors prove that FedSWE converges to a stationary point for non‑convex objectives and achieves linear speedup in certain scenarios, and they validate these claims with experiments on real‑world datasets featuring diverse client unavailability patterns.

By Ming Xiang, Stratis Ioannidis, Edmund Yeh, Carlee Joe-Wong, Lili Su