Absolute convergence and error thresholds in non-active adaptive sampling

DOI10.1016/J.JCSS.2022.05.002MaRDI QIDQ2672944zbMATH OpenOpenAlexFDO

Authors Manuel Vilares Ferro, Víctor M. Darriba Bilbao, Jesús Vilares Ferro

Publication date 13 June 2022

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.jcss.2022.05.002

zbMATH Keywords

machine learning convergencenon-active adaptive samplingPOS tagging

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Rates of convergence in active learning
• scientific article; zbMATH DE number 2080438
• Sequential sampling techniques for algorithmic learning theory
• Minimax Bounds for Active Learning
• The true sample complexity of active learning

Cites work

• 10.1162/153244302760200678
• A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems
• Adaptive sampling methods for scaling up knowledge discovery algorithms
• Bagging predictors

Cited in

(1)

• Optimal convergence rates of high order Parzen windows with unbounded sampling

Describes a project that uses

Uses Software

• TreeTagger
• TnT
• SVMTool
• Stanford Tagger

This page was built for publication: Absolute convergence and error thresholds in non-active adaptive sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2672944)