Eigenvalue problems via the multiplicative weights update method
From MaRDI portal
Cites work
- A decision-theoretic generalization of on-line learning and an application to boosting
- A simplified neuron model as a principal component analyzer
- Expander flows, geometric embeddings and graph partitioning
- First-order methods in optimization
- Globally solving the trust region subproblem using simple first-order methods
- scientific article; zbMATH DE number 5957285 (Why is no real title available?)
- scientific article; zbMATH DE number 5485455 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Numerical methods for large eigenvalue problems
- On stochastic approximation of the eigenvectors and eigenvalues of the expectation of a random matrix
- Online learning and online convex optimization
- Online PCA with optimal regret
- Online Variance Minimization
- Randomized online PCA algorithms with regret bounds that are logarithmic in the dimension
- The multiplicative weights update method: a meta-algorithm and applications
- The weighted majority algorithm
- Tight query complexity lower bounds for PCA via finite sample deformed Wigner law
This page was built for publication: Eigenvalue problems via the multiplicative weights update method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6890091)