The issue of correctness in the context of a certain style of program transformation is investigated. This style is characterised by the fully automated application of large numbe...
Stephen Kilpatrick, Maurice Clint, Peter Kilpatric...
We present a statistical method that PAC learns the class of stochastic perceptrons with arbitrary monotonic activation function and weights wi {-1, 0, +1} when the probability d...
The cross-entropy method (CE) developed by R. Rubinstein is an elegant practical principle for simulating rare events. The method approximates the probability of the rare event by...
Identifiability becomes an essential requirement for learning machines when the models contain physically interpretable parameters. This paper presents two approaches to examining...
Abstract. We deal with duality for almost convex finite dimensional optimization problems by means of the classical perturbation approach. To this aim some standard results from th...