中文
相关论文

相关论文: Poisson Reweighted Laplacian Uncertainty Sampling …

200 篇论文

Uncertainty Sampling is an Active Learning strategy that aims to improve the data efficiency of machine learning models by iteratively acquiring labels of data points with the highest uncertainty. While it has proven effective for…

This paper studies graph-based active learning, where the goal is to reconstruct a binary signal defined on the nodes of a weighted graph, by sampling it on a small subset of the nodes. A new sampling algorithm is proposed, which…

机器学习 · 计算机科学 2016-05-19 Eyal En Gad , Akshay Gadde , A. Salman Avestimehr , Antonio Ortega

We consider the problem of offline, pool-based active semi-supervised learning on graphs. This problem is important when the labeled data is scarce and expensive whereas unlabeled data is easily available. The data points are represented by…

机器学习 · 计算机科学 2014-05-20 Akshay Gadde , Aamir Anis , Antonio Ortega

Graph Neural Networks (GNNs) have garnered widespread attention for their potential to address the challenges posed by graph representation learning, which face complex graph-structured data across various domains. However, due to the…

机器学习 · 计算机科学 2024-08-23 Hang Gao , Jiaguo Yuan , Jiangmeng Li , Peng Qiao , Fengge Wu , Changwen Zheng , Huaping Liu

In recent years, learning-based control in robotics has gained significant attention due to its capability to address complex tasks in real-world environments. With the advances in machine learning algorithms and computational capabilities,…

机器人学 · 计算机科学 2023-05-30 Taekyung Kim , Jungwi Mun , Junwon Seo , Beomsu Kim , Seongil Hong

The success of deep active learning hinges on the choice of an effective acquisition function, which ranks not yet labeled data points according to their expected informativeness. Many acquisition functions are (partly) based on the…

机器学习 · 计算机科学 2023-11-08 Mohamadsadegh Khosravani , Sandra Zilles

In reinforcement learning, the graph Laplacian has proved to be a valuable tool in the task-agnostic setting, with applications ranging from skill discovery to reward shaping. Recently, learning the Laplacian representation has been framed…

Offline reinforcement learning (RL) enables policy learning from static data but often suffers from poor coverage of the state-action space and distributional shift problems. This problem can be addressed by allowing limited online…

机器学习 · 计算机科学 2026-02-03 Soumyadeep Roy , Shashwat Kushwaha , Ambedkar Dukkipati

We consider an autonomous exploration problem in which a range-sensing mobile robot is tasked with accurately mapping the landmarks in an a priori unknown environment efficiently in real-time; it must choose sensing actions that both curb…

机器人学 · 计算机科学 2020-07-27 Fanfei Chen , John D. Martin , Yewei Huang , Jinkun Wang , Brendan Englot

Active Learning (AL) addresses the crucial challenge of enabling machines to efficiently gather labeled examples through strategic queries. Among the many AL strategies, Uncertainty Sampling (US) stands out as one of the most widely…

机器学习 · 计算机科学 2025-06-24 Po-Yi Lu , Yi-Jie Cheng , Chun-Liang Li , Hsuan-Tien Lin

Active Learning (AL) has emerged as a powerful approach for minimizing labeling costs by selectively sampling the most informative data for neural network model development. Effective AL for large-scale vision-language models necessitates…

计算机视觉与模式识别 · 计算机科学 2025-07-30 Athmanarayanan Lakshmi Narayanan , Amrutha Machireddy , Ranganath Krishnan

Real-world training data is often noisy; for example, human annotators assign conflicting class labels to the same instances. Partial-label learning (PLL) is a weakly supervised learning paradigm that allows training classifiers in this…

机器学习 · 计算机科学 2025-10-27 Tobias Fuchs , Florian Kalinke

Common acquisition functions for active learning use either uncertainty or diversity sampling, aiming to select difficult and diverse data points from the pool of unlabeled data, respectively. In this work, leveraging the best of both…

计算与语言 · 计算机科学 2021-09-09 Katerina Margatina , Giorgos Vernikos , Loïc Barrault , Nikolaos Aletras

Selecting exploratory actions that generate a rich stream of experience for better learning is a fundamental challenge in reinforcement learning (RL). An approach to tackle this problem consists in selecting actions according to specific…

机器学习 · 计算机科学 2023-06-12 Martin Klissarov , Marlos C. Machado

Current person image retrieval methods have achieved great improvements in accuracy metrics. However, they rarely describe the reliability of the prediction. In this paper, we propose an Uncertainty-Aware Learning (UAL) method to remedy…

计算机视觉与模式识别 · 计算机科学 2022-10-25 Zhaopeng Dou , Zhongdao Wang , Weihua Chen , Yali Li , Shengjin Wang

Exploration in reinforcement learning is a challenging problem: in the worst case, the agent must search for high-reward states that could be hidden anywhere in the state space. Can we define a more tractable class of RL problems, where the…

机器学习 · 计算机科学 2021-07-20 Kevin Li , Abhishek Gupta , Ashwin Reddy , Vitchyr Pong , Aurick Zhou , Justin Yu , Sergey Levine

Typically, a supervised learning model is trained using passive learning by randomly selecting unlabelled instances to annotate. This approach is effective for learning a model, but can be costly in cases where acquiring labelled instances…

机器学习 · 计算机科学 2024-03-05 Zan-Kai Chong , Hiroyuki Ohsaki , Bok-Min Goi

Recent studies in active learning, particularly in uncertainty sampling, have focused on the decomposition of model uncertainty into reducible and irreducible uncertainties. In this paper, the aim is to simplify the computational process…

机器学习 · 计算机科学 2024-05-28 Arthur Hoarau , Vincent Lemaire , Arnaud Martin , Jean-Christophe Dubois , Yolande Le Gall

Active Learning (AL) is increasingly important in a broad range of applications. Two main AL principles to obtain accurate classification with few labeled data are refinement of the current decision boundary and exploration of poorly…

机器学习 · 计算机科学 2012-10-19 Jens Roeder , Boaz Nadler , Kevin Kunzmann , Fred A. Hamprecht

This paper studies graphical model selection, i.e., the problem of estimating a graph of statistical relationships among a collection of random variables. Conventional graphical model selection algorithms are passive, i.e., they require all…

机器学习 · 统计学 2014-04-15 Divyanshu Vats , Robert D. Nowak , Richard G. Baraniuk
‹ 上一页 1 2 3 10 下一页 ›