Concept

Graphical model

Related publications (147)

Model-checking intends to verify whether a property is satisfied by a model, or not. Model-checking of high-level models, e.g. SysML models, usually first requires a model transformation to a low level formal specification. The present papers proposes a ne ...

SCITEPRESS2021

We study the stability of low-density parity-check codes under blockwise or bitwise maximum a posteriori decoding, where transmission takes place over a binary-input memoryless output-symmetric channel. Our study stems from the consideration of constructin ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

A Graphical Description of Partial Exchangeability

Mats Julius Stensrud, Aaron Leor Sarvet

Partial exchangeability is sufficient for the identification of some causal effects of interest. Here we review the use of common graphical tools and the sufficient component cause model in the context of partial exchangeability. We illustrate the utility ...

2020

Distributed Coupled Multiagent Stochastic Optimization

Ali H. Sayed, Sulaiman A S A E Alghunaim

This paper develops an effective distributed strategy for the solution of constrained multiagent stochastic optimization problems with coupled parameters across the agents. In this formulation, each agent is influenced by only a subset of the entries of a ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

On the Universality of Low-Density Parity-Check Block Codes

Rüdiger Urbanke, Wei Liu

An important class of modern channel codes is the capacity-achieving sequences of low-density parity-check block codes. Such sequences are usually designed for the binary erasure channel and are decoded by iterative message-passing algorithms. In this pape ...

IEEE2020

RobustBench: a standardized adversarial robustness benchmark

Nicolas Henri Bernard Flammarion, Maksym Andriushchenko, Francesco Croce

Evaluation of adversarial robustness is often error-prone leading to overestimation of the true robustness of models. While adaptive attacks designed for a particular defense are a way out of this, there are only approximate guidelines on how to perform th ...

2020

Pairwise Comparisons with Flexible Time-Dynamics

Matthias Grossglauser, Lucas Maystre, Victor Kristof

Inspired by applications in sports where the skill of players or teams competing against each other varies over time, we propose a probabilistic model of pairwise-comparison outcomes that can capture a wide range of time dynamics. We achieve this by replac ...

ASSOC COMPUTING MACHINERY2019

Deep Unfolding for Communications Systems: A Survey and Some New Directions

Alexios Konstantinos Balatsoukas Stimming, Christoph Studer

Deep unfolding is a method of growing popularity that fuses iterative optimization algorithms with tools from neural networks to efficiently solve a range of tasks in machine learning, signal and image processing, and communication systems. This survey sum ...

IEEE2019

Scalable Learning-Based Sampling Optimization for Compressive Dynamic MRI

Volkan Cevher, Ruud van Heeswijk, Baran Gözcü, Thomas Sanchez

Slow acquisition has been one of the historical problems in dynamic magnetic resonance imaging (dMRI), but the rise of compressed sensing (CS) has brought numerous algorithms that successfully achieve high acceleration rates. While CS proposes random sampl ...

2019

, , ,

Conceptual models such as database schemas, ontologies or process models have been established as a means for effective engineering of information systems. Yet, for complex systems, conceptual models are created by a variety of stakeholders, which calls fo ...

2019

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.