Pages that link to "Item:Q4986830"
From MaRDI portal
The following pages link to Randomized Kaczmarz Converges Along Small Singular Vectors (Q4986830):
Displaying 15 items.
- On the regularization effect of stochastic gradient descent applied to least-squares (Q2055514) (← links)
- Developing Kaczmarz method for solving Sylvester matrix equations (Q2094980) (← links)
- Eigenvector phase retrieval: recovering eigenvectors from the absolute value of their entries (Q2168926) (← links)
- On the convergence of randomized and greedy relaxation schemes for solving nonsingular linear systems of equations (Q2679678) (← links)
- Side effects of learning from low-dimensional data embedded in a Euclidean space (Q2687305) (← links)
- A weighted randomized Kaczmarz method for solving linear systems (Q4956926) (← links)
- Surrounding the solution of a linear system of equations from all sides (Q4997183) (← links)
- An Optimal Scheduled Learning Rate for a Randomized Kaczmarz Algorithm (Q5885816) (← links)
- A semi-randomized Kaczmarz method with simple random sampling for large-scale linear systems (Q6042632) (← links)
- Approximate Solutions of Linear Systems at a Universal Rate (Q6053419) (← links)
- Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency (Q6130543) (← links)
- Linearly convergent adjoint free solution of least squares problems by random descent (Q6141569) (← links)
- The method of randomized Bregman projections for stochastic feasibility problems (Q6156125) (← links)
- Randomized Kaczmarz algorithm with averaging and block projection (Q6181514) (← links)
- Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition (Q6202283) (← links)