TIC-TAC: A Framework for Improved Covariance Estimation in Deep Heteroscedastic Regression
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
The present paper is the third and last part of an investigation on what determines reliability in fuel cell model identification. In continuation to the effect of experimental design (Part I) and a process method for stochastic calculation of a model's pa ...
Dynamic optimization problems affected by uncertainty are ubiquitous in many application domains. Decision makers typically model the uncertainty through random variables governed by a probability distribution. If the distribution is precisely known, then ...
The recently developed self-consistent continuum solvation model (SCCS) [O. Andreussi, I. Dabo, and N. Marzari, J. Chem. Phys. 136, 064102 (2012)] is applied here to charged species in aqueous solutions. Describing ions in solution represents a great chall ...
We study the steady-state probability distribution of diffusion and consensus strategies that employ constant step-sizes to enable continuous adaptation and learning. We show that, in the small step-size regime, the estimation error at each agent approache ...
The family of natural evolution strategies (NES) offers a principled approach to real-valued evolutionary optimization by following the natural gradient of the expected fitness. Like the well-known CMA-ES, the most competitive algorithm in the field, NES c ...
Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multiarmed bandit problem, where the payoff function is either sampled from a Gaussian process (GP) or has low RKHS norm. We resolve ...
Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multi-armed bandit problem, where the payoff function is either sampled from a Gaussian process (GP) or has low RKHS norm. We resolve ...
We analyze computational aspects of variational approximate inference techniques for sparse linear models, which have to be understood to allow for large scale applications. Gaussian covariances play a key role, whose approximation is computationally hard. ...
The paper introduces a multiple signal classification technique based method for fringe analysis. In the proposed method, the phase of a fringe pattern is locally approximated as a polynomial. The polynomial phase signal is then transformed to obtain signa ...
We consider bearing estimation of multiple narrow-band plane waves impinging on an array of sensors. For this problem, bearing estimation algorithms such as minimum variance distortionless response (MVDR), multiple signal classification, and maximum likeli ...
