GAN倒置旨在将输入图像倒入预训练GAN的潜在空间中。尽管GAN倒置最近取得了进步，但减轻失真和编辑性之间的权衡仍然存在挑战，即准确地重建输入图像并以较小的视觉质量下降来编辑倒置图像。最近提出的关键调整模型通过使用两步方法将输入图像转变为潜在代码，称为枢轴代码，然后改变生成器，以便可以准确映射输入图像，从而取得了重大进展，从而取得了重大进展。进入枢轴代码。在这里，我们表明可以通过适当的枢轴代码设计来改进重建和编辑性。我们提出了一种简单而有效的方法，称为“循环编码”，以提供高质量的枢轴代码。我们方法的关键思想是根据周期方案在不同空间中逐步训练编码器：w-> w+ - > w。该训练方法保留了W+空间的性质，即W+的低畸变的高编辑性。为了进一步减少失真，我们还建议使用基于优化的方法来完善枢轴代码，其中引入正则化项以减少编辑性的降解。对几种最新方法的定性和定量比较证明了我们方法的优势。

由于其高识别精度，包括移动设备的面部解锁，社区访问控制系统和城市监视，因此在许多领域都使用了面部识别技术。由于非常深的网络结构可以保证当前的高精度，因此通常需要将面部图像传输到具有高计算能力以进行推理的第三方服务器。但是，面部图像在视觉上揭示了用户的身份信息。在此过程中，不受信任的服务提供商和恶意用户都可以显着增加个人隐私漏洞的风险。当前的隐私识别方法通常伴随着许多副作用，例如推理时间的显着增加或明显的识别准确性下降。本文提出了使用频域中使用差异隐私的保护隐私面部识别方法。由于利用了差异隐私，它在理论上提供了隐私的保证。同时，准确性的丧失非常小。该方法首先将原始图像转换为频域，并删除称为DC的直接组件。然后，可以根据差异隐私框架内的后端面部识别网络的丢失来学习隐私预算分配方法。最后，它为频域特征添加了相应的噪声。根据广泛的实验，我们的方法在几个经典的面部识别测试集中表现出色。

知识蒸馏（KD）将知识从高容量的教师网络转移到加强较小的学生。现有方法着重于发掘知识的提示，并将整个知识转移给学生。但是，由于知识在不同的学习阶段显示出对学生的价值观，因此出现了知识冗余。在本文中，我们提出了知识冷凝蒸馏（KCD）。具体而言，每个样本上的知识价值是动态估计的，基于期望最大化（EM）框架的迭代性凝结，从老师那里划定了一个紧凑的知识，以指导学生学习。我们的方法很容易建立在现成的KD方法之上，没有额外的培训参数和可忽略不计的计算开销。因此，它为KD提出了一种新的观点，在该观点中，积极地识别教师知识的学生可以学会更有效，有效地学习。对标准基准测试的实验表明，提出的KCD可以很好地提高学生模型的性能，甚至更高的蒸馏效率。代码可在https://github.com/dzy3/kcd上找到。

在本文中，我们提出了一个简单而通用的网络，该网络称为SEQTR，用于视觉接地任务，例如短语本地化，参考表达理解（REC）和分割（RES）。视觉接地的规范范例通常需要在设计网络体系结构和损失功能方面具有丰富的专业知识，从而使它们难以跨越跨任务进行推广。为了简化和统一建模，我们将视觉接地作为点预测问题在图像和文本输入上进行条件，其中边界框或二进制掩码表示为一系列离散坐标令牌。在此范式下，视觉接地任务是在我们的SEQTR网络中统一的，而没有特定于任务的分支或头部，例如RES的卷积蒙版解码器，这大大降低了多任务建模的复杂性。此外，SEQTR还具有简单的交叉渗透损失，共享所有任务的相同优化目标，从而进一步降低了部署手工制作的损失功能的复杂性。五个基准数据集的实验表明，所提出的SEQTR优于现有的最新技术（或与之相提并论），这证明了一种简单而通用的视觉接地方法确实是可行的。源代码可在https://github.com/sean-zhuh/seqtr上获得。

本文提出了一种任何时间的超分辨率方法（ARM），以解决过度参数化的单图像超分辨率（SISR）模型。我们的手臂是由三个观察结果激励的：（1）不同图像贴片的性能随不同大小的SISR网络而变化。 （2）计算开销与重建图像的性能之间存在权衡。 （3）给定输入图像，其边缘信息可以是估计其PSNR的有效选择。随后，我们训练包含不同尺寸的SISR子网的手臂超网，以处理各种复杂性的图像斑块。为此，我们构建了一个边缘到PSNR查找表，该表将图像补丁的边缘分数映射到每个子网的PSNR性能，以及子网的一组计算成本。在推论中，图像贴片单独分配给不同的子网，以获得更好的计算绩效折衷。此外，每个SISR子网都共享手臂超网的权重，因此不引入额外的参数。多个子网的设置可以很好地使SISR模型的计算成本适应动态可用的硬件资源，从而可以随时使用SISR任务。对不同大小的分辨率数据集的广泛实验和流行的SISR网络作为骨架验证了我们的手臂的有效性和多功能性。源代码可在https://github.com/chenbong/arm-net上找到。

