通常,监督学习模型通过被动学习进行训练,即随机选择未标注实例进行标注。这种方法对于学习模型是有效的,但在获取标注实例成本高昂的情况下可能代价很大。例如,在初始数据收集期间,从涌入收件箱的数千封电子邮件(未标注实例)中手动识别垃圾邮件(标注实例)可能非常耗时。一般而言,我们用不确定性采样来应对上述场景,这是一种主动学习方法,通过使用比被动学习更少的标注实例来提高监督学习的效率。给定一个未标注数据池,不确定性采样会查询预测概率 p 落入不确定区域(即 $p \approx 0.5$)的实例的标签。然后,新获得的标签会被添加到现有标注数据池中,以学习新模型。尽管如此,不确定性采样的性能容易受到不可预测响应区域(AUR)和数据集性质的影响。在没有关于新数据集的先验知识的情况下,很难决定应使用被动学习还是不确定性采样。为解决这一问题,我们提出了钟形曲线采样,该方法采用钟形曲线权重函数来获取新标签。钟形曲线以 p=0.5 为中心,因此钟形曲线采样在大多数时候会选择预测值处于不确定区域的实例,同时不会忽略其余实例。仿真结果表明,在具有不同性质且包含 AUR 的数据集上,钟形曲线采样在大多数时候都优于不确定性采样和被动学习。
英文摘要:
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 is expensive. For example, it can be time-consuming to manually identify spam mails (labelled instances) from thousands of emails (unlabelled instances) flooding an inbox during initial data collection. Generally, we answer the above scenario with uncertainty sampling, an active learning method that improves the efficiency of supervised learning by using fewer labelled instances than passive learning. Given an unlabelled data pool, uncertainty sampling queries the labels of instances where the predicted probabilities, p, fall into the uncertainty region, i.e., $p \approx 0.5$. The newly acquired labels are then added to the existing labelled data pool to learn a new model. Nonetheless, the performance of uncertainty sampling is susceptible to the area of unpredictable responses (AUR) and the nature of the dataset. It is difficult to determine whether to use passive learning or uncertainty sampling without prior knowledge of a new dataset. To address this issue, we propose bell curve sampling, which employs a bell curve weight function to acquire new labels. With the bell curve centred at p=0.5, bell curve sampling selects instances whose predicted values are in the uncertainty area most of the time without neglecting the rest. Simulation results show that, most of the time bell curve sampling outperforms uncertainty sampling and passive learning in datasets of different natures and with AUR.
Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
Tencent Quantum Laboratory(腾讯量子实验室);HUN-REN Alfréd Rényi Institute of Mathematics(匈牙利冯·诺依曼数学研究所);HUN-REN Institute for Computer Science and Control(匈牙利计算机科学与控制研究所);Centre for Quantum Technologies(量子技术中心);National University of Singapore(新加坡国立大学);CNRS, IRIF, Université Paris Cité(法国国家科学研究中心、IRIF、巴黎Cité大学)
TS-UCB: Improving on Thompson Sampling With Little to No Additional Computation
Massachusetts Institute of Technology(麻省理工学院)
汤普森抽样已经成为一种普遍存在的方法,在线决策问题的强盗反馈。汤普森抽样算法的关键任务是从最优行为的后验中抽取样本。我们提出了一种替代的手臂选择规则,我们称之为TS-UCB,需要微不足道的额外计算工作,但提供显着的性能改善相对于汤普森采样。在每一步中,TS-UCB使用两个成分计算每组的分数:后验样本和置信上限。TS-UCB可用于这两个量可用的任何设置中,并且它在作为输入的后验样本数量方面是灵活的。TS-UCB在一套全面的合成和真实世界的数据集上实现了大幅降低的遗憾,包括来自Yahoo!以及Riquelme et al.(2018)提出的深度强盗套件中的一套基准数据集。最后,从理论的角度来看,我们建立了最优后悔保证TS-UCB的K-臂和线性强盗模型。
Ranked Set Sampling-Based Multilayer Perceptron: Improving Generalization via Variance-Based Bounds
Institute of Big Data Science and Industry(大数据科学与产业研究院);Shanxi University(山西大学);Key Laboratory of Evolutionary Science Intelligence of Shanxi Province(山西省进化智能重点实验室)
Improving Decoupled Posterior Sampling for Inverse Problems using Data Consistency Constraint
ZJU-UIUC Institute(ZJU-UIUC联合学院);Zhejiang University(浙江大学);School of Information Science and Technology(信息科学与技术学院);Tsinghua University(清华大学);Institute for Physics of Intelligence(智能物理研究所);The University of Tokyo(东京大学)
Improving Gradient-guided Nested Sampling for Posterior Inference
Mila – Québec Artificial Intelligence Institute(米拉-魁北克人工智能研究所);Université de Montréal(蒙特利尔大学);Ciela Institute(谢拉研究所);CCA – Flatiron Institute(计算天体物理学中心-弗拉蒂伦研究所);Cavendish Laboratory(卡文迪什实验室);Kavli Institute for Cosmology(卡夫利宇宙学研究所);Gonville and Caius College, University of Cambridge(剑桥大学冈维尔与凯斯学院);Canadian Institute for Advanced Research (CIFAR)(加拿大高等研究院)
Improving Sampling Accuracy of Stochastic Gradient MCMC Methods via Non-uniform Subsampling of Gradients
Georgia Institute of Technology(佐治亚理工学院);Google Inc.(谷歌公司);The Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳))
许多马尔可夫链蒙特卡罗(MCMC)方法利用目标分布的势函数的梯度信息来有效地探索样本空间。然而,计算梯度对于大规模应用(诸如当代机器学习中的那些应用)而言通常在计算上是昂贵的。随机梯度(SG-)MCMC方法通常通过均匀子采样的数据点通过随机梯度来近似梯度,并且实现了提高的计算效率,但是以引入采样误差为代价。我们提出了一种非均匀子采样方案,以提高采样精度。提出的指数加权随机梯度(EWSG)的设计,使一个非均匀SG-MCMC方法模仿的批量梯度MCMC方法的统计行为,因此,由于SG近似的不准确性减少。EWSG不同于经典的方差缩减(VR)技术,因为它关注的是整个分布而不仅仅是方差;尽管如此,它的局部方差也被证明了。EWSG也可以被看作是重要性采样思想的扩展,成功的随机梯度为基础的优化,采样任务。在EWSG的实际实现中,非均匀子采样通过数据索引上的Metropolis-Hastings链有效地执行,该链与MCMC算法耦合。数值实验不仅证明了EWSG的有效性,而且还指导超参数的选择,并验证我们的\emph{non-asymptotic global error bound},尽管在实现中的近似。值得注意的是,虽然统计精度得到了提高,但收敛速度可以与统一版本相媲美,这使得EWSG成为VR的实用替代方案(但EWSG和VR也可以组合)。
Ten Words Only Still Help: Improving Black-Box AI-Generated Text Detection via Proxy-Guided Efficient Re-Sampling
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences(中国科学院智能信息处理重点实验室);Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所);University of Chinese Academy of Sciences(中国科学院大学);Xi’an Jiaotong University(西安交通大学)
PANDAS: Improving Many-shot Jailbreaking via Positive Affirmation, Negative Demonstration, and Adaptive Sampling
University of Toronto, Vector Institute(多伦多大学,向量研究所);University of Oxford(牛津大学);Polytechnique Montréal, Mila - Quebec AI Institute, University of Toronto(蒙特利尔理工学院,魁北克人工智能研究所,多伦多大学)
CanvasMAR: Improving Masked Autoregressive Video Prediction With Canvas
Institute for Artificial Intelligence, Peking University, Beijing, China(人工智能研究院,北京大学,北京,中国);School of Intelligence Science and Technology, Peking University, Beijing, China(智能科学与技术学院,北京大学,北京,中国);State Key Laboratory of General Artificial Intelligence, Peking University, Beijing, China(通用人工智能国家重点实验室,北京大学,北京,中国)