尽管无条件的特征反演是许多图像合成应用的基础，但训练逆变器需要高计算预算，大型解码容量和强加的条件，例如自回旋先验。为了解决这些局限性，我们建议使用对抗强大的表示作为特征反演的感知原始。我们训练一个对抗性稳健的编码器，以提取分离和感知对齐的图像表示，使其容易逆转。通过使用编码器的镜像架构训练简单的发电机，我们实现了优于标准模型的卓越重建质量和概括。基于此，我们提出了一个具有对抗性的自动编码器，并展示了其在样式转移，图像denoisising和异常检测任务方面的改进性能。与最近的Imagenet特征反演方法相比，我们的模型的性能提高了，复杂性的性能明显较小。

我们训练一个神经网络模型，以预测宇宙N体模拟的全相空间演化。它的成功表明，神经网络模型正在准确地近似绿色的功能扩展，该功能将模拟的初始条件与其在深层非线性方向上的后期结合到结果。我们通过评估其在具有已知精确解决方案或充分理解扩展的简单情况下的良好理解的简单案例上的表现来测试这种近似值的准确性。这些场景包括球形构型，隔离平面波和两个相互作用的平面波：与用于训练的高斯随机场有很大不同的初始条件。我们发现我们的模型可以很好地推广到这些良好理解的方案，这表明网络已经推断了一般的物理原理，并从复杂的随机高斯训练数据中学习了非线性模式耦合。这些测试还为查找模型的优势和劣势以及确定改进模型的策略提供了有用的诊断。我们还测试了仅包含横向模式的初始条件，该模式的模式不仅在其相位上有所不同，而且还与训练集中使用的纵向生长模式相比。当网络遇到与训练集正交的这些初始条件时，该模型将完全失败。除了这些简单的配置外，我们还评估了模型对N体模拟的标准初始条件的密度，位移和动量功率谱的预测。我们将这些摘要统计数据与N体结果和称为COLA的近似快速模拟方法进行了比较。我们的模型在$ k \ sim 1 \ \ mathrm {mpc}^{ - 1} \，h $的非线性尺度上达到百分比精度，代表了对COLA的显着改进。

行为选择一直是机器人技术的积极研究主题，尤其是在人类机器人相互作用领域。为了使机器人与人类有效，自主的互动，基于感应信息的人类活动识别技术和基于决策机制的机器人行为选择之间的耦合至关重要。但是，迄今为止的大多数方法包括公认活动与机器人行为之间的确定性关联，忽略了实时应用程序中顺序预测固有的不确定性。在本文中，我们通过基于类似于生物的神经生理方面的计算模型提出神经机构方法来解决这一差距。将这种神经机构方法与非生物启发的基于启发式方法的方法进行了比较。为了评估这两种方法，都开发了机器人模拟，其中移动机器人必须根据智能房屋的居民进行的活动来完成任务。根据机器人提供的正确结果数量评估每种方法的结果。结果表明，神经机构方法是有利的，尤其是考虑到基于更复杂动物的计算模型。

在这项工作中，我们提出了一种基于从Marmoset猴的大脑收集的局部场潜在数据，提出了与帕金森病相关的新生物物理计算模型。帕金森病是一种神经退行性疾病，与大量NIGRA PARSCACTCA的多巴胺能神经元的死亡有关，这影响了大脑基底神经节 - 丘脑 - 皮质神经元电路的正常动态。尽管存在多种疾病的机制，但仍然缺少这些机制和分子发病机制的完整描述，仍然没有治愈。为了解决这种差距，已经提出了类似于动物模型中发现的神经生物学方面的计算模型。在我们的模型中，我们执行了一种数据驱动方法，其中使用差分演变优化了一组生物学限制参数。进化模型成功地类似于来自健康和Parkinsonian Marmoset脑数据的单神经元均值射击和局部场势的光谱签名。据我们所知，这是帕金森病的第一个基于来自Marmoset Monkeys的七个脑区域的同时电生理学记录的第一个计算模型。结果表明，该拟议的模型可以促进PD机制的调查，并支持可以表明新疗法的技术的发展。它还可以应用于其他计算神经科学问题，其中可以使用生物数据来适应大规模模型的脑电路。

Variational inference uses optimization, rather than integration, to approximate the marginal likelihood, and thereby the posterior, in a Bayesian model. Thanks to advances in computational scalability made in the last decade, variational inference is now the preferred choice for many high-dimensional models and large datasets. This tutorial introduces variational inference from the parametric perspective that dominates these recent developments, in contrast to the mean-field perspective commonly found in other introductory texts.