弱监督对象本地化（WSOL）旨在仅通过使用图像级标签来学习对象本地化器。基于卷积神经网络（CNN）的技术通常导致突出显示物体的最辨别部分，同时忽略整个对象范围。最近，变压器架构已经部署到WSOL，以捕获具有自我关注机制和多层的Perceptron结构的远程特征依赖性。然而，变压器缺乏CNN所固有的局部感应偏差，因此可以恶化WSOL中的局部特征细节。在本文中，我们提出了一种基于变压器的新型框架，称为LCTR（局部连续性变压器），该框架被称为LCTR（局部连续性变压器），该框架在长期特征依赖项中提高全局特征的本地感知能力。为此，我们提出了一个关系的修补程序注意模块（RPAM），其考虑全球跨补丁信息。我们进一步设计了一个CUE挖掘模块（CDM），它利用本地特征来指导模型的学习趋势，以突出弱局部响应。最后，在两个广泛使用的数据集，即Cub-200-2011和ILSVRC上进行综合实验，以验证我们方法的有效性。

Decompilation aims to transform a low-level program language (LPL) (eg., binary file) into its functionally-equivalent high-level program language (HPL) (e.g., C/C++). It is a core technology in software security, especially in vulnerability discovery and malware analysis. In recent years, with the successful application of neural machine translation (NMT) models in natural language processing (NLP), researchers have tried to build neural decompilers by borrowing the idea of NMT. They formulate the decompilation process as a translation problem between LPL and HPL, aiming to reduce the human cost required to develop decompilation tools and improve their generalizability. However, state-of-the-art learning-based decompilers do not cope well with compiler-optimized binaries. Since real-world binaries are mostly compiler-optimized, decompilers that do not consider optimized binaries have limited practical significance. In this paper, we propose a novel learning-based approach named NeurDP, that targets compiler-optimized binaries. NeurDP uses a graph neural network (GNN) model to convert LPL to an intermediate representation (IR), which bridges the gap between source code and optimized binary. We also design an Optimized Translation Unit (OTU) to split functions into smaller code fragments for better translation performance. Evaluation results on datasets containing various types of statements show that NeurDP can decompile optimized binaries with 45.21% higher accuracy than state-of-the-art neural decompilation frameworks.

Nearest-Neighbor (NN) classification has been proven as a simple and effective approach for few-shot learning. The query data can be classified efficiently by finding the nearest support class based on features extracted by pretrained deep models. However, NN-based methods are sensitive to the data distribution and may produce false prediction if the samples in the support set happen to lie around the distribution boundary of different classes. To solve this issue, we present P3DC-Shot, an improved nearest-neighbor based few-shot classification method empowered by prior-driven data calibration. Inspired by the distribution calibration technique which utilizes the distribution or statistics of the base classes to calibrate the data for few-shot tasks, we propose a novel discrete data calibration operation which is more suitable for NN-based few-shot classification. Specifically, we treat the prototypes representing each base class as priors and calibrate each support data based on its similarity to different base prototypes. Then, we perform NN classification using these discretely calibrated support data. Results from extensive experiments on various datasets show our efficient non-learning based method can outperform or at least comparable to SOTA methods which need additional learning steps.

In recent years, arbitrary image style transfer has attracted more and more attention. Given a pair of content and style images, a stylized one is hoped that retains the content from the former while catching style patterns from the latter. However, it is difficult to simultaneously keep well the trade-off between the content details and the style features. To stylize the image with sufficient style patterns, the content details may be damaged and sometimes the objects of images can not be distinguished clearly. For this reason, we present a new transformer-based method named STT for image style transfer and an edge loss which can enhance the content details apparently to avoid generating blurred results for excessive rendering on style features. Qualitative and quantitative experiments demonstrate that STT achieves comparable performance to state-of-the-art image style transfer methods while alleviating the content leak problem.

In contrast to the control-theoretic methods, the lack of stability guarantee remains a significant problem for model-free reinforcement learning (RL) methods. Jointly learning a policy and a Lyapunov function has recently become a promising approach to ensuring the whole system with a stability guarantee. However, the classical Lyapunov constraints researchers introduced cannot stabilize the system during the sampling-based optimization. Therefore, we propose the Adaptive Stability Certification (ASC), making the system reach sampling-based stability. Because the ASC condition can search for the optimal policy heuristically, we design the Adaptive Lyapunov-based Actor-Critic (ALAC) algorithm based on the ASC condition. Meanwhile, our algorithm avoids the optimization problem that a variety of constraints are coupled into the objective in current approaches. When evaluated on ten robotic tasks, our method achieves lower accumulated cost and fewer stability constraint violations than previous studies.