NDLI: Exploiting symmetries for scaling loopy belief propagation and relational training

Content Provider	Springer Nature Link
Author	Ahmadi, Babak Kersting, Kristian Mladev, Martin Natarajan, Sriraam
Copyright Year	2013
Abstract	Judging by the increasing impact of machine learning on large-scale data analysis in the last decade, one can anticipate a substantial growth in diversity of the machine learning applications for “big data” over the next decade. This exciting new opportunity, however, also raises many challenges. One of them is scaling inference within and training of graphical models. Typical ways to address this scaling issue are inference by approximate message passing, stochastic gradients, and MapReduce, among others. Often, we encounter inference and training problems with symmetries and redundancies in the graph structure. A prominent example are relational models that capture complexity. Exploiting these symmetries, however, has not been considered for scaling yet. In this paper, we show that inference and training can indeed benefit from exploiting symmetries. Specifically, we show that (loopy) belief propagation (BP) can be lifted. That is, a model is compressed by grouping nodes together that send and receive identical messages so that a modified BP running on the lifted graph yields the same marginals as BP on the original one, but often in a fraction of time. By establishing a link between lifting and radix sort, we show that lifting is MapReduce-able. Still, in many if not most situations training relational models will not benefit from this (scalable) lifting: symmetries within models easily break since variables become correlated by virtue of depending asymmetrically on evidence. An appealing idea for such situations is to train and recombine local models. This breaks long-range dependencies and allows to exploit lifting within and across the local training tasks. Moreover, it naturally paves the way for the first scalable lifted training approaches based on stochastic gradients, both in an online and a MapReduced fashion. On several datasets, the online training, for instance, converges to the same quality solution over an order of magnitude faster, simply because it starts optimizing long before having seen the entire mega-example even once.
Starting Page	91
Ending Page	132
Page Count	42
File Format	PDF
ISSN	08856125
Journal	Machine Learning
Volume Number	92
Issue Number	1
e-ISSN	15730565
Language	English
Publisher	Springer US
Publisher Date	2013-05-30
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Statistical relational learning Lifted inference Lifted online training MapReduce Artificial Intelligence (incl. Robotics) Control, Robotics, Mechatronics Computing Methodologies Simulation and Modeling Language Translation and Linguistics
Content Type	Text
Resource Type	Article
Subject	Artificial Intelligence Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Exploiting symmetries for scaling loopy belief propagation and relational training

Lifted generative learning of Markov logic networks

Lifted graphical models: a survey

Piecewise training for structured prediction

Data and task parallelism in ILP using MapReduce

Stochastic relational processes: Efficient inference and applications

Improving probabilistic inference in graphical models with determinism and cycles

Online Bayesian inference for the parameters of PRISM programs

Fast learning of relational kernels

Exploiting symmetries for scaling loopy belief propagation and relational training

Similar Documents

Exploiting symmetries for scaling loopy belief propagation and relational training

Lifted generative learning of Markov logic networks

Lifted graphical models: a survey

Piecewise training for structured prediction

Data and task parallelism in ILP using MapReduce

Stochastic relational processes: Efficient inference and applications

Improving probabilistic inference in graphical models with determinism and cycles

Online Bayesian inference for the parameters of PRISM programs

Fast learning of relational kernels

Exploiting symmetries for scaling loopy belief propagation and relational training