Papers › LibAUC: A Deep Learning Library for X-Risk Optimization

LibAUC: A Deep Learning Library for X-Risk Optimization

5 Jun 2023arXiv:2306.03065archive 2025-07-28

Zhuoning Yuan, Dixian Zhu, Zi-Hao Qiu, Gang Li, Xuanhui Wang, Tianbao Yang

This paper introduces the award-winning deep learning (DL) library called LibAUC for implementing state-of-the-art algorithms towards optimizing a family of risk functions named X-risks. X-risks refer to a family of compositional functions in which the loss function of each data point is defined in a way that contrasts the data point with a large number of others. They have broad applications in AI for solving classical and emerging problems, including but not limited to classification for imbalanced data (CID), learning to rank (LTR), and contrastive learning of representations (CLR). The motivation of developing LibAUC is to address the convergence issues of existing libraries for solving these problems. In particular, existing libraries may not converge or require very large mini-batch sizes in order to attain good performance for these problems, due to the usage of the standard mini-batch technique in the empirical risk minimization (ERM) framework. Our library is for deep X-risk optimization (DXO) that has achieved great success in solving a variety of tasks for CID, LTR and CLR. The contributions of this paper include: (1) It introduces a new mini-batch based pipeline for implementing DXO algorithms, which differs from existing DL pipeline in the design of controlled data samplers and dynamic mini-batch losses; (2) It provides extensive benchmarking experiments for ablation studies and comparison with existing libraries. The LibAUC library features scalable performance for millions of items to be contrasted, faster and better convergence than existing libraries for optimizing X-risks, seamless PyTorch deployment and versatile APIs for various loss optimization. Our library is available to the open source community at https://github.com/Optimization-AI/LibAUC, to facilitate further academic research and industrial applications.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2306.03065")

Code

Syntology Ran 0 of 9 code samples harvested from 1 repository linked to this paper; 9 have no recorded run.

By repository: official repository: 9 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Optimization-AI/LibAUC officialmentioned in paperpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

9 samples harvested; 0 ran; 0 honoured the contract we drafted; 9 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

9unverified

Licence: 0 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from Optimization-AI/LibAUC. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

DenseNet121 Optimization-AI/LibAUC/libauc/models/densenet.py official repository unverified MIT (permissive) · 8a4d4b5c6865a4b2 · report
DenseNet161 Optimization-AI/LibAUC/libauc/models/densenet.py official repository unverified MIT (permissive) · 6ef24032aeb13a90 · report
DenseNet169 Optimization-AI/LibAUC/libauc/models/densenet.py official repository unverified MIT (permissive) · 3f83d5288c64f414 · report
ResNet20_stoc_att Optimization-AI/LibAUC/libauc/models/mil_models.py official repository unverified MIT (permissive) · 01bef328fcb90223 · report
concat_all_gather Optimization-AI/LibAUC/libauc/losses/contrastive.py official repository unverified MIT (permissive) · 8e658c85710c38c9 · report
gather_features Optimization-AI/LibAUC/libauc/losses/contrastive.py official repository unverified MIT (permissive) · 0e719e1b1ed02c5a · report
hinge_loss Optimization-AI/LibAUC/libauc/losses/surrogate.py official repository unverified MIT (permissive) · bce69fc779a88d80 · report
squared_hinge_loss Optimization-AI/LibAUC/libauc/losses/surrogate.py official repository unverified MIT (permissive) · 169e9f577f80b9b9 · report
squared_loss Optimization-AI/LibAUC/libauc/losses/surrogate.py official repository unverified MIT (permissive) · 7c4877fce871d8a6 · report

Tasks

BenchmarkingClassificationContrastive LearningDeep LearningLearning-To-Rank

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Contrastive Learning

1 archive method tag without a method page not shown.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections