Self-similarity is valuable to the exploration of non-local textures in single image super-resolution (SISR). Researchers usually assume that the importance of non-local textures is positively related to their similarity scores. In this paper, we surprisingly found that when repairing severely damaged query textures, some non-local textures with low-similarity which are closer to the target can provide more accurate and richer details than the high-similarity ones. In these cases, low-similarity does not mean inferior but is usually caused by different scales or orientations. Utilizing this finding, we proposed a Global Learnable Attention (GLA) to adaptively modify similarity scores of non-local textures during training instead of only using a fixed similarity scoring function such as the dot product. The proposed GLA can explore non-local textures with low-similarity but more accurate details to repair severely damaged textures. Furthermore, we propose to adopt Super-Bit Locality-Sensitive Hashing (SB-LSH) as a preprocessing method for our GLA. With the SB-LSH, the computational complexity of our GLA is reduced from quadratic to asymptotic linear with respect to the image size. In addition, the proposed GLA can be integrated into existing deep SISR models as an efficient general building block. Based on the GLA, we constructed a Deep Learnable Similarity Network (DLSN), which achieves state-of-the-art performance for SISR tasks of different degradation types (e.g. blur and noise). Our code and a pre-trained DLSN have been uploaded to GitHub{\dag} for validation.

梯度下降（GDA）方法是生成对抗网络（GAN）中最小值优化的主流算法。 GDA的收敛特性引起了最近文献的重大兴趣。具体而言，对于$ \ min _ {\ mathbf {x}} \ max _ {\ mathbf {y}} f（\ mathbf {x}; \ m m缩y} $以及$ \ mathbf {x} $，（lin等，2020）中的nonConvex证明了GDA的收敛性，带有sptepize的比率$ \ eta _ {\ mathbf {y}}}}/\ eta _ { }} = \ theta（\ kappa^2）$ with $ \ eta _ {\ mathbf {x}} $和$ \ eta _ {\ eta _ {\ mathbf {y}} $是$ \ mathbf {x}} $和$ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \\ Mathbf {y} $和$ \ kappa $是$ \ mathbf {y} $的条件号。尽管该步骤大比表明对最小玩家进行缓慢的训练，但实用的GAN算法通常对两个变量采用类似的步骤，表明理论和经验结果之间存在较大差距。在本文中，我们的目标是通过分析常规\ emph {nonconvex-nonconcave} minimax问题的\ emph {local contergence}来弥合这一差距。我们证明，$ \ theta（\ kappa）$的得分比是必要且足够的，足以使GDA局部收敛到Stackelberg equilibrium，其中$ \ kappa $是$ \ mathbf {y} $的本地条件号。我们证明了与匹配的下限几乎紧密的收敛速率。我们进一步将收敛保证扩展到随机GDA和额外梯度方法（例如）。最后，我们进行了几项数值实验来支持我们的理论发现。

本文的目的是通过应用深度学习方法作为计算最佳资本分配策略的工具来研究系统性风险措施的新方法学框架。在这个新框架下，可以将系统性风险措施解释为通过在汇总单个风险之前将资本分配给单个机构来确保总体机构确保汇总系统的最低现金。除了在非常有限的情况下，此问题没有明确的解决方案。深度学习在财务模型和风险管理中越来越受到关注，我们建议我们基于深度学习的算法解决风险措施的原始问题和双重问题，从而学习公平的风险分配。特别是，我们的双重问题方法涉及受众所周知的生成对抗网络（GAN）方法的启发，以及对radon-Nikodym衍生产品的新设计的直接估计。我们通过对该主题进行大量数值研究结束了论文，并提供了与系统性风险措施相关的风险分配的解释。在指数偏好的特定情况下，与最佳显式溶液作为基准相比，数值实验表明了所提出的算法的出色性能。

在本文中，我们研究了为给定图像生成高质量视觉文本演示设计的图形布局生成问题。我们注意到，不仅包含全局语义和空间信息的图像组成在很大程度上会影响布局结果。因此，我们提出了一个深层生成模型，称为组成感知图形布局GAN（CGL-GAN），以基于输入图像的全局和空间视觉内容来合成布局。为了从已经包含手动设计的图形布局数据的图像中获取训练图像，先前的工作建议将设计元素（例如文本和点缀）作为模型输入，这不可避免地会留下地面真相的提示。我们研究训练输入（带有提示掩码）和测试输入（没有掩模）之间的错位，并设计一个新型的域比对模块（DAM）以缩小此间隙。为了培训，我们构建了一个大规模布局数据集，该数据集由60,548张广告海报组成，并带有带注释的布局信息。为了评估生成的布局，我们根据美学直觉提出了三个新型指标。通过定量和定性评估，我们证明了所提出的模型可以根据图像组成合成高质量的图形布局。

