Pages that link to "Item:Q2111477"
From MaRDI portal
The following pages link to From inexact optimization to learning via gradient concentration (Q2111477):
Displaying 12 items.
- Concentration estimates for learning with \(\ell ^{1}\)-regularizer and data dependent hypothesis spaces (Q550498) (← links)
- Approximation and learning of convex superpositions (Q1370865) (← links)
- Special issue for SIMAI 2020-2021: large-scale optimization and applications (Q2111463) (← links)
- (Q3979271) (← links)
- The importance of convexity in learning with squared loss (Q4701173) (← links)
- Gradient-Based Discrete-Time Concurrent Learning for Standalone Function Approximation (Q5125479) (← links)
- (Q5149018) (← links)
- A Note on Lewicki-Sejnowski Gradient for Learning Overcomplete Representations (Q5453531) (← links)
- Multilevel Fine-Tuning: Closing Generalization Gaps in Approximation of Solution Maps under a Limited Budget for Training Data (Q5857926) (← links)
- Implicit regularization with strongly convex bias: Stability and acceleration (Q5873931) (← links)
- Towards an automatic uncertainty compiler (Q6178702) (← links)
- From inexact optimization to learning via gradient concentration (Q6369924) (← links)