Knowledge graphs (KG) have served as the key component of various natural language processing applications. Commonsense knowledge graphs (CKG) are a special type of KG, where entities and relations are composed of free-form text. However, previous works in KG completion and CKG completion suffer from long-tail relations and newly-added relations which do not have many know triples for training. In light of this, few-shot KG completion (FKGC), which requires the strengths of graph representation learning and few-shot learning, has been proposed to challenge the problem of limited annotated data. In this paper, we comprehensively survey previous attempts on such tasks in the form of a series of methods and applications. Specifically, we first introduce FKGC challenges, commonly used KGs, and CKGs. Then we systematically categorize and summarize existing works in terms of the type of KGs and the methods. Finally, we present applications of FKGC models on prediction tasks in different areas and share our thoughts on future research directions of FKGC.

Few Shot Instance Segmentation (FSIS) requires models to detect and segment novel classes with limited several support examples. In this work, we explore a simple yet unified solution for FSIS as well as its incremental variants, and introduce a new framework named Reference Twice (RefT) to fully explore the relationship between support/query features based on a Transformer-like framework. Our key insights are two folds: Firstly, with the aid of support masks, we can generate dynamic class centers more appropriately to re-weight query features. Secondly, we find that support object queries have already encoded key factors after base training. In this way, the query features can be enhanced twice from two aspects, i.e., feature-level and instance-level. In particular, we firstly design a mask-based dynamic weighting module to enhance support features and then propose to link object queries for better calibration via cross-attention. After the above steps, the novel classes can be improved significantly over our strong baseline. Additionally, our new framework can be easily extended to incremental FSIS with minor modification. When benchmarking results on the COCO dataset for FSIS, gFSIS, and iFSIS settings, our method achieves a competitive performance compared to existing approaches across different shots, e.g., we boost nAP by noticeable +8.2/+9.4 over the current state-of-the-art FSIS method for 10/30-shot. We further demonstrate the superiority of our approach on Few Shot Object Detection. Code and model will be available.

Unsupervised domain adaptation (UDA) for semantic segmentation is a promising task freeing people from heavy annotation work. However, domain discrepancies in low-level image statistics and high-level contexts compromise the segmentation performance over the target domain. A key idea to tackle this problem is to perform both image-level and feature-level adaptation jointly. Unfortunately, there is a lack of such unified approaches for UDA tasks in the existing literature. This paper proposes a novel UDA pipeline for semantic segmentation that unifies image-level and feature-level adaptation. Concretely, for image-level domain shifts, we propose a global photometric alignment module and a global texture alignment module that align images in the source and target domains in terms of image-level properties. For feature-level domain shifts, we perform global manifold alignment by projecting pixel features from both domains onto the feature manifold of the source domain; and we further regularize category centers in the source domain through a category-oriented triplet loss and perform target domain consistency regularization over augmented target domain images. Experimental results demonstrate that our pipeline significantly outperforms previous methods. In the commonly tested GTA5$\rightarrow$Cityscapes task, our proposed method using Deeplab V3+ as the backbone surpasses previous SOTA by 8%, achieving 58.2% in mIoU.

The development of social media user stance detection and bot detection methods rely heavily on large-scale and high-quality benchmarks. However, in addition to low annotation quality, existing benchmarks generally have incomplete user relationships, suppressing graph-based account detection research. To address these issues, we propose a Multi-Relational Graph-Based Twitter Account Detection Benchmark (MGTAB), the first standardized graph-based benchmark for account detection. To our knowledge, MGTAB was built based on the largest original data in the field, with over 1.55 million users and 130 million tweets. MGTAB contains 10,199 expert-annotated users and 7 types of relationships, ensuring high-quality annotation and diversified relations. In MGTAB, we extracted the 20 user property features with the greatest information gain and user tweet features as the user features. In addition, we performed a thorough evaluation of MGTAB and other public datasets. Our experiments found that graph-based approaches are generally more effective than feature-based approaches and perform better when introducing multiple relations. By analyzing experiment results, we identify effective approaches for account detection and provide potential future research directions in this field. Our benchmark and standardized evaluation procedures are freely available at: https://github.com/GraphDetec/MGTAB.

The performance of inertial navigation systems is largely dependent on the stable flow of external measurements and information to guarantee continuous filter updates and bind the inertial solution drift. Platforms in different operational environments may be prevented at some point from receiving external measurements, thus exposing their navigation solution to drift. Over the years, a wide variety of works have been proposed to overcome this shortcoming, by exploiting knowledge of the system current conditions and turning it into an applicable source of information to update the navigation filter. This paper aims to provide an extensive survey of information aided navigation, broadly classified into direct, indirect, and model aiding. Each approach is described by the notable works that implemented its concept, use cases, relevant state updates, and their corresponding measurement models. By matching the appropriate constraint to a given scenario, one will be able to improve the navigation solution accuracy, compensate for the lost information, and uncover certain internal states, that would otherwise remain unobservable.