No article text was recorded for this version.
surrogate loss regret bounds
Version 1 of 133 papers53 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Surrogate regret bounds for bipartite ranking via strongly proper losses
- Blog: A Theoretical Analysis of Recommendation Loss Functions under Negative Sampling
- Blog: On the Relationship Between Binary Classification, Bipartite Ranking, and Binary Class Probability Estimation
- Blog: Web-Search Ranking with Initialized Gradient Boosted Regression Trees
- Blog: Surrogate Regret Bounds for the Area Under the ROC Curve via Strongly Proper Losses
- Blog: Enhanced H-Consistency Bounds
- Blog: Consistent Multilabel Ranking through Univariate Losses
- Blog: Ranking Measures and Loss Functions in Learning to Rank
- Blog: Comparing Recommendation Losses under Negative Sampling
- Blog: On the Consistency of AUC Pairwise Optimization
- Blog: On NDCG Consistency of Listwise Ranking Methods
- Blog: Bipartite Ranking through Minimization of Univariate Loss
- Blog: Weston-Watkins Hinge Loss and Ordered Partitions
- Blog: Robust reductions from ranking to classification
- Blog: Learning to Rank by Optimizing NDCG Measure
- Blog: Introduction: special issue of selected papers from ACML 2015
- Blog: Consistent optimization of AMS by logistic loss minimization
- Blog: Calibration and regret bounds for order-preserving surrogate losses in learning to rank
- Blog: RankMatch: A Novel Approach to Semi-Supervised Label Distribution Learning Leveraging Rank Correlation between Labels
- Blog: Ordinal Regression by Extended Binary Classification
- Blog: Sampling Wisely: Deep Image Embedding by Top-K Precision Optimization
- Blog: An Alternative Cross Entropy Loss for Learning-to-Rank
- Blog: A Structured Prediction Approach for Label Ranking
- Blog: A Univariate Bound of Area Under ROC
- Blog: Regret Bounds for Non-decomposable Metrics with Missing Labels
- Blog: McRank: Learning to Rank Using Multiple Classification and Gradient Boosting
- Blog: A Selective Sampling Strategy for Label Ranking
- Blog: Preference-based learning to rank
- Blog: Generalization Bounds for the Area Under the ROC Curve
- Blog: A Coherent Interpretation of AUC as a Measure of Aggregated Classification Performance
- Blog: Online Learning to Rank for Content-Based Image Retrieval
- Blog: On Partitioning Rules for Bipartite Ranking
- Blog: An Efficient Reduction of Ranking to Classification
History & citation
Current · Permanent link
- Reducing Ranking to Classification with Theoretical Consistency merged into this direction (58% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_surrogate_loss_regret_bounds_fa2cd730,
title = {surrogate loss regret bounds},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/surrogate-loss-regret-bounds/rdr_fa2cd730fd6848e28d3f96008831e093},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_surrogate_loss_regret_bounds_fa2cd730_v1,
title = {surrogate loss regret bounds},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/surrogate-loss-regret-bounds/rdr_fa2cd730fd6848e28d3f96008831e093/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}