The stock market prediction has been a traditional yet complex problem researched within diverse research areas and application domains due to its non-linear, highly volatile and complex nature. Existing surveys on stock market prediction often focus on traditional machine learning methods instead of deep learning methods. Deep learning has dominated many domains, gained much success and popularity in recent years in stock market prediction. This motivates us to provide a structured and comprehensive overview of the research on stock market prediction focusing on deep learning techniques. We present four elaborated subtasks of stock market prediction and propose a novel taxonomy to summarize the state-of-the-art models based on deep neural networks from 2011 to 2022. In addition, we also provide detailed statistics on the datasets and evaluation metrics commonly used in the stock market. Finally, we highlight some open issues and point out several future directions by sharing some new perspectives on stock market prediction.

Label smoothing is a regularization technique widely used in supervised learning to improve the generalization of models on various tasks, such as image classification and machine translation. However, the effectiveness of label smoothing in multi-hop question answering (MHQA) has yet to be well studied. In this paper, we systematically analyze the role of label smoothing on various modules of MHQA and propose F1 smoothing, a novel label smoothing technique specifically designed for machine reading comprehension (MRC) tasks. We evaluate our method on the HotpotQA dataset and demonstrate its superiority over several strong baselines, including models that utilize complex attention mechanisms. Our results suggest that label smoothing can be effective in MHQA, but the choice of smoothing strategy can significantly affect performance.

Image harmonization aims to produce visually harmonious composite images by adjusting the foreground appearance to be compatible with the background. When the composite image has photographic foreground and painterly background, the task is called painterly image harmonization. There are only few works on this task, which are either time-consuming or weak in generating well-harmonized results. In this work, we propose a novel painterly harmonization network consisting of a dual-domain generator and a dual-domain discriminator, which harmonizes the composite image in both spatial domain and frequency domain. The dual-domain generator performs harmonization by using AdaIn modules in the spatial domain and our proposed ResFFT modules in the frequency domain. The dual-domain discriminator attempts to distinguish the inharmonious patches based on the spatial feature and frequency feature of each patch, which can enhance the ability of generator in an adversarial manner. Extensive experiments on the benchmark dataset show the effectiveness of our method. Our code and model are available at https://github.com/bcmi/PHDNet-Painterly-Image-Harmonization.

This work explores an efficient approach to establish a foundational video-text model for tasks including open-vocabulary video classification, text-to-video retrieval, video captioning and video question-answering. We present VideoCoCa that reuses a pretrained image-text contrastive captioner (CoCa) model and adapt it to video-text tasks with minimal extra training. While previous works adapt image-text models with various cross-frame fusion modules (for example, cross-frame attention layer or perceiver resampler) and finetune the modified architecture on video-text data, we surprisingly find that the generative attentional pooling and contrastive attentional pooling layers in the image-text CoCa design are instantly adaptable to ``flattened frame embeddings'', yielding a strong zero-shot transfer baseline for many video-text tasks. Specifically, the frozen image encoder of a pretrained image-text CoCa takes each video frame as inputs and generates \(N\) token embeddings per frame for totally \(T\) video frames. We flatten \(N \times T\) token embeddings as a long sequence of frozen video representation and apply CoCa's generative attentional pooling and contrastive attentional pooling on top. All model weights including pooling layers are directly loaded from an image-text CoCa pretrained model. Without any video or video-text data, VideoCoCa's zero-shot transfer baseline already achieves state-of-the-art results on zero-shot video classification on Kinetics 400/600/700, UCF101, HMDB51, and Charades, as well as zero-shot text-to-video retrieval on MSR-VTT and ActivityNet Captions. We also explore lightweight finetuning on top of VideoCoCa, and achieve strong results on video question-answering (iVQA, MSRVTT-QA, MSVD-QA) and video captioning (MSR-VTT, ActivityNet, Youcook2). Our approach establishes a simple and effective video-text baseline for future research.

Most existing person re-identification methods compute the matching relations between person images across camera views based on the ranking of the pairwise similarities. This matching strategy with the lack of the global viewpoint and the context's consideration inevitably leads to ambiguous matching results and sub-optimal performance. Based on a natural assumption that images belonging to the same person identity should not match with images belonging to multiple different person identities across views, called the unicity of person matching on the identity level, we propose an end-to-end person unicity matching architecture for learning and refining the person matching relations. First, we adopt the image samples' contextual information in feature space to generate the initial soft matching results by using graph neural networks. Secondly, we utilize the samples' global context relationship to refine the soft matching results and reach the matching unicity through bipartite graph matching. Given full consideration to real-world person re-identification applications, we achieve the unicity matching in both one-shot and multi-shot settings of person re-identification and further develop a fast version of the unicity matching without losing the performance. The proposed method is evaluated on five public benchmarks, including four multi-shot datasets MSMT17, DukeMTMC, Market1501, CUHK03, and a one-shot dataset VIPeR. Experimental results show the superiority of the proposed method on performance and efficiency.

近年来，随着空间航天器实体的大规模部署以及卫星在板载功能的增加，在过度网络动态的情况下，与TCP/IP相比，出现了比TCP/IP更强大的通信协议。 DTN节点缓冲区管理仍然是一个活跃的研究领域，因为DTN核心协议的当前实现仍然依赖于以下假设：在不同的网络节点中始终有足够的内存来存储和正向捆绑包。此外，经典排队理论不适用于DTN节点缓冲区的动态管理。因此，本文提出了一种集中式方法，以基于高级强化学习（RL）策略优势行动者 - 批评者（A2C）自动管理低地球（LEO）卫星星座中的认知DTN节点。该方法旨在探索培训地球同步地球轨道智能代理，以管理Leo卫星星座中的所有DTN节点。 A2C代理的目的是在考虑节点内存利用率的同时最大化交付成功率并最大程度地减少网络资源消耗成本。智能代理可以根据束优先级动态调整无线电数据速率并执行下降操作。为了衡量在LEO卫星星座场景中将A2C技术应用于DTN节点管理问题的有效性，本文将受过训练的智能代理策略与其他两种非RL政策进行了比较，包括随机和标准政策。实验表明，A2C策略平衡了交付成功率和成本，并提供了最高的奖励和最低的节点存储器利用率。

对具有代理商初始位置未知的有限3D环境的多代理探索是一个具有挑战性的问题。它需要快速探索环境，并坚定合并代理商构建的子图。我们认为现有方法是侵略性或保守的：在检测到重叠时，积极的策略合并了两种由不同代理构建的子图，这可能导致由于对重叠的错误阳性检测而导致不正确的合并，因此是如此。不健全。保守策略指导一个代理人在合并之前重新审视另一个代理商的过量验证历史轨迹，这可以降低由于对同一空间的反复探索而引起的勘探效率。为了巧妙地平衡子图合并和勘探效率的鲁棒性，我们为基于激光雷达的多代理探索开发了一种新方法，该方法可以指导一个代理商以\ emph {自适应}方式重复另一个代理商的轨迹子图合并过程的指标。此外，我们的方法通过计划合并子图的代理人共同计划，以进一步提高勘探效率，以\ emph {Cooperative}方式将最近的单格分层勘探策略扩展到多个代理。我们的实验表明，我们的方法平均比基线高出50 \％，同时稳固地合并子映射。

出色的图像文本检索模型取决于高质量标记的数据。尽管现有图像文本检索数据集的构建者努力确保标题与链接的图像匹配，但它们无法阻止字幕拟合其他图像。我们观察到，如此多的匹配现象在广泛使用的检索数据集中非常普遍，其中一个标题可以描述多达178张图像。这些较大的匹配失误数据不仅使训练中的模型混淆，而且还会削弱评估精度。受视觉和文本核心任务的启发，我们提出了一个多模式的核心分类器，以确定句子是否由图像和其链接的字幕所带来。随后，我们通过将这些需要的字幕添加为图像的附加标签来修改图像文本检索数据集，并制定通用可变率策略，以教授检索模型以区分所需的字幕和其他负样本。在实验中，我们手动注释了一个需要校正的图像文本检索数据集进行评估。结果表明，所提出的元素分类器可实现约78％的精度，并始终提高图像文本检索基线的性能。

我们介绍了DeepGen，这是一个在网络范围内部署的系统，用于自动为宾果派客户创建赞助的搜索广告（ADS）。我们利用最新的自然语言生成（NLG）模型以抽象的方式从广告商的网页中生成流利的广告，并解决了实际问题，例如事实和推理速度。此外，我们的系统可实时创建自定义的广告，以响应用户的搜索查询，因此根据用户所需的内容突出显示了同一产品的不同方面。为了实现这一目标，我们的系统会提前生成各种较小广告的选择，并在查询时间选择最相关的广告选择，以将其缝合为完整的广告。我们通过培训可控的NLG模型来改善发电多样性，以生成相同网页的多个广告，突出显示不同的销售点。我们的系统设计通过首先运行具有不同目标训练的生成模型的合奏，然后使用多样性采样算法来选择各种各样的生成结果以进行在线选择，从而进一步改善了多样性。实验结果显示了我们提出的系统设计的有效性。我们的系统目前已在生产中部署，为Bing提供的全球广告提供$ {\ sim} 4 \％$。

基于草图的3D形状检索（SBSR）是一项重要但艰巨的任务，近年来引起了越来越多的关注。现有方法在限制设置中解决了该问题，而无需适当模拟真实的应用程序方案。为了模仿现实的设置，在此曲目中，我们采用了不同级别的绘图技能的业余爱好者以及各种3D形状的大规模草图，不仅包括CAD型号，而且还可以从真实对象扫描的模型。我们定义了两个SBSR任务，并构建了两个基准，包括46,000多个CAD型号，1,700个现实型号和145,000个草图。四个团队参加了这一轨道，并为这两个任务提交了15次跑步，由7个常用指标评估。我们希望，基准，比较结果和开源评估法会在3D对象检索社区中促进未来的研究。