United States

Due to the communication bottleneck in distributed and decentralized federated learning applications, algorithms using compressed communication have attracted significant attention. The Error Feedback (EF) is a widely-studied compression framework for convergence with biased compressors such as top-$k$ sparsification. Although various improvements have been obtained in recent years, the theoretical guarantee for EF-type framework is still limited. Previous works either 1) rely on strong assumptions such as bounded gradient/dissimilarity assumptions, thus can not deal with arbitrary data heterogeneity and also slow the convergence speed, or 2) can not enjoy linear speedup in the number of clients. In this work, we propose a new EFSkip framework which removes the strong assumptions to allow arbitrary data heterogeneity and enjoys linear speedup for significantly improving upon previous results. In particular, EFSkip achieves the complexity result $O(\frac{\sigma^2}{n\epsilon^4} + \frac{1}{\epsilon^2})$ while previous EF21 only obtains $O(\frac{\sigma^2}{\delta^3\epsilon^4} + \frac{1}{\delta\epsilon^2})$, i.e., EFSkip enjoys the linear speedup in the number of clients $n$ (reducing the result linearly using more clients) and also removes the compression factor $\delta$ (matching the result without compression). We also show that EFSkip enjoys linear speedup and achieves faster convergence for nonconvex problems satisfying Polyak-Lojasiewicz (PL) condition. Finally, the deep learning experiments validate the theoretical results and confirm the practical superiority of EFSkip. We believe that the new EFSkip framework will have a large impact on the communication- and computation-efficient distributed and decentralized federated learning.

AAAI 2025

EFSkip: A New Error Feedback with Linear Speedup for Compressed Federated Learning with Arbitrary Data Heterogeneity

distributed machine learning

federated learning

We are pleased to announce the Thirty-Ninth AAAI Conference on Artificial Intelligence (AAAI-25), which will be held in Philadelphia, Pennsylvania at the Pennsylvania Convention Center from February 25 to March 4, 2025.

The purpose of the AAAI conference series is to promote research in Artificial Intelligence (AI) and foster scientific exchange between researchers, practitioners, scientists, students, and engineers across the entirety of AI and its affiliated disciplines. AAAI-25 will feature technical paper presentations, special tracks, invited speakers, workshops, tutorials, poster sessions, senior member presentations, competitions, and exhibit programs, and a range of other activities to be announced.

### [Invited Speakers](https://aaai.org/conference/aaai/aaai-25/aaai-25-invited-speakers/)

