Ai alignment: A comprehensive survey
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 …
AI systems grow more capable, the potential large-scale risks associated with misaligned AI …
Quantum machine learning: a classical perspective
Recently, increased computational power and data availability, as well as algorithmic
advances, have led machine learning (ML) techniques to impressive results in regression …
advances, have led machine learning (ML) techniques to impressive results in regression …
Cross-entropy loss functions: Theoretical analysis and applications
Cross-entropy is a widely used loss function in applications. It coincides with the logistic loss
applied to the outputs of a neural network, when the softmax is used. But, what guarantees …
applied to the outputs of a neural network, when the softmax is used. But, what guarantees …
A survey of preference-based reinforcement learning methods
Reinforcement learning (RL) techniques optimize the accumulated long-term reward of a
suitably chosen reward function. However, designing such a reward function often requires …
suitably chosen reward function. However, designing such a reward function often requires …
A theoretical analysis of NDCG type ranking measures
Ranking has been extensively studied in information retrieval, machine learning and
statistics. A central problem in ranking is to design a ranking measure for evaluation of …
statistics. A central problem in ranking is to design a ranking measure for evaluation of …
Iterative ranking from pair-wise comparisons
The question of aggregating pairwise comparisons to obtain a global ranking over a
collection of objects has been of interest for a very long time: be it ranking of online gamers …
collection of objects has been of interest for a very long time: be it ranking of online gamers …
-Consistency Bounds for Pairwise Misranking Loss Surrogates
We present a detailed study of $ H $-consistency bounds for score-based ranking. These
are upper bounds on the target loss estimation error of a predictor in a hypothesis set $ H …
are upper bounds on the target loss estimation error of a predictor in a hypothesis set $ H …
Learning with fenchel-young losses
Over the past decades, numerous loss functions have been been proposed for a variety of
supervised learning tasks, including regression, classification, ranking, and more generally …
supervised learning tasks, including regression, classification, ranking, and more generally …
Ranking with abstention
We introduce a novel framework of ranking with abstention, where the learner can abstain
from making prediction at some limited cost $ c $. We present a extensive theoretical …
from making prediction at some limited cost $ c $. We present a extensive theoretical …
A statistical convergence perspective of algorithms for rank aggregation from pairwise data
There has been much interest recently in the problem of rank aggregation from pairwise
data. A natural question that arises is: under what sorts of statistical assumptions do various …
data. A natural question that arises is: under what sorts of statistical assumptions do various …