This article proposes an adaptive localized decision variable analysis approach under the decomposition-based framework to solve the large-scale multiobjective and many-objective optimization problems (MaOPs). Its main idea is to incorporate the guidance of reference vectors into the control variable analysis and optimize the decision variables using an adaptive strategy. Especially, in the control variable analysis, for each search direction, the convergence relevance degree of each decision variable is measured by a projection-based detection method. In the decision variable optimization, the grouped decision variables are optimized with an adaptive scalarization strategy, which is able to adaptively balance the convergence and diversity of the solutions in the objective space. The proposed algorithm is evaluated with a suite of test problems with 2–10 objectives and 200–1000 variables. Experimental results validate the effectiveness and efficiency of the proposed algorithm on the large-scale multiobjective and MaOPs.

The performance of decomposition-based algorithms is sensitive to the Pareto front shapes since their reference vectors preset in advance are not always adaptable to various problem characteristics with no a priori knowledge. For this issue, this article proposes an adaptive reference vector reinforcement learning (RVRL) approach to decomposition-based algorithms for industrial copper burdening optimization. The proposed approach involves two main operations, that is: 1) a reinforcement learning (RL) operation and 2) a reference point sampling operation. Given the fact that the states of reference vectors interact with the landscape environment (quite often), the RL operation treats the reference vector adaption process as an RL task, where each reference vector learns from the environmental feedback and selects optimal actions for gradually fitting the problem characteristics. Accordingly, the reference point sampling operation uses estimation-of-distribution learning models to sample new reference points. Finally, the resultant algorithm is applied to handle the proposed industrial copper burdening problem. For this problem, an adaptive penalty function and a soft constraint-based relaxing approach are used to handle complex constraints. Experimental results on both benchmark problems and real-world instances verify the competitiveness and effectiveness of the proposed algorithm.

Mobile edge computing (MEC) emerges as an appealing paradigm to provide time-sensitive computing services for industrial Internet of Things (IIoT) applications. How to guarantee truthfulness and budget-balance under locality constraints is an important issue to the allocation and pricing design of the MEC system. In this paper, we propose a truthful combinatorial double auction mechanism, which integrates the padding concept and the efficient pricing strategy to guarantee desirable properties in constrained MEC environments. This mechanism takes into account the locality characteristics of the MEC systems, where mobile devices (MDs) only offload tasks to edge servers (ESs) in the proximity with various requirements, and ESs only serve their neighboring MDs with limited resources. To be specific, for allocation, a linear programming (LP)-based padding method is used to obtain the near-optimal solution in the polynomial time. For pricing, a critical-value-based pricing strategy and a VCG-based pricing strategy are designed for MDs and ESs to achieve truthfulness and budget-balance. Our theoretical analysis confirms that TCDA is able to hold a set of desirable economic properties, including truthfulness, individual rationality, and budget-balance. Furthermore, simulation results validate the theoretical analysis, and verify the effectiveness and efficiency of TCDA.

In multi-objective evolutionary neural architecture search (NAS), existing predictor-based methods commonly suffer from the rank disorder issue that a candidate high-performance architecture may have a poor ranking compared with the worse architecture in terms of the trained predictor.To alleviate the above issue, we aim to train a Pareto-wise end-to-end ranking classifier to simplify the architecture search process by transforming the complex multi-objective NAS task into a simple classification task. To this end, a classifier-based Pareto evolution approach is proposed, where an online classifier is trained to directly predict the dominance relationship between the candidate and reference architectures. Besides, an adaptive clustering method is designed to select reference architectures for the classifier, and an α-domination assisted approach is developed to address the imbalance issue of positive and negative samples. The proposed approach is compared with a number of state-of-the-art NAS methods on widely-used test datasets, and computation results show that the proposed approach is able to alleviate the rank disorder issue and outperforms other methods. Especially, the proposed method is able to find a set of promising network architectures with different model sizes ranging from 2M to 5M under diverse objectives and constraints.

Integrated sensing and communication (ISAC) has emerged as a critical convergence of traditional communication and radar systems in terms of spectrum, software, and hardware platforms within a unified framework. This survey aims to provide a comprehensive overview on ISAC, beginning with its layered architecture and continuing to discuss about many key components, such as technologies, standardizations, prototypes and testbeds. ISAC architecture is divided into terminal and signal layer, resource layer, function layer, application layer, and computation layer, each of which is examined in detail to understand its roles and interplay within an ISAC ecosystem. Moving beyond the layered architecture, we explore various enabling technologies that empower ISAC, such as beamforming, antenna array design, etc.. Notably, this paper reviews emerging technologies such as reconfigurable intelligent surfaces (RIS), new materials, and innovative approach of software-defined radio/radar (SDR), as well as near-field (NF) ISAC. In addition, this survey covers the standardization efforts of international bodies, which are instrumental in shaping an evolutional trajectory of ISAC technologies. The prototypes and testbeds are presented to validate theoretical concepts and practical implementations of ISAC. Finally, the survey concludes with open issues and potential future directions for ISAC, providing a roadmap for its ongoing development and integration into next-generation networks.

Machine learning (ML) typically relies on the assumption that training and testing distributions are identical and that data are centrally stored for training and testing. However, in real-world scenarios, distributions may differ significantly, and data are often distributed across different devices, organizations, or edge nodes. Consequently, it is to develop models capable of effectively generalizing across unseen distributions in data spanning various domains. In response to this challenge, there has been a surge of interest in federated domain generalization (FDG) in recent years. FDG synergizes federated learning (FL) and domain generalization (DG) techniques, facilitating collaborative model development across diverse source domains for effective generalization to unseen domains, all while maintaining data privacy. However, generalizing the federated model under domain shifts remains a complex, underexplored issue. This article provides a comprehensive survey of the latest advancements in this field. Initially, we discuss the development process from traditional ML to domain adaptation (DA) and DG, leading to FDG, as well as provide the corresponding formal definition. Subsequently, we classify recent methodologies into four distinct categories: federated domain alignment (FDAL), data manipulation (DM), learning strategies (LSs), and aggregation optimization (AO), detailing appropriate algorithms for each. We then overview commonly utilized datasets, applications, evaluations, and benchmarks. Conclusively, this survey outlines potential future research directions.