我们提出了一种Saimaa环形密封（Pusa hispida saimensis）的方法。通过摄像机捕获和众包访问大型图像量，为动物监测和保护提供了新的可能性，并呼吁自动分析方法，特别是在重新识别图像中的单个动物时。所提出的方法通过PELAGE模式聚合（NORPPA）重新识别新型环形密封件，利用Saimaa环形密封件的永久和独特的毛线模式和基于内容的图像检索技术。首先，对查询图像进行了预处理，每个密封实例都进行了分段。接下来，使用基于U-NET编码器解码器的方法提取密封件的层模式。然后，将基于CNN的仿射不变特征嵌入并聚集到Fisher载体中。最后，使用Fisher载体之间的余弦距离用于从已知个体数据库中找到最佳匹配。我们在新的挑战性Saimaa环形密封件重新识别数据集上对该方法进行了各种修改的广泛实验。在与替代方法的比较中，提出的方法显示出在我们的数据集上产生最佳的重新识别精度。

野生动植物摄像机陷阱和众包材料提供了监测濒危动物物种的新型可能性。但是，这些方法产生的大量图像量对于研究人员来说是压倒性的，可以手动进行手动，要求自动系统执行分析。获得最关注的分析任务是重新确定个体，例如，它可以研究动物迁移或估计人口规模。 Saimaa环形海豹（Pusa hispida saimensis）是仅在芬兰西马阿湖中发现的濒危亚种，是现有的少数淡水海豹物种之一。环形密封件具有永久性的层模式，每个人都可以使用，可用于识别个体。密封的可变形性质以及环形图案和其余部分之间的不同外观和较低的对比度，使Saimaa环形密封重新识别任务变得非常具有挑战性，从而提供了良好的基准，从而提供了一个良好的基准，从而提供了一个良好的基准，从而提供了一个很好的基准来评估最新的基准 - ART重新识别方法。因此，我们使Saimaa环形密封图像（SealId）数据集（n = 57）公开用于研究目的。在本文中，描述了数据集，提出了重新识别方法的评估协议，并提供了两种基线方法的结果热点和NOPPA。 SEALID数据集已公开可用。

Missing values are a common problem in data science and machine learning. Removing instances with missing values can adversely affect the quality of further data analysis. This is exacerbated when there are relatively many more features than instances, and thus the proportion of affected instances is high. Such a scenario is common in many important domains, for example, single nucleotide polymorphism (SNP) datasets provide a large number of features over a genome for a relatively small number of individuals. To preserve as much information as possible prior to modeling, a rigorous imputation scheme is acutely needed. While Denoising Autoencoders is a state-of-the-art method for imputation in high-dimensional data, they still require enough complete cases to be trained on which is often not available in real-world problems. In this paper, we consider missing value imputation as a multi-label classification problem and propose Chains of Autoreplicative Random Forests. Using multi-label Random Forests instead of neural networks works well for low-sampled data as there are fewer parameters to optimize. Experiments on several SNP datasets show that our algorithm effectively imputes missing values based only on information from the dataset and exhibits better performance than standard algorithms that do not require any additional information. In this paper, the algorithm is implemented specifically for SNP data, but it can easily be adapted for other cases of missing value imputation.

During training, reinforcement learning systems interact with the world without considering the safety of their actions. When deployed into the real world, such systems can be dangerous and cause harm to their surroundings. Often, dangerous situations can be mitigated by defining a set of rules that the system should not violate under any conditions. For example, in robot navigation, one safety rule would be to avoid colliding with surrounding objects and people. In this work, we define safety rules in terms of the relationships between the agent and objects and use them to prevent reinforcement learning systems from performing potentially harmful actions. We propose a new safe epsilon-greedy algorithm that uses safety rules to override agents' actions if they are considered to be unsafe. In our experiments, we show that a safe epsilon-greedy policy significantly increases the safety of the agent during training, improves the learning efficiency resulting in much faster convergence, and achieves better performance than the base model.

This paper examines the encoding of analogy in large-scale pretrained language models, such as BERT and GPT-2. Existing analogy datasets typically focus on a limited set of analogical relations, with a high similarity of the two domains between which the analogy holds. As a more realistic setup, we introduce the Scientific and Creative Analogy dataset (SCAN), a novel analogy dataset containing systematic mappings of multiple attributes and relational structures across dissimilar domains. Using this dataset, we test the analogical reasoning capabilities of several widely-used pretrained language models (LMs). We find that state-of-the-art LMs achieve low performance on these complex analogy tasks, highlighting the challenges still posed by analogy understanding.

