scientific article; zbMATH DE number 7064045
From MaRDI portal
Publication:5381119
zbMath1489.68227arXiv1703.01014MaRDI QIDQ5381119
Hal Daumé, John Langford, Tzu-Kuo Huang, Akshay Krishnamurthy, Alekh Agarwal
Publication date: 7 June 2019
Full work available at URL: https://arxiv.org/abs/1703.01014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
statistical learning theoryactive learningstructured predictioncost-sensitive learningoracle-based algorithms
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (4)
Robust cost-sensitive kernel method with Blinex loss and its applications in credit risk evaluation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of hierarchical classification across different application domains
- Learning noisy linear classifiers via adaptive and selective sampling
- Empirical entropy, minimax regret and minimax risk
- Risk bounds for statistical learning
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
- Smooth discrimination analysis
- Optimal aggregation of classifiers in statistical learning.
- Search-based structured prediction
- Surrogate losses in passive and active learning
- Agnostic active learning
- Minimax Analysis of Active Learning
- On Martingale Extensions of Vapnik–Chervonenkis Theory with Applications to Online Learning
- Active Learning
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Theory of Disagreement-Based Active Learning
- Plug-in Approach to Active Learning
- Margin Based Active Learning
- Learning Theory
This page was built for publication:
