Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 19 of 19 for “"Message passing algorithms"”.
-
Scalable collective message-passing algorithms
… has far better time and space scaling than known algorithms. Our evaluations predict an improvement of up to 60x for large exascale systems and arbitrary reduction in the large temporary buffer space required for generating new communicators. Our second contribution consists of several novel …
-
Message passing algorithms - methods and applications
Algorithms on graphs are used extensively in many applications and research areas. Such applications include machine learning, artificial intelligence, communications, image processing, state tracking, sensor networks, sensor fusion, distributed cooperative estimation, and distributed computation. …
-
Message-passing algorithms and analog electronic circuits
ISSN:1616-671X
-
Message Passing Algorithms for Statistical Estimation and Communication
… based on belief propagation (BP) and Approximate Message Passing (AMP), are developed for these problems. We first consider matrix sketching, where the goal is to recover an *n*<sub>1</sub> x *n*<sub>2</sub> low-rank matrix with *k*-sparse singular vectors from a small number of linear …
-
Graphical models and message-passing algorithms for network-constrained decision problems
… developing efficient inference methods, such as message-passing algorithms that exploit the conditional independencies encoded by the given graph. Conceptually, this framework extends naturally to a distributed network setting: by associating to each node and edge in the graph a distinct sensor …
-
Performance Engineering of Directional Message-Passing Algorithms Through a Stencil-Based Approach for Applications in Molecular Dynamics
… however, rely on inefficient directional message-passing algorithms on graph neural networks. This thesis presents a novel approach for the optimization of these algorithms using a stencil-like technique. The stencil-based algorithm, called StencilMD, provides both the benefits of …
-
Efficient Multi-Target Tracking using graphical models
… a new framework for Multi-Target Tracking (MTT) algorithms that are distinguished by the use of statistical machine learning techniques. MTT is a crucial problem for many important practical applications such as military surveillance. Despite being a well-studied research problem, MTT remains …
-
A model-adaptive universal data compression architecture with applications to image compression
… encoding and probabilistic graphical models and message-passing algorithms for decoding. We implement a lossless bi-level image data compressor as well as a lossy greyscale image compressor and explain how these compressors can rapidly adapt to changes in source models. We then show using these …
-
Computational Hardness in Random Optimization Problems from the Overlap Gap Property
We study the limits of efficient algorithms in random optimization problems. In these problems, we are given a random objective function and our goal is to find an input achieving a large output. These problems often exhibit information-computation gaps, where the maximum objective that exists is …
-
Massively parallel message passing on a GPU for graphical model inference
… challenging. For more effective inference, message passing algorithms that expose significant parallelism have been implemented to exploit graphics processing units (GPUs), albeit often tackling specific graphical model structures such as directed acyclic graphs (DAGs), grids, uniform state …
-
Approximate inference in graphical models using LP relaxations
… on linear programming (LP) relaxations. Our algorithms optimize over the cycle relaxation of the marginal polytope, which we show to be closely related to the first lifting of the Sherali-Adams hierarchy, and is significantly tighter than the pairwise LP relaxation. We show how to efficiently …
-
Analogic for code estimation and detection
… by locally propagating probabilities in a message-passing algorithm [29] [15]. In this thesis, we study an exemplary embodiment of analogic called Noise-Locked Loop(NLL) which is a pseudo-random code estimation system. The previous work shows NLL can perform direct-sequence spread-spectrum …
-
Sparse graph codes for compression, sensing, and secrecy
… codes with low complexity encoding and decoding algorithms have been designed for many channels. Motivated by the success of sparse graph codes for channel coding, we explore the use of sparse graph codes for four other problems related to compression, sensing, and security. First, we construct …
-
Distributed averaging in dynamic networks
… network in a distributed manner using gossip or message-passing algorithms has been of great recent interest across disciplines -- algorithms, control and robotics, estimation, social networks, etc. It has served as a non-trivial, representative model for an important class of questions arising …
-
Constrained Information Exchange Message Passing Algorithm in Probabilistic Graphical Models
… all cellular wireless systems run on these days. Message passing algorithms exploit the independence and factorization structure within these graphical models to develop analytically tractable, computationally efficient, and exact inference algorithms. Posterior inference using message-passing …
-
Approximate Inference: New Visions
… such as ImageNet. In this thesis we develop new algorithms towards addressing the open challenges in approximate inference. In the first part of the thesis we develop two new approximate inference algorithms, by drawing inspiration from the well known expectation propagation and message passing …
-
Spatial Coupling for High-Dimensional Estimation
… reconstruction performance with efficient algorithms for a variety of inference problems. For many high-dimensional regression models with unstructured designs, the Bayes-optimal estimator is computa- tionally intractable. The main idea in spatial coupling is to chain simple, unstructured …
-
Model-code separation architectures for compression based on message-passing
… compression, based on a core set of iterative message-passing algorithms over graphical models representing the modeling and coding aspects of compression. Systems following this architecture resolve the challenges posed by current systems, and stand to benefit further from future advances in …