Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2212.14883 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915741646716928 |
|---|---|
| author | Chang, Xiangyu Chen, Xi Lai, Zehua Li, He Liu, Zhihong Zhang, Yichen |
| author_facet | Chang, Xiangyu Chen, Xi Lai, Zehua Li, He Liu, Zhihong Zhang, Yichen |
| contents | With the fast development of big data, learning the optimal decision rule by recursively updating it and making online decisions has been easier than before. We study the online statistical inference of model parameters in a contextual bandit framework of sequential decision-making. We propose a general framework for an online and adaptive data collection environment that can update decision rules via weighted stochastic gradient descent. We allow different weighting schemes of the stochastic gradient and establish the asymptotic normality of the parameter estimator. Our proposed estimator significantly improves the asymptotic efficiency over the previous averaged SGD approach via inverse probability weights. We also conduct an optimality analysis on the weights in a linear regression setting. We provide a Bahadur representation of the proposed estimator and show that the remainder term in the Bahadur representation entails a slower convergence rate compared to classical SGD due to the adaptive data collection. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2212_14883 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Online Statistical Inference for Contextual Bandits via Stochastic Gradient Descent Chang, Xiangyu Chen, Xi Lai, Zehua Li, He Liu, Zhihong Zhang, Yichen Machine Learning With the fast development of big data, learning the optimal decision rule by recursively updating it and making online decisions has been easier than before. We study the online statistical inference of model parameters in a contextual bandit framework of sequential decision-making. We propose a general framework for an online and adaptive data collection environment that can update decision rules via weighted stochastic gradient descent. We allow different weighting schemes of the stochastic gradient and establish the asymptotic normality of the parameter estimator. Our proposed estimator significantly improves the asymptotic efficiency over the previous averaged SGD approach via inverse probability weights. We also conduct an optimality analysis on the weights in a linear regression setting. We provide a Bahadur representation of the proposed estimator and show that the remainder term in the Bahadur representation entails a slower convergence rate compared to classical SGD due to the adaptive data collection. |
| title | Online Statistical Inference for Contextual Bandits via Stochastic Gradient Descent |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2212.14883 |