Calibrated language models must hallucinate

AT Kalai, SS Vempala - Proceedings of the 56th Annual ACM …, 2024 - dl.acm.org
Recent language models generate false but plausible-sounding text with surprising
frequency. Such “hallucinations” are an obstacle to the usability of language-based AI …

[BOK][B] Bandit algorithms

T Lattimore, C Szepesvári - 2020 - books.google.com
Decision-making in the face of uncertainty is a significant challenge in machine learning,
and the multi-armed bandit model is a commonly used framework to address it. This …

Concentration of measure inequalities in information theory, communications, and coding

M Raginsky, I Sason - Foundations and Trends® in …, 2013 - nowpublishers.com
Concentration inequalities have been the subject of exciting developments during the last
two decades, and have been intensively studied and used as a powerful tool in various …

[PDF][PDF] To believe or not to believe your llm

YA Yadkori, I Kuzborskij… - arxiv preprint …, 2024 - storage.prod.researchhub.com
We explore uncertainty quantification in large language models (LLMs), with the goal to
identify when uncertainty in responses given a query is large. We simultaneously consider …

On the sub-Gaussianity of the Beta and Dirichlet distributions

O Marchal, J Arbel - 2017 - projecteuclid.org
We obtain the optimal proxy variance for the sub-Gaussianity of Beta distribution, thus
proving upper bounds recently conjectured by Elder (2016). We provide different proof …

Universal Bayes consistency in metric spaces

S Hanneke, A Kontorovich, S Sabato… - 2020 Information …, 2020 - ieeexplore.ieee.org
We show that a recently proposed 1-nearest-neighbor-based multiclass learning algorithm
is universally strongly Bayes consistent in all metric spaces where such Bayes consistency …

Tightening exploration in upper confidence reinforcement learning

H Bourel, O Maillard, MS Talebi - … Conference on Machine …, 2020 - proceedings.mlr.press
The upper confidence reinforcement learning (UCRL2) algorithm introduced in\citep
{jaksch2010near} is a popular method to perform regret minimization in unknown discrete …

Concentration inequalities in the infinite urn scheme for occupancy counts and the missing mass, with applications

A Ben-Hamou, S Boucheron, MI Ohannessian - 2017 - projecteuclid.org
An infinite urn scheme is defined by a probability mass function (p_j)_j\geq1 over positive
integers. A random allocation consists of a sample of N independent drawings according to …

Concentration inequalities for the empirical distribution of discrete distributions: beyond the method of types

J Mardia, J Jiao, E Tánczos, RD Nowak… - … and Inference: A …, 2020 - academic.oup.com
We study concentration inequalities for the Kullback–Leibler (KL) divergence between the
empirical distribution and the true distribution. Applying a recursion technique, we improve …

AD3 alternating directions dual decomposition for MAP inference in graphical models

AFT Martins, MAT Figueiredo, PMQ Aguiar… - The Journal of Machine …, 2015 - dl.acm.org
In Bayesian nonparametric models, Gaussian processes provide a popular prior choice for
regression function estimation. Existing literature on the theoretical investigation of the …