Ai alignment: A comprehensive survey

J Ji, T Qiu, B Chen, B Zhang, H Lou, K Wang… - arXiv preprint arXiv …, 2023 - arxiv.org
AI alignment aims to make AI systems behave in line with human intentions and values. As
AI systems grow more capable, the potential large-scale risks associated with misaligned AI …

[HTML][HTML] Preferences in AI: An overview

C Domshlak, E Hüllermeier, S Kaci, H Prade - Artificial Intelligence, 2011 - Elsevier
This editorial of the special issue “Representing, Processing, and Learning Preferences:
Theoretical and Practical Challenges” surveys past and ongoing research on preferences in …

[PDF][PDF] Do we need hundreds of classifiers to solve real world classification problems?

M Fernández-Delgado, E Cernadas, S Barro… - The journal of machine …, 2014 - jmlr.org
We evaluate 179 classifiers arising from 17 families (discriminant analysis, Bayesian, neural
networks, support vector machines, decision trees, rule-based classifiers, boosting, bagging …

Kdgan: Knowledge distillation with generative adversarial networks

X Wang, R Zhang, Y Sun, J Qi - Advances in neural …, 2018 - proceedings.neurips.cc
Abstract Knowledge distillation (KD) aims to train a lightweight classifier suitable to provide
accurate inference with constrained resources in multi-label learning. Instead of directly …

Offline a/b testing for recommender systems

A Gilotte, C Calauzènes, T Nedelec… - Proceedings of the …, 2018 - dl.acm.org
Online A/B testing evaluates the impact of a new technology by running it in a real
production environment and testing its performance on a subset of the users of the platform …

Calibrated fairness in bandits

Y Liu, G Radanovic, C Dimitrakakis, D Mandal… - arXiv preprint arXiv …, 2017 - arxiv.org
We study fairness within the stochastic,\emph {multi-armed bandit}(MAB) decision making
framework. We adapt the fairness framework of" treating similar individuals similarly" to this …

[PDF][PDF] Learning Mallows models with pairwise preferences

T Lu, C Boutilier - Proceedings of the 28th international conference …, 2011 - cs.toronto.edu
Learning preference distributions is a key problem in many areas (eg, recommender
systems, IR, social choice). However, many existing methods require restrictive data models …

Rank-n-contrast: learning continuous representations for regression

K Zha, P Cao, J Son, Y Yang… - Advances in Neural …, 2024 - proceedings.neurips.cc
Deep regression models typically learn in an end-to-end fashion without explicitly
emphasizing a regression-aware representation. Consequently, the learned representations …

Random forest for label ranking

Y Zhou, G Qiu - Expert systems with applications, 2018 - Elsevier
Label ranking aims to learn a mapping from instances to rankings over a finite number of
predefined labels. Random forest is a powerful and one of the most successful general …

[PDF][PDF] Effective sampling and learning for mallows models with pairwise-preference data.

T Lu, C Boutilier - J. Mach. Learn. Res., 2014 - jmlr.org
Learning preference distributions is a critical problem in many areas (eg, recommender
systems, IR, social choice). However, many existing learning and inference methods impose …