Monotone classification with relative approximations
From MaRDI portal
Cites work
- A decomposition theorem for partially ordered sets
- A unified framework for approximating and clustering data
- Active Learning in the Non-realizable Case
- Agnostic active learning
- Agnostic proper learning of monotone functions: beyond the black-box correction barrier
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 6395191 (Why is no real title available?)
- Isotonic regression via partitioning
- Minimax analysis of active learning
- Monotonicity testing over general poset domains
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- On the Fourier spectrum of monotone functions
- Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids
- Properly learning monotone functions via local correction
- Relative (p, )-approximations in geometry
- Relative-error monotonicity testing
- Sampling Algorithms and Coresets for \ell_p Regression
- Smaller coresets for k-median and k-means clustering
- Smoothness, disagreement coefficient, and the label complexity of agnostic active learning
- Teaching Dimension and the Complexity of Active Learning
- Testing monotonicity
- Testing monotonicity
- Theory of Disagreement-Based Active Learning
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- Weighted isotonic regression under the L1 norm
This page was built for publication: Monotone classification with relative approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7404699)
