37,061 Hits in 2.7 sec

Lifted Junction Tree Algorithm [chapter]

Tanya Braun, Ralf Möller
2016 Lecture Notes in Computer Science  
In these formalisms, the standard approach for inference is lifted variable elimination.  ...  When querying for multiple marginals, the lifted junction tree algorithm performs better than using lifted VE to infer each marginal individually.  ...  We initialize the accumulated counts with the number of calls to lifted VE operators during message passing for FOJT.  ... 
doi:10.1007/978-3-319-46073-4_3 fatcat:23fr464wizhwzjdmqv4bkyyrjq

Fusing First-order Knowledge Compilation and the Lifted Junction Tree Algorithm [article]

Tanya Braun, Ralf Möller
2018 arXiv   pre-print
Standard approaches for inference in probabilistic formalisms with first-order constructs include lifted variable elimination (LVE) for single queries as well as first-order knowledge compilation (FOKC  ...  For certain inputs, the implementations of LVE and, as a result, LJT ground parts of a model where FOKC has a lifted run.  ...  We currently work on incorporating FOKC into message passing for cases where an problematic elimination occurs during message calculation, which includes adapting an FO jtree accordingly.  ... 
arXiv:1807.00743v1 fatcat:lxif7pkicrcv5k6lt4aisu4d4i

Analyzing the Redesign of a Distributed Lift System in UPPAAL [chapter]

Jun Pang, Bart Karstens, Wan Fokkink
2003 Lecture Notes in Computer Science  
An existing distributed lift system was analyzed using the process algebraic language µCRL [7].  ...  The analysis in [7] revealed the reasons for those problems, and proposed solutions. In this paper, we checked the developers' solutions using Uppaal.  ...  Acknowledgments We thank the developers of the lift systems for their collaboration and fruitful discussions. We thank the anonymous referees for their useful comments.  ... 
doi:10.1007/978-3-540-39893-6_29 fatcat:nej5ayajtbabfb6t25mcotb5va

Preventing Unnecessary Groundings in the Lifted Dynamic Junction Tree Algorithm [article]

Marcel Gehrke, Tanya Braun, Ralf Möller
2018 arXiv   pre-print
Unfortunately, a non-ideal elimination order can lead to groundings even though a lifted run is possible for a model.  ...  The lifted dynamic junction tree algorithm (LDJT) efficiently answers filtering and prediction queries for probabilistic relational temporal models by building and then reusing a first-order cluster representation  ...  Other interesting future work includes a tailored automatic learning for PDMs, parallelisation of LJT, and improved evidence entering.  ... 
arXiv:1807.00744v1 fatcat:zzfkosrhfjenhmycbivkss2tpm

Design of high-rate irregular non-binary LDPC codes using algorithmic stopping-set cancellation

Sudarsan V. S. Ranganathan, Dariush Divsalar, Kasra Vakilinia, Richard D. Wesel
2014 2014 IEEE International Symposium on Information Theory  
The design procedure first identifies all stopping sets up to weight five in an LDPC code and enumerates them via a message passing algorithm.  ...  Simulation results for codes designed through this procedure show a significant improvement in the error-floor region over randomized labeling.  ...  Then a message-passing procedure is run once for each check node as a potential origin node O.  ... 
doi:10.1109/isit.2014.6874925 dblp:conf/isit/RanganathanDVW14 fatcat:u4dsacyclbhkjhf2zofd7urqcq

Scaling Lifted Probabilistic Inference and Learning Via Graph Databases

Mayukh Das, Yuqing Wu, Tushar Khot, Kristian Kersting, Sriraam Natarajan
2016 Proceedings of the 2016 SIAM International Conference on Data Mining  
One of the key operations inside these lifted approaches is counting -be it for parameter/structure learning or for efficient inference.  ...  This paper investigates whether 'Compilation to Graph Databases' could be a practical technique for scaling lifted probabilistic inference and learning methods.  ...  Finally another message µ pr3 a2→a4 is passed from a2 to a4 as shown in figure 5 (c). The message is as shown below: (3.5) µ pr3 a2→a4 = Out pr3 (C) Θ(a4) .  ... 
doi:10.1137/1.9781611974348.83 dblp:conf/sdm/DasWKKN16 fatcat:6ng7pbllvva2vh3b2fcuqfeaaa

Preventing Groundings and Handling Evidence in the Lifted Junction Tree Algorithm [chapter]

Tanya Braun, Ralf Möller
2017 Lecture Notes in Computer Science  
For inference in probabilistic formalisms with first-order constructs, lifted variable elimination (LVE) is one of the standard approaches for single queries.  ...  We extend LJT (i) to identify and prevent unnecessary groundings and (ii) to effectively handle evidence in a lifted manner.  ...  Message passing starts after lifted absorption.  ... 
doi:10.1007/978-3-319-67190-1_7 fatcat:zsl4aiw44vb5rdijznbnrlozpm

Page 173 of The Electrical Review Vol. 46, Issue 1158 [page]

1900 The Electrical Review  
Quick, acting as defendent’s consulting engineer, for a year or a year and a half acted as the London agent for witness’s firm, but they were not satisfied with the volume of business, and gave notice  ...  There were a number of trials of the lift, and it worked satisfactorily. Witness was present at defendant’s trial on November 15th, and Brinsmead appeared satisfied and accepted the lift.  ... 

Page 431 of The Bibliotheca Sacra Vol. 67, Issue 267 [page]

1910 The Bibliotheca Sacra  
The church is not without its godly laymen, who have been feeding their souls with it, and their message to hungry humanity will be the satisfying food of the soul.  ...  know better than the speaker, and perform¬ ances to please and entertain for the hour only, and forgotten as we pass over the threshold, or remembered only for the talents and accomplishments and oratory  ... 

Multiple Access Demodulation in the Lifted Signal Graph with Spatial Coupling [article]

Christian Schlegel, Dmitri Truhachev
2011 arXiv   pre-print
However, the maximal system load of this lifted graph is limited to \alpha<2.07, even for signal-to-noise ratios going to infinity - the system is interference limited.  ...  We then show that by introducing spatial coupling between subsequent lifted graphs, and anchoring the initial graphs, this limitation can be avoided and arbitrary system loads are achievable.  ...  BELIEF PROPAGATION MESSAGE PASSING Message passing in the lifted graph is carried out in the usual way.  ... 
arXiv:1107.4797v1 fatcat:il335rizhbfeteq4gziuc3g52i

Partition Consistency: A Case Study in Modeling Systems with Weak Memory Consistency and Proving Correctness of their Implementations [article]

Steven Cheng, Lisa Higham, Jalal Kawash
2013 arXiv   pre-print
A concrete message-passing network model is also specified. Implementations of partition consistency on this network model are then presented and proved correct.  ...  The paper aims to illustrate a general methodology and techniques for specifying memory consistency models and proving the correctness of their implementations.  ...  message passing.  ... 
arXiv:1306.0077v1 fatcat:b3fr4schpfc3vcxakpcjb65fqa

Construction of Near-Capacity Protograph LDPC Code Sequences With Block-Error Thresholds

Asit Kumar Pradhan, Andrew Thangaraj, Arunkumar Subramanian
2016 IEEE Transactions on Communications  
Density evolution for protograph Low-Density Parity-Check (LDPC) codes is considered, and it is shown that the message-error rate falls double-exponentially with iterations whenever the degree-2 subgraph  ...  Conditions for stability of protograph density evolution are established and related to the structure of the protograph.  ...  The standard message-passing decoder uses the log-likelihood ratio (LLR) l 0 = log p(y|+1) p(y|−1) as input, and the message passed from a bit node to a check node in iteration t is an LLR l t for the  ... 
doi:10.1109/tcomm.2015.2500234 fatcat:jgp3p2qjc5fihmq26ltsyskrae

Exploiting symmetries for scaling loopy belief propagation and relational training

Babak Ahmadi, Kristian Kersting, Martin Mladenov, Sriraam Natarajan
2013 Machine Learning  
Actually, statistical learning is unthinkable for many practical applications without techniques such as inference by approximate message passing, stochastic gradients, and MapReduce, among others.  ...  Typical ways to address this scaling issue are inference by approximate message passing, stochastic gradients, and MapReduce, among others.  ...  Thanks to Roman Garnett, Fabian Hadiji and Mirwaes Wahabzada for helpful discussion on map-reduce, and Tushar Khot for kindly providing the Wumpus dataset.  ... 
doi:10.1007/s10994-013-5385-0 fatcat:tzyy7cagjzhhxccvsw6smdjsom

Page 19 of Juvenile & Family Court Journal Vol. 2, Issue 5 [page]

1951 Juvenile & Family Court Journal  
Will you be one to give a lift helping children to enjoy a better life, or will you, passing on, let the chil- dren languish by the wayside?  ...  Fees you may not like to accept for yourself could be directed tactfully to the Foundation, thus satisfying the givers and support- ing the cause of children.  ... 

Efficient message passing scheduling for terminated LDPC convolutional codes

Michael Lentmaier, Maria Mellado Prenda, Gerhard P. Fettweis
2011 2011 IEEE International Symposium on Information Theory Proceedings  
Message passing schedules that reduce the decoding complexity of terminated LDPC convolutional code ensembles are analyzed.  ...  The results of the analysis together with computer simulations for some (3,6)-regular codes confirm that sliding window decoding is an attractive practical solution for low-latency and low-complexity decoding  ...  of iterations It for symbols at time instants t = 1, . . . , L, for different message passing schedules.  ... 
doi:10.1109/isit.2011.6033865 dblp:conf/isit/LentmaierPF11 fatcat:hijgf3hjofetpnofz522k6mihi
« Previous Showing results 1 — 15 out of 37,061 results