paper-with-me

Papers

Compositional Training for End-to-End Deep AUC Maximization

2021-09-29 · ICLR 2022 4 · Zhuoning Yuan, Zhishuai Guo, Nitesh Chawla, Tianbao Yang

Recently, deep AUC maximization (DAM) has achieved great success in different domains (e.g., medical image classification). However, the end-to-end training for deep AUC maximization still remains a challenging problem. Previous studies employ an ad-hoc two-stage approach that first trains the network by optimizing a traditional loss (e.g., cross-entropy loss) and then finetunes the network by optimizing an AUC loss. This is because that training a deep neural network from scratch by maximizing an AUC loss usually does not yield a satisfactory performance. This phenomenon can be attributed to the degraded feature representations learned by maximizing the AUC loss from scratch. To address this issue, we propose a novel compositional training framework for end-to-end DAM, namely compositional DAM. The key idea of compositional training is to minimize a compositional objective function, where the outer function corresponds to an AUC loss and the inner function represents a gradient descent step for minimizing a traditional loss, e.g., the cross-entropy (CE) loss. To optimize the non-standard compositional objective, we propose an efficient and provable stochastic optimization algorithm. The proposed algorithm enhances the capabilities of both robust feature learning and robust classifier learning by alternatively taking a gradient descent step for the CE loss and for the AUC loss in a systematic way. We conduct extensive empirical studies on imbalanced benchmark and medical image datasets, which unanimously verify the effectiveness of the proposed method. Our results show that the compositional training approach dramatically improves both the feature representations and the testing AUC score compared with traditional deep learning approaches, and yields better performance than the two-stage approaches for DAM as well.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

image-classificationImage ClassificationMedical Image ClassificationStochastic Optimization

Similar Papers 제목 키워드 기반

Federated Compositional Deep AUC Maximization

2023-04-20 · NeurIPS 2023 11 · Xinwen Zhang, Yihan Zhang, Tianbao Yang, Richard Souvenir 외

Federated learning has attracted increasing attention due to the promise of balancing privacy and large-scale learning; numerous approaches have been proposed. However, most existing approaches focus on problems with bal…

Federated Learning

Towards Compositional Generalization of LLMs via Skill Taxonomy Guided Data Synthesis

2026-01-07 · Yifan Wei, Li Du, Xiaoyan Yu, Yang Feng 외 arxiv

Large Language Models (LLMs) and agent-based systems often struggle with compositional generalization due to a data bottleneck in which complex skill combinations follow a long-tailed, power-law distribution, limiting bo…

Stability and Generalization of Stochastic Compositional Gradient Descent Algorithms

2023-07-07 · Ming Yang, Xiyuan Wei, Tianbao Yang, Yiming Ying

Many machine learning tasks can be formulated as a stochastic compositional optimization (SCO) problem such as reinforcement learning, AUC maximization, and meta-learning, where the objective function involves a nested c…

Learning TheoryMeta-Learning

GFlowNet-EM for learning compositional latent variable models

2023-02-13 · Edward J. Hu, Nikolay Malkin, Moksh Jain, Katie Everett 외

Latent variable models (LVMs) with discrete compositional latents are an important but challenging setting due to a combinatorially large number of possible configurations of the latents. A key tradeoff in modeling the p…

Variational Inference

Non-Smooth Weakly-Convex Finite-sum Coupled Compositional Optimization

2023-10-05 · NeurIPS 2023 11 · Quanqi Hu, Dixian Zhu, Tianbao Yang

This paper investigates new families of compositional optimization problems, called $\underline{\bf n}$on-$\underline{\bf s}$mooth $\underline{\bf w}$eakly-$\underline{\bf c}$onvex $\underline{\bf f}$inite-sum $\underlin…