Unravelling Species-Specific Loading Effects on Oxygen Reduction Activity of Heteronuclear Single Atom Catalysts.

Toward high-density single atom catalysts (SACs), the interaction between neighboring SACs and the induced non-linear loading effect become crucial for their intrinsic catalytic performance. Despite recent investigations on homonuclear SACs, understanding such effect in heteronuclear SACs remains limited. Using Fe and Co SACs co-supported on the nitrogen-doped graphene as a model system, the loading effect on the site-specific activity of heteronuclear SACs toward oxygen reduction reaction (ORR) is here reported by density functional theory calculations.

Multiview Subgraph Neural Networks: Self-Supervised Learning With Scarce Labeled Data.

While graph neural networks (GNNs) have become the de facto standard for graph-based node classification, they impose a strong assumption on the availability of sufficient labeled samples. This assumption restricts the classification performance of prevailing GNNs on many real-world applications suffering from low-data regimes. Specifically, features extracted from scarce labeled nodes could not provide sufficient supervision for the unlabeled samples, leading to severe overfitting.

Toward Multilabel Classification for Multiple Disease Prediction Using Gut Microbiota Profiles.

Advancements in high-throughput technologies have yielded large-scale human gut microbiota profiles, sparking considerable interest in exploring the relationship between the gut microbiome and complex human diseases. Through extracting and integrating knowledge from complex microbiome data, existing machine learning (ML)-based studies have demonstrated their effectiveness in the precise identification of high-risk individuals. However, these approaches struggle to address the heterogeneity and sparsity of microbial features and explore the intrinsic relatedness among human diseases.

Solving Expensive Optimization Problems in Dynamic Environments With Meta-Learning.

Dynamic environments pose great challenges for expensive optimization problems, as the objective functions of these problems change over time and thus require remarkable computational resources to track the optimal solutions. Although data-driven evolutionary optimization and Bayesian optimization (BO) approaches have shown promise in solving expensive optimization problems in static environments, the attempts to develop such approaches in dynamic environments remain rarely explored. In this article, we propose a simple yet effective meta-learning-based optimization framework for solving the expensive dynamic optimization problems.

A Knee Point Driven Evolutionary Algorithm for Multiobjective Bilevel Optimization.

Bilevel optimization is a special type of optimization in which one problem is embedded within another. The bilevel optimization problem (BLOP) of which both levels are multiobjective functions is usually called the multiobjective BLOP (MBLOP). The expensive computation and nested features make it challenging to solve.

A Hybrid Neural Coding Approach for Pattern Recognition With Spiking Neural Networks.

Recently, brain-inspired spiking neural networks (SNNs) have demonstrated promising capabilities in solving pattern recognition tasks. However, these SNNs are grounded on homogeneous neurons that utilize a uniform neural coding for information representation. Given that each neural coding scheme possesses its own merits and drawbacks, these SNNs encounter challenges in achieving optimal performance such as accuracy, response time, efficiency, and robustness, all of which are crucial for practical applications.

Source Free Semi-Supervised Transfer Learning for Diagnosis of Mental Disorders on fMRI Scans.

The high prevalence of mental disorders gradually poses a huge pressure on the public healthcare services. Deep learning-based computer-aided diagnosis (CAD) has emerged to relieve the tension in healthcare institutions by detecting abnormal neuroimaging-derived phenotypes. However, training deep learning models relies on sufficient annotated datasets, which can be costly and laborious.

Block-Level Knowledge Transfer for Evolutionary Multitask Optimization.

Evolutionary multitask optimization is an emerging research topic that aims to solve multiple tasks simultaneously. A general challenge in solving multitask optimization problems (MTOPs) is how to effectively transfer common knowledge between/among tasks. However, knowledge transfer in existing algorithms generally has two limitations.

Architecture Augmentation for Performance Predictor via Graph Isomorphism.

Neural architecture search (NAS) can automatically design architectures for deep neural networks (DNNs) and has become one of the hottest research topics in the current machine learning community. However, NAS is often computationally expensive because a large number of DNNs require to be trained for obtaining performance during the search process. Performance predictors can greatly alleviate the prohibitive cost of NAS by directly predicting the performance of DNNs.

Spatial-Temporal Co-Attention Learning for Diagnosis of Mental Disorders From Resting-State fMRI Data.

Neuroimaging techniques have been widely adopted to detect the neurological brain structures and functions of the nervous system. As an effective noninvasive neuroimaging technique, functional magnetic resonance imaging (fMRI) has been extensively used in computer-aided diagnosis (CAD) of mental disorders, e.g.

Transferable Adaptive Differential Evolution for Many-Task Optimization.

The evolutionary multitask optimization (EMTO) algorithm is a promising approach to solve many-task optimization problems (MaTOPs), in which similarity measurement and knowledge transfer (KT) are two key issues. Many existing EMTO algorithms estimate the similarity of population distribution to select a set of similar tasks and then perform KT by simply mixing individuals among the selected tasks. However, these methods may be less effective when the global optima of the tasks greatly differ from each other.

Multitask Learning for Joint Diagnosis of Multiple Mental Disorders in Resting-State fMRI.

Facing the increasing worldwide prevalence of mental disorders, the symptom-based diagnostic criteria struggle to address the urgent public health concern due to the global shortfall in well-qualified professionals. Thanks to the recent advances in neuroimaging techniques, functional magnetic resonance imaging (fMRI) has surfaced as a new solution to characterize neuropathological biomarkers for detecting functional connectivity (FC) anomalies in mental disorders. However, the existing computer-aided diagnosis models for fMRI analysis suffer from unstable performance on large datasets.

