PAC-Bayesian High Dimensional Bipartite Ranking
arXiv:1511.02729 · doi:10.1016/j.jspi.2017.10.010
Abstract
This paper is devoted to the bipartite ranking problem, a classical statistical learning task, in a high dimensional setting. We propose a scoring and ranking strategy based on the PAC-Bayesian approach. We consider nonlinear additive scoring functions, and we derive non-asymptotic risk bounds under a sparsity assumption. In particular, oracle inequalities in probability holding under a margin condition assess the performance of our procedure, and prove its minimax optimality. An MCMC-flavored algorithm is proposed to implement our method, along with its behavior on synthetic and real-life datasets.
References in corpus (8)
- Fast learning rates for plug-in classifiers
- Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity
- Sparse Regression Learning by Aggregation and Langevin Monte-Carlo
- Sparse single-index model
- PAC-Bayesian Bounds for Randomized Empirical Risk Minimizers
- Pac-bayesian bounds for sparse regression estimation with exponential weights
- PAC-Bayesian Estimation and Prediction in Sparse Additive Models
- PAC-Bayesian AUC classification and scoring