Author name cluster

Yao Yang

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

5 papers

1 author row

AAAI Conference 2024 Conference Paper

Adaptive Meta-Learning Probabilistic Inference Framework for Long Sequence Prediction

Jianping Zhu
Xin Guo
Yang Chen
Yao Yang
Wenbo Li
Bo Jin
Fei Wu

Long sequence prediction has broad and significant application value in fields such as finance, wind power, and weather. However, the complex long-term dependencies of long sequence data and the potential domain shift problems limit the effectiveness of traditional models in practical scenarios. To this end, we propose an Adaptive Meta-Learning Probabilistic Inference Framework (AMPIF) based on sequence decomposition, which can effectively enhance the long sequence prediction ability of various basic models. Specifically, first, we decouple complex sequences into seasonal and trend components through a frequency domain decomposition module. Then, we design an adaptive meta-learning task construction strategy, which divides the seasonal and trend components into different tasks through a clustering-matching approach. Finally, we design a dual-stream amortized network (ST-DAN) to capture shared information between seasonal-trend tasks and use the support set to generate task-specific parameters for rapid generalization learning on the query set. We conducted extensive experiments on six datasets, including wind power and finance scenarios, and the results show that our method significantly outperforms baseline methods in prediction accuracy, interpretability, and algorithm stability and can effectively enhance the long sequence prediction capabilities of base models. The source code is publicly available at https://github.com/Zhu-JP/AMPIF.

PDF Details DOI

IJCAI Conference 2024 Conference Paper

BlockEcho: Retaining Long-Range Dependencies for Imputing Block-Wise Missing Data

Qiao Han
Mingqian Li
Yao Yang
Yiteng Zhai

Block-wise missing data poses significant challenges in real-world data imputation tasks. Compared to scattered missing data, block-wise gaps exacerbate adverse effects on subsequent analytic and machine learning tasks, as the lack of local neighboring elements significantly reduces the interpolation capability and predictive power. However, this issue has not received adequate attention. Most SOTA matrix completion methods appeared less effective, primarily due to overreliance on neighboring elements for predictions. We systematically analyze the issue and propose a novel matrix completion method "BlockEcho" for a more comprehensive solution. This method creatively integrates Matrix Factorization (MF) within Generative Adversarial Networks (GAN) to explicitly retain long-distance inter-element relationships in the original matrix. Besides, we incorporate an additional discriminator for GAN, comparing the generator's intermediate progress with pre-trained MF results to constrain high-order feature distributions. Subsequently, we evaluate BlockEcho on public datasets across three domains. Results demonstrate superior performance over both traditional and SOTA methods when imputing block-wise missing data, especially at higher missing rates. The advantage also holds for scattered missing data at high missing rates. We also contribute on the analyses in providing theoretical justification on the optimality and convergence of fusing MF and GAN for missing block data.

PDF Details DOI

IJCAI Conference 2024 Conference Paper

CMACE: CMAES-based Counterfactual Explanations for Black-box Models

Xudong Yin
Yao Yang

Explanatory Artificial Intelligence plays a vital role in machine learning, due to its widespread application in decision-making scenarios, e. g. , credit lending. Counterfactual Explanation (CFE) is a new kind of explanatory method that involves asking “what if ”, i. e. what would have happened if model inputs slightly change. To answer the question, Counterfactual Explanation aims at finding a minimum perturbation in model inputs leading to a different model decision. Compared with model-agnostic approaches, model-specific CFE approaches designed only for specific type of models usually have better performance in finding optimal counterfactual perturbations, owing to access to the inner workings of models. To deal with this dilemma, this work first proposes CMAES-based Counterfactual Explanations (CMACE): an effective model-agnostic counterfactual generating approach based on Covariance Matrix Adaptation Evolution Strategy (CMA-ES) and a warm starting scheme that provides good initialization of the counterfactual's mean and covariance parameters for CMA-ES taking advantage of prior information of training samples. CMACE significantly outperforms another state-of-art (SOTA) model-agnostic approach (Bayesian Counterfactual Generator, BayCon) with various experimental settings. Extensive experiments also demonstrate that CMACE is superior to a SOTA model-specific approach (Flexible Optimizable Counterfactual Explanations for Tree Ensembles, FOCUS) that is designed for tree-based models using gradient-based optimization.

PDF Details DOI

JBHI Journal 2022 Journal Article

Divergent and Convergent Imaging Markers Between Bipolar and Unipolar Depression Based on Machine Learning

Huifeng Zhang
Zhen Zhou
Lei Ding
Chuangxin Wu
Meihui Qiu
Yueqi Huang
Feng Jin
Ting Shen

Distinguishing bipolar depression (BD) from unipolar depression (UD) based on symptoms only is challenging. Brain functional connectivity (FC), especially dynamic FC, has emerged as a promising approach to identify possible imaging markers for differentiating BD from UD. However, most of such studies utilized conventional FC and group-level statistical comparisons, which may not be sensitive enough to quantify subtle changes in the FC dynamics between BD and UD. In this paper, we present a more effective individualized differentiation model based on machine learning and the whole-brain “high-order functional connectivity (HOFC)” network. The HOFC, capturing temporal synchronization among the dynamic FC time series, a more complex “chronnectome” metric compared to the conventional FC, was used to classify 52 BD, 73 UD, and 76 healthycontrols (HC). We achieved a satisfactory accuracy (70. 40%) in BD vs. UD differentiation. The resultant contributing features revealed the involvement of the coordinated flexible interactions among sensory (e. g. , olfaction, vision, and audition), motor, and cognitive systems. Despite sharing common chronnectome of cognitive and affective impairments, BD and UD also demonstrated unique dynamic FC synchronization patterns. UD is more associated with abnormal visual-somatomotor inter-network connections, while BD is more related to impaired ventral attention-frontoparietal inter-network connections. Moreover, we found that the illness duration modulated the BD vs. UD separation, with the differentiation performance hampered by the secondary disease effects. Our findings suggest that BD and UD may have divergent and convergent neural substrates, which further expand our knowledge of the two different mental disorders.

Details DOI

IJCAI Conference 2019 Conference Paper

Triplet Enhanced AutoEncoder: Model-free Discriminative Network Embedding

Yao Yang
Haoran Chen
Junming Shao

Deep autoencoder is widely used in dimensionality reduction because of the expressive power of the neural network. Therefore, it is naturally suitable for embedding tasks, which essentially compresses high-dimensional information into a low-dimensional latent space. In terms of network representation, methods based on autoencoder such as SDNE and DNGR have achieved comparable results with the state-of-arts. However, all of them do not leverage label information, which leads to the embeddings lack the characteristic of discrimination. In this paper, we present Triplet Enhanced AutoEncoder (TEA), a new deep network embedding approach from the perspective of metric learning. Equipped with the triplet-loss constraint, the proposed approach not only allows capturing the topological structure but also preserving the discriminative information. Moreover, unlike existing discriminative embedding techniques, TEA is independent of any specific classifier, we call it the model-free property. Extensive empirical results on three public datasets (i. e, Cora, Citeseer and BlogCatalog) show that TEA is stable and achieves state-of-the-art performance compared with both supervised and unsupervised network embedding approaches on various percentages of labeled data. The source code can be obtained from https: //github. com/yybeta/TEA.

PDF Details