Pages that link to "Item:Q2252501"
From MaRDI portal
The following pages link to Convergence rates of learning algorithms by random projection (Q2252501):
Displaying 15 items.
- Two-dimensional random projection (Q537260) (← links)
- An algorithmic theory of learning: robust concepts and random projection (Q851862) (← links)
- On orthogonal projections for dimension reduction and applications in augmented target loss functions for learning problems (Q1988352) (← links)
- Random projections as regularizers: learning a linear discriminant from fewer observations than dimensions (Q2353006) (← links)
- Rates of convergence in active learning (Q2429933) (← links)
- Convergence analysis of Chauvin's PCA learning algorithm with a constant learning rate (Q2466667) (← links)
- Global convergence of a PCA learning algorithm with a constant learning rate (Q2469892) (← links)
- An algorithmic theory of learning: Robust concepts and random projection (Q2499543) (← links)
- Dimension-Adaptive Bounds on Compressive FLD Classification (Q2859225) (← links)
- The coefficient regularized regression with random projection (Q2911899) (← links)
- (Q3609715) (← links)
- (Q3725366) (← links)
- On convergence rate of projection neural networks (Q5273664) (← links)
- Learning Theory (Q5473618) (← links)
- Learning convergence of CMAC algorithm (Q5944446) (← links)
