This paper introduces the online probing problem: In each round, the learner is able to purchase the values of a subset of feature values. After the learner uses this information to come up with a prediction for the given round, he then has the option of paying for seeing the loss that he is evaluated against. Either way, the learner pays for the imperfections of his predictions and whatever he chooses to observe, including the cost of observing the loss function for the given round and the cost of the observed features. We consider two variations of this problem, depending on whether the learner can observe the label for free or not. We provide algorithms and upper and lower bounds on the regret for both variants. We show that a positive cost for observing the label significantly increases the regret of the problem.

@inproceedings{zolghadr13online,
	author = {Navid Zolghadr and G{\'a}bor Bart{\'o}k and Russel Greiner and Andr{\'a}s Gy{\"o}rgy and Csaba Szepesv{\'a}ri},
	booktitle = {Proc. Neural Information Processing Systems (NeurIPS)},
	title = {Online Learning with Costly Features and Labels},
	year = {2013}}