PulseAugur
EN
LIVE 07:27:15

New algorithm tackles high-dimensional data estimation with active subsampling

This paper introduces a novel K-step active subsampling algorithm designed for estimating an optimal individualized threshold in high-dimensional data under measurement constraints. The algorithm iteratively selects the most informative data points for labeling to minimize discrepancies between predicted and actual outcomes, particularly in scenarios where labeling is costly. Theoretical analysis indicates a sharp phase transition phenomenon related to the smoothness of the conditional density of the data. AI

RANK_REASON The cluster contains an academic paper detailing a new statistical methodology. [lever_c_demoted from research: ic=1 ai=0.4]

Read on arXiv stat.ML →

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →

COVERAGE [1]

  1. arXiv stat.ML TIER_1 English(EN) · Jingyi Duan, Lehao Fu, Yang Ning ·

    Active Subsampling for Measurement-Constrained M-Estimation of Individualized Thresholds with High-Dimensional Data

    arXiv:2411.13763v2 Announce Type: replace-cross Abstract: Measurement-constrained problems frequently arise in modern applications such as electronic health record studies. In such problems, despite the availability of large datasets, collecting labeled data can be highly costly …