Maximization of Average Precision for Deep Learning with Adversarial Ranking Robustness

Gang Li, Wei Tong, Tianbao Yang
2/12/2026

No confident code implementation found for this paper.

DOISemantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

A Unified Framework for Generalization Error Analysis of Learning with Arbitrary Discrete Weak Features

97% match2026

Performance Bounds for Active Binary Testing with Information Maximization

95% match2026

Decision Tree for Locally Private Estimation with Public Data

95% match2026

Interactive Adjustment for Human Trajectory Prediction with Individual Feedback

95% match2026

Approximate Allocation Matching for Structural Causal Bandits with Unobserved Confounders

95% match2026

Sample Average Approximation for Conditional Stochastic Optimization with Dependent Data

95% match2026

Cite this paper

@article{li2026maximization,
  title  = {Maximization of Average Precision for Deep Learning with Adversarial Ranking Robustness},
  author = {Gang Li and Wei Tong and Tianbao Yang},
  year   = {2026},
  doi    = {10.52202/075280-0680},
  url    = {https://doi.org/10.52202/075280-0680},
  journal = {NEURIPS 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/096b0f860116981ff870610954a545c2e4777f53.svg)](https://codeofpaper.com/paper/096b0f860116981ff870610954a545c2e4777f53)

Discussion