HENDERSON, C. R. (1975). Best linear unbiased estimation and prediction under a selection model. Biometrics 423-447.
JACOT, A., GABRIEL, F. and HONGLER, C. (2018). Neural tangent kernel: Convergence and generalization in neural networks. Advances in neural information processing systems 31.
KANDASAMY, K., KRISHNAMURTHY, A., SCHNEIDER, J. and POCZOS, B. (2018). Parallelised bayesian optimisation via thompson sampling. In International Conference on Artificial Intelligence and Statistics. PMLR.
KAUFMANN, E., KORDA, N. and MUNOS, R. (2012). Thompson sampling: An asymptotically optimal finite-time analysis. In Algorithmic Learning Theory: 23rd International Conference, ALT 2012, Lyon, France, October 29-31, 2012. Proceedings 23. Springer.
KIM, W., KIM, G.-S. and PAIK, M. C. (2021). Doubly robust thompson sampling with linear payoffs. Advances in Neural Information Processing Systems 34 15830-15840.
KIM, W., LEE, K. and PAIK, M. C. (2022a). Double doubly robust thompson sampling for generalized linear contextual bandits. arXiv preprint arXiv:2209.06983.
KIM, Y., YANG, I. and JUN, K.-S. (2022b). Improved regret analysis for variance-adaptive linear bandits and horizon-free linear mixture mdps. Advances in Neural Information Processing Systems 35 1060-1072.
KIRSCHNER, J. and KRAUSE, A. (2018). Information directed sampling and bandits with heteroscedastic noise. In Conference On Learning Theory. PMLR.
KORDA, N., KAUFMANN, E. and MUNOS, R. (2013). Thompson sampling for 1-dimensional exponential family bandits. Advances in neural information processing systems 26.
LAI, T. L., ROBBINS, H. ET AL. (1985). Asymptotically efficient adaptive allocation rules. Advances in applied mathematics 6 4-22.
LI, Y., WANG, Y. and ZHOU, Y. (2023). Nearly minimax-optimal regret for linearly parameterized bandits. IEEE Transactions on Information Theory.
LILLICRAP, T. P., HUNT, J. J., PRITZEL, A., HEESS, N., EREZ, T., TASSA, Y., SILVER, D. and WIERSTRA, D. (2015). Continuous control with deep reinforcement learning. arXiv preprint arXiv:1509.02971.
LING, S., XU, R. and BANDEIRA, A. S. (2019). On the landscape of synchronization networks: A perspective from nonconvex optimization. SIAM Journal on Optimization 29 1879-1907.
LU, M., MIN, Y., WANG, Z. and YANG, Z. (2022). Pessimism in the face of confounders: Provably efficient offline reinforcement learning in partially observable markov decision processes. In The Eleventh International Conference on Learning Representations.
LU, Y., Xu, Z. and TEWARI, A. (2021). Bandit algorithms for precision medicine. arXiv preprint arXiv:2108.04782.
LUO, Y. and BAYATI, M. (2023). Geometry-aware approaches for balancing performance and theoretical guarantees in linear bandits. arXiv preprint arXiv:2306.14872.
MAY, B. C., KORDA, N., LEE, A. and LESLIE, D. S. (2012). Optimistic bayesian sampling in contextual-bandit problems. Journal of Machine Learning Research 13 2069-2106.
MIN, Y., CHEN, L. and KARBASI, A. (2021a). The curious case of adversarially robust models: More data can help, double descend, or hurt generalization. In Uncertainty in Artificial Intelligence. PMLR.
MIN, Y., HE, J., WANG, T. and GU, Q. (2022a). Learning stochastic shortest path with linear function approximation. In International Conference on Machine Learning. PMLR.