Interactive algorithms: pool, stream and precognitive stream

MaRDI QIDQ4558569zbMATH OpenFDO

Authors Sivan Sabato, Tom Hess

Publication date 22 November 2018

Full work available at URL http://jmlr.csail.mit.edu/papers/v18/16-424.html

zbMATH Keywords

active learninginteractive algorithmspool-basedstream-based

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Streaming adaptive submodular maximization
• Interactive Algorithms 2005 with Added Appendix
• Mathematical Foundations of Computer Science 2005
• Clustering with Interactive Feedback
• Active learning via perfect selective classification

Cites work

• Active learning using arbitrary binary valued queries
• Adaptive submodularity: theory and applications in active learning and stochastic optimization
• Agnostic active learning
• Approximation algorithms for stochastic submodular set cover with applications to Boolean function evaluation and min-knapsack
• Efficient active learning of halfspaces: an aggressive approach
• scientific article; zbMATH DE number 3383344 (Why is no real title available?)
• Minimax analysis of active learning
• Quickest online selection of an increasing subsequence of specified size
• Rates of convergence in active learning
• Submodular functions and optimization.
• Support vector machine active learning with applications to text classification
• Teaching Dimension and the Complexity of Active Learning
• The true sample complexity of active learning
• Who solved the secretary problem

This page was built for publication: Interactive algorithms: pool, stream and precognitive stream

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