具有复制机制的最近神经序列到序列模型在各种文本生成任务中取得了显着的进展。这些模型解决了词汇问题，并促进了稀有词的产生。然而，如先前的复制模型所观察到的，难以产生的，难以产生和缺乏抽象，难以识别。在本文中，我们提出了一种副本网络的新颖监督方法，该方法可帮助模型决定需要复制哪些单词并需要生成。具体而言，我们重新定义目标函数，它利用源序列和目标词汇表作为复制的指导。关于数据到文本生成和抽象总结任务的实验结果验证了我们的方法提高了复制质量，提高了抽象程度。

人类通常通过利用关于他们正在交谈的人的主题和背景信息的先验知识来进行对话。然而，现有的会话代理和数据集不考虑此类综合信息，因此它们有一个限制生成知识和人格正确融合的话语。为解决此问题，我们介绍了一个呼叫进行定制对话（焦点）数据集，其中包括用户的角色和维基百科知识建立了自定义答案。为了评估预先训练的语言模型的信息和定制话语的能力，我们利用BART和GPT-2以及基于变压器的模型。我们评估了他们的生成能力，自动分数并对人类评估进行定性结果。我们仔细检查模型是否反映了我们提出的两个子任务，人物接地（PG）和知识接地（KG）的充分人物和知识。此外，我们表明我们的数据的话语通过接地质量评估来构建具有正确的知识和角色。

分配和验证国际公认的商品代码（HS编码）的任务是贸易货物的是海关办公室的关键职能之一。这一决定对于进口商和出口商至关重要，因为它决定了关税率。但是，类似于法官作出的法院决定，即使对于经验丰富的海关官员，任务也可能是非琐碎的。目前的论文提出了一个深入的学习模式，以协助这一看似挑战HS代码分类。与韩国海关服务一起，我们建立了基于科电的决策模型，该决策模型建议了HS代码的最有可能的标题和副标题（即，前四位和六位数）。在129,084件之前的情况下评估显示，我们模型的前3个建议在分类265个副标题方面的准确性为95.5％。这个有希望的结果意味着算法可以通过协助HS代码分类任务来减少海关官员所采取的时间和精力。

鉴于大量的跨境流量，对行业的有效和有效控制对于保护人和社会免受非法行业的影响而在促进合法交易的同时变得更加重要。但是，交易级贸易数据集的有限可访问性阻碍了公开研究的进展，许多海关管理部门并未受益于基于数据的风险管理的最新进展。在本文中，我们介绍了一个进口声明数据集，以促进海关管理部门和数据科学研究人员领域专家之间的合作。该数据集包含54,000个具有22个关键属性的人为产生的交易，并且在维护相关功能的同时与CTGAN合成。合成数据具有多个优点。首先，释放数据集没有限制，这些限制不允许披露原始的导入数据。其次，制造步骤最大程度地减少了贸易统计中可能存在的身份风险。最后，已发布的数据遵循与源数据相似的分布，因此可以在各种下游任务中使用。通过提供数据及其生成过程，我们为欺诈检测任务打开基线代码，因为我们从经验上表明，更高级的算法可以更好地检测欺诈。

当将同时映射和本地化（SLAM）调整到现实世界中的应用程序（例如自动驾驶汽车，无人机和增强现实设备）时，其内存足迹和计算成本是限制性能和应用程序范围的两个主要因素。在基于稀疏特征的SLAM算法中，解决此问题的一种有效方法是通过选择可能对本地和全局捆绑捆绑调整（BA）有用的点来限制地图点大小。这项研究提出了用于大量系统中稀疏地图点的有效图优化。具体而言，我们将最大姿势可见度和最大空间多样性问题作为最小成本最大流量图优化问题。提出的方法是现有SLAM系统的附加步骤，因此可以在常规或基于学习的SLAM系统中使用。通过广泛的实验评估，我们证明了所提出的方法以大约1/3的MAP点和1/2的计算实现了更准确的相机姿势。

