{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:42Z","timestamp":1740169182583,"version":"3.37.3"},"reference-count":63,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Vingroup Innovation Foundation","award":["VINIF.2019.DA18"],"award-info":[{"award-number":["VINIF.2019.DA18"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3008534","type":"journal-article","created":{"date-parts":[[2020,7,10]],"date-time":"2020-07-10T20:25:30Z","timestamp":1594412730000},"page":"127818-127833","source":"Crossref","is-referenced-by-count":1,"title":["MAP Estimation With Bernoulli Randomness, and Its Application to Text Analysis and Recommender Systems"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4533-419X","authenticated-orcid":false,"given":"Xuan","family":"Bui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hieu","family":"Vu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6166-2011","authenticated-orcid":false,"given":"Oanh","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8615-2854","authenticated-orcid":false,"given":"Khoat","family":"Than","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Guaranteed inference in topic models","author":"than","year":"2015","journal-title":"arXiv 1512 03308"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1992.4.6.888"},{"key":"ref33","first-page":"985","article-title":"Provable Bayesian inference via particle mirror descent","author":"dai","year":"0","journal-title":"Artificial Intelligence and Statistics"},{"key":"ref32","first-page":"1599","article-title":"Sparse stochastic inference for latent Dirichlet allocation","author":"hoffman","year":"2012","journal-title":"Proc 29th Int Conf Mach Learn (ICML)"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.21236\/ADA629956"},{"key":"ref30","first-page":"993","article-title":"Latent Dirichlet allocation","volume":"3","author":"blei","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref37","first-page":"142","article-title":"Online learning and stochastic approximations","volume":"17","author":"bottou","year":"1998","journal-title":"On-Line Learning on Neural Networks"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P17-1040"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/963770.963775"},{"key":"ref34","first-page":"2","article-title":"Stochastic quasi-Newton langevin Monte Carlo","author":"simsekli","year":"2016","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020480"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.2307\/1990253"},{"key":"ref61","first-page":"3176","article-title":"Content-based recommendations with Poisson factorization","author":"gopalan","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/E14-1056"},{"key":"ref28","first-page":"1724","article-title":"How to escape saddle points efficiently","volume":"70","author":"jin","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref27","first-page":"3716","article-title":"Neon2: Finding local minima via first-order oracles","author":"li","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref29","first-page":"1157","article-title":"How to make the gradients small stochastically: Even faster convex and nonconvex SGD","author":"allen-zhu","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"journal-title":"The Bayesian Choice From Decision-Theoretic Foundations to Computational Implementation","year":"2007","author":"robert","key":"ref2"},{"journal-title":"Probabilistic Graphical Models Principles and Techniques","year":"2009","author":"koller","key":"ref1"},{"key":"ref20","first-page":"1950","article-title":"Global map-optimality by shrinking the combinatorial search area with convex relaxation","author":"savchynskyy","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref22","first-page":"2283","article-title":"Stochastic majorization-minimization algorithms for large-scale optimization","author":"mairal","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref21","first-page":"1033","article-title":"The concave-convex procedure (CCCP)","volume":"2","author":"yuille","year":"2002","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref24","first-page":"1843","article-title":"Projection-free online learning","author":"hazan","year":"2012","journal-title":"Proc Annu Int Conf Mach Learn"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1824777.1824783"},{"key":"ref26","first-page":"2680","article-title":"Natasha 2: Faster non-convex optimization than SGD","author":"allen-zhu","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852377"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2020.101582"},{"key":"ref51","first-page":"2859","article-title":"Provable algorithms for inference in topic models","author":"arora","year":"2016","journal-title":"Proc 33nd Int Conf Mach Learn"},{"key":"ref59","first-page":"13","article-title":"Evaluating topic coherence using distributional semantics","author":"aletras","year":"2013","journal-title":"Proc 10th Int Conf Comput Semantics (IWCS)"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0307752101"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487682"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31750-2_34"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487697"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783355"},{"key":"ref53","first-page":"27","article-title":"On smoothing and inference for topic models","author":"asuncion","year":"2009","journal-title":"Proc 21th Annu Conf Uncertainty Artif Intell"},{"key":"ref52","first-page":"1303","article-title":"Stochastic variational inference","volume":"14","author":"hoffman","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref10","first-page":"1180","article-title":"MAP estimation for graphical models by likelihood maximization","author":"kumar","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref11","first-page":"1008","article-title":"Complexity of inference in latent Dirichlet allocation","author":"sontag","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31484-6_5"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)90072-8"},{"key":"ref13","first-page":"1","article-title":"The relative complexity of maximum likelihood estimation, MAP estimation, and sampling","volume":"99","author":"tosh","year":"2019","journal-title":"Mach Learn Res"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2916805"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01140"},{"key":"ref16","first-page":"216","article-title":"Block stability for MAP inference","volume":"89","author":"lang","year":"2019","journal-title":"Mach Learn Res"},{"key":"ref17","first-page":"247","article-title":"Learning with maximum a-posteriori perturbation models","author":"gane","year":"2014","journal-title":"Artificial Intelligence and Statistics"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/16M1071249"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/31\/8\/085009"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/18M1174076"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2019.06.061"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1117\/12.2518860","article-title":"Can machines learn continuously? A tutorial of the Bayesian approach","author":"than","year":"2019","journal-title":"Artificial Intelligence and Machine Learning for Multi-Domain"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33016562"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2018.02.001"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2019.05.010"},{"key":"ref49","first-page":"1","article-title":"Toward personality insights from language exploration in social media","author":"schwartz","year":"2013","journal-title":"AAAI Spring Symposium Analyzing Microtext"},{"key":"ref9","first-page":"503","article-title":"Tightening lp relaxations for MAP using message passing","author":"sontag","year":"2008","journal-title":"Proc 24th Conf Uncertainty in Artific Intell"},{"key":"ref46","first-page":"262","article-title":"Optimizing semantic coherence in topic models","author":"mimno","year":"2011","journal-title":"Proc Conf Empirical Methods Natural Lang Process"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1093\/genetics\/155.2.945","article-title":"Inference of population structure using multilocus genotype data","volume":"155","author":"pritchard","year":"2000","journal-title":"Genetics"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1093\/pan\/mpp034"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557121"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/2133806.2133826"},{"journal-title":"The Elements of Statistical Learning Data Mining Inference and Prediction","year":"2009","author":"hastie","key":"ref41"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btq576"},{"key":"ref43","article-title":"Topic modeling in embedding spaces","author":"dieng","year":"2019","journal-title":"arXiv 1907 04907"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09138369.pdf?arnumber=9138369","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T09:23:38Z","timestamp":1667381018000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9138369\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":63,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3008534","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}