Sciweavers

530 search results - page 65 / 106
» Bounds on marginal probability distributions
Sort
View
GECCO
2009
Springer
14 years 2 months ago
Optimal robust expensive optimization is tractable
Following a number of recent papers investigating the possibility of optimal comparison-based optimization algorithms for a given distribution of probability on fitness functions...
Philippe Rolet, Michèle Sebag, Olivier Teyt...
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 7 months ago
Asymptotic Sum-Capacity of Random Gaussian Interference Networks Using Interference Alignment
We consider a dense n-user Gaussian interference network formed by paired transmitters and receivers placed independently at random in Euclidean space. Under natural conditions on ...
Matthew Aldridge, Oliver Johnson, Robert J. Piecho...
AAAI
2012
11 years 10 months ago
A Search Algorithm for Latent Variable Models with Unbounded Domains
This paper concerns learning and prediction with probabilistic models where the domain sizes of latent variables have no a priori upper-bound. Current approaches represent prior d...
Michael Chiang, David Poole
CORR
2011
Springer
210views Education» more  CORR 2011»
13 years 3 months ago
Statistical Compressed Sensing of Gaussian Mixture Models
A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribu...
Guoshen Yu, Guillermo Sapiro
CORR
2006
Springer
101views Education» more  CORR 2006»
13 years 8 months ago
MDL Convergence Speed for Bernoulli Sequences
The Minimum Description Length principle for online sequence estimation/prediction in a proper learning setup is studied. If the underlying model class is discrete, then the total...
Jan Poland, Marcus Hutter