Low-Rank Bandit Methods for High-Dimensional Dynamic Pricing
We consider dynamic pricing with many products under an evolving but low-dimensional demand model. Assuming the temporal variation in cross-elasticities exhibits low-rank structure based on fixed (latent) features of the products, we show that the revenue maximization problem reduces to an online bandit convex optimization with side information given by the observed demands. We design dynamic pricing algorithms whose revenue approaches that of the best fixed price vector in hindsight, at a rate that only depends on the intrinsic rank of the demand model and not the number of products. Our approach applies a bandit convex optimization algorithm in a projected low-dimensional space spanned by the latent product features, while simultaneously learning this span via online singular value decomposition of a carefully-crafted matrix containing the observed demands.
Code (1)
Tasks
Vocal Bursts Intensity PredictionSimilar Papers 제목 키워드 기반
Catching a Moving Subspace: Low-Rank Bandits Beyond Stationarity
Many bandit deployments (recommendation, clinical dosing, ad targeting) share two facts prior work handles only in isolation: rewards live on a low-dimensional latent subspace, and that subspace drifts. Stationary low-ra…
Stochastic Linear Bandits with Hidden Low Rank Structure
High-dimensional representations often have a lower dimensional underlying structure. This is particularly the case in many decision making settings. For example, when the representation of actions is generated from a de…
Decision MakingDimensionality Reductionimage-classificationImage Classification+1A Simple Unified Framework for High Dimensional Bandit Problems
Stochastic high dimensional bandit problems with low dimensional structures are useful in different applications such as online advertising and drug discovery. In this work, we propose a simple unified algorithm for such…
Drug Discoveryparameter estimationVocal Bursts Intensity PredictionOn High-dimensional and Low-rank Tensor Bandits
Most existing studies on linear bandits focus on the one-dimensional characterization of the overall system. While being representative, this formulation may fail to model applications with high-dimensional but favorable…
Recommendation SystemsVocal Bursts Intensity PredictionA Unified Regularization Approach to High-Dimensional Generalized Tensor Bandits
Modern decision-making scenarios often involve data that is both high-dimensional and rich in higher-order contextual information, where existing bandits algorithms fail to generate effective policies. In response, we pr…
Decision Making