Mutual Information and Optimality of Approximate Message-Passing in Random Linear Estimation

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.

In this paper, we present an exact (i. e. non-approximated) and linear measurement model for hybrid AC/DC microgrids for recursive state estimation (SE). More specifically, an exact linear model of a voltage source converter (VSC) is proposed. It relies on ...

Local modifications of a computational domain are often performed in order to simplify the meshing process and to reduce computational costs and memory requirements. However, removing geometrical features of a domain often introduces a non-negligible error ...

Activity-based models offer the potential of a far deeper understanding of daily mobility behaviour than trip-based models. However, activity-based models used both in research and practice have often relied on applying sequential choice models between sub ...

For people with limited mobility, navigating in cluttered indoor environment is challenging. In this work, we propose a mobile assistive furniture suite that is designed to ease the life of people with special needs in indoor movement. To enable intelligen ...

We present a framework for performing regression when both covariate and response are probability distributions on a compact and convex subset of

\R^d

. Our regression model is based on the theory of optimal transport and links the conditional Fr'echet m ...

We study the problem of estimating an unknown function from noisy data using shallow ReLU neural networks. The estimators we study minimize the sum of squared data-fitting errors plus a regularization term proportional to the squared Euclidean norm of the ...

Is it possible to detect if the sample paths of a stochastic process almost surely admit a finite expansion with respect to some/any basis? The determination is to be made on the basis of a finite collection of discretely/noisily observed sample paths. We ...

We introduce the elliptical Ornstein-Uhlenbeck (OU) process, which is a generalisation of the well-known univariate OU process to bivariate time series. This process maps out elliptical stochastic oscillations over time in the complex plane, which are obse ...

A kernel method for estimating a probability density function from an independent and identically distributed sample drawn from such density is presented. Our estimator is a linear combination of kernel functions, the coefficients of which are determined b ...

Mutual Information and Optimality of Approximate Message-Passing in Random Linear Estimation

Chat with Graph Search

Linear Recursive State Estimation of Hybrid and Unbalanced AC/DC Micro-Grids using Synchronized Measurements

Analysis-aware defeaturing of complex geometries with Neumann features

OASIS: Optimisation-based Activity Scheduling with Integrated Simultaneous choice dimensions

Real-Time Localization for Closed-Loop Control of Assistive Furniture

Distributional Regression and Autoregression via Optimal Transport

Near-Minimax Optimal Estimation With Shallow ReLU Neural Networks

Detecting whether a stochastic process is finitely expressed in a basis

The elliptical Ornstein-Uhlenbeck process

Density estimation in RKHS with application to Korobov spaces in high dimensions