Related Experiment Videos
On stochastic approximation algorithms for classes of PAC learning problems
N V Rao1, V R Uppuluri, E M Oblow
1Center for Eng. Syst. Adv. Res., Oak Ridge Nat. Lab., TN.
Abstract:
The classical stochastic approximation methods are shown to yield algorithms to solve several formulations of the PAC learning problem defined on the domain [0,1](d). Under some smoothness conditions on the probability measure functions, simple algorithms to solve some PAC learning problems are proposed based on networks of nonpolynomial units (e.g. artificial neural networks). Conditions on the sizes of the samples required to ensure the error bounds are derived using martingale inequalities.
Related Concept Videos
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Application of Linearization and Approximation
Statically Indeterminate Problem Solving
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length, the...
Propagation of Uncertainty from Random Error
Linear Approximations