Pages that link to "Item:Q5348776"
From MaRDI portal
The following pages link to Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries (Q5348776):
Displaying 5 items.
- Efficiency of the weak Rescaled Pure Greedy Algorithm (Q5010120) (← links)
- Unified error estimate for weak biorthogonal Greedy algorithms (Q5097875) (← links)
- Randomized approximation numbers on Besov classes with mixed smoothness (Q5117178) (← links)
- Compact dictionary pair learning and refining based on principal components analysis (Q5236781) (← links)
- Optimality of the rescaled pure greedy learning algorithms (Q5880599) (← links)
