An adaptive gradient method for online AUC maximization
Learning for maximizing AUC performance is an important research problem in machine learning. Unlike traditional batch learning methods for maximizing AUC which often suffer from poor scalability, recent years have witnessed some emerging studies that attempt to maximize AUC by single-pass online le...
Saved in:
Main Authors: | DING, Yi, ZHAO, Peilin, HOI, Steven C. H., ONG, Yew-Soon |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2015
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/2638 https://ink.library.smu.edu.sg/context/sis_research/article/3638/viewcontent/AdaptiveGradientAUCmax_2015_aaai.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Fast bounded online gradient descent algorithms for scalable kernel-based online learning
by: ZHAO, Peilin, et al.
Published: (2012) -
Online AUC maximization
by: ZHAO, Peilin, et al.
Published: (2011) -
Large scale kernel methods for online AUC maximization
by: DING, Yi, et al.
Published: (2017) -
Sampling-based adaptive bounding evolutionary algorithm for continuous optimization problems
by: Luo, Linbo, et al.
Published: (2017) -
Broadband linearly constrained adaptive array processing with a preprocessed Gram-Schmidt algorithm
by: Ko, C.C.
Published: (2014)