Large language models (LLMs) have been shown to be able to perform new tasks based on a few demonstrations or natural language instructions. While these capabilities have led to widespread adoption, most LLMs are developed by resource-rich organizations and are frequently kept from the public. As a step towards democratizing this powerful technology, we present BLOOM, a 176B-parameter open-access language model designed and built thanks to a collaboration of hundreds of researchers. BLOOM is a decoder-only Transformer language model that was trained on the ROOTS corpus, a dataset comprising hundreds of sources in 46 natural and 13 programming languages (59 in total). We find that BLOOM achieves competitive performance on a wide variety of benchmarks, with stronger results after undergoing multitask prompted finetuning. To facilitate future research and applications using LLMs, we publicly release our models and code under the Responsible AI License.

It has been experimentally demonstrated that humans are able to learn in a manner that allows them to make predictions on categories for which they have not seen any examples (Malaviya et al., 2022). Sucholutsky and Schonlau (2020) have recently presented a machine learning approach that aims to do the same. They utilise synthetically generated data and demonstrate that it is possible to achieve sub-linear scaling and develop models that can learn to recognise N classes from M training samples where M is less than N - aka less-than-one shot learning. Their method was, however, defined for univariate or simple multivariate data (Sucholutsky et al., 2021). We extend it to work on large, high-dimensional and real-world datasets and empirically validate it in this new and challenging setting. We apply this method to learn previously unseen NLP tasks from very few examples (4, 8 or 16). We first generate compact, sophisticated less-than-one shot representations called soft-label prototypes which are fitted on training data, capturing the distribution of different classes across the input domain space. We then use a modified k-Nearest Neighbours classifier to demonstrate that soft-label prototypes can classify data competitively, even outperforming much more computationally complex few-shot learning methods.

我们提出了Rudsi，这是俄罗斯语言感官诱导（WSI）的新基准。该数据集是使用单词用法图（WUGS）的手动注释和半自动聚类创建的。与俄罗斯的先前WSI数据集不同，Rudsi完全由数据驱动（基于俄罗斯国家语料库的文本），没有对注释者强加的外部词感官。根据图聚类的参数，可以从原始注释中产生不同的导数数据集。我们报告了几种基线WSI方法在Rudsi上获得的性能，并讨论了改善这些分数的可能性。

为了在高移动性虚拟环境中实现柔软物体的高富度触觉渲染，我们提出了一种新颖的触觉显示dandeliontouch。一群无人机将触觉执行器传递给用户的指尖。 DandelionTouch的用户能够在不受设备工作区域限制的大空间中体验触觉反馈。重要的是，在与虚拟物体的长时间互动中，他们不会经历肌肉疲劳。手动跟踪和群控制算法允许用手动运动引导群，并避免在编队内部发生冲突。在这项研究中，研究了群体之间的阻抗连接的几种拓扑结构。该实验在实时在正方形轨迹上执行了一个遵循的实验，该实验表明，在恒星拓扑中连接的无人机执行了平均位置误差较低的轨迹（与其他阻抗拓扑相比，RMSE降低了20.6 \％与潜在的基于现场的群体控制相比，为40.9 \％。在所有具有阻抗行为的地层中，无人机的达到的速度比通过潜在场算法控制的群体高28％。此外，在与7名参与者的用户研究中评估了几种纤维骨架模式的感知。该研究表明，提议的时间延迟和频率调制的组合使用户可以同时成功识别VR中的表面特性和运动方向（平均识别率为70 \％，最大为93 \％）。 DandelionTouch建议在VR系统中提出一种新型的触觉反馈，无需手持或可穿戴界面。

相干显微镜技术提供了跨科学和技术领域的材料的无与伦比的多尺度视图，从结构材料到量子设备，从综合电路到生物细胞。在构造更明亮的来源和高速探测器的驱动下，连贯的X射线显微镜方法（如Ptychography）有望彻底改变纳米级材料的特征。但是，相关的数据和计算需求显着增加意味着，常规方法不再足以从高速相干成像实验实时恢复样品图像。在这里，我们演示了一个工作流程，该工作流利用边缘的人工智能和高性能计算，以实现直接从检测器直接从检测器流出的X射线ptychography数据实时反演。拟议的AI支持的工作流程消除了传统的Ptychography施加的采样约束，从而使用比传统方法所需的数据较少的数据级允许低剂量成像。