Estimation of separable direct and indirect effects in continuous time
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.
The proliferation of (low-cost) sensors provokes new challenges in data fusion. This is related to the correctness of stochastic characterization that is a prerequisite for optimal estimation of parameters from redundant observations. Different (statistica ...
This paper proposes a tradeoff between computational time, sample complexity, and statistical accuracy that applies to statistical estimators based on convex optimization. When we have a large amount of data, we can exploit excess samples to decrease stati ...
We intend to prove that PMU-based state estimation processes for active distribution networks exhibit unique time determinism and refresh rate that make them suitable to satisfy the time-critical requirements of protections as well as the accuracy requirem ...
Institute of Electrical and Electronics Engineers2017
Solving a linear inverse problem may include difficulties such as the presence of outliers and a mixing matrix with a large condition number. In such cases a regularized robust estimator is needed. We propose a new tau-type regularized robust estimator tha ...
In this paper, we derive elementary M- and optimally robust asymptotic linear (AL)-estimates for the parameters of an Ornstein-Uhlenbeck process. Simulation and estimation of the process are already well-studied, see Iacus (Simulation and inference for sto ...
Springer-Verlag2012
, ,
Many recent algorithms for sparse signal recovery can be interpreted as maximum-a-posteriori (MAP) estimators relying on some specific priors. From this Bayesian perspective, state-of-the-art methods based on discrete-gradient regularizers, such as total-v ...
Ieee2012
In this thesis, we treat robust estimation for the parameters of the Ornstein–Uhlenbeck process, which are the mean, the variance, and the friction. We start by considering classical maximum likelihood estimation. For the simulation study, where we also in ...
EPFL2012
, ,
We consider the problem of estimating sparse communication channels in the MIMO context. In small to medium bandwidth communications, as in the current standards for OFDM and CDMA communication systems (with bandwidth up to 20 MHz), such channels are indiv ...
2012
, ,
Many recent algorithms for sparse signal recovery can be interpreted as maximum-a-posteriori (MAP) estimators relying on some specific priors. From this Bayesian perspective, state-of-the-art methods based on discrete-gradient regularizers, such as total- ...
This work is concerned with the estimation of the spreading potential of the disease in the initial stages of an epidemic. A speedy and accurate estimation is important for determining whether or not interventions are necessary to prevent a major outbreak. ...
