Sciweavers

75 search results - page 4 / 15
» A Uniform Lower Error Bound for Half-Space Learning
Sort
View
CORR
2006
Springer
67views Education» more  CORR 2006»
13 years 8 months ago
Error Exponents and Cutoff Rate for Noncoherent Rician Fading Channels
In this paper, random coding error exponents and cutoff rate are studied for noncoherent Rician fading channels, where neither the receiver nor the transmitter has channel side inf...
Mustafa Cenk Gursoy
NIPS
2004
13 years 10 months ago
Variational Minimax Estimation of Discrete Distributions under KL Loss
We develop a family of upper and lower bounds on the worst-case expected KL loss for estimating a discrete distribution on a finite number m of points, given N i.i.d. samples. Our...
Liam Paninski
TIT
2008
90views more  TIT 2008»
13 years 8 months ago
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...
Gil Wiechman, Igal Sason
CORR
2007
Springer
149views Education» more  CORR 2007»
13 years 8 months ago
Competitive minimax universal decoding for several ensembles of random codes
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC’s)), and various ensembles of random codes, ar...
Yaniv Akirav, Neri Merhav
ICML
2006
IEEE
14 years 9 months ago
Estimating relatedness via data compression
We show that it is possible to use data compression on independently obtained hypotheses from various tasks to algorithmically provide guarantees that the tasks are sufficiently r...
Brendan Juba