{"id":37,"date":"2013-12-09T00:14:25","date_gmt":"2013-12-09T00:14:25","guid":{"rendered":"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/?page_id=37"},"modified":"2022-10-12T03:10:51","modified_gmt":"2022-10-12T03:10:51","slug":"research","status":"publish","type":"page","link":"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/research\/","title":{"rendered":"Research"},"content":{"rendered":"<h3>Statistical Learning and Graphical Models<\/h3>\n<table style=\"height: 1144px\">\n<tbody>\n<tr>\n<td style=\"width: 906px\">\n<p style=\"text-align: left\"><strong><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2021\/02\/beyond-gaussian.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-585\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2021\/02\/beyond-gaussian-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2021\/02\/beyond-gaussian-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2021\/02\/beyond-gaussian.png 417w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/strong><\/p>\n<p>&nbsp;<\/p>\n<p style=\"text-align: left\">Christopher X. Ren, Sidhant Misra, Marc Vuffray, Andrey Y. Lokhov<br \/>\n<strong>Learning Continuous Exponential Families Beyond Gaussian<\/strong><br \/>\nSubmitted [<a href=\"https:\/\/arxiv.org\/abs\/2102.09198\">ArXiv<\/a>]<\/p>\n<p><em>Short description: Introducing a new estimator ISODUS for\u00a0continuous non-Gaussian exponential family distributions with unbounded support and multi-body interactions<\/em><\/p>\n<p style=\"text-align: left\"><strong>\u00a0<\/strong><\/p>\n<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 906px\">\n<p style=\"text-align: left\"><strong><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2021\/04\/glauber.png\"><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-593 alignleft\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2021\/04\/glauber-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2021\/04\/glauber-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2021\/04\/glauber.png 417w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/strong><\/p>\n<p>&nbsp;<\/p>\n<p style=\"text-align: left\">Arkopal Dutt,\u00a0Andrey Y. Lokhov, Marc Vuffray, Sidhant Misra,<br \/>\n<strong>Exponential Reduction in Sample Complexity with Learning of Ising Model Dynamics<\/strong><br \/>\n<a href=\"http:\/\/proceedings.mlr.press\/v139\/dutt21a.html\">International Conference on Machine Learning (ICML 2021)<\/a> [<a href=\"https:\/\/arxiv.org\/abs\/2104.00995\">ArXiv<\/a>]<\/p>\n<p><em>Short description: Learning of graphical models from correlated samples in the out-of-equilibrium regime is exponentially easier compared to the independent samples setting<\/em><\/p>\n<p style=\"text-align: left\"><strong>\u00a0<\/strong><strong>\u00a0<\/strong><\/p>\n<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 906px\">\n<p style=\"text-align: left\"><strong><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2020\/12\/NeurISE.png\"><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-567 alignleft\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2020\/12\/NeurISE-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2020\/12\/NeurISE-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2020\/12\/NeurISE.png 417w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/strong><\/p>\n<p>&nbsp;<\/p>\n<p style=\"text-align: left\">Abhijith J., Andrey Y. Lokhov, Sidhant Misra, Marc Vuffray<br \/>\n<strong>Learning of discrete graphical models with neural networks<\/strong><br \/>\n<a href=\"https:\/\/proceedings.neurips.cc\/paper\/2020\/hash\/3cc697419ea18cc98d525999665cb94a-Abstract.html\">Advances in Neural Information Processing Systems (NeurIPS 2020)<\/a> [<a href=\"https:\/\/arxiv.org\/abs\/2006.11937\">ArXiv<\/a>]<\/p>\n<p><em>Short description: Discovering parsimonious\u00a0basis representation with NeurISE, an Interaction Screening based estimator incorporating neural networks acting as universal energy function approximators<\/em><\/p>\n<p style=\"text-align: left\"><strong>\u00a0<\/strong><\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 272px\">\n<td style=\"height: 272px;width: 906px\">\n<p style=\"text-align: left\"><strong><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/Screening-1.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-222\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/Screening-1-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/Screening-1-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/Screening-1.png 694w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/strong><\/p>\n<p>&nbsp;<\/p>\n<p style=\"text-align: left\">Marc Vuffray, Sidhant Misra,\u00a0Andrey Y. Lokhov<br \/>\n<strong>Efficient learning of discrete graphical models<\/strong><br \/>\n<a href=\"https:\/\/proceedings.neurips.cc\/paper\/2020\/hash\/9d702ffd99ad9c70ac37e506facc8c38-Abstract.html\">Advances in Neural Information Processing Systems (NeurIPS 2020)<\/a> [<a href=\"https:\/\/arxiv.org\/abs\/1902.00600\">ArXiv<\/a>]<\/p>\n<p><em>Short description: Learning discrete graphical models with\u00a0<\/em><em>arbitrary alphabets and multi-body interactions using GRISE, Generalized Regularized Interaction Screening Estimator<\/em><\/p>\n<p style=\"text-align: left\"><strong>\u00a0<\/strong><\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 272px\">\n<td style=\"height: 272px;width: 906px\"><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/Slice-2.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-208\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/Slice-2-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/Slice-2-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/Slice-2.png 694w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/p>\n<p>&nbsp;<\/p>\n<p>Sidhant Misra, Marc Vuffray, Andrey Y. Lokhov<br \/>\n<strong>Information theoretic optimal learning of Gaussian graphical models<\/strong><br \/>\n<a href=\"https:\/\/www.colt2020.org\/virtual\/papers\/paper_395.html\">Conference on Learning Theory (COLT 2020)<\/a>\u00a0[<a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2020\/09\/colt2020gaussian.pdf\">pdf<\/a>] [<a href=\"https:\/\/arxiv.org\/abs\/1703.04886\">ArXiv<\/a>]<\/p>\n<p><em>Short description: Beyond LASSO with SLICE and DICE algorithms that achieve the IT bound on sample complexity for learning the structure of Gaussian graphical models<\/em><\/td>\n<\/tr>\n<tr style=\"height: 272px\">\n<td style=\"height: 272px;width: 906px\">\n<p style=\"text-align: left\"><strong><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/Ising-1.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-129\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/Ising-1-300x283.png\" alt=\"Ising-1\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/Ising-1-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/Ising-1-1024x966.png 1024w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/Ising-1.png 1389w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/strong><\/p>\n<p style=\"text-align: left\">Andrey Y. Lokhov, Marc Vuffray, Sidhant Misra, Michael Chertkov<br \/>\n<strong>Optimal structure and parameter learning of Ising models<em><br \/>\n<\/em><\/strong><a href=\"http:\/\/advances.sciencemag.org\/content\/4\/3\/e1700791\">Science Advances, 4 , e1700791 (2018)<\/a> [<a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2018\/03\/e1700791.full_.pdf\">pdf<\/a>] [<a href=\"https:\/\/arxiv.org\/abs\/1612.05024\">ArXiv<\/a>] [<a href=\"https:\/\/github.com\/lanl-ansi\/inverse_ising\">Code<\/a>]<\/p>\n<p style=\"text-align: left\">Marc Vuffray, Sidhant Misra, Andrey Y. Lokhov, Michael Chertkov<br \/>\n<strong>Interaction screening: efficient and sample-optimal learning of Ising models<\/strong><em><br \/>\n<\/em><a href=\"https:\/\/papers.nips.cc\/paper\/6375-interaction-screening-efficient-and-sample-optimal-learning-of-ising-models\">Advances in Neural Information Processing Systems (NIPS)\u00a02016<\/a> [<a href=\"https:\/\/papers.nips.cc\/paper\/6375-interaction-screening-efficient-and-sample-optimal-learning-of-ising-models.pdf\">pdf<\/a>] [<a href=\"http:\/\/arxiv.org\/abs\/1605.07252\">ArXiv<\/a>]<\/p>\n<p style=\"text-align: left\"><em>Short description: Sample-optimal \u201cInteraction Screening\u201d method for provably learning arbitrary binary graphical models without any assumptions<\/em><\/p>\n<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 906px\"><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/RNA-1.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-135\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/RNA-1-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/RNA-1-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/RNA-1-1024x966.png 1024w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/RNA-1.png 1389w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/p>\n<p>Andrey Y. Lokhov, Olga V. Valba, Mikhail V. Tamm, Sergei K. Nechaev<br \/>\n<strong>Phase transition in random planar diagrams and RNA-type matching<\/strong><br \/>\n<a href=\"http:\/\/pre.aps.org\/abstract\/PRE\/v88\/i5\/e052117\">Phys. Rev. E 88, 052117 (2013)<\/a> [<a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/Lokhov-et-al.-2013-Phase-transition-in-random-planar-diagrams-and-RNA-type-matching.pdf\">pdf<\/a>] [<a href=\"http:\/\/arxiv.org\/abs\/1307.2170\">ArXiv<\/a>]<\/p>\n<p>Andrey Y. Lokhov, Olga V. Valba, Sergei K. Nechaev, Mikhail V. Tamm<br \/>\n<strong style=\"font-family: inherit;font-size: inherit\">Topological transition in disordered planar matching: combinatorial arcs expansion<br \/>\n<\/strong><a style=\"font-family: inherit;font-size: inherit\" href=\"http:\/\/iopscience.iop.org\/1742-5468\/2014\/12\/P12004\/\">J. Stat. Mech. P12004 (2014)<\/a><span style=\"font-family: inherit;font-size: inherit\"> [<\/span><a style=\"font-family: inherit;font-size: inherit\" href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2014\/12\/Lokhov-et-al.-2014-Topological-transition-in-disordered-planar-matching-combinatorial-arcs-expansion.pdf\">pdf<\/a><span style=\"font-family: inherit;font-size: inherit\">] [<\/span><a style=\"font-family: inherit;font-size: inherit\" href=\"http:\/\/arxiv.org\/abs\/1406.5537\">ArXiv<\/a><span style=\"font-family: inherit;font-size: inherit\">]<\/span><\/p>\n<p><em>Short description: Combinatorics of RNA-type matching structures and new phase transition<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<h3>Dynamic Message-Passing and Spreading Processes<\/h3>\n<table style=\"width: 920px\">\n<tbody>\n<tr>\n<td style=\"width: 910px\"><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2022\/10\/cholera1.png\"><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-645 alignleft\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2022\/10\/cholera1-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2022\/10\/cholera1-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2022\/10\/cholera1-768x725.png 768w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2022\/10\/cholera1-1024x967.png 1024w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2022\/10\/cholera1.png 1390w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/p>\n<p>Mateusz Wilinski,\u00a0Lauren Castro, Jeffrey Keithley, Carrie Manore, Josefina Campos, Ethan Romero-Severson, Daryl Domman, Andrey Y. Lokhov<br \/>\n<strong>Congruity of genomic and epidemiological data in modeling of local cholera outbreaks<\/strong><br \/>\nSubmitted [<a href=\"https:\/\/arxiv.org\/abs\/2210.01956\">ArXiv<\/a>]<\/p>\n<p><em>Short description: We use high-fidelity case count and whole genome sequencing data from the 1991-1998 cholera epidemic in Argentina, and show that consistency between the epidemiological model parameters estimated from both genetic and case-count data sources.<\/em><\/td>\n<\/tr>\n<tr>\n<td style=\"width: 910px\"><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2021\/04\/slicer.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-595\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2021\/04\/slicer-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2021\/04\/slicer-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2021\/04\/slicer.png 417w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/p>\n<p>Mateusz Wilinski, Andrey Y. Lokhov<br \/>\n<strong>Scalable Learning of Independent Cascade Dynamics from Partial Observations<\/strong><br \/>\n<a href=\"http:\/\/proceedings.mlr.press\/v139\/wilinski21a.html\">International Conference on Machine Learning (ICML 2021)<\/a> [<a href=\"https:\/\/arxiv.org\/abs\/2007.06557\">ArXiv<\/a>]<\/p>\n<p><em>Short description: Introducing a scalable algorithm SLICER that estimates parameters of the Independent Cascade model. In the context of learning for inference, tractable inference from the learned model generates a better prediction of marginal probabilities compared to the original model<\/em><\/td>\n<\/tr>\n<tr>\n<td style=\"width: 910px\"><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2020\/07\/influence_estimation.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-515\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2020\/07\/influence_estimation-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2020\/07\/influence_estimation-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2020\/07\/influence_estimation.png 417w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/p>\n<p>&nbsp;<\/p>\n<p>Andrey Y. Lokhov, David Saad<br \/>\n<strong>Scalable Influence Estimation Without Sampling<\/strong><br \/>\nSubmitted [<a href=\"https:\/\/arxiv.org\/abs\/1912.12749\">ArXiv<\/a>]<\/p>\n<p><em>Short description: Scalable dynamic message-passing algorithm for estimation of spread in the Independent Cascade type diffusion models<\/em><\/td>\n<\/tr>\n<tr>\n<td style=\"width: 910px\"><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2021\/04\/interacting_epidemics.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-594\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2021\/04\/interacting_epidemics-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2021\/04\/interacting_epidemics-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2021\/04\/interacting_epidemics.png 417w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/p>\n<p>Hanlin Sun, David Saad,\u00a0Andrey Y. Lokhov<br \/>\n<strong>Competition, Collaboration, and Optimization in Multiple Interacting Spreading Processes<\/strong><br \/>\n<a href=\"https:\/\/journals.aps.org\/prx\/abstract\/10.1103\/PhysRevX.11.011048\">Phys. Rev. X 11, 011048 (2021)<\/a>\u00a0[<a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2021\/04\/PhysRevX.11.011048.pdf\">pdf<\/a>] [<a href=\"https:\/\/arxiv.org\/abs\/1905.04416\">ArXiv<\/a>]<\/p>\n<p><em>Short description: Exact dynamic message-passing equations for estimation of marginal infection probabilities for collaborative and mutually exclusive epidemics, and their use for the optimal resource allocation problem<\/em><\/td>\n<\/tr>\n<tr>\n<td style=\"width: 910px\"><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/DMPopt-new1.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-335\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/DMPopt-new1-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/DMPopt-new1-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/DMPopt-new1.png 417w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/p>\n<p>&nbsp;<\/p>\n<p>Andrey Y. Lokhov, David Saad<br \/>\n<strong>Optimal deployment of resources for maximizing impact in spreading processes<\/strong><br \/>\n<a href=\"http:\/\/www.pnas.org\/content\/114\/39\/E8138\">Proceedings of the National Academy of Sciences, 114 (39) E8138-E8146 (2017)<\/a> [<a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/PNAS-2017-Lokhov-E8138-46.pdf\">pdf<\/a>] [<a href=\"https:\/\/arxiv.org\/abs\/1608.08278\">ArXiv<\/a>]<\/p>\n<p><em>Short description: Optimal targeting in spreading processes with\u00a0dynamic message-passing equations and forward-backward optimization method used in\u00a0artificial neural networks<\/em><\/td>\n<\/tr>\n<tr>\n<td style=\"width: 910px\"><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/DMPrec-2.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-240\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/DMPrec-2-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/DMPrec-2-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/DMPrec-2.png 694w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/p>\n<p>Andrey Y. Lokhov<br \/>\n<strong>Reconstructing parameters of spreading models from partial observations<em><br \/>\n<\/em><\/strong><a href=\"https:\/\/papers.nips.cc\/paper\/6129-reconstructing-parameters-of-spreading-models-from-partial-observations\">Advances in Neural Information Processing Systems (NIPS)\u00a02016<\/a> [<a href=\"https:\/\/papers.nips.cc\/paper\/6129-reconstructing-parameters-of-spreading-models-from-partial-observations.pdf\">pdf<\/a>] [<a href=\"http:\/\/arxiv.org\/abs\/1608.08698\">ArXiv<\/a>] [<a href=\"https:\/\/www.youtube.com\/watch?v=JjJFimWBHdw\">video<\/a>]<\/p>\n<p>Andrey Y. Lokhov,\u00a0Theodor Misiakiewicz<br \/>\n<strong>Efficient reconstruction of transmission probabilities in a spreading process from partial observations<br \/>\n<\/strong>Work in progress [<a href=\"http:\/\/arxiv.org\/abs\/1509.06893\">ArXiv<\/a>]<\/p>\n<p><em>Short description: Introducing a dynamic message-passing algorithm DMPrec for learning parameters of spreading models from partial observations\u00a0<\/em><\/td>\n<\/tr>\n<tr>\n<td style=\"width: 910px\"><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/DMPeqs-1.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-134\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/DMPeqs-1-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/DMPeqs-1-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/DMPeqs-1-1024x966.png 1024w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/DMPeqs-1.png 1389w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/p>\n<p>&nbsp;<\/p>\n<p>Andrey Y. Lokhov, Marc M\u00e9zard, Lenka Zdeborov\u00e1<br \/>\n<strong>Dynamic message-passing equations for models with unidirectional dynamics<\/strong><br \/>\n<a href=\"http:\/\/journals.aps.org\/pre\/abstract\/10.1103\/PhysRevE.91.012811\">Phys. Rev. E 91, 012811 (2015)<\/a> [<a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/Lokhov-M\u00e9zard-Zdeborov\u00e1-2015-Dynamic-message-passing-equations-for-models-with-unidirectional-dynamics.pdf\">pdf<\/a>] [<a href=\"http:\/\/arxiv.org\/abs\/1407.1255\">ArXiv<\/a>]<\/p>\n<p><em>Short description: Solution of many dynamic models (random field Ising model, epidemic and rumor spreading, threshold models) on given network instances<\/em><\/td>\n<\/tr>\n<tr>\n<td style=\"width: 910px\"><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/PatientZero-1.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-136\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/PatientZero-1-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/PatientZero-1-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/PatientZero-1-1024x966.png 1024w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/PatientZero-1.png 1389w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/p>\n<p>&nbsp;<\/p>\n<p>Andrey Y. Lokhov, Marc M\u00e9zard, Hiroki Ohta, Lenka Zdeborov\u00e1<br \/>\n<strong>Inferring the origin of an epidemic with a dynamic message-passing algorithm<\/strong><br \/>\n<a href=\"http:\/\/journals.aps.org\/pre\/abstract\/10.1103\/PhysRevE.90.012801\">Phys. Rev. E 90, 012801 (2014)<\/a>\u00a0 [<a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/Lokhov-et-al.-2014-Inferring-the-origin-of-an-epidemic-with-a-dynamic-message-passing-algorithm2.pdf\">pdf<\/a>] [<a href=\"https:\/\/arxiv.org\/abs\/1303.5315\">ArXiv<\/a>]<\/p>\n<p><em>Short description: Localization of the epidemic source from a partial snapshot at unknown time<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<h3>Quantum Computing<\/h3>\n<table style=\"height: 1360px\">\n<tbody>\n<tr>\n<td style=\"width: 906px\"><strong><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2022\/10\/advantage_optimization.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-649\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2022\/10\/advantage_optimization-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2022\/10\/advantage_optimization-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2022\/10\/advantage_optimization-768x725.png 768w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2022\/10\/advantage_optimization-1024x967.png 1024w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2022\/10\/advantage_optimization.png 1390w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/strong><\/p>\n<p>Byron Tasseff<em> et al.<\/em><strong><br \/>\nOn the Emerging Potential of Quantum Annealing Hardware for Combinatorial Optimization<\/strong><br \/>\nSubmitted [<a href=\"https:\/\/arxiv.org\/abs\/2210.04291\">ArXiv<\/a>]<\/p>\n<p><em>Short description: We demonstrate the existence of classes of contrived optimization problems where\u00a0<\/em><em>D-Wave Systems&#8217; most recent Advantage Performance Update quantum annealer provides run time benefits over a collection of established classical solution methods.<\/em><\/td>\n<\/tr>\n<tr>\n<td style=\"width: 906px\"><strong><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2022\/10\/single_qubit_hkill.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-651\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2022\/10\/single_qubit_hkill-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2022\/10\/single_qubit_hkill-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2022\/10\/single_qubit_hkill-768x725.png 768w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2022\/10\/single_qubit_hkill-1024x967.png 1024w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2022\/10\/single_qubit_hkill.png 1390w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/strong><\/p>\n<p>&nbsp;<\/p>\n<p>Zachary Morrell\u00a0<em>et al.<\/em><strong><br \/>\nSignatures of Open and Noisy Quantum Systems in Single-Qubit Quantum Annealing<br \/>\n<\/strong>Submitted\u00a0[<a href=\"https:\/\/arxiv.org\/abs\/2208.09068\">ArXiv<\/a>]<\/p>\n<p><em>Short description: This paper shows that both thermal and magnetic field fluctuations are key sources of noise that need to be included in an open quantum system model to reproduce the output statistics of the hardware.<\/em><\/td>\n<\/tr>\n<tr>\n<td style=\"width: 906px\"><strong><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2020\/07\/Quantum_Algorithm_Implementation.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-497\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2020\/07\/Quantum_Algorithm_Implementation-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2020\/07\/Quantum_Algorithm_Implementation-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2020\/07\/Quantum_Algorithm_Implementation.png 417w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/strong><\/p>\n<p>&nbsp;<\/p>\n<p>Abhijith J. <em>et al.<\/em><strong><br \/>\nQuantum Algorithm Implementations for Beginners<\/strong><br \/>\n<a href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3517340\">ACM Transactions on Quantum Computing, Volume 3, Issue 4, 18, pp. 1\u201392 (2022)<\/a> [<a href=\"https:\/\/arxiv.org\/abs\/1804.03719\">ArXiv<\/a>]<\/p>\n<p><em>Short description: An introduction to quantum computing algorithms and their implementation on IBM QX quantum computer<\/em><\/p>\n<p><strong>\u00a0<\/strong><\/p>\n<p><strong>\u00a0<\/strong><\/td>\n<\/tr>\n<tr>\n<td style=\"width: 906px\"><strong><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2022\/07\/vizualization-tomography.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-633\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2022\/07\/vizualization-tomography-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2022\/07\/vizualization-tomography-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2022\/07\/vizualization-tomography.png 417w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/strong><\/p>\n<p>&nbsp;<\/p>\n<p>Adrien Suau, Marc Vuffray, Andrey Y. Lokhov, Lukasz Cincio, Carleton Coffrin<strong><br \/>\nVector Field Visualization of Single-Qubit State Tomography<\/strong><br \/>\nAccepted to\u00a0IEEE QCE 2022\u00a0[<a href=\"https:\/\/arxiv.org\/abs\/2205.02483\">ArXiv<\/a>]<\/p>\n<p><em>Short description:\u00a0Developing a vector field visualization for\u00a0<\/em><em>quantum state tomography characterization of individual qubits, and demonstration of qubit performance features in IBM quantum computing hardware.<\/em><\/td>\n<\/tr>\n<tr style=\"height: 272px\">\n<td style=\"height: 272px;width: 906px\"><strong><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2022\/07\/quantum_annealing.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-629\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2022\/07\/quantum_annealing-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2022\/07\/quantum_annealing-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2022\/07\/quantum_annealing.png 417w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/strong><\/p>\n<p>&nbsp;<\/p>\n<p>Jon Nelson, Marc Vuffray, Andrey Y. Lokhov, Tameem Albash, and Carleton Coffrin<strong><br \/>\n<\/strong><strong>High-Quality Thermal Gibbs Sampling with Quantum Annealing Hardware<br \/>\n<\/strong><a href=\"https:\/\/journals.aps.org\/prapplied\/abstract\/10.1103\/PhysRevApplied.17.044046\">Phys. Rev. Applied 17, 044046 (2022)<\/a> [<a href=\"https:\/\/arxiv.org\/abs\/2109.01690\">ArXiv<\/a>]<strong><br \/>\n<\/strong><\/p>\n<p><em>Short description: Introducing a procedure for producing high-quality samples from quantum annealing hardware<\/em><\/td>\n<\/tr>\n<tr style=\"height: 272px\">\n<td style=\"height: 272px;width: 906px\"><strong><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/Opening_quantum_box.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-333\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/Opening_quantum_box-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/Opening_quantum_box-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/Opening_quantum_box.png 417w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/strong><\/p>\n<p>&nbsp;<\/p>\n<p>Marc Vuffray, Carleton Coffrin, Yaroslav Kharkov, Andrey Y. Lokhov<strong><br \/>\nProgrammable Quantum Annealers as Noisy Gibbs Samplers<br \/>\n<\/strong><a href=\"https:\/\/journals.aps.org\/prxquantum\/abstract\/10.1103\/PRXQuantum.3.020317\">PRX Quantum 3, 020317 (2022)<\/a> [<a href=\"https:\/\/arxiv.org\/abs\/2012.08827\">ArXiv<\/a>]<strong><br \/>\n<\/strong><\/p>\n<p><em>Short description: Characterization of quantum annealers&#8217; sampling properties using statistical learning methods, including unexpected spurious interactions in the output distribution due to qubit noise<\/em><\/td>\n<\/tr>\n<tr style=\"height: 272px\">\n<td style=\"height: 272px;width: 906px\"><strong><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2021\/04\/fidelity.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-592\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2021\/04\/fidelity-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2021\/04\/fidelity-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2021\/04\/fidelity.png 417w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/strong><\/p>\n<p>Jon Nelson, Marc Vuffray, Andrey Y. Lokhov, Carleton Coffrin<strong><br \/>\nSingle-Qubit Fidelity Assessment of Quantum Annealing Hardware<br \/>\n<\/strong><a href=\"https:\/\/ieeexplore.ieee.org\/document\/9465651\">IEEE Transactions on Quantum Engineering, 2, 1-10 (2021)<\/a> [<a href=\"https:\/\/arxiv.org\/abs\/2104.03335\">ArXiv<\/a>]<strong><br \/>\n<\/strong><\/p>\n<p>Adrien Suau <em>et al.<\/em><br \/>\n<strong>Single-Qubit Cross Platform Comparison of Quantum Computing Hardware<\/strong><br \/>\nSubmitted [<a href=\"http:\/\/arxiv.org\/abs\/2108.11334\">ArXiv<\/a>]<\/p>\n<p><em>Short description: Quantifying the error performance of individual qubits in quantum annealing and gate quantum computers<\/em><\/p>\n<p><strong>\u00a0<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 272px\">\n<td style=\"height: 272px;width: 906px\"><strong><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2020\/07\/quantum_annealing_structure_identification.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-517\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2020\/07\/quantum_annealing_structure_identification-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2020\/07\/quantum_annealing_structure_identification-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2020\/07\/quantum_annealing_structure_identification.png 417w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/strong><\/p>\n<p><strong><br \/>\nThe Potential of Quantum Annealing for Rapid Solution Structure Identification<br \/>\n<\/strong>Yuchen Pang, Carleton Coffrin, Andrey Y. Lokhov, Marc Vuffray<br \/>\n<a href=\"https:\/\/link.springer.com\/article\/10.1007\/s10601-020-09315-0\">Constraints (2020)<\/a> [<a href=\"https:\/\/arxiv.org\/abs\/1912.01759\">ArXiv<\/a>]<br \/>\nPresented at\u00a0<a href=\"https:\/\/cpaior2020.dbai.tuwien.ac.at\/\">CPAIOR 2020<\/a><\/p>\n<p><em>Short description: Identification of a hard instance of an optimization problem where quantum annealing provides notable performance gains over established classical algorithms<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<h3>Dynamical Systems, Power Grid, and Cyber-Physical Systems<\/h3>\n<table style=\"height: 1096px\">\n<tbody>\n<tr style=\"height: 272px\">\n<td style=\"height: 272px;width: 891px\">\n<p style=\"text-align: left\"><strong><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/Anomaly-detection-1.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-220\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/Anomaly-detection-1-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/Anomaly-detection-1-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/Anomaly-detection-1.png 694w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/strong><\/p>\n<p>&nbsp;<\/p>\n<p>Zheguang Zhao, Deepjyoti Deka, Andrey Y. Lokhov<br \/>\n<strong>Learning of Cyber-Physical Systems<br \/>\n<\/strong>Work in progress<strong><br \/>\n<\/strong><\/p>\n<p style=\"text-align: left\"><em>Short description:\u00a0Learning of an effective cyber-physical model from discrete and continuous time series of physical and control processes<\/em><\/p>\n<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 891px\">\n<p style=\"text-align: left\"><strong><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2020\/09\/coarse-graining.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-543\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2020\/09\/coarse-graining-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2020\/09\/coarse-graining-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2020\/09\/coarse-graining.png 417w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/strong><\/p>\n<p>&nbsp;<\/p>\n<p>Jordan Snyder, Anatoly Zlotnik, Andrey Y. Lokhov<br \/>\n<strong>Data-driven Selection of Coarse-Grained Models of Coupled Oscillators<br \/>\n<\/strong><a href=\"https:\/\/journals.aps.org\/prresearch\/abstract\/10.1103\/PhysRevResearch.2.043402\">Phys. Rev. Research 2, 043402 (2020)<\/a>\u00a0[<a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2020\/12\/PhysRevResearch.2.043402.pdf\">pdf<\/a>] [<a href=\"https:\/\/arxiv.org\/abs\/2009.10107\">ArXiv<\/a>]<strong><br \/>\n<\/strong><\/p>\n<p style=\"text-align: left\"><em>Short description: Learning of macroscopic reduced-order models in systems of coupled oscillators from coarse-grained microscopic data<\/em><\/p>\n<p style=\"text-align: left\"><strong>\u00a0<\/strong><\/p>\n<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 891px\"><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2020\/07\/traffic_congestion.png\"><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-510 alignleft\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2020\/07\/traffic_congestion-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2020\/07\/traffic_congestion-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2020\/07\/traffic_congestion.png 417w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/p>\n<p>&nbsp;<\/p>\n<p>Bo Li, David Saad,\u00a0Andrey Y. Lokhov<br \/>\n<strong style=\"font-family: inherit;font-size: inherit\">Reducing Urban Traffic Congestion Due To Localized Routing Decisions<br \/>\n<\/strong><span style=\"font-family: inherit;font-size: inherit\"><a href=\"https:\/\/journals.aps.org\/prresearch\/abstract\/10.1103\/PhysRevResearch.2.032059\">Phys. Rev. Research 2, 032059(R) (2020)<\/a> [<a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2020\/09\/PhysRevResearch.2.032059.pdf\">pdf<\/a>] [<\/span><a style=\"font-family: inherit;font-size: inherit\" href=\"https:\/\/arxiv.org\/abs\/2002.10298\">ArXiv<\/a><span style=\"font-family: inherit;font-size: inherit\">]<\/span><\/p>\n<p><em>Short description: Discovery of paradoxical traffic patterns emerging within a new traffic model that includes\u00a0<\/em><em>localized routing inducement, and development of a scalable optimization algorithm for identifying mechanisms to minimize congestion<\/em><\/p>\n<p style=\"text-align: left\"><strong>\u00a0<\/strong><\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 272px\">\n<td style=\"height: 272px;width: 891px\">\n<p style=\"text-align: left\"><strong><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2020\/07\/real_time_anomaly_detection.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-520\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2020\/07\/real_time_anomaly_detection-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2020\/07\/real_time_anomaly_detection-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2020\/07\/real_time_anomaly_detection.png 417w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/strong><\/p>\n<p>&nbsp;<\/p>\n<p>Christopher Hannon, Deepjyoti Deka, Dong Jin, Marc Vuffray, Andrey Y. Lokhov<br \/>\n<strong>Real-time Anomaly Detection and Classification in Streaming PMU Data<br \/>\n<\/strong><a href=\"https:\/\/ieeexplore.ieee.org\/document\/9494800\">IEEE PowerTech 2021<\/a> [<a href=\"https:\/\/arxiv.org\/abs\/1911.06316\">ArXiv<\/a>]<br \/>\nPresented in a demo track of <a href=\"https:\/\/nips.cc\/Conferences\/2019\/\">NeurIPS 2019<\/a><\/p>\n<p style=\"text-align: left\"><em>Short description: Anomaly detection and classification in streaming phasor measurement units data via real-time learning of effective dynamical model<\/em><\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 264px\">\n<td style=\"height: 264px;width: 891px\"><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/Transmission_learning.png\"><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-322 alignleft\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/Transmission_learning-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/Transmission_learning-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/Transmission_learning.png 462w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a>Andrey Y. Lokhov, Marc Vuffray, Dmitry Shemetov, Deepjyoti Deka, Michael Chertkov<br \/>\n<strong>Online Learning of Power Transmission Dynamics<\/strong><br \/>\n<a href=\"https:\/\/ieeexplore.ieee.org\/document\/8442720\">PSCC 2018<\/a> [<a href=\"https:\/\/arxiv.org\/abs\/1710.10021\">ArXiv<\/a>]Andrey Y. Lokhov, Deepjyoti Deka, Marc Vuffray, Michael Chertkov<br \/>\n<strong>Uncovering Power Transmission Dynamic Model from Incomplete PMU Observations<br \/>\n<\/strong><a href=\"https:\/\/ieeexplore.ieee.org\/abstract\/document\/8619606\">CDC 2018<\/a>Deepjyoti Deka, Armin Zare,\u00a0 Andrey Y. Lokhov, Mihailo Jovanovic, Michael Chertkov<br \/>\n<strong>Estimation of state and noise covariance in power grids using limited nodal PMUs<br \/>\n<\/strong><a href=\"https:\/\/2017.ieeeglobalsip.org\/\">IEEE Global Conference on Signal and Information Processing (2017)<\/a> [<a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/IEEE_GlobalSIP.pdf\">pdf<\/a>]<\/td>\n<\/tr>\n<tr style=\"height: 288px\">\n<td style=\"height: 288px;width: 891px\"><a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/CyberPhysical-1.png\"><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-132 alignleft\" src=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/CyberPhysical-1-300x283.png\" alt=\"\" width=\"255\" height=\"241\" srcset=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/CyberPhysical-1-300x283.png 300w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/CyberPhysical-1-1024x966.png 1024w, http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/files\/2013\/12\/CyberPhysical-1.png 1389w\" sizes=\"auto, (max-width: 255px) 100vw, 255px\" \/><\/a><\/p>\n<p>&nbsp;<\/p>\n<p>Andrey Y. Lokhov, Nathan Lemons, Thomas C. McAndrew, Aric Hagberg, Scott Backhaus<br \/>\n<strong>Detection of cyber-physical faults and intrusions from physical correlations<em><br \/>\n<\/em><\/strong><a href=\"http:\/\/ieeexplore.ieee.org\/document\/7836681\/\">IEEE 16th International Conference on Data Mining Workshops (ICDMW),\u00a0303-310 (2016)<\/a><br \/>\n[<a href=\"http:\/\/lptms.u-psud.fr\/andrey-lokhov\/files\/2013\/12\/ICDMW_Lokhov.pdf\">pdf<\/a>] [<a href=\"http:\/\/arxiv.org\/abs\/1602.06604\">ArXiv<\/a>]<br \/>\nPresented at &#8220;Outlier Definition, Detection, and Description on Demand&#8221; <a href=\"http:\/\/outlier-analytics.org\/odd16kdd\/\">workshop<\/a> at KDD 2016<\/p>\n<p><em>Short description: Detection of anomalies in cyber-physical systems from real data<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<h3><\/h3>\n","protected":false},"excerpt":{"rendered":"<p>Statistical Learning and Graphical Models &nbsp; Christopher X. Ren, Sidhant Misra, Marc Vuffray, Andrey Y. Lokhov Learning Continuous Exponential Families Beyond Gaussian Submitted [ArXiv] Short description: Introducing a new estimator ISODUS for\u00a0continuous non-Gaussian exponential family distributions with unbounded support and &hellip; <a href=\"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/research\/\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":28,"featured_media":0,"parent":0,"menu_order":1,"comment_status":"closed","ping_status":"open","template":"","meta":{"footnotes":""},"class_list":["post-37","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/wp-json\/wp\/v2\/pages\/37","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/wp-json\/wp\/v2\/users\/28"}],"replies":[{"embeddable":true,"href":"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/wp-json\/wp\/v2\/comments?post=37"}],"version-history":[{"count":245,"href":"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/wp-json\/wp\/v2\/pages\/37\/revisions"}],"predecessor-version":[{"id":682,"href":"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/wp-json\/wp\/v2\/pages\/37\/revisions\/682"}],"wp:attachment":[{"href":"http:\/\/www.lptms.universite-paris-saclay.fr\/andrey-lokhov\/wp-json\/wp\/v2\/media?parent=37"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}