通用域适应性（UNIDA）是一种一般无监督的域适应设置，它解决了自适应中的域和标签变化。它的主要挑战在于如何在未共享或未知类中识别目标样本。以前的方法通常努力描绘样本“置信度”以及拒绝未知数的阈值，并使跨域共享类的特征分布对齐。但是，仍然很难预先指定“信心”标准和阈值，这些标准和阈值适应各种实际任务，并且对未知数的错误预测进一步导致了共享类中特征的错误对准。在本文中，我们提出了一种新的UNIDA方法，该方法具有分类器悖论（UACP）的自适应未知身份验证，考虑到具有矛盾预测的样品可能是未知的，属于源类别。在UACP中，一个复合分类器与两种类型的预测变量共同设计。也就是说，多类（MC）预测器将样品分类为多个源类之一，而二进制单VS-ALL（OVA）预测器进一步验证了MC预测器的预测。验证失败或悖论的样品被鉴定为未知数。此外，在输出空间中进行了隐式域对齐，而不是共享类别的特征对齐，使跨域的样本共享相同的决策边界，尽管特征差异都具有相同的决策边界。经验结果验证了开放式UDA和通用UDA设置下的UACP。

以前的无监督域适应性（UDA）方法旨在通过从富含标签的源域到未标记的目标域的单向知识转移来促进目标学习，而到目前为止，尚未共同考虑其从目标到源的反向适应性。实际上，在一些真正的教学实践中，老师帮助学生学习，同时在某种程度上也从学生那里获得晋升，这激发了我们探索域之间的双向知识转移，因此提出了双重校正适应网络（DUALCAN）在本文中。但是，由于跨域的不对称标签知识，从未标记的目标转移到标记的来源比共同的源与目标对应物更加困难。首先，由源预测的目标伪标签通常涉及模型偏差引起的噪音，因此在反向适应中，它们可能会损害源绩效并带来负目标转换。其次，源域通常包含先天噪声，这将不可避免地加剧目标噪声，从而导致跨域的噪声扩增。为此，我们进一步引入了噪声识别和校正（NIC）模块，以纠正和回收两个域中的噪声。据我们所知，这是对嘈杂UDA的双向适应的首次幼稚尝试，并且自然适用于无噪声UDA。给出理论理由以说明我们的直觉的合理性。经验结果证实了双can的有效性，其性能在最先进的方面具有显着的性能，尤其是对于极端嘈杂的任务（例如，PW-> pr和PR-> RW的办公室房屋）的有效性。

鉴于案件的事实，法律判断预测（LJP）涉及一系列的子任务，例如预测违规的法律文章，费用和罚款期限。我们建议利用LJP的统一文本到文本变压器，其中子任务之间的依赖关系可以自然地建立在自动回归解码器中。与以前的作品相比，它有三个优点：（1）它适合屏蔽语言模型的预先预订模式，从而可以从每个子任务的语义提示中受益，而不是将它们视为原子标签，（2）它使用单个统一的架构，在所有子任务中都可以实现完整参数共享，并且（3）它可以包含分类和生成子任务。我们展示了这款统一的变压器，尽管普通的域文本，但优于法律领域专门针对的预磨损模型。通过广泛的实验，我们发现捕获依赖性的最佳订单与人类直觉不同，而且人类最合理的逻辑顺序可以是模型的次优。我们还包括两个更多的辅助任务：法院视图生成和文章内容预测，显示它们不仅可以提高预测准确性，而且也可以为模型输出提供可解释的解释，即使在进行错误时也是模型输出。通过最佳配置，我们的模型优于先前的SOTA和一个单一任务版本的统一变压器，通过大边距。

