显示过次分辨率化，导致在亚组信息的各种设置下在罕见的子组上的测试精度差。为了获得更完整的图片，我们考虑子组信息未知的情况。我们调查模型规模在多种设置的经验风险最小化（ERM）下最差组泛化的影响，不同：1）架构（Reset，VGG或BERT），2）域（视觉或自然语言处理）3）模型尺寸（宽度或深度）和4）初始化（具有预先培训或随机重量）。我们的系统评价显示，模型大小的增加不会受到伤害，并且可以帮助所有设置的ERM下的最差群体测试性能。特别是，增加预先训练的模型大小一致地提高水鸟和多液体的性能。当子组标签未知时，我们建议从业者使用更大的预训练模型。

用于单视网型3D重建（SVR）的神经网络（NN）已经获得了普及。最近的工作指出，对于SVR，大多数尖端NNS在重建看不见的对象时具有有限的性能，因为它们主要依赖于识别（即，基于分类的方法）而不是形状重建。要深入了解这个问题，我们对NNS更倾向识别重建的何时以及为什么提供系统的研究，反之亦然。我们的发现表明，确定识别与重建的主要因素是如何分散训练数据。因此，我们介绍了一个新的数据驱动度量的分散评分，以量化这种前导因素并研究其对NNS的影响。我们假设当训练图像更加分散时，NNS朝向识别偏置，并且训练形状较少分散。支持我们的假设，通过我们的合成和基准数据集的实验证明了分散评分。我们表明，拟议的指标是分析重建质量的主要方法，并提供除了传统的重建分数之外的新颖信息。

图表分类具有生物信息学，社会科学，自动假新闻检测，Web文档分类等中的应用程序。在许多实践方案中，包括网络级应用程序，其中标签稀缺或难以获得，无人监督的学习是一种自然范式，但它交易表现。最近，对比学习（CL）使得无监督的计算机视觉模型能够竞争对抗监督。分析Visual CL框架的理论和实证工作发现，利用大型数据集和域名感知增强对于框架成功至关重要。有趣的是，图表CL框架通常会在使用较小数据的顺序的同时报告高性能，并且使用可能损坏图形的底层属性的域名增强（例如，节点或边缘丢弃，功能捕获）。通过这些差异的激励，我们寻求确定：（i）为什么现有的图形Cl框架尽管增加了增强和有限的数据; （ii）是否遵守Visual CL原理可以提高图形分类任务的性能。通过广泛的分析，我们识别图形数据增强和评估协议的缺陷实践，这些协议通常用于图形CL文献中，并提出了未来的研究和应用的改进的实践和理智检查。我们表明，在小型基准数据集上，图形神经网络的归纳偏差可以显着补偿现有框架的局限性。在采用相对较大的图形分类任务的研究中，我们发现常用的域名忽视增强的表现不佳，同时遵守Visual Cl中的原则可以显着提高性能。例如，在基于图形的文档分类中，可以用于更好的Web搜索，我们显示任务相关的增强提高了20％的准确性。

在他们的损失景观方面观看神经网络模型在学习的统计力学方法方面具有悠久的历史，并且近年来它在机器学习中得到了关注。除此之外，已显示局部度量（例如损失景观的平滑度）与模型的全局性质（例如良好的泛化性能）相关联。在这里，我们对数千个神经网络模型的损失景观结构进行了详细的实证分析，系统地改变了学习任务，模型架构和/或数据数量/质量。通过考虑试图捕获损失景观的不同方面的一系列指标，我们证明了最佳的测试精度是如下：损失景观在全球连接;训练型模型的集合彼此更像;而模型会聚到局部平滑的地区。我们还表明，当模型很小或培训以较低质量数据时，可以出现全球相连的景观景观;而且，如果损失景观全球相连，则培训零损失实际上可以导致更糟糕的测试精度。我们详细的经验结果阐明了学习阶段的阶段（以及后续双重行为），基本与偶然的决定因素良好的概括决定因素，负载样和温度相同的参数在学习过程中，不同的影响对模型的损失景观的影响不同和数据，以及地方和全球度量之间的关系，近期兴趣的所有主题。

