Search Results for author:
Found 5 papers, 0 papers with code
Near-Optimal Non-Convex Stochastic Optimization under Generalized Smoothness
Two recent works established the $O(\epsilon^{-3})$ sample complexity to obtain an $O(\epsilon)$-stationary point.
A Model-based Projection Technique for Segmenting Customers
We consider the problem of segmenting a large population of customers into non-overlapping groups with similar preferences, using diverse preference observations such as purchases, ratings, clicks, etc.
Assortment Optimization Under the Mallows model
We consider the assortment optimization problem when customer preferences follow a mixture of Mallows distributions.
Reputation-based Worker Filtering in Crowdsourcing
In this paper, we study the problem of aggregating noisy labels from crowd workers to infer the underlying true labels of binary tasks.
A Data-Driven Approach to Modeling Choice
We visit the following fundamental problem: For a `generic model of consumer choice (namely, distributions over preference lists) and a limited amount of data on how consumers actually make decisions (such as marginal preference information), how may one predict revenues from offering a particular assortment of choices?
