Information Theory, Inference, and Learning ... - MAELabs UCSD

More documents

Recommendations

Info

Copyright Cambridge University Press 2003. On-screen viewing permitted. Printing not permitted. http://www.cambridge.org/0521642981 You can buy this book for 30 pounds or $50. See http://www.inference.phy.cam.ac.uk/mackay/itila/ for links. Γ, 598 Φ(z), 514 χ 2 , 40, 323, 458, 459 λ, 119 σN and σN−1, 320 :=, 600 ?, 419 2s, 156 Abu-Mostafa, Yaser, 482 acceptance rate, 365, 369, 394 acceptance ratio method, 379 accumulator, 254, 570, 582 activation function, 471 activity rule, 470, 471 adaptive direction sampling, 393 adaptive models, 101 adaptive rejection sampling, 370 address, 201, 468 Aiyer, Sree, 518 Alberto, 56 alchemists, 74 algebraic coding theory, 19, 574 algorithm, see learning algorithms BCJR, 330 belief propagation, 330, 336 covariant, 442 EM, 432 exact sampling, 413 expectation–maximization, 432 function minimization, 473 genetic, 395, 396 Hamiltonian Monte Carlo, 387, 496 independent component analysis, 443 Langevin Monte Carlo, 496 leapfrog, 389 max–product, 339 message-passing, 330 min–sum, 339 Monte Carlo, see Monte Carlo methods Newton–Raphson, 303, 441 perfect simulation, 413 sum–product, 336 Viterbi, 340 Alice, 199 Allais paradox, 454 alphabetical ordering, 194 America, 354 American, 238, 260 amino acid, 201, 204, 279, 362 anagram, 200 Index annealing, 379, 392, 397 deterministic, 518 importance sampling, 379 antiferromagnetic, 400 ape, 269 approximation by Gaussian, 2, 301, 341, 350, 496 Laplace, 341, 547 of complex distribution, 185, 282, 364, 422, 433 of density evolution, 567 saddle-point, 341 Stirling, 1 variational, 422 arabic, 127 architecture, 470, 529 arithmetic coding, 101, 110, 111 decoder, 118 software, 121 uses beyond compression, 118, 250, 255 arithmetic progression, 344 arms race, 278 artificial intelligence, 121, 129 associative memory, 468, 505, 507 assumptions, 26, 50 astronomy, 551 asymptotic equipartition, 80, 384 why it is a misleading term, 83 Atlantic, 173 AutoClass, 306 automatic relevance determination, 532, 544 automobile data reception, 594 average, 26, see expectation AWGN, 177 background rate, 307 backpropagation, 473, 475, 528, 535 backward pass, 244 bad, see error-correcting code Balakrishnan, Sree, 518 balance, 66 Baldwin effect, 279 ban (unit), 264 Banburismus, 265 band-limited signal, 178 bandwidth, 178, 182 bar-code, 262, 399 base transitions, 373 base-pairing, 280 basis dependence, 306, 342 bat, 213, 214 620 battleships, 71 Bayes’ theorem, 6, 24, 25, 27, 28, 48–50, 53, 148, 324, 344, 347, 446, 493, 522 Bayes, Rev. Thomas, 51 Bayesian belief networks, 293 Bayesian inference, 26, 346, 457 BCH codes, 13 BCJR algorithm, 330, 578 bearing, 307 Belarusian, 238 belief, 57 belief propagation, 330, 557, see message passing and sum–product algorithm Benford’s law, 446 bent coin, 1, 30, 38, 51, 76, 113, 307 Berlekamp, Elwyn, 172, 213 Bernoulli distribution, 117 Berrou, C., 186 bet, 200, 209, 455 beta distribution, 316 beta function, 316 beta integral, 30 Bethe free energy, 434 Bhattacharyya parameter, 215 bias, 345, 506 in neural net, 471 in statistics, 306, 307, 321 biexponential, 88, 313, 448 bifurcation, 89, 291, 426 binary entropy function, 2, 15 binary erasure channel, 148, 151 binary images, 399 binary representations, 132 binary symmetric channel, 4, 148, 151, 211, 215, 229 binding DNA, 201 binomial distribution, 1, 311 bipartite graph, 19 birthday, 156, 157, 160, 198, 200 bit, 3, 73 bit (unit), 264 bits back, 104, 108, 353 bivariate Gaussian, 388 black, 355 Bletchley Park, 265 Blind Watchmaker, 269, 396 block code, 9, see source code or error-correcting code block-sorting, 121 blood group, 55 blow up, 306 blur, 549
Copyright Cambridge University Press 2003. On-screen viewing permitted. Printing not permitted. http://www.cambridge.org/0521642981 You can buy this book for 30 pounds or $50. See http://www.inference.phy.cam.ac.uk/mackay/itila/ for links. Index 621 Bob, 199 Boltzmann entropy, 85 Boltzmann machine, 522 bombes, 265 book ISBN, 235 bookies, 456 Bottou, Leon, 121 bound, 85 union, 166, 216, 230 bounded-distance decoder, 207, 212 bounding chain, 419 box, 343, 351 boyish matters, 58 brain, 468 Bridge, 126 British, 260 broadcast channel, 237, 239, 594 Brody, Carlos, 246 Brownian motion, 280, 316, 535 BSC, see channel, binary symmetric budget, 94, 96 Buffon’s needle, 38 BUGS, 371, 431 buoy, 307 burglar alarm and earthquake, 293 Burrows–Wheeler transform, 121 burst errors, 185, 186 bus-stop paradox, 39, 46, 107 byte, 134, 265 cable labelling, 175 calculator, 320 camera, 549 canonical, 88 capacity, 14, 146, 150, 151, 183, 484 channel with synchronization errors, 187 constrained channel, 251 Gaussian channel, 182 Hopfield network, 514 neural network, 483 neuron, 483 symmetry argument, 151 car data reception, 594 card, 233 casting out nines, 198 Cauchy distribution, 85, 88, 313, 362 caution, see sermon equipartition, 83 Gaussian distribution, 312 importance sampling, 362, 382 sampling theory, 64 cave, 214 caveat, see caution and sermon cellphone, see mobile phone cellular automaton, 130 central-limit theorem, 36, 41, 88, 131, see law of large numbers centre of gravity, 35 chain rule, 528 challenges, 246 Tanner, 569 channel AWGN, 177 binary erasure, 148, 151 binary symmetric, 4, 146, 148, 151, 206, 211, 215, 229 broadcast, 237, 239, 594 bursty, 185, 557 capacity, 14, 146, 150, 250 connection with physics, 257 coding theorem, see noisy-channel coding theorem complex, 184, 557 constrained, 248, 255, 256 continuous, 178 discrete memoryless, 147 erasure, 188, 219, 589 extended, 153 fading, 186 Gaussian, 155, 177, 186 input ensemble, 150 multiple access, 237 multiterminal, 239 noiseless, 248 noisy, 3, 146 noisy typewriter, 148, 152 symmetric, 171 two-dimensional, 262 unknown noise level, 238 variable symbol durations, 256 with dependent sources, 236 with memory, 557 Z channel, 148, 149, 150, 172 cheat, 200 Chebyshev inequality, 81, 85 checkerboard, 404, 520 Chernoff bound, 85 chess, 451 chess board, 406, 520 chi-squared, 27, 40, 323, 458 Cholesky decomposition, 552 chromatic aberration, 552 cinema, 187 circle, 316 classical statistics, 64 criticisms, 32, 50, 457 classifier, 532 Clockville, 39 clustering, 284, 303 coalescence, 413 cocked hat, 307 code, see error-correcting code, source code (for data compression), symbol code, arithmetic coding, linear code, random code or hash code dual, see error-correcting code, dual for constrained channel, 249 variable-length, 255 code-equivalent, 576 codebreakers, 265 codeword, see source code, symbol code, or error-correcting code coding theory, 4, 19, 205, 215, 574 coin, 1, 30, 38, 63, 76, 307, 464 coincidence, 267, 343, 351 collective, 403 collision, 200 coloured noise, 179 combination, 2, 490, 598 commander, 241 communication, v, 3, 16, 138, 146, 156, 162, 167, 178, 182, 186, 192, 205, 210, 215, 394, 556, 562, 596 broadcast, 237 of dependent information, 236 over noiseless channels, 248 perspective on learning, 483, 512 competitive learning, 285 complexity, 531, 548 complexity control, 289, 346, 347, 349 compress, 119 compression, see source code future methods, 129 lossless, 74 lossy, 74, 284, 285 of already-compressed files, 74 of any file, 74 universal, 121 computer, 370 concatenation, 185, 214, 220 error-correcting codes, 16, 21, 184, 185, 579 in compression, 92 in Markov chains, 373 concave ⌢, 35 conditional entropy, 138, 146 cones, 554 confidence interval, 457, 464 confidence level, 464 confused gameshow host, 57 conjugate gradient, 479 conjugate prior, 319 conjuror, 233 connection between channel capacity and physics, 257 error correcting code and latent variable model, 437 pattern recognition and error-correction, 481 supervised and unsupervised learning, 515 vector quantization and error-correction, 285 connection matrix, 253, 257 constrained channel, 248, 257, 260, 399 variable-length code, 249 constraint satisfaction, 516 content-addressable memory, 192, 193, 469, 505 continuous channel, 178 control treatment, 458 conventions, see notation convex hull, 102 convex ⌣, 35 convexity, 370 convolution, 568 convolutional code, 184, 186, 574, 587 equivalence, 576
Page 1 and 2:
Copyright Cambridge University Pres
Page 3 and 4:
Page 5 and 6:
Page 7 and 8:
Page 9 and 10:
Page 11 and 12:
Page 13 and 14:
Page 15 and 16:
Page 17 and 18:
Page 19 and 20:
Page 21 and 22:
Page 23 and 24:
Page 25 and 26:
Page 27 and 28:
Page 29 and 30:
Page 31 and 32:
Page 33 and 34:
Page 35 and 36:
Page 37 and 38:
Page 39 and 40:
Page 41 and 42:
Page 43 and 44:
Page 45 and 46:
Page 47 and 48:
Page 49 and 50:
Page 51 and 52:
Page 53 and 54:
Page 55 and 56:
Page 57 and 58:
Page 59 and 60:
Page 61 and 62:
Page 63 and 64:
Page 65 and 66:
Page 67 and 68:
Page 69 and 70:
Page 71 and 72:
Page 73 and 74:
Page 75 and 76:
Page 77 and 78:
Page 79 and 80:
Page 81 and 82:
Page 83 and 84:
Page 85 and 86:
Page 87 and 88:
Page 89 and 90:
Page 91 and 92:
Page 93 and 94:
Page 95 and 96:
Page 97 and 98:
Page 99 and 100:
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
Page 107 and 108:
Page 109 and 110:
Page 111 and 112:
Page 113 and 114:
Page 115 and 116:
Page 117 and 118:
Page 119 and 120:
Page 121 and 122:
Page 123 and 124:
Page 125 and 126:
Page 127 and 128:
Page 129 and 130:
Page 131 and 132:
Page 133 and 134:
Page 135 and 136:
Page 137 and 138:
Page 139 and 140:
Page 141 and 142:
Page 143 and 144:
Page 145 and 146:
Page 147 and 148:
Page 149 and 150:
Page 151 and 152:
Page 153 and 154:
Page 155 and 156:
Page 157 and 158:
Page 159 and 160:
Page 161 and 162:
Page 163 and 164:
Page 165 and 166:
Page 167 and 168:
Page 169 and 170:
Page 171 and 172:
Page 173 and 174:
Page 175 and 176:
Page 177 and 178:
Page 179 and 180:
Page 181 and 182:
Page 183 and 184:
Page 185 and 186:
Page 187 and 188:
Page 189 and 190:
Page 191 and 192:
Page 193 and 194:
Page 195 and 196:
Page 197 and 198:
Page 199 and 200:
Page 201 and 202:
Page 203 and 204:
Page 205 and 206:
Page 207 and 208:
Page 209 and 210:
Page 211 and 212:
Page 213 and 214:
Page 215 and 216:
Page 217 and 218:
Page 219 and 220:
Page 221 and 222:
Page 223 and 224:
Page 225 and 226:
Page 227 and 228:
Page 229 and 230:
Page 231 and 232:
Page 233 and 234:
Page 235 and 236:
Page 237 and 238:
Page 239 and 240:
Page 241 and 242:
Page 243 and 244:
Page 245 and 246:
Page 247 and 248:
Page 249 and 250:
Page 251 and 252:
Page 253 and 254:
Page 255 and 256:
Page 257 and 258:
Page 259 and 260:
Page 261 and 262:
Page 263 and 264:
Page 265 and 266:
Page 267 and 268:
Page 269 and 270:
Page 271 and 272:
Page 273 and 274:
Page 275 and 276:
Page 277 and 278:
Page 279 and 280:
Page 281 and 282:
Page 283 and 284:
Page 285 and 286:
Page 287 and 288:
Page 289 and 290:
Page 291 and 292:
Page 293 and 294:
Page 295 and 296:
Page 297 and 298:
Page 299 and 300:
Page 301 and 302:
Page 303 and 304:
Page 305 and 306:
Page 307 and 308:
Page 309 and 310:
Page 311 and 312:
Page 313 and 314:
Page 315 and 316:
Page 317 and 318:
Page 319 and 320:
Page 321 and 322:
Page 323 and 324:
Page 325 and 326:
Page 327 and 328:
Page 329 and 330:
Page 331 and 332:
Page 333 and 334:
Page 335 and 336:
Page 337 and 338:
Page 339 and 340:
Page 341 and 342:
Page 343 and 344:
Page 345 and 346:
Page 347 and 348:
Page 349 and 350:
Page 351 and 352:
Page 353 and 354:
Page 355 and 356:
Page 357 and 358:
Page 359 and 360:
Page 361 and 362:
Page 363 and 364:
Page 365 and 366:
Page 367 and 368:
Page 369 and 370:
Page 371 and 372:
Page 373 and 374:
Page 375 and 376:
Page 377 and 378:
Page 379 and 380:
Page 381 and 382:
Page 383 and 384:
Page 385 and 386:
Page 387 and 388:
Page 389 and 390:
Page 391 and 392:
Page 393 and 394:
Page 395 and 396:
Page 397 and 398:
Page 399 and 400:
Page 401 and 402:
Page 403 and 404:
Page 405 and 406:
Page 407 and 408:
Page 409 and 410:
Page 411 and 412:
Page 413 and 414:
Page 415 and 416:
Page 417 and 418:
Page 419 and 420:
Page 421 and 422:
Page 423 and 424:
Page 425 and 426:
Page 427 and 428:
Page 429 and 430:
Page 431 and 432:
Page 433 and 434:
Page 435 and 436:
Page 437 and 438:
Page 439 and 440:
Page 441 and 442:
Page 443 and 444:
Page 445 and 446:
Page 447 and 448:
Page 449 and 450:
Page 451 and 452:
Page 453 and 454:
Page 455 and 456:
Page 457 and 458:
Page 459 and 460:
Page 461 and 462:
Page 463 and 464:
Page 465 and 466:
Page 467 and 468:
Page 469 and 470:
Page 471 and 472:
Page 473 and 474:
Page 475 and 476:
Page 477 and 478:
Page 479 and 480:
Page 481 and 482:
Page 483 and 484:
Page 485 and 486:
Page 487 and 488:
Page 489 and 490:
Page 491 and 492:
Page 493 and 494:
Page 495 and 496:
Page 497 and 498:
Page 499 and 500:
Page 501 and 502:
Page 503 and 504:
Page 505 and 506:
Page 507 and 508:
Page 509 and 510:
Page 511 and 512:
Page 513 and 514:
Page 515 and 516:
Page 517 and 518:
Page 519 and 520:
Page 521 and 522:
Page 523 and 524:
Page 525 and 526:
Page 527 and 528:
Page 529 and 530:
Page 531 and 532:
Page 533 and 534:
Page 535 and 536:
Page 537 and 538:
Page 539 and 540:
Page 541 and 542:
Page 543 and 544:
Page 545 and 546:
Page 547 and 548:
Page 549 and 550:
Page 551 and 552:
Page 553 and 554:
Page 555 and 556:
Page 557 and 558:
Page 559 and 560:
Page 561 and 562:
Page 563 and 564:
Page 565 and 566:
Page 567 and 568:
Page 569 and 570:
Page 571 and 572:
Page 573 and 574:
Page 575 and 576:
Page 577 and 578:
Page 579 and 580:
Page 581 and 582: Copyright Cambridge University Pres
Page 631: Copyright Cambridge University Pres
show all

Information Theory, Inference, and Learning ... - MAELabs UCSD

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?