Online Tensor Inference

References

• Agterberg J, Zhang AR (2025) Estimating higher-order mixed memberships via the ℓ2,∞ tensor perturbation bound. J. Am. Stat. Assoc. 120(550):1214–1224.Crossref, Google Scholar
• Allenby GM, Rossi PE (1998) Marketing models of consumer heterogeneity. J. Econometrics 89(1):57–78.Crossref, Google Scholar
• Bach F, Moulines E (2011) Non-asymptotic analysis of stochastic approximation algorithms for machine learning. Shawe-Taylor J, Zemel R, Bartlett P, Pereira F, Weinberger K, eds. Proc. 24th Adv. Neural Inform. Processing Systems (Curran Associates, Red Hook, NY), 451–459.Google Scholar
• Bayati M, Cao J, Chen W (2022) Speed up the cold-start learning in two-sided bandits with many arms. Preprint, submitted October 1, https://arxiv.org/abs/2210.00340.Google Scholar
• Blake T, Nosko C, Tadelis S (2015) Consumer heterogeneity and paid search effectiveness: A large-scale field experiment. Econometrica 83(1):155–174.Crossref, Google Scholar
• Bojinov I, Gupta S (2022) Online experimentation: Benefits, operational and methodological challenges, and scaling guide. Harvard Data Sci. Rev. 4(3).Google Scholar
• Cai C, Poor HV, Chen Y (2023) Uncertainty quantification for nonconvex tensor completion: Confidence intervals, heteroscedasticity and optimality. IEEE Trans. Inform. Theory 69(1):407–452.Crossref, Google Scholar
• Cai C, Li G, Poor HV, Chen Y (2022) Nonconvex low-rank tensor completion from noisy data. Oper. Res. 70(2):1219–1237.Link, Google Scholar
• Chen EY, Fan J (2023) Statistical inference for high-dimensional matrix-variate factor models. J. Amer. Statist. Assoc. 118(542):1038–1055.Crossref, Google Scholar
• Chen H, Lu W, Song R (2021) Statistical inference for online decision-making: In a contextual bandit setting. J. Amer. Statist. Assoc. 116(533):240–255.Crossref, Google Scholar
• Chen H, Raskutti G, Yuan M (2019a) Non-convex projected gradient descent for generalized low-rank tensor regression. J. Machine Learn. Res. 20(5):1–37.Google Scholar
• Chen Y, Fan J, Ma C, Yan Y (2019b) Inference and uncertainty quantification for noisy matrix completion. Proc. Natl. Acad. Sci. USA 116(46):22931–22937.Crossref, Google Scholar
• Chang X, Chen X, Lai Z, Li H, Liu Z, Zhang Y (2022) Online statistical inference for contextual bandits via stochastic gradient descent. Preprint, submitted December 30, https://arxiv.org/abs/2212.14883.Google Scholar
• Chen X, Lee JD, Tong XT, Zhang Y (2020) Statistical inference for model parameters in stochastic gradient descent. Ann. Statist. 48(1):251–273.Crossref, Google Scholar
• De Lathauwer L, De Moor B, Vandewalle J (2000a) A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl. 21(4):1253–1278.Crossref, Google Scholar
• De Lathauwer L, De Moor B, Vandewalle J (2000b) On the best rank-1 and rank-(r1, r2,., rn) approximation of higher-order tensors. SIAM J. Matrix Anal. Appl. 21(4):1324–1342.Crossref, Google Scholar
• Dwivedi YK, Ismagilova E, Hughes DL, Carlson J, Filieri R, Jacobson J, Jain V, et al. (2021) Setting the future of digital and social media marketing research: Perspectives and research propositions. Internat. J. Inform. Management 59:102168.Crossref, Google Scholar
• Eckart C, Young G (1936) The approximation of one matrix by another of lower rank. Psychometrika 1(3):211–218.Crossref, Google Scholar
• Fang Y, Xu J, Yang L (2018) Online bootstrap confidence intervals for the stochastic gradient descent estimator. J. Machine Learn. Res. 19(78):1–21.Google Scholar
• Farias VF, Li AA (2019) Learning preferences with side information. Management Sci. 65(7):3131–3149.Link, Google Scholar
• Funk S (2006) Netflix update: Try this at home. Accessed January 27, 2026, https://sifter.org/simon/journal/20061211.html.Google Scholar
• Grbovic M, Radosavljevic V, Djuric N, Bhamidipati N, Savla J, Bhagwan V, Sharp D (2015) E-commerce in your inbox: Product recommendations at scale. Cao L, Zhang C, Joachims T, Webb GI, Margineantu DD, Williams G, eds. Proc. 21th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (Association for Computing Machinery, New York), 1809–1818.Google Scholar
• Han R, Willett R, Zhang AR (2022) An optimal statistical and computational framework for generalized tensor estimation. Ann. Stat. 50(1):1–29.Crossref, Google Scholar
• Han R, Luo L, Lin Y, Huang J (2024) Online inference with debiased stochastic gradient descent. Biometrika 111(1):93–108.Crossref, Google Scholar
• Hotelling H (1933) Analysis of a complex of statistical variables into principal components. J. Ed. Psych. 24(6):417–441.Crossref, Google Scholar
• Huang J, Huang DZ, Yang Q, Cheng G (2022) Power iteration for tensor PCA. J. Machine Learn. Res. 23(1):5567–5613.Google Scholar
• Imbens G (2022) Comment on: “Confidence intervals for nonparametric empirical bayes analysis” by Ignatiadis and Wager. J. Amer. Statist. Assoc. 117(539):1181–1182.Crossref, Google Scholar
• Jiang ZZ, Li J, Zhang D (2025) A high-dimensional choice model for online retailing. Management Sci. 71(4):3320–3339.Link, Google Scholar
• Jin C, Kakade SM, Netrapalli P (2016) Provable efficient online matrix completion via non-convex stochastic gradient descent. Lee D, Sugiyama M, Luxburg U, Guyon I, Garnett R, eds. Proc. 30th Adv. Neural Inform. Processing Systems (Curran Associates Inc., Red Hook, NY), 4527–4535.Google Scholar
• Kallus N, Udell M (2020) Dynamic assortment personalization in high dimensions. Oper. Res. 68(4):1020–1037.Link, Google Scholar
• Kamakura WA, Kim BD, Lee J (1996) Modeling preference and structural heterogeneity in consumer choice. Marketing Sci. 15(2):152–172.Link, Google Scholar
• Keane MP (1997) Modeling heterogeneity and state dependence in consumer choice behavior. J. Bus. Econom. Statist. 15(3):310–327.Crossref, Google Scholar
• Kolda T (2006) Multilinear operators for higher-order decompositions. Technical Report No. SAND2006-2081, Sandia National Laboratories, Albuquerque, NM and Livermore, CA.Google Scholar
• Kolda TG, Bader BW (2009) Tensor decompositions and applications. SIAM Rev. 51(3):455–500.Crossref, Google Scholar
• Kumar V, Pansari A (2016) Competitive advantage through engagement. J. Marketing Res. 53(4):497–514.Crossref, Google Scholar
• Li L, Zhang X (2017) Parsimonious tensor response regression. J. Amer. Statist. Assoc. 112(519):1131–1146.Crossref, Google Scholar
• Li J, Cai JF, Chen Y, Xia D (2023) Online tensor learning: Computational and statistical trade-offs, adaptivity, and optimal regret. Preprint, submitted June 6, https://arxiv.org/abs/2306.03372.Google Scholar
• Li X, Xu D, Zhou H, Li L (2018) Tucker tensor regression and neuroimaging analysis. Statist. Biosci. 10(3):520–545.Crossref, Google Scholar
• Liang T, Su WJ (2019) Statistical inference for the population landscape via moment-adjusted stochastic gradients. J. Roy. Statist. Soc. Ser. B Statist. Methodology 81(2):431–456.Crossref, Google Scholar
• Miao S, Chao X (2022) Online personalized assortment optimization with high-dimensional customer contextual data. Manufacturing Service Oper. Management 24(5):2741–2760.Link, Google Scholar
• Nemirovski A, Juditsky A, Lan G, Shapiro A (2009) Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4):1574–1609.Crossref, Google Scholar
• Polyak BT, Juditsky AB (1992) Acceleration of stochastic approximation by averaging. SIAM J. Control Optim. 30(4):838–855.Crossref, Google Scholar
• POTOO (2024) Amazon’s ‘see price in cart’: Key insights for brands. Accessed January 27, 2026, https://www.linkedin.com/pulse/amazons-see-price-cart-key-insights-brands-potoosolutions-8k33e/.Google Scholar
• Raskutti G, Yuan M, Chen H (2019) Convex regularization for high-dimensional multiresponse tensor regression. Ann. Statist. 47(3):1554–1584.Crossref, Google Scholar
• Robbins H, Monro S (1951) A stochastic approximation method. Ann. Math. Statist. 22(3):400–407.Crossref, Google Scholar
• Ruppert D (1988) Efficient estimations from a slowly convergent Robbins-Monro process. Technical report No. 781, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY.Google Scholar
• Sawhney M, Verona G, Prandelli E (2005) Collaborating to create: The Internet as a platform for customer engagement in product innovation. J. Interactive Marketing 19(4):4–17.Crossref, Google Scholar
• Shankar V, Inman JJ, Mantrala M, Kelley E, Rizley R (2011) Innovations in shopper marketing: Current insights and future research issues. J. Retailing 87:S29–S42.Crossref, Google Scholar
• Spearman C (1904) “General intelligence,” objectively determined and measured. Amer. J. Psych. 15(2):201–292.Crossref, Google Scholar
• Statista (2024) Online advertising revenue in the United States from 2000 to 2023. Accessed January 27, 2026, https://www.statista.com/statistics/183816/us-online-advertising-revenue-since-2000/.Google Scholar
• Tong T, Ma C, Prater-Bennette A, Tripp E, Chi Y (2022) Scaling and scalability: Provable nonconvex low-rank tensor estimation from incomplete measurements. J. Machine Learn. Res. 23(1):7312–7388.Google Scholar
• Udell M, Townsend A (2019) Why are big data matrices approximately low rank? SIAM J. Math. Data Sci. 1(1):144–160.Crossref, Google Scholar
• Witten DM, Tibshirani R, Hastie T (2009) A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis. Biostatistics 10(3):515–534.Crossref, Google Scholar
• Xia D (2019) Confidence region of singular subspaces for low-rank matrix regression. IEEE Trans. Inform. Theory 65(11):7437–7459.Crossref, Google Scholar
• Xia D, Yuan M (2021) Statistical inferences of linear forms for noisy matrix completion. J. Roy. Statist. Soc. Ser. B. Statist. Methodology 83(1):58–77.Crossref, Google Scholar
• Xia D, Zhang AR, Zhou Y (2022) Inference for low-rank tensors—No need to debias. Ann. Statist. 50(2):1220–1245.Crossref, Google Scholar
• Xu K, Zhao X, Bastani H, Bastani O (2021) Group-sparse matrix factorization for transfer learning of word embeddings. Meila M, Zhang T, eds. Proc. 38th Internat. Conf. Machine Learn. (Curran Associates, Red Hook, NY), 11603–11612.Google Scholar
• Zhang A (2019) Cross: Efficient low-rank tensor completion. Ann. Statist. 47(2):936–964.Crossref, Google Scholar
• Zhang A, Xia D (2018) Tensor SVD: Statistical and computational limits. IEEE Trans. Inform. Theory 64(11):7311–7338.Crossref, Google Scholar
• Zhang AR, Luo Y, Raskutti G, Yuan M (2020) ISLET: Fast and optimal low-rank tensor regression via importance sketching. SIAM J. Math. Data Sci. 2(2):444–479.Crossref, Google Scholar
• Zhang Y, Zhang J, Sun Y, Wang J (2024) Change point detection in dynamic networks via regularized tensor decomposition. J. Comput. Graphic Statist. 33(2):515–524.Crossref, Google Scholar
• Zhen Y, Wang J (2024) Nonnegative tensor completion for dynamic counterfactual prediction on COVID-19 pandemic. Ann. Appl. Statist. 18(1):224–245.Crossref, Google Scholar
• Zheng Q, Lafferty J (2016) Convergence analysis for rectangular matrix completion using Burer-Monteiro factorization and gradient descent. Preprint, submitted May 23, https://arxiv.org/abs/1605.07051.Google Scholar
• Zhou Y, Chen Y (2023) Heteroskedastic tensor clustering. Preprint, submitted November 4, https://arxiv.org/abs/2311.02306.Google Scholar
• Zhou H, Li L, Zhu H (2013) Tensor regression with applications in neuroimaging data analysis. J. Amer. Statist. Assoc. 108(502):540–552.Crossref, Google Scholar
• Zhou J, Hao B, Wen Z, Zhang J, Sun WW (2025) Stochastic low-rank tensor bandits for multi-dimensional online decision making. J. Amer. Statist. Assoc. 120(549):198–211.Crossref, Google Scholar