Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. Artificial Intelligence Lab Publications
  4. AI Memos (1959 - 2004)
  5. A Nondeterministic Minimization Algorithm

A Nondeterministic Minimization Algorithm

Thumbnail Image
Download
Name

AIM-1254.pdf

Size

480.97 KB

Format

Adobe PDF

Checksum (MD5)

39bb27aa4d0738ee144f7122c4e8e767

Thumbnail Image
Download
Name

AIM-1254.ps

Size

1.18 MB

Format

PostScript

Checksum (MD5)

b969006162b8a8dcc08db7646ca56c14

Author(s)
Caprile, Bruno
•
Girosi, Federico
Date Issued
September 1, 1990
Series/Report no.
AIM-1254
Abstract
The problem of minimizing a multivariate function is recurrent in many disciplines as Physics, Mathematics, Engeneering and, of course, Computer Science. In this paper we describe a simple nondeterministic algorithm which is based on the idea of adaptive noise, and that proved to be particularly effective in the minimization of a class of multivariate, continuous valued, smooth functions, associated with some recent extension of regularization theory by Poggio and Girosi (1990). Results obtained by using this method and a more traditional gradient descent technique are also compared.
Persistent DSpace Link
http://hdl.handle.net/1721.1/6560
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.