The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Fast Curvature Matrix-Vector Products for Second-Order Gradient Descent
Abstract
We propose a generic method for iteratively approximating various second-order gradient steps—-Newton, Gauss-Newton, Levenberg-Marquardt, and natural gradient—-in linear time per iteration, using special curvature matrix-vector products that can be computed in O(n). Two recent acceleration techniques for on-line learning, matrix momentum and stochastic meta-descent (SMD), implement this approach. Since both were originally derived by very different routes, this offers fresh insight into their operation, resulting in further improvements to SMD.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An Algorithm for Least-Squares Estimation of Nonlinear Parameters
Marquardt, D. W. (1963) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0111030 · Cited by 30,728
Neural networks for pattern recognition
(1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,538
A method for the solution of certain non-linear problems in least squares
Levenberg, K. (1944) · Quarterly of Applied Mathematics · doi:10.1090/qam/10666 · Cited by 12,359
Natural Gradient Works Efficiently in Learning
Amari, S.-I. (1998) · Neural Computation · doi:10.1162/089976698300017746 · Cited by 2,681
Differential-Geometrical Methods in Statistics
Amari, S.-I. (1985) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-5056-2 · Cited by 1,673
Numerical recipes in C (2nd ed.): the art of scientific computing
Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (1992) · Cambridge University Press eBooks · Cited by 1,156
Fast Exact Multiplication by the Hessian
Pearlmutter, B. A. (1994) · Neural Computation · doi:10.1162/neco.1994.6.1.147 · Cited by 540
Training Multilayer Perceptrons with the Extended Kalman Algorithm
Singhal, S., & Wu, L. (1988) · neural information processing systems · Cited by 320
BACKPROPAGATION: PAST AND FUTURE
Werbos, P. J. (1988) · Cited by 224
Additive versus exponentiated gradient updates for linear prediction
Kivinen, J., & Warmuth, M. K. (1995) · Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 · doi:10.1145/225058.225121 · Cited by 223
Local gain adaptation in stochastic gradient descent
Schraudolph, N. N. (1999) · International Conference on Artificial Neural Networks · doi:10.1049/cp:19991170 · Cited by 180
Self-citationA Fast, Compact Approximation of the Exponential Function
Schraudolph, N. N. (1999) · Neural Computation · doi:10.1162/089976699300016467 · Cited by 160
Self-citationExponentially many local minima for single neurons
Auer, P. L., Herbster, M., & Warmuth, M. K. (1995) · Cited by 115
Complexity Issues in Natural Gradient Descent Method for Training Multilayer Perceptrons
Yang, H. H., & Амари, Ш.-И. (1998) · Neural Computation · doi:10.1162/089976698300017007 · Cited by 73
On-line learning in changing environments with applications in supervised and unsupervised learning
Murata, N., Kawanabe, M., Ziehe, A., Müller, K., & Амари, Ш.-И. (2002) · Neural Networks · doi:10.1016/s0893-6080(02)00060-6 · Cited by 60
Gradient-Based Manipulation of Nonparametric Entropy Estimates
Schraudolph, N. N. (2004) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.828766 · Cited by 38
Self-citationMøller, M. F. (1993) · DAIMI Report Series · doi:10.7146/dpb.v22i432.6748 · Cited by 28
Tempering Backpropagation Networks: Not All Weights are Created Equal
Schraudolph, N. N., B, T. J. S. A., & Gmbh, E. B. (1996) · Cited by 23
Self-citation
Cited by
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
Graves, A., Fernández, S., Gomez, F., & Schmidhuber, J. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143891 · Cited by 5,370
Supervised Sequence Labelling with Recurrent Neural Networks
Graves, A. (2012) · Studies in Computational Intelligence · doi:10.1007/978-3-642-24797-2 · Cited by 3,120
A survey on deep learning and its applications
Dong, S., Wang, P., & Abbas, K. (2021) · Computer Science Review · doi:10.1016/j.cosrev.2021.100379 · Cited by 1,800
Framewise phoneme classification with bidirectional LSTM networks
Graves, A., & Schmidhuber, J. (2006) · Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005. · doi:10.1109/ijcnn.2005.1556215 · Cited by 618
Metadata
- Authors
- Schraudolph, N. N.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 2002-07-01
- Volume
- 14
- Issue
- 7
- Pages
- 1723-1738
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2130984546
- Cited by
- 265
- References
- 18
- FWCI
- 4.01
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.