Learning without loss
From MaRDI portal
Publication:2138443
DOI10.1186/s13663-021-00697-1OpenAlexW3185552720MaRDI QIDQ2138443
Publication date: 12 May 2022
Published in: Fixed Point Theory and Algorithms for Sciences and Engineering (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.00493
projection methodmachine learningartificial neural networknonnegative matrix factorizationfixed-point algorithmDouglas-Rachforddivide and concur
Related Items (2)
The projection onto the cross ⋮ Projections onto hyperbolas or bilinear constraint sets in Hilbert spaces
Uses Software
Cites Work
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Heuristics for exact nonnegative matrix factorization
- On the nonnegative rank of distance matrices
- The Douglas-Rachford algorithm for the case of the sphere and the line
- The Douglas–Rachford Algorithm in the Absence of Convexity
- Phase Retrieval via Wirtinger Flow: Theory and Algorithms
- On the Complexity of Nonnegative Matrix Factorization
- Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
- The Complexity of Bit Retrieval
- Projecting onto the Intersection of a Cone and a Sphere
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Learning without loss