自动推荐向特定法律案件的相关法律文章引起了很多关注，因为它可以大大释放人工劳动力，从而在大型法律数据库中寻找。然而，目前的研究只支持粗粒度推荐，其中所有相关文章都预测为整体，而无需解释每种文章与之相关的具体事实。由于一个案例可以由许多支持事实形成，因此遍历它们来验证推荐结果的正确性可能是耗时的。我们认为，在每个单一的事实和法律文章之间学习细粒度的对应，对于准确可靠的AI系统至关重要。通过这种动机，我们执行开创性的研究并创建一个手动注释的事实 - 文章的语料库。我们将学习视为文本匹配任务，并提出一个多级匹配网络来解决它。为了帮助模型更好地消化法律文章的内容，我们以随机森林的前提结论对形式解析物品。实验表明，解析的形式产生了更好的性能，结果模型超越了其他流行的文本匹配基线。此外，我们与先前的研究相比，并发现建立细粒度的事实 - 文章对应物可以通过大幅度提高建议准确性。我们最好的系统达到了96.3％的F1得分，使其具有实际使用潜力。它还可以显着提高法律决策预测的下游任务，将F1增加到12.7％。

In this paper, we propose a robust 3D detector, named Cross Modal Transformer (CMT), for end-to-end 3D multi-modal detection. Without explicit view transformation, CMT takes the image and point clouds tokens as inputs and directly outputs accurate 3D bounding boxes. The spatial alignment of multi-modal tokens is performed implicitly, by encoding the 3D points into multi-modal features. The core design of CMT is quite simple while its performance is impressive. CMT obtains 73.0% NDS on nuScenes benchmark. Moreover, CMT has a strong robustness even if the LiDAR is missing. Code will be released at https://github.com/junjie18/CMT.

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.

Graph Neural Networks (GNNs) have shown satisfying performance on various graph learning tasks. To achieve better fitting capability, most GNNs are with a large number of parameters, which makes these GNNs computationally expensive. Therefore, it is difficult to deploy them onto edge devices with scarce computational resources, e.g., mobile phones and wearable smart devices. Knowledge Distillation (KD) is a common solution to compress GNNs, where a light-weighted model (i.e., the student model) is encouraged to mimic the behavior of a computationally expensive GNN (i.e., the teacher GNN model). Nevertheless, most existing GNN-based KD methods lack fairness consideration. As a consequence, the student model usually inherits and even exaggerates the bias from the teacher GNN. To handle such a problem, we take initial steps towards fair knowledge distillation for GNNs. Specifically, we first formulate a novel problem of fair knowledge distillation for GNN-based teacher-student frameworks. Then we propose a principled framework named RELIANT to mitigate the bias exhibited by the student model. Notably, the design of RELIANT is decoupled from any specific teacher and student model structures, and thus can be easily adapted to various GNN-based KD frameworks. We perform extensive experiments on multiple real-world datasets, which corroborates that RELIANT achieves less biased GNN knowledge distillation while maintaining high prediction utility.

This paper focuses on designing efficient models with low parameters and FLOPs for dense predictions. Even though CNN-based lightweight methods have achieved stunning results after years of research, trading-off model accuracy and constrained resources still need further improvements. This work rethinks the essential unity of efficient Inverted Residual Block in MobileNetv2 and effective Transformer in ViT, inductively abstracting a general concept of Meta-Mobile Block, and we argue that the specific instantiation is very important to model performance though sharing the same framework. Motivated by this phenomenon, we deduce a simple yet efficient modern \textbf{I}nverted \textbf{R}esidual \textbf{M}obile \textbf{B}lock (iRMB) for mobile applications, which absorbs CNN-like efficiency to model short-distance dependency and Transformer-like dynamic modeling capability to learn long-distance interactions. Furthermore, we design a ResNet-like 4-phase \textbf{E}fficient \textbf{MO}del (EMO) based only on a series of iRMBs for dense applications. Massive experiments on ImageNet-1K, COCO2017, and ADE20K benchmarks demonstrate the superiority of our EMO over state-of-the-art methods, \eg, our EMO-1M/2M/5M achieve 71.5, 75.1, and 78.4 Top-1 that surpass \textbf{SoTA} CNN-/Transformer-based models, while trading-off the model accuracy and efficiency well.

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.