scientific article; zbMATH DE number 7370578

MaRDI QIDQ4998961

Yiming Ying, Yunwen Lei

Publication date: 9 July 2021

Full work available at URL: https://arxiv.org/abs/1906.06053

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

stochastic gradient descentAUC maximizationproximal operatorimbalanced classification

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Error analysis of kernel regularized pairwise learning with a strongly convex loss ⋮ Online regularized pairwise learning with least squares loss

Uses Software

• LIBSVM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions
• Smoothing technique and its applications in semidefinite optimization
• Introductory lectures on convex optimization. A basic course.
• Convergence of stochastic proximal gradient algorithm
• Linear convergence of first order methods for non-strongly convex optimization
• Ranking and empirical minimization of \(U\)-statistics
• Online Learning and Online Convex Optimization
• Robust Stochastic Approximation Approach to Stochastic Programming
• Degenerate Nonlinear Programming with a Quadratic Growth Condition
• Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization
• Probability Inequalities for Sums of Bounded Random Variables
• Online Pairwise Learning Algorithms
• Support Vector Algorithms for Optimizing the Partial Area under the ROC Curve
• Prediction, Learning, and Games
• Learning Theory