Fetching the paper…
Reading the bibliography…
Multi-dimensional online decision making plays a crucial role in many real applications such as online recommendation and digital marketing.
Audibert, J.-Y., Munos, R., and Szepesvári, C. (2009), “Exploration–exploitation tradeoff using variance estimates in multi-armed bandits,” Theoretical Computer Science
1902
Earlier work this paper cites.
Lai, T. L. and Robbins, H. (1985), “Asymptotically efficient adaptive allocation rules,” Advances in applied mathematics
1985
Earlier work this paper cites.
Auer, P. (2002), “Using Confidence Bounds for Exploitation-Exploration Trade-offs,” Journal of Machine Learning Research
2002
Earlier work this paper cites.
Auer, P., Cesa-Bianchi, N., and Fischer, P. (2002), “Finite-time analysis of the multiarmed bandit problem,” Machine learning
2002
Earlier work this paper cites.
Katariya, S., Kveton, B., Szepesvári, C., Vernade, C., and Wen, Z. (2017a), “Bernoulli rank-1 bandits for click feedback,” in Proceedings of the 26th International Joint Conference on Artificial Intelligence
2007
Earlier work this paper cites.
Langford, J. and Zhang, T. (2007), “The epoch-greedy algorithm for contextual multi-armed bandits,” in Proceedings of the 20th International Conference on Neural Information Processing Systems
2007
Earlier work this paper cites.
Kolda, T. and Bader, B. (2009), “Tensor Decompositions and Applications,” SIAM Review
2009
Earlier work this paper cites.
Tsybakov, A. B. (2009), Introduction to Nonparametric Estimation
2009
Earlier work this paper cites.
Li, L., Chu, W., Langford, J., and Schapire, R. E. (2010), “A contextual-bandit approach to personalized news article recommendation,” in Proceedings of the 19th international conference on World wide web
2010
Earlier work this paper cites.
Abbasi-Yadkori, Y., Pál, D., and Szepesvári, C. (2011), “Improved algorithms for linear stochastic bandits,” Advances in Neural Information Processing Systems
2011
Earlier work this paper cites.
Garivier, A. and Cappé, O. (2011), “The KL-UCB algorithm for bounded stochastic bandits and beyond,” in Proceedings of the 24th annual conference on learning theory
2011
Earlier work this paper cites.
Allen, G. (2012), “Sparse Higher-Order Principal Components Analysis,” Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics
2012
Earlier work this paper cites.
Bubeck, S. and Cesa-Bianchi, N. (2012), “Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems,” Foundations and Trends in Machine Learning
2012
Earlier work this paper cites.
Negahban, S. and Wainwright, M. J. (2012), “Restricted strong convexity and weighted matrix completion: Optimal bounds with noise,” The Journal of Machine Learning Research
2012
Earlier work this paper cites.
Xu, Y. and Yin, W. (2013), “A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion,” SIAM Journal on imaging sciences
2013
Earlier work this paper cites.
Jain, P. and Oh, S. (2014), “Provable tensor factorization with missing data,” Advances in Neural Information Processing Systems
2014
Earlier work this paper cites.
Richard, E. and Montanari, A. (2014), “A statistical model for tensor PCA,” Advances in Neural Information Processing Systems
2014
Earlier work this paper cites.
Valko, M., Munos, R., Kveton, B., and Kocák, T. (2014), “Spectral bandits for smooth graph functions,” in International Conference on Machine Learning
2014
Cited alongside, same era.
Yu, R., Cheng, D., and Liu, Y. (2015), “Accelerated online low rank tensor learning for multivariate spatiotemporal streams,” in International conference on machine learning
2015
Cited alongside, same era.
Russo, D. and Van Roy, B. (2016), “An information-theoretic analysis of thompson sampling,” The Journal of Machine Learning Research
2016
Cited alongside, same era.
Yuan, M. and Zhang, C.-H. (2016), “On tensor completion via nuclear norm minimization,” Foundations of Computational Mathematics
2016
Cited alongside, same era.
Friedland, S. and Lim, L.-H. (2017), “Nuclear norm of higher-order tensors,” Mathematics of Computation
2017
Cited alongside, same era.
Zhang, A. et al. (2019), “Cross: Efficient low-rank tensor completion,” The Annals of Statistics
2019
Later among the works it cites.
Choi, H., Mela, C. F., Balseiro, S. R., and Leary, A. (2020), “Online display advertising markets: A literature review and future directions,” Information Systems Research
2020
Closest in time.
Lattimore, T. and Szepesvári, C. (2020), Bandit algorithms
2020
Closest in time.
Trinh, C., Kaufmann, E., Vernade, C., and Combes, R. (2020), “Solving Bernoulli Rank-One Bandits with Unimodal Thompson Sampling,” 31st International Conference on Algorithmic Learning Theory
2020
Closest in time.
Ahn, D., Kim, S., and Kang, U. (2021), “Accurate Online Tensor Factorization for Temporal Tensor Streams with Missing Values,” in Proceedings of the 30th ACM International Conference on Information & Knowledge Management
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Frolov, E. and Oseledets, I. (2017), “Tensor methods and recommender systems,” Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery
2017
Cited alongside, same era.
2017
Cited alongside, same era.
Lu, X. and Van Roy, B. (2017), “Ensemble Sampling,” Advances in Neural Information Processing Systems
2017
Cited alongside, same era.
Sen, R., Shanmugam, K., Kocaoglu, M., Dimakis, A., and Shakkottai, S. (2017), “Contextual Bandits with Latent Confounders: An NMF Approach,” Artificial Intelligence and Statistics
2017
Cited alongside, same era.
Sun, W. W., Lu, J., Liu, H., and Cheng, G. (2017), “Provable sparse tensor decomposition,” Journal of the Royal Statistical Society: Series B (Statistical Methodology)
2017
Cited alongside, same era.
Bi, X., Qu, A., Shen, X., et al. (2018), “Multilayer tensor factorization with applications to recommender systems,” The Annals of Statistics
2018
Cited alongside, same era.
Lu, X., Wen, Z., and Kveton, B. (2018), “Efficient online recommendation via low-rank ensemble sampling,” Proceedings of the 12th ACM Conference on Recommender Systems
2018
Cited alongside, same era.
2021
Closest in time.
Bi, X., Tang, X., Yuan, Y., Zhang, Y., and Qu, A. (2021), “Tensors in statistics,” Annual review of statistics and its application
2021
Closest in time.
Cai, C., Li, G., Poor, H. V., and Chen, Y. (2021), “Nonconvex Low-Rank Tensor Completion from Noisy Data,” Operations Research
2021
Closest in time.
Lu, Y., Meisami, A., and Tewari, A. (2021), “Low-rank generalized linear bandit problems,” in International Conference on Artificial Intelligence and Statistics
2021
Closest in time.
Rafieian, O. and Yoganarasimhan, H. (2021), “Targeting and privacy in mobile advertising,” Marketing Science
2021
Closest in time.
Xia, D., Yuan, M., and Zhang, C.-H. (2021), “Statistically optimal and computationally efficient low rank tensor completion from noisy entries,” The Annals of Statistics
2021
Closest in time.
Bi, X., Adomavicius, G., Li, W., and Qu, A. (2022), “Improving Sales Forecasting Accuracy: A Tensor Factorization Approach with Demand Awareness,” INFORMS Journal on Computing
2022
Closest in time.
2022
Closest in time.
Han, R., Willett, R., and Zhang, A. R. (2022), “An optimal statistical and computational framework for generalized tensor estimation,” The Annals of Statistics
2022
Closest in time.
2022
Closest in time.
Qin, C., Wen, Z., Lu, X., and Van Roy, B. (2022), “An Analysis of Ensemble Sampling,” in Advances in Neural Information Processing Systems
2022
Closest in time.
Kveton, B., Zaheer, M., Szepesvari, C., Li, L., Ghavamzadeh, M., and Boutilier, C. (2020), “Randomized exploration in generalized linear bandits,” in International Conference on Artificial Intelligence and Statistics
2076
Closest in time.