Register [here](https://aaai.org/conference/aaai/aaai-25/registration/)

The purpose of the AAAI conference series is to promote research in Artificial Intelligence (AI) and foster scientific exchange between researchers, practitioners, scientists, students, and engineers across the entirety of AI and its affiliated disciplines. AAAI-25 will feature technical paper presentations, special tracks, invited speakers, workshops, tutorials, poster sessions, senior member presentations, competitions, and exhibit programs, and a range of other activities to be announced.



technical paper

Speaker recognition technology is applied to various tasks, from personal virtual assistants to secure access systems. However, the robustness of these systems against adversarial attacks, particularly to additive perturbations, remains a significant challenge. In this paper, we pioneer applying robustness certification techniques to speaker recognition, originally developed for the image domain. Our work covers this gap by transferring and improving randomized smoothing certification techniques against norm-bounded additive perturbations for classification and few-shot learning tasks to speaker recognition. We demonstrate the effectiveness of these methods on VoxCeleb 1 and 2 datasets for several models. We expect this work to improve the robustness of voice biometrics and accelerate the research of certification methods in the audio domain.

Certification of Speaker Recognition Models to Additive Perturbations

Large Language Models (LLMs) often face challenges when prompted to generate content under specific constraints or conditions. However, in such cases it is often easy to check whether these constraints are satisfied or violated. Recent works have shown that LLMs can benefit from such ``corrective feedback''. Here we claim that this skill of LLMs can be significantly enhanced via training. We introduce an RL framework for teaching models to use such rewards, by simulating interaction sessions, and rewarding the model according to its ability to satisfy the constraints.
We refer to our method as CORGI (Controlled Generation with RL for Guided Interaction), and evaluate it on a variety of controlled generation tasks using unlabeled training data. We find that CORGI consistently outperforms the baseline reinforcement learning method that does not incorporate conversational feedback. Furthermore, CORGI's interactive framework enables meta-learning, allowing the LLM to generalize better to guided interaction in new tasks. Through this dynamic interaction, the model learns to optimize its responses in real time, ensuring improved compliance with predefined requirements. Our experiments demonstrate that combining textual feedback with reinforcement learning results in more effective optimization and enhanced performance across a diverse range of generation tasks. These findings indicate that conversational optimization, when combined with reinforcement learning, significantly improves the effectiveness of LLMs in controlled generation contexts.

Teaching Models to Improve on Tape

Extracting lane topology from perspective views (PV) is crucial for planning and control in autonomous driving. This approach extracts potential drivable trajectories for self-driving vehicles without relying on high-definition (HD) maps. However, the unordered nature and weak long-range perception of the DETR-like framework can result in misaligned segment endpoints and limited topological prediction capabilities. Inspired by the learning of contextual relationships in language models, the connectivity relations in roads can be characterized as explicit topology sequences. In this paper, we introduce $\textbf{Topo2Seq}$, a novel approach for enhancing topology reasoning via topology sequences learning. The core concept of Topo2Seq is a randomized order prompt-to-sequence learning between lane segment decoder and topology sequence decoder. The dual-decoder branches simultaneously learn the lane topology sequences extracted from the Directed Acyclic Graph (DAG) and the lane graph containing geometric information. Randomized order prompt-to-sequence learning extracts unordered key points from the lane graph predicted by the lane segment decoder, which are then fed into the prompt design of the topology sequence decoder to reconstruct an ordered and complete lane graph. In this way, the lane segment decoder learns powerful long-range perception and accurate topological reasoning from the topology sequence decoder. Notably, topology sequence decoder is only introduced during training and does not affect the inference efficiency. Experimental evaluations on the OpenLane-V2 dataset demonstrate the state-of-the-art performance of Topo2Seq in topology reasoning.

Topo2Seq: Enhanced Topology Reasoning via Topology Sequence Learning

Dynamic graphs exhibit the intricate and intertwined spatio-temporal evolutionary patterns, widely existing in real-world scenarios. Nevertheless, the structure incompleteness, noise, and redundancy result in poor robustness for the prevailing Dynamic Graph Neural Networks (DGNNs). Dynamic Graph Structure Learning (DGSL) offers promising insight into optimizing graph structures. However, aside from encountering unacceptable quadratic complexity, it overly relies on the heuristic priors, making it difficult to discover underlying predictive patterns. How to efficiently refine dynamic structures, capture intrinsic dependencies, and learn robust representations for downstream tasks is still under-explored. In this work, we propose the **REDGSL**, an **E**fficient **D**ynamic **G**raph **S**tructure **L**earning framework for **R**obust graph representations. To accelerate the spatio-temporal structure learning, we propose a kernelized dynamic message-passing operator that reduces the quadratic time complexity to linear. To capture global intrinsic dynamics, we establish the dynamic graph as a self-contained system with State Space Model. By discretizing the system states with the cross-snapshot graph adjacency, we enable the long-distance dependencies capturing with the selective snapshot scan. To endow learned dynamic structures more expressive with informativeness, we propose the self-supervised Principle of Relevant Information for DGSL to regularize the most relevant yet least redundant information, enhancing global robustness. Extensive experiments demonstrate the superiority of the efficiency and robustness of our REDGSL compared with the state-of-the-art baselines against adversarial attacks.

DG-Mamba: Robust and Efficient Dynamic Graph Structure Learning with Selective State Space Models

The ability to autonomously explore and resolve tasks with minimal human guidance is crucial for the self-development of embodied robots. Although reinforcement learning methods can largely ease human effort, designing reward functions for real-world tasks, especially high-dimensional robotic control, is challenging due to complex relationships among joints and tasks. Recent advancements in the aid of large language models (LLMs) enable automatic reward function design. However, current approaches evaluate reward functions by re-training policies from scratch placing an undue burden on the reward function, expecting it to be effective at every stage of the policy improvement process, from initiation to convergence. We argue for a more practical strategy in robotic autonomy, focusing on refining existing policies with policy-dependent reward functions rather than seeking a universal reward function. To this end, we propose a novel reward-policy co-evolution framework where the reward function and the learned policy benefit from each other's progressive on-the-fly improvements, resulting in more efficient and higher-performing skill acquisition. 
Specifically, the reward evolution process translates the robot's previous best reward function, descriptions of tasks and environment into text inputs. These inputs are used to query LLMs to generate a dynamic amount of reward function candidates, ensuring continuous improvement through each evolutionary round. For policy evolution, our method generates new policy populations by hybridizing historically optimal and random policies. Through an improved Bayesian optimization, our approach efficiently and robustly identifies the most capable and plastic reward-policy combination, which then proceeds to the next round of co-evolution.
Despite using less data, our approach demonstrates an average normalized improvement of $95.3$\% across various high-dimensional robotic skill learning tasks.

Efficient Language-instructed Skill Acquisition via Reward-Policy Co-Evolution

In recent years, with the advancements in brain science, spiking neural networks (SNNs) have garnered significant attention. SNNs can generate spikes that mimic the function of neurons transmission in humans brain, thereby significantly reducing computational costs by the event-driven nature during training. While deep SNNs have shown impressive performance on classification tasks, they still face challenges in more complex tasks such as object detection. In this paper, we propose SpikingYOLOX, extending the structure of the original YOLOX by introducing signed spiking neurons and fast Fourier convolution (FFC). The designed ternary signed spiking neurons could generate three kinds of spikes to obtain more robust features in the deep layer of the backbone. Meanwhile, we integrate FFC with SNN modules to enhance object detection performance, because its global receptive field is beneficial to the object detection task. Extensive experiments demonstrate that the proposed SpikingYOLOX achieves state-of-the-art performance among other SNN-based object detection methods.

SpikingYOLOX: Improved YOLOX Object Detection with Fast Fourier Convolution and Spiking Neural Networks

Recent works have explored the use of counting queries coupled with Description Logic ontologies.
The answer of such a query in a particular model of a knowledge base is either an integer or $\infty$, and its spectrum is the set of its answers over all models.
While it is unclear how to compute and manipulate such a set in general, we identify a class of counting queries whose spectra can be effectively represented.
Further focusing on atomic counting queries, we pinpoint the possible shapes of a spectrum when the ontology is formulated in $ALCIF$: they are essentially the subsets of $\mathbb{N} \cup \{ \infty\}$ closed under addition.
For most sublogics of $ALCIF$, we show that possible spectra enjoy simpler shapes, being $[ m, \infty]$ or variations thereof.
To obtain our results, we refine constructions used for finite model reasoning in those DLs and notably rely on a cycle-reversion technique for the Horn fragment of $ALCIF$.
We also study the data complexity of computing the proposed effective representation and establish the $FP^{NP[log]}$-completeness of this task under several settings.

Spectra of Cardinality Queries over Description Logic Knowledge Bases

LiDAR-based 3D object detection is crucial for autonomous driving. However, due to the quality deterioration of LiDAR point clouds, it suffers from performance degradation in adverse weather conditions. Fusing LiDAR with the weather-robust 4D radar sensor is expected to solve this problem; however, it faces challenges of significant differences in terms of data quality and the degree of degradation in adverse weather. To address these issues, we introduce L4DR, a weather-robust 3D object detection method that effectively achieves LiDAR and 4D Radar fusion. Our L4DR proposes Multi-Modal Encoding (MME) and Foreground-Aware Denoising (FAD) modules to reconcile sensor gaps, which is the first exploration of the complementarity of early fusion between LiDAR and 4D radar. Additionally, we design an Inter-Modal and IntraModal ({IM} 2 ) parallel feature extraction backbone coupled with a Multi-Scale Gated Fusion (MSGF) module to counteract the varying degrees of sensor degradation under adverse weather conditions. Experimental evaluation on a VoD dataset with simulated fog proves that L4DR is more adaptable to changing weather conditions. It delivers a significant performance increase under different fog levels, improving the 3D mAP by up to 20.0% over the traditional LiDAR-only approach. Moreover, the results on the K-Radar dataset validate the consistent performance improvement of L4DR in real-world adverse weather conditions.

L4DR: LiDAR-4DRadar Fusion for Weather-Robust 3D Object Detection

Diffusion-based models have been recently shown to be high-quality data generators. However, its performance severely degrades when training on non-stationary changing data distributions in an online manner, which is because of catastrophic forgetting. In this paper, we propose to enable the diffusion model with a novel Dynamic Expansion Memory Unit (DEMU) approach that adaptively creates new memory buffers to preserve the information deemed critical for the training of the model. Having a selective memory buffering unit is essential for training diffusion networks, which are expensive to train, especially when deployed in resource constrained environments. A Maximum Mean Discrepancy (MMD) based expansion mechanism, that evaluates probabilistic distances between each previously defined memory buffers and the newly given data, as an expansion signal, is employed for ensuring the learning of a diversity of information. A novel memory compaction approach is proposed to automatically remove statistically overlapping memory units through a graph relationship evaluation, is employed for preventing the limitless expansion of DEMU. In addition, we propose a new model expansion mechanism to automatically add new diffusion models as experts in a mixture system, which enhances the multi-domain image generation performance. Comprehensive results show that the proposed approach performs better than the state-of-the-art.

Lifelong Scalable Generative System via Online Maximum Mean Discrepancy

DNN-based watermarking methods have rapidly advanced, with the ``Encoder-Noise Layer-Decoder'' (END) framework being the most widely used. To ensure end-to-end training, the noise layer in the framework must be differentiable. However, real-world distortions are often non-differentiable, leading to challenges in end-to-end training. 
Existing solutions only treat the distortion perturbation as additive noise, which does not fully integrate the effect of distortion in training.
To better incorporate non-differentiable distortions into training, we propose a novel dual-decoder architecture ($\textbf{END$^{2}$}$). Unlike conventional END architecture, our method employs two structurally identical decoders: the Teacher Decoder, processing pure watermarked images, and the Student Decoder, handling distortion-perturbed images. 
The gradient is backpropagated only through the Teacher Decoder branch to optimize the encoder thus bypassing the problem of non-differentiability. To ensure resistance to arbitrary distortions, we enforce alignment of the two decoders' feature representations by maximizing the cosine similarity between their intermediate vectors on a hypersphere. 
Extensive experiments demonstrate that our scheme outperforms state-of-the-art algorithms under various non-differentiable distortions. Moreover, even without the differentiability constraint, our method surpasses baselines with a differentiable noise layer. Our approach is effective and easily implementable across all END architectures, enhancing practicality and generalizability.

Downloads

Next from AAAI 2025

Certification of Speaker Recognition Models to Additive Perturbations

Similar lecture

Accelerated Methods with Compressed Communications for Distributed Optimization Problems Under Data Similarity

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES

.css-70qvj9{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-align-items:center;-webkit-box-align:center;-ms-flex-align:center;align-items:center;}Downloads

Next from AAAI 2025

Certification of Speaker Recognition Models to Additive Perturbations

Similar lecture

Accelerated Methods with Compressed Communications for Distributed Optimization Problems Under Data Similarity

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES

Downloads