paper-with-me

홈 › Papers

Online Active Learning with Surrogate Loss Functions

2021-12-01 · NeurIPS 2021 12 · Giulia Desalvo, Claudio Gentile, Tobias Sommer Thune

We derive a novel active learning algorithm in the streaming setting for binary classification tasks. The algorithm leverages weak labels to minimize the number of label requests, and trains a model to optimize a surrogate loss on a resulting set of labeled and weak-labeled points. Our algorithm jointly admits two crucial properties: theoretical guarantees in the general agnostic setting and a strong empirical performance. Our theoretical analysis shows that the algorithm attains favorable generalization and label complexity bounds, while our empirical study on 18 real-world datasets demonstrate that the algorithm outperforms standard baselines, including the Margin Algorithm, or Uncertainty Sampling, a high-performing active learning algorithm favored by practitioners.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Active LearningBinary Classification

Similar Papers 제목 키워드 기반

Surrogate Losses in Passive and Active Learning

2012-07-16 · Steve Hanneke, Liu Yang

Active learning is a type of sequential design for supervised machine learning, in which the learning algorithm sequentially requests the labels of selected instances from a large pool of unlabeled data points. The objec…

Active Learning

Locality-aware Surrogates for Gradient-based Black-box Optimization

2025-01-31 · Ali Momeni, Stefan Uhlich, Arun Venkitaraman, Chia-Yu Hsieh 외

In physics and engineering, many processes are modeled using non-differentiable black-box simulators, making the optimization of such functions particularly challenging. To address such cases, inspired by the Gradient Th…

Computational Efficiency

RONAALP: Reduced-Order Nonlinear Approximation with Active Learning Procedure

2023-11-17 · Clément Scherding, Georgios Rigas, Denis Sipp, Peter J Schmid 외

Many engineering applications rely on the evaluation of expensive, non-linear high-dimensional functions. In this paper, we propose the RONAALP algorithm (Reduced Order Nonlinear Approximation with Active Learning Proced…

Active Learning

Universal Online Convex Optimization with $1$ Projection per Round

2024-05-30 · Wenhao Yang, Yibo Wang, Peng Zhao, Lijun Zhang

To address the uncertainty in function types, recent progress in online convex optimization (OCO) has spurred the development of universal algorithms that simultaneously attain minimax rates for multiple types of convex …

Active learning for structural reliability analysis with multiple limit state functions through variance-enhanced PC-Kriging surrogate models

2023-02-23 · J. Moran A., P. G. Morato, P. Rigo

Existing active strategies for training surrogate models yield accurate structural reliability estimates by aiming at design space regions in the vicinity of a specified limit state function. In many practical engineerin…

Active Learning