Federated Adversarial Learning (FAL) is a robust framework for resisting adversarial attacks on federated learning. Although some FAL studies have developed efficient algorithms, they primarily focus on convergence performance and overlook generalization. Generalization is crucial for evaluating algorithm performance on unseen data. However, generalization analysis is more challenging due to non-smooth adversarial loss functions. A common approach to addressing this issue is to leverage smoothness approximation. In this paper, we develop algorithm stability measures to evaluate the generalization performance of two popular FAL algorithms: Vanilla FAL (VFAL) and Slack FAL (SFAL), using three different smooth approximation methods: 1) Surrogate Smoothness Approximation (SSA), (2) Randomized Smoothness Approximation (RSA), and (3) Over-Parameterized Smoothness Approximation (OPSA). Based on our in-depth analysis, we answer how to properly set the smoothness approximation method to mitigate generalization error in FAL. Moreover, we identify RSA as the most effective generalization error reduction method. In highly data-heterogeneous scenarios, we also recommend employing SFAL to mitigate the deterioration of generalization performance caused by heterogeneity. Based on our theoretical results, we provide insights to help develop more efficient FAL algorithms, such as designing new metrics and dynamic aggregation rules to mitigate heterogeneity.

Meta-learning has achieved significant advancements, with generalization emerging as a key metric for evaluating meta-learning algorithms. While recent studies have mainly focused on training strategies, data-split methods, and tightening generalization bounds, they often ignore the impact of inner-levels on generalization. To bridge this gap, this paper focuses on several prominent meta-learning algorithms and establishes two generalization analytical frameworks for them based on their inner-processes: the Gradient Descent Framework (GDF) and the Proximal Descent Framework (PDF). Within these frameworks, we introduce two novel algorithmic stability definitions and derive the corresponding generalization bounds. Our findings reveal a trade-off of inner-levels under GDF, whereas PDF exhibits a beneficial relationship. Moreover, we highlight the critical role of the meta-objective function in minimizing generalization error. Inspired by this, we propose a new, simplified meta-objective function definition to enhance generalization performance. Many real-world experiments support our findings and show the improvement of the new meta-objective function.

The generation of text proposals (i.e. local candidate regions most likely containing textual components) is one critical and prerequisite step in scene text detection task. As one popular text proposal algorithm, the Maximally Stable Extremal Region (MSER), has been exploited by many successful text detection methods, while on the other hand has difficulties in handling complicated scene text involving touching characters and characters composed of multiple unconnected parts (e.g. Chinese characters and text in dot matrix fonts). In this paper, we propose a novel text proposal method for localizing text in natural images, which integrates the MSER algorithm with the multi-scale sliding window framework and efficiently extracts Windowed Maximally Stable Extremal Regions (WMSERs) as text proposals. We further present effective proposal filtering and grouping algorithms for exploiting WMSER-based proposals in text detection task. Experiments on public scene text datasets demonstrate the promising aspects of the proposed method in dealing with complicated scene text.

Text embedded in natural scene images provide rich semantic information about the scene, which is of great value for content-based image applications. Due to the variety of text appearance and the complexity of scene context, however, text detection in natural images remains a challenging task. In this paper, we propose a robust text detection method that hierarchically and progressively localizes textual components at pixel, intra-character and inter-character levels. For each level, a seed growing mechanism is adopted, which starts by detecting well-conditioned seed textual components and then grows from the seeds to localize related degraded components, exploiting the cues captured by the seeds. We further propose a random walk with restart algorithm to robustly aggregate character candidates into text lines. The experiment on public scene text datasets demonstrates the state-of-the-art performance of the proposed method.