## Prior Information and Generalized Questions (1996)

Citations: | 7 - 4 self |

### BibTeX

@MISC{Lemm96priorinformation,

author = {Jörg C. Lemm},

title = {Prior Information and Generalized Questions},

year = {1996}

}

### OpenURL

### Abstract

In learning problems available information is usually divided into two categories: examples of function values (or training data) and prior information (e.g. a smoothness constraint).

### Citations

10328 | The Nature of Statistical Learning Theory - Vapnik - 1995 |

9374 | Maximum Likelihood from incomplete data via the EM algorithm - Dempster, Laird, et al. - 1977 |

8610 | Genetic Algorithms - Goldberg - 1989 |

7634 | Probabilistic Reasoning in Intelligent Systems - Pearl - 1988 |

5536 |
Neural Networks for Pattern Recognition
- Bishop
- 1995
(Show Context)
Citation Context ... a Gaussian distribution with oe = 0:2 and mean �� y x (f 0 ) from the interval [1; 30]. Thus, the task can be seen as a simple two-- template prediction or reconstructing problem. with the interv=-=all [31; 40]-=- representing either future values (for time series) or a hidden area (in image reconstruction). See the thickly dashed curve in the upper right picture in Fig.17 for the f 0 used for the results disc... |

4177 | Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images - Geman, Geman - 1984 |

4112 | Prospect Theory: An analysis of decision under risk - Kahneman, Tversky - 1979 |

3867 | Self-Organizing Maps - Kohonen |

3609 | An introduction to the bootstrap - Efron, Tibshirani - 1993 |

3127 | Adaptation in Natural and Artificial Systems - Holland - 1975 |

2793 | Density Estimation for Statistics and Data Analysis - Silverman - 1986 |

2619 | Equations of State Calculations by Fast Computing Machines - Metropolis, Rosenbluth, et al. - 1953 |

2433 | An Introduction to Probability Theory and Its Applications,” Vol - Feller - 1971 |

2293 | Genetic Algorithms +Data Structures =Evolution Programs - Michalewicz - 1992 |

1956 | Introduction to the Theory of Neural Computation - Hertz, Krogh, et al. - 1993 |

1792 | Generalized Additive Models - Hastie, Tibshirani - 1984 |

1734 | An Introduction to Genetic Algorithms - Mitchell - 1996 |

1697 | Judgment under Uncertainty: Heuristics and Biases - Kahneman, Slovic, et al. - 1986 |

1589 | Bayesian Data Analysis - Gelman, Carlin, et al. - 1995 |

1466 | Spline Models for Observational Data - Wahba - 1990 |

1460 | Statistical Decision Theory and Bayesian Analysis. 2nd edn - Berger - 1985 |

1414 | Monte Carlo Sampling Methods Using Markov Chains and Their - Hastings - 1970 |

1348 | Handbook of Genetic Algorithms - Davis, editor - 1991 |

1251 | Recognition and Neural Networks - Ripley |

1187 | Graphical models - Lauritzen - 1996 |

1070 | Quantum Field Theory and Critical Phenomena - Zinn-Justin - 1990 |

1004 | An introduction to Bayesian networks - Jensen - 1996 |

872 | Markov Chains for Exploring Posterior Distributions. The Annals of Statistics - Tierney - 1994 |

869 | Cross-validatory choice and assessment of statistical predictions - Stone - 1974 |

863 | Adaptive mixtures of local experts - Jacobs, Jordan, et al. - 1991 |

849 | Estimation of Dependence Based on Empirical Data - Vapnik - 2006 |

848 | Neuro-dynamic programming - Bertsekas, Tsitsiklis - 1996 |

821 | A view of the EM algorithm that justifies incremental, sparse, and other variants - Neal, Hinton - 1999 |

772 | Hierarchical mixtures of experts and the EM algorithm - Jordan, Jacobs - 1994 |

740 | Statistical analysis of finite mixture distributions - Titterington, Smith, et al. - 1985 |

721 | Networks for Approximation and Learning - Poggio, Girosi - 1990 |

672 | Convergence of Stochastic Processes - Pollard - 1984 |

659 | Bayesian learning for neural networks - Neal - 1996 |

656 | Applied Nonparametric Regression - Härdle - 1990 |

631 | An introduction to computational learning theory - Kearns, Vazirani - 1994 |

625 | Theory of statistics - Schervish - 1995 |

608 | Probabilistic Inference Using Markov Chain Monte Carlo Methods - Neal - 1993 |

598 | Bayesian interpolation - MacKay - 1992 |

567 | Nonparametric Regression and Generalized Linear Models - Green, Silverman - 1994 |

549 | Stochastic complexity - Rissanen - 1989 |

526 | Evolution and Optimum Seeking - Schwefel - 1996 |

494 | Monte Carlo methods - Hammersley, Handscomb - 1964 |

473 | Stochastic Simulation - Ripley - 1987 |

444 | Practical Bayesian framework of back propagation networks - MacKay - 1992 |

433 |
Simulated annealing and Boltzmann machines
- Aarts, Korst
- 1989
(Show Context)
Citation Context ... (A AND B) = 1 for CA = 1 or CB = 1; C (A OR B) = 8 ! : CA for CB = 1 6= CA ; CB for CA = 1 6= CB ; 1 for CA = CB = 1: C (NOT A) = 0 for CA = 1: and one finds that the functions on the whole interval =-=[0; 1]-=- are nonlinear. This representation is interesting in as far as the AND is linear and the nonlinearity of the OR can be implemented by just skipping functions with final C(f 0 ) = 1 from F 0 . We will... |