这项工作旨在通过使用路边激光射击环境的3D感知来应对自动驾驶的挑战。我们设计了一个3D对象检测模型，该模型可以实时检测路边激光雷达的交通参与者。我们的模型使用现有的3D检测器作为基线并提高其准确性。为了证明我们提出的模块的有效性，我们在三个不同的车辆和基础设施数据集上训练和评估模型。为了显示我们探测器的域适应能力，我们在来自中国的基础架构数据集上训练它，并在德国记录的其他数据集上进行转移学习。我们为检测器中每个模块进行几套实验和消融研究，这些实验表明我们的模型的表现优于基线，而推理速度为45 Hz（22 ms）。我们对基于激光雷达的3D探测器做出了重大贡献，可用于智能城市应用程序，以提供连接和自动化的车辆具有深远的视野。连接到路边传感器的车辆可以获取有关拐角处其他车辆的信息，以改善其道路和操纵计划并提高道路交通安全性。

Most Graph Neural Networks follow the message-passing paradigm, assuming the observed structure depicts the ground-truth node relationships. However, this fundamental assumption cannot always be satisfied, as real-world graphs are always incomplete, noisy, or redundant. How to reveal the inherent graph structure in a unified way remains under-explored. We proposed PRI-GSL, a Graph Structure Learning framework guided by the Principle of Relevant Information, providing a simple and unified framework for identifying the self-organization and revealing the hidden structure. PRI-GSL learns a structure that contains the most relevant yet least redundant information quantified by von Neumann entropy and Quantum Jensen-Shannon divergence. PRI-GSL incorporates the evolution of quantum continuous walk with graph wavelets to encode node structural roles, showing in which way the nodes interplay and self-organize with the graph structure. Extensive experiments demonstrate the superior effectiveness and robustness of PRI-GSL.

拓扑不平衡是由标记节点的不均匀拓扑位置引起的一个特异性不平衡问题，它大大损害了GNN的性能。什么拓扑不平衡意味着如何衡量其对图形学习的影响。在本文中，从全球视图中，我们对监督信息分布的全球视图提供了对拓扑 - 不平衡的新理解，从不足和过度划分的角度来看，这激发了两个定量指标作为测量。鉴于我们的分析，我们提出了一个新颖的位置感知的图形结构学习框架，该框架名为柔和，该框架直接优化了信息传播路径并解决了本质上解决拓扑 - 不平衡问题。我们的关键见解是增强同一类中节点的连接性，以获取更多的监督信息，从而减轻不足和过度的现象。具体而言，我们设计了一个基于锚的位置编码机制，该机制可以更好地结合相对拓扑位置并通过最大化标签影响来增强类内部电感偏置。我们进一步提出了作为边缘权重的阶级冲突度量，这有利于不同节点类别的分离。广泛的实验表明，在不同的数据注释方案中增强GNNS的功率方面，柔和的能力具有较高的潜力和适应性。

有限的GPU记忆资源阻碍了深度神经网络的进一步发展。因此，高度要求GPU内存资源的优化。通常应用交换和重新计算，以更好地利用GPU记忆。但是，作为一个新兴领域，仍然存在一些挑战：1）静态和动态方法的重新计算效率受到限制。 2）交换需要手动卸载参数，这会产生巨大的时间成本。 3）没有这种动态和细粒的方法，涉及张量与当今的张量重新组件一起交换。为了纠正上述问题，我们提出了一个名为Delta（动态张量卸载和重新组件）的新型调度程序经理。据我们所知，我们是第一个在没有用户监督的情况下进行张量交换和张量重新组合的合理的动态运行时间调度程序。在Delta中，我们提出了一种过滤器算法，以选择要从GPU内存中释放出来的最佳张量，并提出导演算法，以选择每个张量的适当动作。此外，故意考虑预取和重叠以克服交换和重新计算张量引起的时间成本。实验结果表明，DELTA不仅节省了40％-70％的GPU记忆，从而超过了最新方法，而且还获得了可比的收敛结果，并获得了可接受的时间延迟。此外，与基准相比，当训练Resnet-101训练Resnet-101时，Delta在训练Resnet-50和2.25 $ \ times $时获得2.04 $ \ times $最大批量。此外，我们实验中的交换成本和重新计算成本之间的比较表明，在张量交换和张量重新计算上制定合理的动态调度程序的重要性，这在某些相关工作中反驳了交换应该是第一个也是最好的选择。

图形神经网络（GNNS）在广泛的应用方面显示了有希望的结果。 GNN的大多数实证研究直接将观察图视为输入，假设观察到的结构完美地描绘了节点之间的准确性和完全关系。然而，现实世界中的图形是不可避免的或不完整的，甚至可以加剧图表表示的质量。在这项工作中，我们提出了一种新颖的变分信息瓶颈引导图形结构学习框架，即vib-gsl，在信息理论的角度下。 VIB-GSL推进了图形结构学习的信息瓶颈（IB）原则，为挖掘潜在的任务关系提供了更优雅且普遍的框架。 VIB-GSL了解一个信息和压缩图形结构，用于蒸馏出特定的下游任务的可操作信息。 VIB-GSL为不规则图数据推导了变化近似，以形成促进训练稳定性的易切换IB目标函数。广泛的实验结果表明，VIB-GSL的卓越有效性和鲁棒性。