有条件的生成对抗网络（CGANs）将标准无条件GaN框架扩展到学习样本的联合数据标签分布，并已建立为能够产生高保真图像的强大生成模型。这种模型的训练挑战在于将课程信息恰当地注入到其发电机和鉴别器中。对于鉴别器，可以通过（1）直接将标签作为输入或（2）涉及辅助分类损失的标签来实现类调节。在本文中，我们表明前者直接对齐类条件的假和实际数据分布$ p（\ text {image} | \ text {class}）$（{\ EM数据匹配}），而后者对齐数据调节类分布$ p（\ text {class} | \ text {image}）$（{\ EM标签匹配}）。虽然类别可分离性并不直接转化为样本质量，并且如果分类本身是本质上困难的话，如果不同类别的特征映射到同一点，则不能为发电机提供有用的指导，因此可以为同一点映射并因此变得不可分割。通过这种直觉激励，我们提出了一种双重投影GaN（P2Gan）模型，它学会在{\ EM数据匹配}和{\ EM标签匹配}之间平衡。然后，我们提出了一种改进的Cgan模型，通过辅助分类，通过最大限度地减少$ F $ -divergence，通过辅助分类直接对准假和实际条件$ p（\ text {class} | \ text {image}）$。高斯（MOG）数据集的合成混合物和各种现实世界数据集的实验，包括CIFAR100，ImageNet和Vggface2，证明了我们所提出的模型的功效。

This work focuses on unsupervised representation learning in person re-identification (ReID). Recent self-supervised contrastive learning methods learn invariance by maximizing the representation similarity between two augmented views of a same image. However, traditional data augmentation may bring to the fore undesirable distortions on identity features, which is not always favorable in id-sensitive ReID tasks. In this paper, we propose to replace traditional data augmentation with a generative adversarial network (GAN) that is targeted to generate augmented views for contrastive learning. A 3D mesh guided person image generator is proposed to disentangle a person image into id-related and id-unrelated features. Deviating from previous GAN-based ReID methods that only work in id-unrelated space (pose and camera style), we conduct GAN-based augmentation on both id-unrelated and id-related features. We further propose specific contrastive losses to help our network learn invariance from id-unrelated and id-related augmentations. By jointly training the generative and the contrastive modules, our method achieves new state-of-the-art unsupervised person ReID performance on mainstream large-scale benchmarks.

This paper proposes a novel self-supervised based Cut-and-Paste GAN to perform foreground object segmentation and generate realistic composite images without manual annotations. We accomplish this goal by a simple yet effective self-supervised approach coupled with the U-Net based discriminator. The proposed method extends the ability of the standard discriminators to learn not only the global data representations via classification (real/fake) but also learn semantic and structural information through pseudo labels created using the self-supervised task. The proposed method empowers the generator to create meaningful masks by forcing it to learn informative per-pixel as well as global image feedback from the discriminator. Our experiments demonstrate that our proposed method significantly outperforms the state-of-the-art methods on the standard benchmark datasets.

With the rapid deployment of graph neural networks (GNNs) based techniques into a wide range of applications such as link prediction, node classification, and graph classification the explainability of GNNs has become an indispensable component for predictive and trustworthy decision-making. Thus, it is critical to explain why graph neural network (GNN) makes particular predictions for them to be believed in many applications. Some GNNs explainers have been proposed recently. However, they lack to generate accurate and real explanations. To mitigate these limitations, we propose GANExplainer, based on Generative Adversarial Network (GAN) architecture. GANExplainer is composed of a generator to create explanations and a discriminator to assist with the Generator development. We investigate the explanation accuracy of our models by comparing the performance of GANExplainer with other state-of-the-art methods. Our empirical results on synthetic datasets indicate that GANExplainer improves explanation accuracy by up to 35\% compared to its alternatives.

This work addresses an alternative approach for query expansion (QE) using a generative adversarial network (GAN) to enhance the effectiveness of information search in e-commerce. We propose a modified QE conditional GAN (mQE-CGAN) framework, which resolves keywords by expanding the query with a synthetically generated query that proposes semantic information from text input. We train a sequence-to-sequence transformer model as the generator to produce keywords and use a recurrent neural network model as the discriminator to classify an adversarial output with the generator. With the modified CGAN framework, various forms of semantic insights gathered from the query document corpus are introduced to the generation process. We leverage these insights as conditions for the generator model and discuss their effectiveness for the query expansion task. Our experiments demonstrate that the utilization of condition structures within the mQE-CGAN framework can increase the semantic similarity between generated sequences and reference documents up to nearly 10% compared to baseline models

High-utility sequential pattern mining (HUSPM) has emerged as an important topic due to its wide application and considerable popularity. However, due to the combinatorial explosion of the search space when the HUSPM problem encounters a low utility threshold or large-scale data, it may be time-consuming and memory-costly to address the HUSPM problem. Several algorithms have been proposed for addressing this problem, but they still cost a lot in terms of running time and memory usage. In this paper, to further solve this problem efficiently, we design a compact structure called sequence projection (seqPro) and propose an efficient algorithm, namely discovering high-utility sequential patterns with the seqPro structure (HUSP-SP). HUSP-SP utilizes the compact seq-array to store the necessary information in a sequence database. The seqPro structure is designed to efficiently calculate candidate patterns' utilities and upper bound values. Furthermore, a new upper bound on utility, namely tighter reduced sequence utility (TRSU) and two pruning strategies in search space, are utilized to improve the mining performance of HUSP-SP. Experimental results on both synthetic and real-life datasets show that HUSP-SP can significantly outperform the state-of-the-art algorithms in terms of running time, memory usage, search space pruning efficiency, and scalability.