paper-with-me

Papers

A Hierarchical Nearest Neighbour Approach to Contextual Bandits

2023-12-14 · Stephen Pasteris, Chris Hicks, Vasilios Mavroudis

In this paper we consider the adversarial contextual bandit problem in metric spaces. The paper "Nearest neighbour with bandit feedback" tackled this problem but when there are many contexts near the decision boundary of the comparator policy it suffers from a high regret. In this paper we eradicate this problem, designing an algorithm in which we can hold out any set of contexts when computing our regret term. Our algorithm builds on that of "Nearest neighbour with bandit feedback" and hence inherits its extreme computational efficiency.

📄 PDF Abstract BibTeX arXiv:2312.09332

Code (0)

등록된 구현이 없습니다.

Tasks

Computational EfficiencyMulti-Armed Bandits

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

The K-Nearest Neighbour UCB algorithm for multi-armed bandits with covariates

2018-03-01 · Henry WJ Reeve, Joe Mellor, Gavin Brown

In this paper we propose and explore the k-Nearest Neighbour UCB algorithm for multi-armed bandits with covariates. We focus on a setting where the covariates are supported on a metric space of low intrinsic dimension, s…

Multi-Armed Bandits

Approximate Nearest Neighbour Phrase Mining for Contextual Speech Recognition

2023-04-18 · Maurits Bleeker, Pawel Swietojanski, Stefan Braun, Xiaodan Zhuang

This paper presents an extension to train end-to-end Context-Aware Transformer Transducer ( CATT ) models by using a simple, yet efficient method of mining hard negative phrases from the latent space of the context encod…

speech-recognitionSpeech Recognition

Nearest Neighbour with Bandit Feedback

2023-06-23 · NeurIPS 2023 11 · Stephen Pasteris, Chris Hicks, Vasilios Mavroudis

In this paper we adapt the nearest neighbour rule to the contextual bandit problem. Our algorithm handles the fully adversarial setting in which no assumptions at all are made about the data-generation process. When comb…

Locality enhanced dynamic biasing and sampling strategies for contextual ASR

2024-01-23 · Md Asif Jalal, Pablo Peso Parada, George Pavlidis, Vasileios Moschopoulos 외

Automatic Speech Recognition (ASR) still face challenges when recognizing time-variant rare-phrases. Contextual biasing (CB) modules bias ASR model towards such contextually-relevant phrases. During training, a list of b…

Automatic Speech RecognitionAutomatic Speech Recognition (ASR)speech-recognitionSpeech Recognition

k-Nearest Neighbour Classifiers: 2nd Edition (with Python examples)

2020-04-09 · Padraig Cunningham, Sarah Jane Delany

Perhaps the most straightforward classifier in the arsenal or machine learning techniques is the Nearest Neighbour Classifier -- classification is achieved by identifying the nearest neighbours to a query example and usi…

ClassificationGeneral ClassificationRetrievalTime Series+1