For decades, ABR has kept two kinds of intelligence apart. Neural policies learn rich behaviors yet forget them the moment the environment changes; rules never learn, and never forget. Every prior attempt to combine them has kept this separation, letting rules supervise, constrain, or override the network from outside. We dissolve the boundary itself. But no union can be trusted before it can be tested, and ABR has never known how to measure what its policies learn or forget. The field's yardstick is bandwidth statistics, and we show it misleads. Identical statistics can hide entirely different outcomes, while wildly different statistics can hide similar ones. We replace the yardstick before building the bridge, with Texture-Aware Generalization Evaluation, a protocol that judges a policy by its whole training journey across traces whose temporal nature is laid bare. What truly breaks a policy is invisible. No statistic reveals it, no feature extracts it, yet rules walk through it untouched, for they reason from physics and owe the data nothing. So we build the bridge. Neuro-Symbolic Manifold Alignment (NSMA) embeds rule decisions as anchors inside the latent space of the neural policy, so that it keeps learning where learning pays, and can no longer forget what rules have always known. Generalization cannot be argued, only survived. We raise NSMA on 3G traces alone and release it, without fine-tuning, into eight unseen datasets spanning 4G, 5G, and WiFi, and onto a real-world player. It outperforms every state-of-the-art baseline. And when we open its latent space to ask why, probing and visualization return the same answer the design promised. https://tinyzqh.github.io/NSMA/
Andrea De Luna, Susanna Peretti, Chiara Contoli +1cs.LG cs.AI
The federated learning (FL) paradigm fosters distributed pervasive computing combined with artificial intelligence techniques, allowing for optimized data usage and improved mitigation of privacy concerns. Indeed, model training occurs on the client's local devices, and model parameters are subsequently shared with a centralized server. However, there is a need to find a tradeoff between models' personalization and generalization capabilities. In this paper, we design and implement several testing scenarios devoted to evaluating and comparing the centralized, local, and federated paradigm performances. We also design and implement a scenario that emulates a change in clients' data. We then present experimental results of the FedAvg algorithm applied to the Human Activity Recognition (HAR) domain to understand the trade-off between personalized and generalized accuracy. Results show that, although FedAvg confirms a higher degree of personalization capabilities while keeping a high degree of generalization with respect to the traditional centralized learning, this result is not so obvious under stressful conditions, such as when varying class distribution over clients.
Dongwon Kim, Donghee Kim, Sung Kuk Shyn +1cs.LG stat.ML
Federated learning (FL) often struggles with generalization due to heterogeneous client data. Local models are prone to overfitting their local data distributions, and even transferable features can be distorted during aggregation. To address these challenges, we propose FedCONST, an approach that adaptively modulates update magnitudes based on the parameter strength of the global model. This prevents over-emphasizing well-learned parameters while reinforcing underdeveloped ones. Specifically, FedCONST employs linear convex constraints to ensure training stability and preserve locally learned generalization capabilities during aggregation. A Gradient Signal to Noise Ratio (GSNR) analysis further validates the effectiveness of FedCONST in enhancing feature transferability and robustness. As a result, FedCONST effectively aligns local and global objectives, mitigating overfitting and promoting stronger generalization across diverse FL environments, achieving state-of-the-art performance.