Search arXivSearch

arXiv · 2309.02476

Optimal Sample Selection Through Uncertainty Estimation and Its Application in Deep Learning

Abstract

Modern deep learning heavily relies on large labeled datasets, which often comse with high costs in terms of both manual labeling and computational resources. To mitigate these challenges, researchers have explored the use of informative subset selection techniques, including coreset selection and active learning. Specifically, coreset selection involves sampling data with both input ($\bx$) and output ($\by$), active learning focuses solely on the input data ($\bx$). In this study, we present a theoretically optimal solution for addressing both coreset selection and active learning within the context of linear softmax regression. Our proposed method, COPS (unCertainty based OPtimal Sub-sampling), is designed to minimize the expected loss of a model trained on subsampled data. Unlike existing approaches that rely on explicit calculations of the inverse covariance matrix, which are not easily applicable to deep learning scenarios, COPS leverages the model's logits to estimate the sampling ratio. This sampling ratio is closely associated with model uncertainty and can be effectively applied to deep learning tasks. Furthermore, we address the challenge of model sensitivity to misspecification by incorporating a down-weighting approach for low-density samples, drawing inspiration from previous works. To assess the effectiveness of our proposed method, we conducted extensive empirical experiments using deep neural networks on benchmark datasets. The results consistently showcase the superior performance of COPS compared to baseline methods, reaffirming its efficacy.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yong Lin, Chen Liu, Chenlu Ye, Qing Lian, Yuan Yao, Tong Zhang. 2023-09-05. Optimal Sample Selection Through Uncertainty Estimation and Its Application in Deep Learning. https://arxiv.org/abs/2309.02476

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Neural Operators for Nonlinear Functionals on RKHS

Motivated by the abundance of functional data, such as time series and images, we study the approximation and statistical learning of nonlinear functionals defined on reproducing kernel Hilbert spaces (RKHSs) using neural networks. By leveraging interpolating orthogonal projections in RKHSs, we use finitely many point evaluations in place of integration-based basis function expansions. This leads to a simpler and more flexible neural-network architecture that remains applicable even when the data domain or the underlying kernel is not explicitly known. We establish universal approximation results and derive explicit kernel-dependent approximation rates and parameter-complexity bounds for RKHSs induced by inverse multiquadric, Gaussian, and Sobolev kernels. We also apply our results to the regression maps arising in generalized functional linear models. Finally, we analyze the generalization properties of the resulting neural-network classes and establish finite-sample guarantees for learning nonlinear functionals.

stat.ML

SAILS: Surrogate-based Analysis of Interactions via Local Effect Smooths

Feature interactions drive much of the predictive power of machine learning models, yet existing explanation methods only detect and quantify interactions without revealing their functional form, or visualize only restricted interaction types. We propose Surrogate-based Analysis of Interactions via Local Effect Smooths (SAILS), a model-agnostic framework that analyzes pairwise interactions through generalized additive model (GAM) surrogates fitted to the local effects of a black-box model. For each interval of a feature of interest, the surrogate smooth terms isolate the interaction components on derivative level, enabling (i) interaction detection through a heuristic derived from significance tests on smooth terms, (ii) interaction form categorization into linear, product-separable, and non-product-separable types, and (iii) tailored, interpretable visualizations for each interaction type. We empirically validate the framework through controlled simulations and a real-world task, showing its effectiveness for pairwise interactions, with limitations under strong feature correlations and higher-order interactions. SAILS fills a notable gap in the eXplainable AI (XAI) toolbox, going beyond detecting interactions alone to characterizing their functional form.

stat.ML

Multi-source conformal prediction: leveraging heterogeneity via localization

Many modern prediction tasks involve data from multiple heterogeneous sources, while the test distribution may differ substantially from any individual source. Although heterogeneity poses challenges, it also offers an opportunity: different sources may provide complementary information, with some regions of the feature space better represented in one source than another. We propose Multi-Source Randomly Localized Conformal Prediction (MS-RLCP), which builds on the local coverage properties of randomly localized conformal prediction (RLCP) (Hore and Barber, 2025) and extends it to multiple sources through data-adaptive source selection. Under the widely adopted assumption of a shared response distribution conditional on the features across sources and the test population, we establish finite-sample coverage bounds using an interpretable notion of envelope distribution that captures their aggregate feature-space representation. Our analysis allows the test feature distribution to be absolutely continuous with respect to the envelope, extending beyond mixtures of source distributions. Under additional regularity conditions, we also establish asymptotic test-conditional coverage. Simulations and real-world experiments demonstrate the effectiveness of MS-RLCP across varying levels of data heterogeneity.

stat.ML