Keywords
Affiliated Institutions
Related Publications
Neural Tangent Kernel: Convergence and Generalization in Neural Networks
At initialization, artificial neural networks (ANNs) are equivalent to Gaussian processes in the infinite-width limit, thus connecting them to kernel methods. We prove that the ...
Universality classes for asymptotic behavior of relaxation processes in systems with dynamical disorder: Dynamical generalizations of stretched exponential
The asymptotic behavior of multichannel parallel relaxation processes for systems with dynamical disorder is investigated in the limit of a very large number of channels. An ind...
On the Convergence Properties of the EM Algorithm
Two convergence aspects of the EM algorithm are studied: (i) does the EM algorithm find a local maximum or a stationary value of the (incomplete-data) likelihood function? (ii) ...
Penalized likelihood regression: General formulation and efficient approximation
Abstract The authors consider a formulation of penalized likelihood regression that is sufficiently general to cover canonical and noncanonical links for exponential families as...
Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
The Nelder--Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensional unconstrained minimization. Despite its widesprea...
Publication Info
- Year
- 1983
- Type
- article
- Volume
- 8
- Pages
- 179-186
- Citations
- 24
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.5186/aasfm.1983.0805