The 3D-aware image synthesis focuses on conserving spatial consistency besides generating high-resolution images with fine details. Recently, Neural Radiance Field (NeRF) has been introduced for synthesizing novel views with low computational cost and superior performance. While several works investigate a generative NeRF and show remarkable achievement, they cannot handle conditional and continuous feature manipulation in the generation procedure. In this work, we introduce a novel model, called Class-Continuous Conditional Generative NeRF ($\text{C}^{3}$G-NeRF), which can synthesize conditionally manipulated photorealistic 3D-consistent images by projecting conditional features to the generator and the discriminator. The proposed $\text{C}^{3}$G-NeRF is evaluated with three image datasets, AFHQ, CelebA, and Cars. As a result, our model shows strong 3D-consistency with fine details and smooth interpolation in conditional feature manipulation. For instance, $\text{C}^{3}$G-NeRF exhibits a Fr\'echet Inception Distance (FID) of 7.64 in 3D-aware face image synthesis with a $\text{128}^{2}$ resolution. Additionally, we provide FIDs of generated 3D-aware images of each class of the datasets as it is possible to synthesize class-conditional images with $\text{C}^{3}$G-NeRF.

Cellular automata (CA) captivate researchers due to teh emergent, complex individualized behavior that simple global rules of interaction enact. Recent advances in the field have combined CA with convolutional neural networks to achieve self-regenerating images. This new branch of CA is called neural cellular automata [1]. The goal of this project is to use the idea of idea of neural cellular automata to grow prediction machines. We place many different convolutional neural networks in a grid. Each conv net cell outputs a prediction of what the next state will be, and minimizes predictive error. Cells received their neighbors' colors and fitnesses as input. Each cell's fitness score described how accurate its predictions were. Cells could also move to explore their environment and some stochasticity was applied to movement.

There is a dramatic shortage of skilled labor for modern vineyards. The Vinum project is developing a mobile robotic solution to autonomously navigate through vineyards for winter grapevine pruning. This necessitates an autonomous navigation stack for the robot pruning a vineyard. The Vinum project is using the quadruped robot HyQReal. This paper introduces an architecture for a quadruped robot to autonomously move through a vineyard by identifying and approaching grapevines for pruning. The higher level control is a state machine switching between searching for destination positions, autonomously navigating towards those locations, and stopping for the robot to complete a task. The destination points are determined by identifying grapevine trunks using instance segmentation from a Mask Region-Based Convolutional Neural Network (Mask-RCNN). These detections are sent through a filter to avoid redundancy and remove noisy detections. The combination of these features is the basis for the proposed architecture.

Feature selection helps reduce data acquisition costs in ML, but the standard approach is to train models with static feature subsets. Here, we consider the dynamic feature selection (DFS) problem where a model sequentially queries features based on the presently available information. DFS is often addressed with reinforcement learning (RL), but we explore a simpler approach of greedily selecting features based on their conditional mutual information. This method is theoretically appealing but requires oracle access to the data distribution, so we develop a learning approach based on amortized optimization. The proposed method is shown to recover the greedy policy when trained to optimality and outperforms numerous existing feature selection methods in our experiments, thus validating it as a simple but powerful approach for this problem.

In this paper, we learn a diffusion model to generate 3D data on a scene-scale. Specifically, our model crafts a 3D scene consisting of multiple objects, while recent diffusion research has focused on a single object. To realize our goal, we represent a scene with discrete class labels, i.e., categorical distribution, to assign multiple objects into semantic categories. Thus, we extend discrete diffusion models to learn scene-scale categorical distributions. In addition, we validate that a latent diffusion model can reduce computation costs for training and deploying. To the best of our knowledge, our work is the first to apply discrete and latent diffusion for 3D categorical data on a scene-scale. We further propose to perform semantic scene completion (SSC) by learning a conditional distribution using our diffusion model, where the condition is a partial observation in a sparse point cloud. In experiments, we empirically show that our diffusion models not only generate reasonable scenes, but also perform the scene completion task better than a discriminative model. Our code and models are available at https://github.com/zoomin-lee/scene-scale-diffusion