Active Nearest-Neighbor Learning in Metric Spaces
From MaRDI portal
Publication:4558521
zbMath1469.68091arXiv1605.06792MaRDI QIDQ4558521
Ruth Urner, Sivan Sabato, Leonid (Aryeh) Kontorovich
Publication date: 22 November 2018
Full work available at URL: https://arxiv.org/abs/1605.06792
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Nonparametric estimation (62G05) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (2)
Universal Bayes consistency in metric spaces ⋮ Exact lower bounds for the agnostic probably-approximately-correct (PAC) machine learning model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using the doubling dimension to analyze the generalization of learning algorithms
- Exponential bounds of mean error for the nearest neighbor estimates of regression functions
- Consistent nonparametric regression. Discussion
- The true sample complexity of active learning
- Fast learning rates in statistical inference through aggregation
- Rates of convergence in active learning
- Agnostic active learning
- Minimax Analysis of Active Learning
- Efficient Classification for Metric Data
- The Power of Localization for Efficiently Learning Linear Separators with Noise
- Discriminatory Analysis. Nonparametric Discrimination: Consistency Properties
- A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
- Generalization Bounds for K-Dimensional Coding Schemes in Hilbert Spaces
- Minimax Bounds for Active Learning
- Structural risk minimization over data-dependent hierarchies
- Rates of convergence of nearest neighbor estimation under arbitrary sampling
- Neural Network Learning
- Proximity Algorithms for Nearly Doubling Spaces
- Margin Based Active Learning
- Understanding Machine Learning
- Nearest neighbor pattern classification
- PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
- Adaptive metric dimensionality reduction
This page was built for publication: Active Nearest-Neighbor Learning in Metric Spaces