Active Learning for Contextual Search with Binary Feedbacks

10/03/2021
by   Quanquan, et al.
0

In this paper, we study the learning problem in contextual search, which is motivated by applications such as first-price auction, personalized medicine experiments, and feature-based pricing experiments. In particular, for a sequence of arriving context vectors, with each context associated with an underlying value, the decision-maker either makes a query at a certain point or skips the context. The decision-maker will only observe the binary feedback on the relationship between the query point and the value associated with the context. We study a PAC learning setting, where the goal is to learn the underlying mean value function in context with a minimum number of queries. To address this challenge, we propose a tri-section search approach combined with a margin-based active learning method. We show that the algorithm only needs to make O(1/ε^2) queries to achieve an ϵ-estimation accuracy. This sample complexity significantly reduces the required sample complexity in the passive setting, at least Ω(1/ε^4).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/04/2021

Pricing Query Complexity of Revenue Maximization

The common way to optimize auction and pricing systems is to set aside a...
research
04/10/2022

Active Learning with Label Comparisons

Supervised learning typically relies on manual annotation of the true la...
research
01/13/2023

Non-Stochastic CDF Estimation Using Threshold Queries

Estimating the empirical distribution of a scalar-valued data set is a b...
research
05/11/2023

Active Learning in the Predict-then-Optimize Framework: A Margin-Based Approach

We develop the first active learning method in the predict-then-optimize...
research
09/08/2022

Active Learning of Classifiers with Label and Seed Queries

We study exact active learning of binary and multiclass classifiers with...
research
12/20/2019

Learning Reserve Prices in Second-Price Auctions

This paper proves the tight sample complexity of Second-Price Auction w...
research
10/22/2009

The Geometry of Generalized Binary Search

This paper investigates the problem of determining a binary-valued funct...

Please sign up or login with your details

Forgot password? Click here to reset