由于表现强劲，预用的语言模型已成为许多NLP任务的标准方法，但他们培训价格昂贵。我们提出了一个简单高效的学习框架TLM，不依赖于大规模预制。给定一些标记的任务数据和大型常规语料库，TLM使用任务数据作为查询来检索一般语料库的微小子集，并联合优化任务目标和从头开始的语言建模目标。在四个域中的八个分类数据集上，TLM实现了比预用语言模型（例如Roberta-Light）更好地或类似的结果，同时减少了两个数量级的训练拖鞋。高精度和效率，我们希望TLM将有助于民主化NLP并加快发展。

This paper presents SimCSE, a simple contrastive learning framework that greatly advances state-of-the-art sentence embeddings. We first describe an unsupervised approach, which takes an input sentence and predicts itself in a contrastive objective, with only standard dropout used as noise. This simple method works surprisingly well, performing on par with previous supervised counterparts. We find that dropout acts as minimal data augmentation, and removing it leads to a representation collapse. Then, we propose a supervised approach, which incorporates annotated pairs from natural language inference datasets into our contrastive learning framework by using "entailment" pairs as positives and "contradiction" pairs as hard negatives. We evaluate SimCSE on standard semantic textual similarity (STS) tasks, and our unsupervised and supervised models using BERT base achieve an average of 76.3% and 81.6% Spearman's correlation respectively, a 4.2% and 2.2% improvement compared to the previous best results. We also show-both theoretically and empirically-that the contrastive learning objective regularizes pre-trained embeddings' anisotropic space to be more uniform, and it better aligns positive pairs when supervised signals are available. 1 2 We randomly sample 10 6 sentences from English Wikipedia and fine-tune BERTbase with learning rate = 3e-5, N = 64. In all our experiments, no STS training sets are used.

Benefiting from the intrinsic supervision information exploitation capability, contrastive learning has achieved promising performance in the field of deep graph clustering recently. However, we observe that two drawbacks of the positive and negative sample construction mechanisms limit the performance of existing algorithms from further improvement. 1) The quality of positive samples heavily depends on the carefully designed data augmentations, while inappropriate data augmentations would easily lead to the semantic drift and indiscriminative positive samples. 2) The constructed negative samples are not reliable for ignoring important clustering information. To solve these problems, we propose a Cluster-guided Contrastive deep Graph Clustering network (CCGC) by mining the intrinsic supervision information in the high-confidence clustering results. Specifically, instead of conducting complex node or edge perturbation, we construct two views of the graph by designing special Siamese encoders whose weights are not shared between the sibling sub-networks. Then, guided by the high-confidence clustering information, we carefully select and construct the positive samples from the same high-confidence cluster in two views. Moreover, to construct semantic meaningful negative sample pairs, we regard the centers of different high-confidence clusters as negative samples, thus improving the discriminative capability and reliability of the constructed sample pairs. Lastly, we design an objective function to pull close the samples from the same cluster while pushing away those from other clusters by maximizing and minimizing the cross-view cosine similarity between positive and negative samples. Extensive experimental results on six datasets demonstrate the effectiveness of CCGC compared with the existing state-of-the-art algorithms.

As one of the prevalent methods to achieve automation systems, Imitation Learning (IL) presents a promising performance in a wide range of domains. However, despite the considerable improvement in policy performance, the corresponding research on the explainability of IL models is still limited. Inspired by the recent approaches in explainable artificial intelligence methods, we proposed a model-agnostic explaining framework for IL models called R2RISE. R2RISE aims to explain the overall policy performance with respect to the frames in demonstrations. It iteratively retrains the black-box IL model from the randomized masked demonstrations and uses the conventional evaluation outcome environment returns as the coefficient to build an importance map. We also conducted experiments to investigate three major questions concerning frames' importance equality, the effectiveness of the importance map, and connections between importance maps from different IL models. The result shows that R2RISE successfully distinguishes important frames from the demonstrations.

Text clustering and topic extraction are two important tasks in text mining. Usually, these two tasks are performed separately. For topic extraction to facilitate clustering, we can first project texts into a topic space and then perform a clustering algorithm to obtain clusters. To promote topic extraction by clustering, we can first obtain clusters with a clustering algorithm and then extract cluster-specific topics. However, this naive strategy ignores the fact that text clustering and topic extraction are strongly correlated and follow a chicken-and-egg relationship. Performing them separately fails to make them mutually benefit each other to achieve the best overall performance. In this paper, we propose an unsupervised text clustering and topic extraction framework (ClusTop) which integrates text clustering and topic extraction into a unified framework and can achieve high-quality clustering result and extract topics from each cluster simultaneously. Our framework includes four components: enhanced language model training, dimensionality reduction, clustering and topic extraction, where the enhanced language model can be viewed as a bridge between clustering and topic extraction. On one hand, it provides text embeddings with a strong cluster structure which facilitates effective text clustering; on the other hand, it pays high attention on the topic related words for topic extraction because of its self-attention architecture. Moreover, the training of enhanced language model is unsupervised. Experiments on two datasets demonstrate the effectiveness of our framework and provide benchmarks for different model combinations in this framework.