Learning Underspecified Models
In-Koo Cho, Jonathan Libgober

TL;DR
This paper explores how a monopolist can learn to set optimal prices using an underspecified demand model, developing algorithms that adaptively estimate demand parameters even when the true demand curve is complex or unknown.
Contribution
It introduces a new PAC-based learnability framework for underspecified models and designs algorithms that efficiently learn demand parameters for optimal pricing.
Findings
Algorithms recursively estimate demand slope and intercept.
Optimal algorithms perform well even with non-linear demand curves.
Monopolist balances model complexity and learning accuracy.
Abstract
This paper examines whether one can learn to play an optimal action while only knowing part of true specification of the environment. We choose the optimal pricing problem as our laboratory, where the monopolist is endowed with an underspecified model of the market demand, but can observe market outcomes. In contrast to conventional learning models where the model specification is complete and exogenously fixed, the monopolist has to learn the specification and the parameters of the demand curve from the data. We formulate the learning dynamics as an algorithm that forecast the optimal price based on the data, following the machine learning literature (Shalev-Shwartz and Ben-David (2014)). Inspired by PAC learnability, we develop a new notion of learnability by requiring that the algorithm must produce an accurate forecast with a reasonable amount of data uniformly over the class of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Auction Theory and Applications · Advanced Bandit Algorithms Research
