Information Theory, Inference, and Learning ... - Inference Group

More documents

Recommendations

Info

Copyright Cambridge University Press 2003. On-screen viewing permitted. Printing not permitted. http://www.cambridge.org/0521642981You can buy this book for 30 pounds or $50. See http://www.inference.phy.cam.ac.uk/mackay/itila/ for links.618 BibliographyNeal, R. M., and Hinton, G. E. (1998) A new view of the EMalgorithm that justifies incremental, sparse, and other variants.In Learning in Graphical Models, ed. by M. I. Jordan, NATOScience Series, pp. 355–368. Kluwer.Nielsen, M., and Chuang, I. (2000) Quantum Computation andQuantum Information. Cambridge Univ. Press.Offer, E., and Soljanin, E. (2000) An algebraic descriptionof iterative decoding schemes. In Codes, Systems and GraphicalModels, ed. by B. Marcus and J. Rosenthal, volume 123 ofIMA Volumes in Mathematics and its Applications, pp. 283–298. Springer.Offer, E., and Soljanin, E. (2001) LDPC codes: a group algebraformulation. In Proc. Internat. Workshop on Coding andCryptography WCC 2001, 8-12 Jan. 2001, Paris.O’Hagan, A. (1978) On curve fitting and optimal design forregression. J. Royal Statistical Society, B 40: 1–42.O’Hagan, A. (1987) Monte Carlo is fundamentally unsound. TheStatistician 36: 247–249.O’Hagan, A. (1994) Bayesian Inference, volume 2B of Kendall’sAdvanced Theory of Statistics. Edward Arnold.Omre, H. (1987) Bayesian kriging – merging observations andqualified guesses in kriging. Mathematical Geology 19: 25–39.Opper, M., and Winther, O. (2000) Gaussian processes forclassification: Mean-field algorithms. Neural Computation 12(11): 2655–2684.Patrick, J. D., and Wallace, C. S. (1982) Stone circle geometries:an information theory approach. In Archaeoastronomy inthe Old World, ed. by D. C. Heggie, pp. 231–264. CambridgeUniv. Press.Pearl, J. (1988) Probabilistic Reasoning in Intelligent Systems:Networks of Plausible Inference. Morgan Kaufmann.Pearl, J. (2000) Causality. Cambridge Univ. Press.Pearlmutter, B. A., and Parra, L. C. (1996) A contextsensitivegeneralization of ICA. In International Conf. on NeuralInformation Processing, Hong Kong, pp. 151–157.Pearlmutter, B. A., and Parra, L. C. (1997) Maximumlikelihood blind source separation: A context-sensitive generalizationof ICA. In Advances in Neural Information ProcessingSystems, ed. by M. C. Mozer, M. I. Jordan, and T. Petsche,volume 9, p. 613. MIT Press.Pinto, R. L., and Neal, R. M. (2001) Improving Markov chainMonte Carlo estimators by coupling to an approximating chain.Technical Report 0101, Dept. of Statistics, Univ. of Toronto.Poggio, T., and Girosi, F. (1989) A theory of networks forapproximation and learning. Technical Report A.I. 1140, MIT.Poggio, T., and Girosi, F. (1990) Networks for approximationand learning. Proc. IEEE 78: 1481–1497.Polya, G. (1954) Induction and Analogy in Mathematics. PrincetonUniv. Press.Propp, J. G., and Wilson, D. B. (1996) Exact sampling withcoupled Markov chains and applications to statistical mechanics.Random Structures and Algorithms 9 (1-2): 223–252.Rabiner, L. R., and Juang, B. H. (1986) An introduction tohidden Markov models. IEEE ASSP Magazine pp. 4–16.Rasmussen, C. E. (1996) Evaluation of Gaussian Processes andOther Methods for Non-Linear Regression. Univ. of TorontoPhD dissertation.Rasmussen, C. E. (2000) The infinite Gaussian mixture model.In Advances in Neural Information Processing Systems 12 , ed.by S. Solla, T. Leen, and K.-R. Müller, pp. 554–560. MIT Press.Rasmussen, C. E., (2002) Reduced rank Gaussian process learning.Unpublished manuscript.Rasmussen, C. E., and Ghahramani, Z. (2002) Infinite mixturesof Gaussian process experts. In Advances in Neural InformationProcessing Systems 14 , ed. by T. G. Diettrich, S. Becker,and Z. Ghahramani. MIT Press.Rasmussen, C. E., and Ghahramani, Z. (2003) Bayesian MonteCarlo. In Advances in Neural Information Processing SystemsXV , ed. by S. Becker, S. Thrun, and K. Obermayer.Ratliff, F., and Riggs, L. A. (1950) Involuntary motions of theeye during monocular fixation. J. Exptl. Psychol. 40: 687–701.Ratzer, E. A., and MacKay, D. J. C. (2003) Sparse low-densityparity-check codes for channels with cross-talk. In Proc. 2003IEEE Info. Theory Workshop, Paris.Reif, F. (1965) Fundamentals of Statistical and Thermal Physics.McGraw–Hill.Richardson, T., Shokrollahi, M. A., and Urbanke, R.(2001) Design of capacity-approaching irregular low-densityparity check codes. IEEE Trans. Info. Theory 47 (2): 619–637.Richardson, T., and Urbanke, R. (2001a) The capacity oflow-density parity check codes under message-passing decoding.IEEE Trans. Info. Theory 47 (2): 599–618.Richardson, T., and Urbanke, R. (2001b) Efficient encodingof low-density parity-check codes. IEEE Trans. Info. Theory47 (2): 638–656.Ridley, M. (2000) Mendel’s Demon: gene justice and the complexityof life. Phoenix.Ripley, B. D. (1991) Statistical Inference for Spatial Processes.Cambridge Univ. Press.Ripley, B. D. (1996) Pattern Recognition and Neural Networks.Cambridge Univ. Press.Rumelhart, D. E., Hinton, G. E., and Williams, R. J. (1986)Learning representations by back-propagating errors. Nature323: 533–536.Russell, S., and Wefald, E. (1991) Do the Right Thing: Studiesin Limited Rationality. MIT Press.Schneier, B. (1996) Applied Cryptography. Wiley.Scholkopf, B., Burges, C., and Vapnik, V. (1995) Extractingsupport data for a given task. In Proc. First InternationalConf. on Knowledge Discovery and Data Mining, ed. by U. M.Fayyad and R. Uthurusamy. AAAI Press.Scholtz, R. A. (1982) The origins of spread-spectrum communications.IEEE Trans. on Communications 30 (5): 822–854.Seeger, M., Williams, C. K. I., and Lawrence, N. (2003)Fast forward selection to speed up sparse Gaussian process regression.In Proc. Ninth International Workshop on ArtificialIntelligence and Statistics, ed. by C. Bishop and B. J. Frey.Society for Artificial Intelligence and Statistics.Sejnowski, T. J. (1986) Higher order Boltzmann machines. InNeural networks for computing, ed. by J. Denker, pp. 398–403.American Institute of Physics.Sejnowski, T. J., and Rosenberg, C. R. (1987) Parallel networksthat learn to pronounce English text. Journal of ComplexSystems 1 (1): 145–168.Shannon, C. E. (1948) A mathematical theory of communication.Bell Sys. Tech. J. 27: 379–423, 623–656.Shannon, C. E. (1993) The best detection of pulses. In CollectedPapers of Claude Shannon, ed. by N. J. A. Sloane and A. D.Wyner, pp. 148–150. IEEE Press.Shannon, C. E., and Weaver, W. (1949) The MathematicalTheory of Communication. Univ. of Illinois Press.Shokrollahi, A. (2003) Raptor codes. Technical report, Laboratoired’algorithmique, École Polytechnique Fédérale de Lausanne,Lausanne, Switzerland. Available from algo.epfl.ch/.Sipser, M., and Spielman, D. A. (1996) Expander codes. IEEETrans. Info. Theory 42 (6.1): 1710–1722.Skilling, J. (1989) Classic maximum entropy. In MaximumEntropy and Bayesian Methods, Cambridge 1988 , ed. byJ. Skilling. Kluwer.Skilling, J. (1993) Bayesian numerical analysis. In Physics andProbability, ed. by W. T. Grandy, Jr. and P. Milonni. CambridgeUniv. Press.
Copyright Cambridge University Press 2003. On-screen viewing permitted. Printing not permitted. http://www.cambridge.org/0521642981You can buy this book for 30 pounds or $50. See http://www.inference.phy.cam.ac.uk/mackay/itila/ for links.Bibliography 619Skilling, J., and MacKay, D. J. C. (2003) Slice sampling – abinary implementation. Annals of Statistics 31 (3): 753–755.Discussion of Slice Sampling by Radford M. Neal.Slepian, D., and Wolf, J. (1973) Noiseless coding of correlatedinformation sources. IEEE Trans. Info. Theory 19: 471–480.Smola, A. J., and Bartlett, P. (2001) Sparse Greedy GaussianProcess Regression. In Advances in Neural InformationProcessing Systems 13 , ed. by T. K. Leen, T. G. Diettrich, andV. Tresp, pp. 619–625. MIT Press.Spiegel, M. R. (1988) Statistics. Schaum’s outline series.McGraw-Hill, 2nd edition.Spielman, D. A. (1996) Linear-time encodable and decodableerror-correcting codes. IEEE Trans. Info. Theory 42(6.1): 1723–1731.Sutton, R. S., and Barto, A. G. (1998) Reinforcement Learning:An Introduction. MIT Press.Swanson, L. (1988) A new code for Galileo. In Proc. 1988 IEEEInternational Symposium Info. Theory, pp. 94–95.Tanner, M. A. (1996) Tools for Statistical Inference: Methodsfor the Exploration of Posterior Distributions and LikelihoodFunctions. Springer Series in Statistics. Springer, 3rd edition.Tanner, R. M. (1981) A recursive approach to low complexitycodes. IEEE Trans. Info. Theory 27 (5): 533–547.Teahan, W. J. (1995) Probability estimation for PPM. InProc. NZCSRSC’95 . Available from citeseer.nj.nec.com/teahan95probability.html.ten Brink, S. (1999) Convergence of iterative decoding. ElectronicsLetters 35 (10): 806–808.ten Brink, S., Kramer, G., and Ashikhmin, A., (2002) Designof low-density parity-check codes for multi-antenna modulationand detection. Submitted to IEEE Trans. on Communications.Terras, A. (1999) Fourier Analysis on Finite Groups and Applications.Cambridge Univ. Press.Thomas, A., Spiegelhalter, D. J., and Gilks, W. R. (1992)BUGS: A program to perform Bayesian inference using Gibbssampling. In Bayesian Statistics 4 , ed. by J. M. Bernardo,J. O. Berger, A. P. Dawid, and A. F. M. Smith, pp. 837–842.Clarendon Press.Tresp, V. (2000) A Bayesian committee machine. Neural Computation12 (11): 2719–2741.Urbanke, R., (2001) LdpcOpt – a fast and accurate degree distributionoptimizer for LDPC code ensembles. lthcwww.epfl.ch/research/ldpcopt/.Vapnik, V. (1995) The Nature of Statistical Learning Theory.Springer.Viterbi, A. J. (1967) Error bounds for convolutional codes andan asymptotically optimum decoding algorithm. IEEE Trans.Info. Theory IT-13: 260–269.Wahba, G. (1990) Spline Models for Observational Data. Societyfor Industrial and Applied Mathematics. CBMS-NSF RegionalConf. series in applied mathematics.Wainwright, M. J., Jaakkola, T., and Willsky, A. S. (2003)Tree-based reparameterization framework for analysis of sumproductand related algorithms. IEEE Trans. Info. Theory 45(9): 1120–1146.Wald, G., and Griffin, D. (1947) The change in refractivepower of the eye in bright and dim light. J. Opt. Soc. Am.37: 321–336.Wallace, C., and Boulton, D. (1968) An information measurefor classification. Comput. J. 11 (2): 185–194.Wallace, C. S., and Freeman, P. R. (1987) Estimation andinference by compact coding. J. R. Statist. Soc. B 49 (3): 240–265.Ward, D. J., Blackwell, A. F., and MacKay, D. J. C. (2000)Dasher – A data entry interface using continuous gestures andlanguage models. In Proc. User Interface Software and Technology2000 , pp. 129–137.Ward, D. J., and MacKay, D. J. C. (2002) Fast hands-freewriting by gaze direction. Nature 418 (6900): 838.Welch, T. A. (1984) A technique for high-performance datacompression. IEEE Computer 17 (6): 8–19.Welling, M., and Teh, Y. W. (2001) Belief optimization forbinary networks: A stable alternative to loopy belief propagation.In Uncertainty in Artificial Intelligence: Proc. SeventeenthConf. (UAI-2001), pp. 554–561. Morgan Kaufmann.Wiberg, N. (1996) Codes and Decoding on General Graphs.Dept. of Elec. Eng., Linköping, Sweden PhD dissertation.Linköping Studies in Science and Technology No. 440.Wiberg, N., Loeliger, H.-A., and Kötter, R. (1995) Codesand iterative decoding on general graphs. European Trans. onTelecommunications 6: 513–525.Wiener, N. (1948) Cybernetics. Wiley.Williams, C. K. I., and Rasmussen, C. E. (1996) Gaussianprocesses for regression. In Advances in Neural InformationProcessing Systems 8 , ed. by D. S. Touretzky, M. C. Mozer,and M. E. Hasselmo. MIT Press.Williams, C. K. I., and Seeger, M. (2001) Using the NyströmMethod to Speed Up Kernel Machines. In Advances in NeuralInformation Processing Systems 13 , ed. by T. K. Leen, T. G.Diettrich, and V. Tresp, pp. 682–688. MIT Press.Witten, I. H., Neal, R. M., and Cleary, J. G. (1987) Arithmeticcoding for data compression. Communications of theACM 30 (6): 520–540.Wolf, J. K., and Siegel, P. (1998) On two-dimensional arraysand crossword puzzles. In Proc. 36th Allerton Conf. on Communication,Control, and Computing, Sept. 1998 , pp. 366–371.Allerton House.Worthen, A. P., and Stark, W. E. (1998) Low-density paritycheck codes for fading channels with memory. In Proc. 36thAllerton Conf. on Communication, Control, and Computing,Sept. 1998 , pp. 117–125.Yedidia, J. S. (2000) An idiosyncratic journey beyond meanfield theory. Technical report, Mitsubishi Electric Res. Labs.TR-2000-27.Yedidia, J. S., Freeman, W. T., and Weiss, Y. (2000) Generalizedbelief propagation. Technical report, Mitsubishi ElectricRes. Labs. TR-2000-26.Yedidia, J. S., Freeman, W. T., and Weiss, Y. (2001a) Bethefree energy, Kikuchi approximations and belief propagation algorithms.Technical report, Mitsubishi Electric Res. Labs. TR-2001-16.Yedidia, J. S., Freeman, W. T., and Weiss, Y. (2001b) Characterizationof belief propagation and its generalizations. Technicalreport, Mitsubishi Electric Res. Labs. TR-2001-15.Yedidia, J. S., Freeman, W. T., and Weiss, Y. (2002) Constructingfree energy approximations and generalized beliefpropagation algorithms. Technical report, Mitsubishi ElectricRes. Labs. TR-2002-35.Yeung, R. W. (1991) A new outlook on Shannon-informationmeasures. IEEE Trans. Info. Theory 37 (3.1): 466–474.Yuille, A. L. (2001) A double-loop algorithm to minimizethe Bethe and Kikuchi free energies. In Energy MinimizationMethods in Computer Vision and Pattern Recognition, ed. byM. Figueiredo, J. Zerubia, and A. Jain, number 2134 in LNCS,pp. 3–18. Springer.Zipf, G. K. (1949) Human Behavior and the Principle of LeastEffort. Addison-Wesley.Ziv, J., and Lempel, A. (1977) A universal algorithm for sequentialdata compression. IEEE Trans. Info. Theory 23 (3): 337–343.Ziv, J., and Lempel, A. (1978) Compression of individual sequencesvia variable-rate coding. IEEE Trans. Info. Theory 24(5): 530–536.
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 80 and 81:
Page 82 and 83:
Page 84 and 85:
Page 86 and 87:
Page 88 and 89:
Page 90 and 91:
Page 92 and 93:
Page 94 and 95:
Page 96 and 97:
Page 98 and 99:
Page 100 and 101:
Page 102 and 103:
Page 104 and 105:
Page 106 and 107:
Page 108 and 109:
¥¡¥¡¥¡¥¡¥¡¥¡¥¡¥¡¥
Page 110 and 111:
Page 112 and 113:
Page 114 and 115:
Page 116 and 117:
Page 118 and 119:
Page 120 and 121:
Page 122 and 123:
Page 124 and 125:
Page 126 and 127:
Page 128 and 129:
Page 130 and 131:
Page 132 and 133:
Page 134 and 135:
Page 136 and 137:
Page 138 and 139:
Page 140 and 141:
Page 142 and 143:
Page 144 and 145:
Page 146 and 147:
Page 148 and 149:
Page 150 and 151:
Page 152 and 153:
Page 154 and 155:
Page 156 and 157:
Page 158 and 159:
Page 160 and 161:
Page 162 and 163:
Page 164 and 165:
Page 166 and 167:
Page 168 and 169:
Page 170 and 171:
Page 172 and 173:
Page 174 and 175:
Page 176 and 177:
Page 178 and 179:
Page 180 and 181:
Page 182 and 183:
Page 184 and 185:
Page 186 and 187:
Page 188 and 189:
Page 190 and 191:
Page 192 and 193:
Page 194 and 195:
Page 196 and 197:
Page 198 and 199:
Page 200 and 201:
Page 202 and 203:
Page 204 and 205:
Page 206 and 207:
Page 208 and 209:
Page 210 and 211:
Page 212 and 213:
Page 214 and 215:
Page 216 and 217:
Page 218 and 219:
Page 220 and 221:
Page 222 and 223:
Page 224 and 225:
Page 226 and 227:
Page 228 and 229:
Page 230 and 231:
Page 232 and 233:
Page 234 and 235:
Page 236 and 237:
Page 238 and 239:
Page 240 and 241:
Page 242 and 243:
Page 244 and 245:
Page 246 and 247:
Page 248 and 249:
Page 250 and 251:
Page 252 and 253:
Page 254 and 255:
Page 256 and 257:
Page 258 and 259:
Page 260 and 261:
Page 262 and 263:
Page 264 and 265:
Page 266 and 267:
Page 268 and 269:
Page 270 and 271:
Page 272 and 273:
Page 274 and 275:
Page 276 and 277:
Page 278 and 279:
Page 280 and 281:
Page 282 and 283:
Page 284 and 285:
Page 286 and 287:
Page 288 and 289:
Page 290 and 291:
Page 292 and 293:
Page 294 and 295:
Page 296 and 297:
Page 298 and 299:
Page 300 and 301:
Page 302 and 303:
Page 304 and 305:
Page 306 and 307:
Page 308 and 309:
Page 310 and 311:
Page 312 and 313:
Page 314 and 315:
Page 316 and 317:
Page 318 and 319:
Page 320 and 321:
Page 322 and 323:
Page 324 and 325:
Page 326 and 327:
Page 328 and 329:
Page 330 and 331:
Page 332 and 333:
Page 334 and 335:
Page 336 and 337:
Page 338 and 339:
Page 340 and 341:
Page 342 and 343:
Page 344 and 345:
Page 346 and 347:
Page 348 and 349:
Page 350 and 351:
Page 352 and 353:
Page 354 and 355:
Page 356 and 357:
Page 358 and 359:
Page 360 and 361:
Page 362 and 363:
Page 364 and 365:
Page 366 and 367:
Page 368 and 369:
Page 370 and 371:
Page 372 and 373:
Page 374 and 375:
Page 376 and 377:
Page 378 and 379:
Page 380 and 381:
Page 382 and 383:
Page 384 and 385:
Page 386 and 387:
Page 388 and 389:
Page 390 and 391:
Page 392 and 393:
Page 394 and 395:
Page 396 and 397:
Page 398 and 399:
Page 400 and 401:
Page 402 and 403:
Page 404 and 405:
Page 406 and 407:
Page 408 and 409:
Page 410 and 411:
Page 412 and 413:
Page 414 and 415:
Page 416 and 417:
Page 418 and 419:
Page 420 and 421:
Page 422 and 423:
Page 424 and 425:
Page 426 and 427:
Page 428 and 429:
Page 430 and 431:
Page 432 and 433:
Page 434 and 435:
Page 436 and 437:
Page 438 and 439:
Page 440 and 441:
Page 442 and 443:
Page 444 and 445:
Page 446 and 447:
Page 448 and 449:
Page 450 and 451:
Page 452 and 453:
Page 454 and 455:
Page 456 and 457:
Page 458 and 459:
Page 460 and 461:
Page 462 and 463:
Page 464 and 465:
Page 466 and 467:
Page 468 and 469:
Page 470 and 471:
Page 472 and 473:
Page 474 and 475:
Page 476 and 477:
Page 478 and 479:
Page 480 and 481:
Page 482 and 483:
Page 484 and 485:
Page 486 and 487:
Page 488 and 489:
Page 490 and 491:
Page 492 and 493:
Page 494 and 495:
Page 496 and 497:
Page 498 and 499:
Page 500 and 501:
Page 502 and 503:
Page 504 and 505:
Page 506 and 507:
Page 508 and 509:
Page 510 and 511:
Page 512 and 513:
Page 514 and 515:
¡¤¢¢¤¨©¢£¡¢£¨¢£ ©Co
Page 516 and 517:
Page 518 and 519:
Page 520 and 521:
Page 522 and 523:
Page 524 and 525:
Page 526 and 527:
Page 528 and 529:
Page 530 and 531:
Page 532 and 533:
Page 534 and 535:
Page 536 and 537:
Page 538 and 539:
Page 540 and 541:
Page 542 and 543:
Page 544 and 545:
Page 546 and 547:
Page 548 and 549:
Page 550 and 551:
Page 552 and 553:
Page 554 and 555:
ttttCopyright Cambridge University
Page 556 and 557:
Page 558 and 559:
Page 560 and 561:
Page 562 and 563:
Page 564 and 565:
Page 566 and 567:
Page 568 and 569:
Page 570 and 571:
Page 572 and 573:
Page 574 and 575:
Page 576 and 577:
Page 578 and 579:
Page 580 and 581: Copyright Cambridge University Pres
Page 640: Copyright Cambridge University Pres
show all

Information Theory, Inference, and Learning ... - Inference Group

Create successful ePaper yourself

Delete template?

Save as template?