Linear neural networks revisited: from PageRank to family happiness
From MaRDI portal
Publication:1979855
DOI10.1007/978-3-030-65324-8_13zbMATH Open1472.62143OpenAlexW83490742MaRDI QIDQ1979855FDOQ1979855
Recommendations
- Linearized two-layers neural networks in high dimension
- A neural network representation of linear programming
- scientific article; zbMATH DE number 1150492
- scientific article; zbMATH DE number 1086976
- Linear programming, recurrent associative memories, and feed-forward neural networks
- Neural networks, linear functions and neglected nonlinearity
- Recurrent neural networks for linear programming: Analysis and design principles
- scientific article; zbMATH DE number 759415
- Bounds on the complexity of neural‐network models and comparison with linear methods
Cites work
- scientific article; zbMATH DE number 3614533 (Why is no real title available?)
- scientific article; zbMATH DE number 3276284 (Why is no real title available?)
- scientific article; zbMATH DE number 3361657 (Why is no real title available?)
- Decision making beyond arrow's “impossibility theorem,” with the analysis of effects of collusion and mutual attraction
- FUZZY DYNAMIC LOGIC
- Google's PageRank and beyond. The science of search engine rankings
- Pattern recognition and machine learning.
- Utility functionals with nonpaternalistic intergenerational altruism
This page was built for publication: Linear neural networks revisited: from PageRank to family happiness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1979855)