Attention-Like Multimodality Fusion With Data Augmentation for Diagnosis of Mental Disorders Using MRI.

The globally rising prevalence of mental disorders leads to shortfalls in timely diagnosis and therapy to reduce patients' suffering. Facing such an urgent public health problem, professional efforts based on symptom criteria are seriously overstretched. Recently, the successful applications of computer-aided diagnosis approaches have provided timely opportunities to relieve the tension in healthcare services.

A Co-Training Framework for Heterogeneous Heuristic Domain Adaptation.

The purpose of this article is to address unsupervised domain adaptation (UDA) where a labeled source domain and an unlabeled target domain are given. Recent advanced UDA methods attempt to remove domain-specific properties by separating domain-specific information from domain-invariant representations, which heavily rely on the designed neural network structures. Meanwhile, they do not consider class discriminate representations when learning domain-invariant representations.

Fast Multilabel Feature Selection via Global Relevance and Redundancy Optimization.

Information theoretical-based methods have attracted a great attention in recent years and gained promising results for multilabel feature selection (MLFS). Nevertheless, most of the existing methods consider a heuristic way to the grid search of important features, and they may also suffer from the issue of fully utilizing labeling information. Thus, they are probable to deliver a suboptimal result with heavy computational burden.

Federated Multi-Task Learning for Joint Diagnosis of Multiple Mental Disorders on MRI Scans.

Objective: Deep learning (DL) techniques have been introduced to assist doctors in the interpretation of medical images by detecting image-derived phenotype abnormality. Yet the privacy-preserving policy of medical images disables the effective training of DL model using sufficiently large datasets. As a decentralized computing paradigm to address this issue, federated learning (FL) allows the training process to occur in individual institutions with local datasets, and then aggregates the resultant weights without risk of privacy leakage.

An Ensemble Surrogate-Based Coevolutionary Algorithm for Solving Large-Scale Expensive Optimization Problems.

Surrogate-assisted evolutionary algorithms (SAEAs) have shown promising performance for solving expensive optimization problems (EOPs) whose true evaluations are computationally or physically expensive. However, most existing SAEAs only focus on the problems with low dimensionality and they rarely consider solving large-scale EOPs (LSEOPs). To fill this research gap, this article proposes an ensemble surrogate-based coevolutionary optimizer for tackling LSEOPs.

A Surrogate-Assisted Differential Evolution Algorithm for High-Dimensional Expensive Optimization Problems.

The radial basis function (RBF) model and the Kriging model have been widely used in the surrogate-assisted evolutionary algorithms (SAEAs). Based on their characteristics, a global and local surrogate-assisted differential evolution algorithm (GL-SADE) for high-dimensional expensive problems is proposed in this article, in which a global RBF model is trained with all samples to estimate a global trend, and then its optima is used to significantly accelerate the convergence process. A local Kriging model prefers to select points with good predicted fitness and great uncertainty, which can effectively prevent the search from getting trapped into local optima.

Evolutionary Large-Scale Dynamic Optimization Using Bilevel Variable Grouping.

Variable grouping provides an efficient approach to large-scale optimization, and multipopulation strategies are effective for both large-scale optimization and dynamic optimization. However, variable grouping is not well studied in large-scale dynamic optimization when cooperating with multipopulation strategies. Specifically, when the numbers/sizes of the variable subcomponents are large, the performance of the algorithms will be substantially degraded.

Adapting Decomposed Directions for Evolutionary Multiobjective Optimization.

Decomposition methods have been widely employed in evolutionary algorithms for tackling multiobjective optimization problems (MOPs) due to their good mathematical explanation and promising performance. However, most decomposition methods only use a single ideal or nadir point to guide the evolution, which are not so effective for solving MOPs with extremely convex/concave Pareto fronts (PFs). To solve this problem, this article proposes an effective method to adapt decomposed directions (ADDs) for solving MOPs.

Competitive Decomposition-Based Multiobjective Architecture Search for the Dendritic Neural Model.

The dendritic neural model (DNM) is computationally faster than other machine-learning techniques, because its architecture can be implemented by using logic circuits and its calculations can be performed entirely in binary form. To further improve the computational speed, a straightforward approach is to generate a more concise architecture for the DNM. Actually, the architecture search is a large-scale multiobjective optimization problem (LSMOP), where a large number of parameters need to be set with the aim of optimizing accuracy and structural complexity simultaneously.

Improving Multispike Learning With Plastic Synaptic Delays.

Emulating the spike-based processing in the brain, spiking neural networks (SNNs) are developed and act as a promising candidate for the new generation of artificial neural networks that aim to produce efficient cognitions as the brain. Due to the complex dynamics and nonlinearity of SNNs, designing efficient learning algorithms has remained a major difficulty, which attracts great research attention. Most existing ones focus on the adjustment of synaptic weights.

Dual Differential Grouping: A More General Decomposition Method for Large-Scale Optimization.

Cooperative coevolution (CC) algorithms based on variable decomposition methods are efficient in solving large-scale optimization problems (LSOPs). However, many decomposition methods, such as the differential grouping (DG) method and its variants, are based on the theorem of function additively separable, which may not work well on problems that are not additively separable and will result in a bottleneck for CC to solve various LSOPs. This deficiency motivates us to study how the decomposition method can decompose more kinds of separable functions, such as the multiplicatively separable function, to improve the general problem-solving ability of CC on LSOPs.

A Cell-Based Fast Memetic Algorithm for Automated Convolutional Neural Architecture Design.

Neural architecture search (NAS) has attracted much attention in recent years. It automates the neural network construction for different tasks, which is traditionally addressed manually. In the literature, evolutionary optimization (EO) has been proposed for NAS due to its strong global search capability.