On the probability distribution of distributed optimization strategies
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.
Two distinct methods underlying the existence of power-law distribution were studied. The distribution ws stationary under the process of merging and splitting of classes and the distribution of the entities under study was invariant. An explanation for th ...
This paper provides an efficient method for analyzing the error probability of the belief propagation (BP) decoder applied to LT Codes. Each output symbol is generated independently by sampling from a distribution and adding the input symbols corresponding ...
We present a general method for maintaining estimates of the distribution of parameters in arbitrary models. This is then applied to the estimation of probability distribution over actions in value-based reinforcement learning. While this approach is simil ...
Distributed processing algorithms are attractive alternatives to centralized algorithms for target tracking applications in sensor networks. In this paper, we address the issue of determining a initial probability distribution of multiple target states in ...
We apply boosting techniques to the problem of word error rate minimisation in speech recognition. This is achieved through a new definition of sample error for boosting and a training procedure for hidden Markov models. For this purpose we define a sample ...
We apply boosting techniques to the problem of word error rate minimisation in speech recognition. This is achieved through a new definition of sample error for boosting and a training procedure for hidden Markov models. For this purpose we define a sample ...
In this paper, we discuss some of the issues that arise with the computation of the implied value of travel-time savings in the case of discrete choice models allowing for random taste heterogeneity. We specifically look at the case of models producing a n ...
We apply boosting techniques to the problem of word error rate minimisation in speech recognition. This is achieved through a new definition of sample error for boosting and a training procedure for hidden Markov models. For this purpose we define a sample ...
This paper introduces an approach to wavelet packet best basis searches using the generalized Renyi entropy. The approach extends on work by Coifman and Wickerhauser who showed how Shannon entropy can be used as an additive cost function in the wavelet pac ...
We propose a very fast and accurate algorithm for pricing swaptions when the underlying term structure dynamics are affine. The efficiency of the algorithm stems from the fact that the moments of the underlying asset (i.e., a coupon bond) possess simple cl ...
