{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T03:07:05Z","timestamp":1780369625084,"version":"3.54.1"},"reference-count":55,"publisher":"Informa UK Limited","issue":"553","funder":[{"name":"Hong Kong RGC","award":["GRF 16302323"],"award-info":[{"award-number":["GRF 16302323"]}]},{"name":"Hong Kong RGC","award":["GRF 16301622"],"award-info":[{"award-number":["GRF 16301622"]}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Journal of the American Statistical Association"],"published-print":{"date-parts":[[2026,1,2]]},"DOI":"10.1080\/01621459.2025.2537454","type":"journal-article","created":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T15:29:55Z","timestamp":1753975795000},"page":"598-611","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":0,"title":["Online Policy Learning and Inference by Matrix Completion"],"prefix":"10.1080","volume":"121","author":[{"given":"Congyuan","family":"Duan","sequence":"first","affiliation":[{"name":"Department of Mathematics, The Hong Kong University of Science and Technology","place":["Kowloon, Hong Kong"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jingyang","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Statistics, University of Michigan","place":["Ann Arbor"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dong","family":"Xia","sequence":"additional","affiliation":[{"name":"Department of Mathematics, The Hong Kong University of Science and Technology","place":["Kowloon, Hong Kong"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2025,10,10]]},"reference":[{"key":"e_1_3_3_2_1","first-page":"1638","volume-title":"International Conference on Machine Learning","author":"Agarwal A.","year":"2014","unstructured":"Agarwal, A., Hsu, D., Kale, S., Langford, J., Li, L., and Schapire, R. (2014), \u201cTaming the Monster: A Fast and Simple Algorithm for Contextual Bandits,\u201d in International Conference on Machine Learning, pp. 1638\u20131646, PMLR."},{"key":"e_1_3_3_3_1","article-title":"\u201cImplicit Regularization in Deep Matrix Factorization,\u201d in","volume":"2","author":"Arora S.","year":"2019","unstructured":"Arora, S., Cohen, N., Hu, W., and Luo, Y. (2019), \u201cImplicit Regularization in Deep Matrix Factorization,\u201d in Advances in Neural Information Processing Systems (Vol. 2). Curran Associates, Inc. Available at https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2019\/file\/c0c783b5fc0d7d808f1d14a6e9c8280d-Paper.pdf.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_4_1","doi-asserted-by":"publisher","DOI":"10.1214\/009053606000001217"},{"key":"e_1_3_3_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2018.1757"},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1902"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2020.3605"},{"key":"e_1_3_3_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2018.3253"},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.2337\/dc16-0826"},{"key":"e_1_3_3_10_1","first-page":"3207","article-title":"\u201cCounterfactual Reasoning and Learning Systems: The Example of Computational Advertising,\u201d","volume":"14","author":"Bottou L.","year":"2013","unstructured":"Bottou, L., Peters, J., Qui\u00f1onero-Candela, J., Charles, D. X., Max Chickering, D., Portugaly, E., Ray, D., Simard, P., and Snelson, E. (2013), \u201cCounterfactual Reasoning and Learning Systems: The Example of Computational Advertising,\u201d Journal of Machine Learning Research, 14, 3207\u20133260.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_3_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2184319.2184343"},{"key":"e_1_3_3_12_1","first-page":"925","volume-title":"Proceedings of the IEEE","volume":"98","author":"Candes E. J.","year":"2010","unstructured":"Candes, E. J., and Plan, Y. (2010), \u201cMatrix Completion with Noise,\u201d Proceedings of the IEEE, 98, 925\u2013936."},{"key":"e_1_3_3_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2111771"},{"key":"e_1_3_3_14_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2020.1770098"},{"key":"e_1_3_3_15_1","unstructured":"Chen X. Lai Z. Li H. and Zhang Y. (2022a) \u201cOnline Statistical Inference for Contextual Bandits via Stochastic Gradient Descent \u201d arXiv preprint arXiv:2212.14883."},{"key":"e_1_3_3_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2020.3772"},{"key":"e_1_3_3_17_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1910053116"},{"key":"e_1_3_3_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/19m1290000"},{"key":"e_1_3_3_19_1","doi-asserted-by":"publisher","DOI":"10.1214\/23-AOS2293"},{"key":"e_1_3_3_20_1","volume-title":"Advances in Neural Information Processing Systems","author":"Garivier A.","year":"2016","unstructured":"Garivier, A., Lattimore, T., and Kaufmann, E. (2016), \u201cOn Explore-Then-Commit Strategies,\u201d in Advances in Neural Information Processing Systems (Vol. 29)."},{"key":"e_1_3_3_21_1","doi-asserted-by":"publisher","DOI":"10.1287\/11-SSY032"},{"key":"e_1_3_3_22_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2014602118"},{"key":"e_1_3_3_23_1","unstructured":"Han Q. Sun W. W. and Zhang Y. (2022) \u201cOnline Statistical Inference for Matrix Contextual Bandit \u201d arXiv preprint arXiv:2212.11385."},{"key":"e_1_3_3_24_1","first-page":"10753","article-title":"\u201cHigh-Dimensional Sparse Linear Bandits,\u201d in","volume":"33","author":"Hao B.","year":"2020","unstructured":"Hao, B., Lattimore, T., and Wang, M. (2020), \u201cHigh-Dimensional Sparse Linear Bandits,\u201d in Advances in Neural Information Processing Systems (Vol. 33), 10753\u201310763.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_25_1","first-page":"3367","article-title":"\u201cMatrix Completion and Low-Rank SVD via Fast Alternating Least Squares,\u201d","volume":"16","author":"Hastie T.","year":"2015","unstructured":"Hastie, T., Mazumder, R., Lee, J. D., and Zadeh, R. (2015), \u201cMatrix Completion and Low-Rank SVD via Fast Alternating Least Squares,\u201d The Journal of Machine Learning Research, 16, 3367\u20133402.","journal-title":"The Journal of Machine Learning Research"},{"key":"e_1_3_3_26_1","article-title":"\u201cProvable Efficient Online Matrix Completion via Non-Convex Stochastic Gradient Descent,\u201d in","volume":"29","author":"Jin C.","year":"2016","unstructured":"Jin, C., Kakade, S. M., and Netrapalli, P. (2016), \u201cProvable Efficient Online Matrix Completion via Non-Convex Stochastic Gradient Descent,\u201d in Advances in Neural Information Processing Systems (Vol. 29).","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_27_1","first-page":"3163","volume-title":"International Conference on Machine Learning","author":"Jun K.-S.","year":"2019","unstructured":"Jun, K.-S., Willett, R., Wright, S., and Nowak, R. (2019), \u201cBilinear Bandits with Low-Rank Structure,\u201d in International Conference on Machine Learning, pp. 3163\u20133172, PMLR."},{"key":"e_1_3_3_28_1","unstructured":"Kaggle. (2020) \u201cEstimate the Unit Sales of Walmart Retail Goods \u201d available at https:\/\/www.kaggle.com\/competitions\/m5-forecasting-accuracy."},{"key":"e_1_3_3_29_1","volume-title":"Advances in Neural Information Processing Systems","author":"Keshavan R.","year":"2009","unstructured":"Keshavan, R., Montanari, A., and Oh, S. (2009), \u201cMatrix Completion from Noisy Entries,\u201d in Advances in Neural Information Processing Systems (Vol. 22)."},{"key":"e_1_3_3_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"e_1_3_3_31_1","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOS894"},{"key":"e_1_3_3_32_1","volume-title":"Advances in Neural Information Processing Systems","author":"Langford J.","year":"2007","unstructured":"Langford, J., and Zhang, T. (2007), \u201cThe Epoch-Greedy Algorithm for Multi-Armed Bandits with Side Information,\u201d in Advances in Neural Information Processing Systems (Vol. 20)."},{"key":"e_1_3_3_33_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"e_1_3_3_34_1","unstructured":"Li J. Cai J.-F. Chen Y. and Xia D. (2023) \u201cOnline Tensor Learning: Computational and Statistical Trade-Offs Adaptivity and Optimal Regret \u201d arXiv preprint arXiv:2306.03372."},{"key":"e_1_3_3_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"e_1_3_3_36_1","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1384"},{"key":"e_1_3_3_37_1","first-page":"3345","volume-title":"International Conference on Machine Learning","author":"Ma C.","year":"2018","unstructured":"Ma, C., Wang, K., Chi, Y., and Chen, Y. (2018), \u201cImplicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval and Matrix Completion,\u201d in International Conference on Machine Learning, pp. 3345\u20133354, PMLR."},{"key":"e_1_3_3_38_1","unstructured":"Ma W. Du L. Xia D. and Yuan M. (2023a) \u201cMultiple Testing of Linear Forms for Noisy Matrix Completion \u201d arXiv preprint arXiv:2312.00305."},{"key":"e_1_3_3_39_1","unstructured":"Ma W. Xia D. and Jiang J. (2023b) \u201cHigh-Dimensional Linear Bandits with Knapsacks \u201d arXiv preprint arXiv:2311.01327."},{"key":"e_1_3_3_40_1","first-page":"2287","article-title":"\u201cSpectral Regularization Algorithms for Learning Large Incomplete Matrices,\u201d","volume":"11","author":"Mazumder R.","year":"2010","unstructured":"Mazumder, R., Hastie, T., and Tibshirani, R. (2010), \u201cSpectral Regularization Algorithms for Learning Large Incomplete Matrices,\u201d The Journal of Machine Learning Research, 11, 2287\u20132322.","journal-title":"The Journal of Machine Learning Research"},{"key":"e_1_3_3_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tra.2014.02.016"},{"key":"e_1_3_3_42_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-9868.00389"},{"key":"e_1_3_3_43_1","doi-asserted-by":"publisher","DOI":"10.1080\/01944363.2013.787307"},{"key":"e_1_3_3_44_1","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS864"},{"key":"e_1_3_3_45_1","unstructured":"SFpark. (2013) \u201cSfpark Evaluation \u201d available at https:\/\/www.sfmta.com\/getting-around\/drive-park\/demand-responsive-pricing\/sfpark-evaluation. Accessed: April 27 2024."},{"key":"e_1_3_3_46_1","first-page":"3086","volume-title":"International Conference on Artificial Intelligence and Statistics","author":"Simchi-Levi D.","year":"2023","unstructured":"Simchi-Levi, D., and Wang, C. (2023), \u201cMulti-Armed Bandit Experimental Design: Online Decision-Making and Adaptive Inference,\u201d in International Conference on Artificial Intelligence and Statistics, pp. 3086\u20133097, PMLR."},{"key":"e_1_3_3_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2017.8116452"},{"key":"e_1_3_3_48_1","volume-title":"Advances in Artificial Intelligence","author":"Su X.","year":"2009","unstructured":"Su, X., and Khoshgoftaar, T. M. (2009), \u201cA Survey of Collaborative Filtering Techniques,\u201d in Advances in Artificial Intelligence."},{"key":"e_1_3_3_49_1","first-page":"9167","volume-title":"International Conference on Machine Learning","author":"Su Y.","year":"2020","unstructured":"Su, Y., Dimakopoulou, M., Krishnamurthy, A., and Dudik, M. (2020), \u201cDoubly Robust Off-Policy Evaluation with Shrinkage,\u201d in International Conference on Machine Learning, pp. 9167\u20139176, PMLR."},{"key":"e_1_3_3_50_1","volume-title":"Reinforcement Learning: An Introduction","author":"Sutton R. S.","year":"2018","unstructured":"Sutton, R. S., and Barto, A. G. (2018), Reinforcement Learning: An Introduction, Cambridge, MA: MIT Press."},{"key":"e_1_3_3_51_1","first-page":"3589","volume-title":"International Conference on Machine Learning","author":"Wang Y.-X.","year":"2017","unstructured":"Wang, Y.-X., Agarwal, A., and Dudik, M. (2017), \u201cOptimal and Adaptive Off-Policy Evaluation in Contextual Bandits,\u201d in International Conference on Machine Learning, pp. 3589\u20133597, PMLR."},{"key":"e_1_3_3_52_1","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12400"},{"key":"e_1_3_3_53_1","unstructured":"Yan Y. Chen Y. and Fan J. (2021) \u201cInference for Heteroskedastic PCA with Missing Data \u201d arXiv preprint arXiv:2107.12365."},{"key":"e_1_3_3_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467456"},{"key":"e_1_3_3_55_1","first-page":"7460","volume-title":"Advances in Neural Information Processing Systems","author":"Zhang K.","year":"2021","unstructured":"Zhang, K., Janson, L., and Murphy, S. (2021), \u201cStatistical Inference with m-estimators on Adaptively Collected Data,\u201d in Advances in Neural Information Processing Systems (Vol. 34), pp. 7460\u20137471."},{"key":"e_1_3_3_56_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2024.2311364"}],"container-title":["Journal of the American Statistical Association"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/01621459.2025.2537454","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T02:25:39Z","timestamp":1780367139000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/01621459.2025.2537454"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,10]]},"references-count":55,"journal-issue":{"issue":"553","published-print":{"date-parts":[[2026,1,2]]}},"alternative-id":["10.1080\/01621459.2025.2537454"],"URL":"https:\/\/doi.org\/10.1080\/01621459.2025.2537454","relation":{},"ISSN":["0162-1459","1537-274X"],"issn-type":[{"value":"0162-1459","type":"print"},{"value":"1537-274X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,10]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=uasa20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=uasa20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2025-03-13","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-06-05","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-07-07","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-10-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}