Fast and Sample Efficient Multi-Task Representation Learning in Stochastic Contextual Bandits
We study how representation learning can improve the learning efficiency of contextual bandit problems. We study the setting where we play T contextual linear bandits with dimension d simultaneously, and these T bandit tasks collectively share a common linear representation with a dimensionality of r much smaller than d. We present a new algorithm based on alternating projected gradient descent (GD) and minimization estimator to recover a low-rank feature matrix. Using the proposed estimator, we present a multi-task learning algorithm for linear contextual bandits and prove the regret bound of our algorithm. We presented experiments and compared the performance of our algorithm against benchmark algorithms.
Code (0)
등록된 구현이 없습니다.
Tasks
Multi-Armed BanditsMulti-Task LearningRepresentation LearningSimilar Papers 제목 키워드 기반
Randomized Stochastic Variance-Reduced Methods for Multi-Task Stochastic Bilevel Optimization
In this paper, we consider non-convex stochastic bilevel optimization (SBO) problems that have many applications in machine learning. Although numerous studies have proposed stochastic algorithms for solving these proble…
Bilevel OptimizationStochastic OptimizationFast and Accurate Stochastic Gradient Estimation
Stochastic Gradient Descent or SGD is the most popular optimization algorithm for large-scale problems. SGD estimates the gradient by uniform sampling with sample size one. There have been several other works that sugges…
Towards Fast Stochastic Sampling in Diffusion Generative Models
Diffusion models suffer from slow sample generation at inference time. Despite recent efforts, improving the sampling efficiency of stochastic samplers for diffusion models remains a promising direction. We propose Split…
You Only Accept Samples Once: Fast, Self-Correcting Stochastic Variational Inference
We introduce YOASOVI, an algorithm for performing fast, self-correcting stochastic optimization for Variational Inference (VI) on large Bayesian heirarchical models. To accomplish this, we take advantage of available inf…
Stochastic OptimizationVariational InferenceFast Stochastic Alternating Direction Method of Multipliers
In this paper, we propose a new stochastic alternating direction method of multipliers (ADMM) algorithm, which incrementally approximates the full gradient in the linearized ADMM formulation. Besides having a low per-ite…