{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T03:05:48Z","timestamp":1783652748164,"version":"3.55.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T00:00:00Z","timestamp":1703030400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T00:00:00Z","timestamp":1703030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s10994-023-06489-5","type":"journal-article","created":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T05:02:20Z","timestamp":1703134940000},"page":"789-814","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Markov chain importance sampling for minibatches"],"prefix":"10.1007","volume":"113","author":[{"given":"Cheng-Der","family":"Fuh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5281-2962","authenticated-orcid":false,"given":"Chuan-Ju","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen-Hung","family":"Pai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,12,20]]},"reference":[{"key":"6489_CR1","volume-title":"Elements of information theory","author":"TM Cover","year":"2006","unstructured":"Cover, T. M., & Thomas, J. A. (2006). Elements of information theory. UK: Wiley."},{"issue":"1","key":"6489_CR2","first-page":"962","volume":"19","author":"D Csiba","year":"2018","unstructured":"Csiba, D., & Richt\u00e1rik, P. (2018). Importance sampling for minibatches. Journal of Machine Learning Research, 19(1), 962\u2013982.","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"6489_CR3","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1093\/biomet\/78.1.161","volume":"78","author":"K-A Do","year":"1991","unstructured":"Do, K.-A., & Hall, P. (1991). On importance resampling for the bootstrap. Biometrika, 78(1), 161\u2013167.","journal-title":"Biometrika"},{"key":"6489_CR4","unstructured":"El Hanchi, A., & Stephens, D. (2020). Adaptive importance sampling for finitesum optimization and sampling with decreasing step-sizes. Advances in Neural Information Processing Systems, 33."},{"issue":"2","key":"6489_CR5","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1093\/biomet\/91.2.471","volume":"91","author":"C-D Fuh","year":"2004","unstructured":"Fuh, C.-D., & Hu, I. (2004). Efficient importance sampling for events of moderate deviations with applications. Biometrika, 91(2), 471\u2013490.","journal-title":"Biometrika"},{"issue":"2","key":"6489_CR6","doi-asserted-by":"publisher","first-page":"492","DOI":"10.3150\/07--BEJ5163","volume":"13","author":"C-D Fuh","year":"2007","unstructured":"Fuh, C.-D., & Hu, I. (2007). Estimation in hidden Markov models via efficient importance sampling. Bernoulli, 13(2), 492\u2013513.","journal-title":"Bernoulli"},{"key":"6489_CR7","doi-asserted-by":"crossref","unstructured":"Fuh, C.D., & Wang, C.J. (2023). Efficient exponential tilting with applications. Technical Report.","DOI":"10.1007\/s11222-023-10374-5"},{"key":"6489_CR8","doi-asserted-by":"crossref","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.H., & Friedman, J.H. (2009). The elements of statistical learning: data mining, inference, and prediction (Vol. 2). Springer.","DOI":"10.1007\/978-0-387-84858-7"},{"issue":"403","key":"6489_CR9","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1080\/01621459.1988.10478651","volume":"83","author":"MV Johns","year":"1988","unstructured":"Johns, M. V. (1988). Importance sampling for bootstrap confidence intervals. Journal of the American Statistical Association, 83(403), 709\u2013714.","journal-title":"Journal of the American Statistical Association"},{"key":"6489_CR10","unstructured":"Johnson, T.B., & Guestrin, C. (2018). Training deep models faster with robust, approximate importance sampling. In Proceedings of the 31st international conference on neural information processing systems (pp. 7265\u20137275)."},{"key":"6489_CR11","unstructured":"Katharopoulos, A., & Fleuret, F. (2018). Not all samples are created equal: Deep learning with importance sampling. In Proceedings of the 35th international conference on machine learning (pp. 2525\u20132534)."},{"key":"6489_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1166-2","volume-title":"Asymptotics in statistics","author":"L LeCam","year":"2000","unstructured":"LeCam, L., & Yang, G. L. (2000). Asymptotics in statistics. NewYork: Springer- Verlag."},{"key":"6489_CR13","unstructured":"Loshchilov, I., & Hutter, F. (2015). Online batch selection for faster training of neural networks. arXiv preprint arXiv:1511.06343 ."},{"issue":"1","key":"6489_CR14","first-page":"4873","volume":"18","author":"S Mandt","year":"2017","unstructured":"Mandt, S., Hoffman, M. D., & Blei, D. M. (2017). Stochastic gradient descent as approximate Bayesian inference. Journal of Machine Learning Research, 18(1), 4873\u20134907.","journal-title":"Journal of Machine Learning Research"},{"key":"6489_CR15","volume-title":"Markov chains and stochastic stability","author":"SP Meyn","year":"2012","unstructured":"Meyn, S. P., & Tweedie, R. L. (2012). Markov chains and stochastic stability. Berlin: Springer Science & Business Media."},{"issue":"1","key":"6489_CR16","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1214\/aos\/1176343006","volume":"3","author":"C Morris","year":"1975","unstructured":"Morris, C. (1975). Central limit theorems for multinomial sums. Annals of Statistics, 3(1), 165\u2013188.","journal-title":"Annals of Statistics"},{"key":"6489_CR17","unstructured":"Needell, D., Ward, R., Srebro, N. (2014). Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm. In Proceedings of the 27th international conference on neural information processing systems (pp. 1017\u20131025)."},{"issue":"6","key":"6489_CR18","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1007\/s11590-015-0916-1","volume":"10","author":"P Richt\u00e1rik","year":"2016","unstructured":"Richt\u00e1rik, P., & Tak\u00e1\u00e8, M. (2016). On optimal probabilities in stochastic coordinate descent methods. Optimization Letters, 10(6), 1233\u20131243.","journal-title":"Optimization Letters"},{"issue":"3","key":"6489_CR19","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H Robbins","year":"1951","unstructured":"Robbins, H., & Monro, S. (1951). A stochastic approximation method. Annals of Mathematical Statistics, 22(3), 400\u2013407.","journal-title":"Annals of Mathematical Statistics"},{"key":"6489_CR20","volume-title":"Simulation","author":"SM Ross","year":"2022","unstructured":"Ross, S. M. (2022). Simulation. UK: Academic Press."},{"key":"6489_CR21","unstructured":"Schaul, T., Quan, J., Antonoglou, I., & Silver, D. (2015). Prioritized experience replay. arXiv preprint arXiv:1511.05952 ."},{"issue":"1","key":"6489_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-010-0420-4","volume":"127","author":"S Shalev-Shwartz","year":"2011","unstructured":"Shalev-Shwartz, S., Singer, Y., Srebro, N., & Cotter, A. (2011). Pegasos: Primal estimated sub-gradient solver for SVM. Mathematical Programming, 127(1), 3\u201330.","journal-title":"Mathematical Programming"},{"issue":"8","key":"6489_CR23","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1049\/el:19740097","volume":"10","author":"AJ Walker","year":"1974","unstructured":"Walker, A. J. (1974). New fast method for generating discrete random numbers with arbitrary frequency distributions. Electronics Letters, 10(8), 127\u2013128.","journal-title":"Electronics Letters"},{"issue":"3","key":"6489_CR24","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/355744.355749","volume":"3","author":"AJ Walker","year":"1977","unstructured":"Walker, A. J. (1977). An efficient method for generating discrete random variables with general distributions. ACM Transactions on Mathematical Software (TOMS), 3(3), 253\u2013256.","journal-title":"ACM Transactions on Mathematical Software (TOMS)"},{"key":"6489_CR25","unstructured":"Zhao, P., & Zhang, T. (2015). Stochastic optimization with importance sampling for regularized loss minimization. In Proceedings of the 32nd international conference on machine learning (pp. 1\u20139)."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-023-06489-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-023-06489-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-023-06489-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T18:13:43Z","timestamp":1764267223000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-023-06489-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,20]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["6489"],"URL":"https:\/\/doi.org\/10.1007\/s10994-023-06489-5","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,20]]},"assertion":[{"value":"26 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This paper is approved in ethics.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"This paper is consented to participate.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"This paper is consented for publication.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}