Robust randomized optimization with k nearest neighbors

DOI10.1142/S0219530519400086zbMath1430.68273OpenAlexW2979313717MaRDI QIDQ5236747

Ata Kabán, Henry W. J. Reeve

Publication date: 10 October 2019

Published in: Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219530519400086

zbMATH Keywords

metric spacesnonparametric methodsoptimization for machine learning

Mathematics Subject Classification ID

Nonparametric regression and quantile regression (62G08) Minimax procedures in statistical decision theory (62C20) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classification in general finite dimensional spaces with the \(k\)-nearest neighbor rule
• Robust optimization - a comprehensive survey
• Improving predictive inference under covariate shift by weighting the log-likelihood function
• Robust optimization-methodology and applications
• Optimal aggregation of classifiers in statistical learning.
• Deep vs. shallow networks: An approximation theory perspective
• Nonconvex Robust Optimization for Problems with Constraints
• Efficient Classification for Metric Data
• Deep distributed convolutional neural networks: Universality
• Deep learning in high dimension: Neural network expression rates for generalized polynomial chaos expansions in UQ
• Near-Optimal Sample Compression for Nearest Neighbors
• Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems
• Probability and Computing