A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model
نویسندگان
چکیده
We study the active learning problem of top-k ranking from multi-wise comparisons under the popular multinomial logit model. Our goal is to identify the top-k items with high probability by adaptively querying sets for comparisons and observing the noisy output of the most preferred item from each comparison. To achieve this goal, we design a new active ranking algorithm without using any information about the underlying items’ preference scores. We also establish a matching lower bound on the sample complexity even when the set of preference scores is given to the algorithm. These two results together show that the proposed algorithm is instance optimal (up to logarithmic factors). Our work extends the existing literature on rank aggregation in three directions. First, instead of studying a static problem with fixed data, we investigate the top-k ranking problem in an active learning setting. Second, we provide the instance optimality, which is a much stronger theoretical guarantee. Finally, we extend the pairwise comparison to the multi-wise comparison, which has not been fully explored in ranking literature.
منابع مشابه
On Rank-Ordered Nested Multinomial Logit Model and D-Optimal Design for this Model
In contrast to the classical discrete choice experiment, the respondent in a rank-order discrete choice experiment, is asked to rank a number of alternatives instead of the preferred one. In this paper, we study the information matrix of a rank order nested multinomial logit model (RO.NMNL) and introduce local D-optimality criterion, then we obtain Locally D-optimal design for RO.NMNL models in...
متن کاملAn Optimal Exploration-Exploitation Approach for Assortment Selection
We consider an online assortment optimization problem, where in every round, the retailer offers a Kcardinality subset (assortment) of N substitutable products to a consumer, and observes the response. We model consumer choice behavior using the widely used multinomial logit (MNL) model, and consider the retailer’s problem of dynamically learning the model parameters, while optimizing cumulativ...
متن کاملModeling the behavior of disordered taxi drivers of Tehran for choosing passenger and destination
In this study, the manner of private taxis drivers has been investigated for choosing passenger and destination from a fixed point. Therefore, two models called Multinomial and Nested Logit Models have been utilized. The information gained by scrolling in 2016 is the input data, which are in the format of revealed preference, acquired by the verbal interview in Vanak Square in Tehran (Iran). Ba...
متن کاملOn upper bounds for assortment optimization under the mixture of multinomial logit models
The assortment optimization problem under the mixture of multinomial logit models is NPcomplete and there are different approximation methods to obtain upper bounds on the optimal expected revenue. In this paper, we analytically compare the upper bounds obtained by the different approximation methods. We propose a new, tractable approach to construct an upper bound on the optimal expected reven...
متن کاملOn Locally Optimal Criterion for a Logit Model with Random Parameters
Mixed logit is a highly flexible model that can approximate any random utility model. In this paper, two kinds of mixed multinomial logit models were considered. The main aim was to introduce a locally D-optimal criterion to obtain an optimal combination of the levels of attributes for producing alternatives and an optimal combination of alternatives in choice sets. Thus, a design including cho...
متن کامل