scientific article; zbMATH DE number 6982985

zbMath1473.68162MaRDI QIDQ4558569

Sivan Sabato, Tom Hess

Publication date: 22 November 2018

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Who solved the secretary problem
• The true sample complexity of active learning
• Active learning using arbitrary binary valued queries
• Rates of convergence in active learning
• Agnostic active learning
• Submodular functions and optimization.
• 10.1162/153244302760185243
• Minimax Analysis of Active Learning
• Quickest online selection of an increasing subsequence of specified size
• Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack
• Teaching Dimension and the Complexity of Active Learning

This page was built for publication: