Pages that link to "Item:Q2788421"
From MaRDI portal
The following pages link to Minimax analysis of active learning (Q2788421):
Displaying 19 items.
- Localization of VC classes: beyond local Rademacher complexities (Q1663641) (← links)
- Cautious active clustering (Q2036490) (← links)
- When are epsilon-nets small? (Q2304628) (← links)
- On density of subgraphs of halved cubes (Q2311351) (← links)
- Nuclear discrepancy for single-shot batch active learning (Q2320585) (← links)
- Agnostic active learning (Q2517826) (← links)
- On Version Space Compression (Q2830266) (← links)
- Refined error bounds for several learning algorithms (Q2834450) (← links)
- Active Learning for Enumerating Local Minima Based on Gaussian Process Derivatives (Q3386417) (← links)
- Active Nearest-Neighbor Learning in Metric Spaces (Q4558521) (← links)
- (Q4558569) (← links)
- (Q4633044) (← links)
- Minimax robust active learning for approximately specified regression models (Q4960910) (← links)
- (Q5381119) (← links)
- Minimax Bounds for Active Learning (Q5432422) (← links)
- Learning Theory (Q5473614) (← links)
- Poisson Reweighted Laplacian Uncertainty Sampling for Graph-Based Active Learning (Q6151664) (← links)
- Realizable learning is all you need (Q6566462) (← links)
- Recent advances in scaling-down sampling methods in machine learning (Q6607064) (← links)
