Optimal sample selection through uncertainty estimation and its application in deep learning
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2033345 (Why is no real title available?)
- A unified framework for approximating and clustering data
- Bandit algorithms
- Core vector machines: fast SVM training on very large data sets
- Fast approximation of matrix coherence and statistical leverage
- Faster least squares approximation
- Finite-sample equivalence in statistical models for presence-only data
- LSRN: A parallel iterative solver for strongly over- or underdetermined systems
- Local uncertainty sampling for large-scale multiclass logistic regression
- Mathematical Analysis of Machine Learning Algorithms
- More efficient estimation for logistic regression with optimal subsamples
- Optimal subsampling for large sample logistic regression
- Optimal subsampling for quantile regression in big data
- Optimal subsampling for softmax regression
- Regret analysis of stochastic and nonstochastic multi-armed bandit problems
- Sampling With Replacement vs Poisson Sampling: A Comparative Study in Optimal Subsampling
- Smaller coresets for \(k\)-median and \(k\)-means clustering
- The fast Cauchy transform and faster robust linear regression
- Training Gaussian mixture models at scale via coresets
- User-friendly tail bounds for sums of random matrices
This page was built for publication: Optimal sample selection through uncertainty estimation and its application in deep learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6887437)