在节点分类任务中，异常和过天性是两个可能损害图形卷积神经网络（GCN）性能的两个问题。异种源于问题是指模型无法处理异构节点属于不同类别的异细则图;过度问题是指模型的退化性能随着越来越多的层。这两个看似无关的问题大多是独立研究的，但最近有近期解决一个问题可能有益于另一个问题的经验证据。在这项工作中，除了经验观察之外，我们的目标是：（1）从统一的理论角度分析异常和过天际上的问题，（2）确定两个问题的共同原因，（3）提出简单但有效的解决策略共同的原因。在我们的理论分析中，我们表明异通源性和过天际上问题的共同原因 - 即节点的相对程度及其异常级别 - 触发连续层中的节点表示，以“移动”更靠近原始决策边界，这增加了某些约束下节点标签的错误分类率。理论上我们显示：（1）具有高异味的节点具有更高的错误分类率。 （2）即使在异常的情况下，节点邻域中的程度差异也可以影响节点表示的运动并导致“伪异性”情况，这有助于解释过度处理。 （3）允许在消息传递期间肯定的阳性而且负面信息可以有助于抵消两个问题的常见原因。基于我们的理论见解，我们提出了对GCN架构的简单修改（即学习程度校正和签名消息），我们表明他们在9个网络上缓解了HeteOlephily和过天际上的问题。

Recent deep networks that directly handle points in a point set, e.g., PointNet, have been state-of-the-art for supervised learning tasks on point clouds such as classification and segmentation. In this work, a novel end-toend deep auto-encoder is proposed to address unsupervised learning challenges on point clouds. On the encoder side, a graph-based enhancement is enforced to promote local structures on top of PointNet. Then, a novel folding-based decoder deforms a canonical 2D grid onto the underlying 3D object surface of a point cloud, achieving low reconstruction errors even for objects with delicate structures. The proposed decoder only uses about 7% parameters of a decoder with fully-connected neural networks, yet leads to a more discriminative representation that achieves higher linear SVM classification accuracy than the benchmark. In addition, the proposed decoder structure is shown, in theory, to be a generic architecture that is able to reconstruct an arbitrary point cloud from a 2D grid. Our code is available at http://www.merl.com/research/ license#FoldingNet

在过去的25年中，我们目睹了机器学习在编译器领域的广泛应用。选择和相位订购问题。但是，有限的作品已在最先进的编译器（即LLVM）上游，以将前者无缝集成到编译器的优化管道中，以便由用户容易部署。 MLGO是此类项目的第一个项目之一，它仅努力使用强化学习使用基于ML的INLINER来减少二进制的代码大小。本文介绍了mlgoperf；第一个端到端框架，能够使用LLVM的ML Inliner优化性能。它采用二级ML模型来生成用于训练重新定位的增强学习代理的奖励，该辅助剂以前由MLGO用作主要模型。它通过预测分析功能的函数的速度加速来做到这一点，并为主要模型提供快速训练框架，否则将是不切实际的。实验结果表明，MLGOPERF在LLVM在O3时的优化方面的优化分别为SPEC CPU2006和CBENCH基准分别获得了1.8％和2.2％。此外，提出的方法为我们的基准测试带来了自动点守则区域的26％，可以将其转化为额外的3.7％速度值。

Dataset distillation has emerged as a prominent technique to improve data efficiency when training machine learning models. It encapsulates the knowledge from a large dataset into a smaller synthetic dataset. A model trained on this smaller distilled dataset can attain comparable performance to a model trained on the original training dataset. However, the existing dataset distillation techniques mainly aim at achieving the best trade-off between resource usage efficiency and model utility. The security risks stemming from them have not been explored. This study performs the first backdoor attack against the models trained on the data distilled by dataset distillation models in the image domain. Concretely, we inject triggers into the synthetic data during the distillation procedure rather than during the model training stage, where all previous attacks are performed. We propose two types of backdoor attacks, namely NAIVEATTACK and DOORPING. NAIVEATTACK simply adds triggers to the raw data at the initial distillation phase, while DOORPING iteratively updates the triggers during the entire distillation procedure. We conduct extensive evaluations on multiple datasets, architectures, and dataset distillation techniques. Empirical evaluation shows that NAIVEATTACK achieves decent attack success rate (ASR) scores in some cases, while DOORPING reaches higher ASR scores (close to 1.0) in all cases. Furthermore, we conduct a comprehensive ablation study to analyze the factors that may affect the attack performance. Finally, we evaluate multiple defense mechanisms against our backdoor attacks and show that our attacks can practically circumvent these defense mechanisms.

Blind image quality assessment (BIQA) remains challenging due to the diversity of distortion and image content variation, which complicate the distortion patterns crossing different scales and aggravate the difficulty of the regression problem for BIQA. However, existing BIQA methods often fail to consider multi-scale distortion patterns and image content, and little research has been done on learning strategies to make the regression model produce better performance. In this paper, we propose a simple yet effective Progressive Multi-Task Image Quality Assessment (PMT-IQA) model, which contains a multi-scale feature extraction module (MS) and a progressive multi-task learning module (PMT), to help the model learn complex distortion patterns and better optimize the regression issue to align with the law of human learning process from easy to hard. To verify the effectiveness of the proposed PMT-IQA model, we conduct experiments on four widely used public datasets, and the experimental results indicate that the performance of PMT-IQA is superior to the comparison approaches, and both MS and PMT modules improve the model's performance.

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.