ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2206.11655
  4. Cited By
Optimizing Two-way Partial AUC with an End-to-end Framework

Optimizing Two-way Partial AUC with an End-to-end Framework

23 June 2022
Zhiyong Yang
Qianqian Xu
Shilong Bao
Yuan He
Xiaochun Cao
Qingming Huang
ArXivPDFHTML

Papers citing "Optimizing Two-way Partial AUC with an End-to-end Framework"

8 / 8 papers shown
Title
Enhancing Target-unspecific Tasks through a Features Matrix
Enhancing Target-unspecific Tasks through a Features Matrix
Fangming Cui
Yonggang Zhang
Xuan Wang
Xinmei Tian
Jun Yu
AAML
82
1
0
06 May 2025
Implicit Rate-Constrained Optimization of Non-decomposable Objectives
Implicit Rate-Constrained Optimization of Non-decomposable Objectives
Abhishek Kumar
Harikrishna Narasimhan
Andrew Cotter
40
10
0
23 Jul 2021
A Generic First-Order Algorithmic Framework for Bi-Level Programming
  Beyond Lower-Level Singleton
A Generic First-Order Algorithmic Framework for Bi-Level Programming Beyond Lower-Level Singleton
Risheng Liu
Pan Mu
Xiaoming Yuan
Shangzhi Zeng
Jin Zhang
56
130
0
07 Jun 2020
Sparse-GAN: Sparsity-constrained Generative Adversarial Network for
  Anomaly Detection in Retinal OCT Image
Sparse-GAN: Sparsity-constrained Generative Adversarial Network for Anomaly Detection in Retinal OCT Image
Kang Zhou
Shenghua Gao
Jun Cheng
Zaiwang Gu
Huazhu Fu
Zhi Tu
Jianlong Yang
Yitian Zhao
Jiang-Dong Liu
GAN
MedIm
168
66
0
28 Nov 2019
Partial AUC optimization based deep speaker embeddings with class-center
  learning for text-independent speaker verification
Partial AUC optimization based deep speaker embeddings with class-center learning for text-independent speaker verification
Zhongxin Bai
Xiao-Lei Zhang
Jingdong Chen
49
29
0
19 Nov 2019
On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems
On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems
Tianyi Lin
Chi Jin
Michael I. Jordan
110
507
0
02 Jun 2019
Local Rademacher Complexity Bounds based on Covering Numbers
Local Rademacher Complexity Bounds based on Covering Numbers
Yunwen Lei
L. Ding
Yingzhou Bi
45
22
0
06 Oct 2015
Predicting accurate probabilities with a ranking loss
Predicting accurate probabilities with a ranking loss
A. Menon
Xiaoqian Jiang
Shankar Vembu
Charles Elkan
L. Ohno-Machado
74
71
0
18 Jun 2012
1