通过深度学习（DL）优于不同任务的常规方法，已经努力利用DL在各个领域中使用。交通域中的研究人员和开发人员还为预测任务（例如交通速度估算和到达时间）设计和改进了DL模型。但是，由于DL模型的黑盒属性和流量数据的复杂性（即时空依赖性），在分析DL模型方面存在许多挑战。我们与域专家合作，我们设计了一个视觉分析系统Attnanalyzer，该系统使用户能够探索DL模型如何通过允许有效的时空依赖性分析来进行预测。该系统结合了动态时间扭曲（DTW）和Granger因果关系测试，用于计算时空依赖性分析，同时提供映射，表格，线图和像素视图，以帮助用户执行依赖性和模型行为分析。为了进行评估，我们提出了三个案例研究，表明Attnanalyzer如何有效地探索模型行为并改善两个不同的道路网络中的模型性能。我们还提供域专家反馈。

扬声器日流是一个标签音频或视频录制的任务，与扬声器身份或短暂的任务标记对应于扬声器标识的类，以识别“谁谈到何时发表讲话”。在早期，对MultiSpeaker录音的语音识别开发了扬声器日益衰退算法，以使扬声器自适应处理能够实现扬声器自适应处理。这些算法还将自己的价值作为独立应用程序随着时间的推移，为诸如音频检索等下游任务提供特定于扬声器的核算。最近，随着深度学习技术的出现，这在讲话应用领域的研究和实践中引起了革命性的变化，对扬声器日益改善已经进行了快速进步。在本文中，我们不仅审查了扬声器日益改善技术的历史发展，而且还审查了神经扬声器日益改善方法的最新进步。此外，我们讨论了扬声器日复速度系统如何与语音识别应用相结合，以及最近深度学习的激增是如何引领联合建模这两个组件互相互补的方式。通过考虑这种令人兴奋的技术趋势，我们认为本文对社区提供了有价值的贡献，以通过巩固具有神经方法的最新发展，从而促进更有效的扬声器日益改善进一步进展。

The number of international benchmarking competitions is steadily increasing in various fields of machine learning (ML) research and practice. So far, however, little is known about the common practice as well as bottlenecks faced by the community in tackling the research questions posed. To shed light on the status quo of algorithm development in the specific field of biomedical imaging analysis, we designed an international survey that was issued to all participants of challenges conducted in conjunction with the IEEE ISBI 2021 and MICCAI 2021 conferences (80 competitions in total). The survey covered participants' expertise and working environments, their chosen strategies, as well as algorithm characteristics. A median of 72% challenge participants took part in the survey. According to our results, knowledge exchange was the primary incentive (70%) for participation, while the reception of prize money played only a minor role (16%). While a median of 80 working hours was spent on method development, a large portion of participants stated that they did not have enough time for method development (32%). 25% perceived the infrastructure to be a bottleneck. Overall, 94% of all solutions were deep learning-based. Of these, 84% were based on standard architectures. 43% of the respondents reported that the data samples (e.g., images) were too large to be processed at once. This was most commonly addressed by patch-based training (69%), downsampling (37%), and solving 3D analysis tasks as a series of 2D tasks. K-fold cross-validation on the training set was performed by only 37% of the participants and only 50% of the participants performed ensembling based on multiple identical models (61%) or heterogeneous models (39%). 48% of the respondents applied postprocessing steps.

Transformer-based models have gained large popularity and demonstrated promising results in long-term time-series forecasting in recent years. In addition to learning attention in time domain, recent works also explore learning attention in frequency domains (e.g., Fourier domain, wavelet domain), given that seasonal patterns can be better captured in these domains. In this work, we seek to understand the relationships between attention models in different time and frequency domains. Theoretically, we show that attention models in different domains are equivalent under linear conditions (i.e., linear kernel to attention scores). Empirically, we analyze how attention models of different domains show different behaviors through various synthetic experiments with seasonality, trend and noise, with emphasis on the role of softmax operation therein. Both these theoretical and empirical analyses motivate us to propose a new method: TDformer (Trend Decomposition Transformer), that first applies seasonal-trend decomposition, and then additively combines an MLP which predicts the trend component with Fourier attention which predicts the seasonal component to obtain the final prediction. Extensive experiments on benchmark time-series forecasting datasets demonstrate that TDformer achieves state-of-the-art performance against existing attention-based models.

Image super-resolution is a common task on mobile and IoT devices, where one often needs to upscale and enhance low-resolution images and video frames. While numerous solutions have been proposed for this problem in the past, they are usually not compatible with low-power mobile NPUs having many computational and memory constraints. In this Mobile AI challenge, we address this problem and propose the participants to design an efficient quantized image super-resolution solution that can demonstrate a real-time performance on mobile NPUs. The participants were provided with the DIV2K dataset and trained INT8 models to do a high-quality 3X image upscaling. The runtime of all models was evaluated on the Synaptics VS680 Smart Home board with a dedicated edge NPU capable of accelerating quantized neural networks. All proposed solutions are fully compatible with the above NPU, demonstrating an up to 60 FPS rate when reconstructing Full HD resolution images. A detailed description of all models developed in the challenge is provided in this paper.

Accurately extracting driving events is the way to maximize computational efficiency and anomaly detection performance in the tire frictional nose-based anomaly detection task. This study proposes a concise and highly useful method for improving the precision of the event extraction that is hindered by extra noise such as wind noise, which is difficult to characterize clearly due to its randomness. The core of the proposed method is based on the identification of the road friction sound corresponding to the frequency of interest and removing the opposite characteristics with several frequency filters. Our method enables precision maximization of driving event extraction while improving anomaly detection performance by an average of 8.506%. Therefore, we conclude our method is a practical solution suitable for road surface anomaly detection purposes in outdoor edge computing environments.

与常规的闭合设定识别相反，开放式识别（OSR）假设存在未知类别，在训练过程中未被视为模型。 OSR中的一种主要方法是度量学习，其中对模型进行了训练以分离已知类别数据的类间表示。 OSR中的许多作品报告说，即使模型仅通过已知类别的数据进行培训，模型也会意识到未知数，并学会将未知类表征与已知类别表示分开。本文通过观察雅各布的代表规范来分析这种新兴现象。从理论上讲，我们表明已知集中的阶层内距离最小化会减少已知类表征的雅各布式规范，同时最大化已知集合中的阶层间距离会增加未知类别的雅各布式规范。因此，封闭式度量学习通过迫使其雅各布规范值有所不同，从而将未知的未知数与已知分开。我们通过使用标准OSR数据集的大量证据来验证我们的理论框架。此外，在我们的理论框架下，我们解释了标准的深度学习技术如何有助于OSR并将框架作为指导原则来开发有效的OSR模型。

合并个人喜好对于高级机器翻译任务至关重要。尽管机器翻译最近进步，但正确反映个人风格仍然是一项艰巨的任务。在本文中，我们引入了一个个性化的自动后编辑框架来应对这一挑战，该挑战有效地产生了考虑不同个人行为的句子。为了构建此框架，我们首先收集后编辑数据，该数据表示来自Live Machine Translation系统的用户偏好。具体而言，现实世界的用户输入源句子进行翻译，并根据用户的首选样式编辑机器翻译的输出。然后，我们提出了一个模型，该模型结合了APE框架上的歧视器模块和特定于用户的参数。实验结果表明，该方法的表现优于四个不同指标（即BLEU，TER，YISI-1和人类评估）的其他基线模型。

本文介绍了一个分散的多代理轨迹计划（MATP）算法，该算法保证在有限的沟通范围内在障碍物丰富的环境中生成安全，无僵硬的轨迹。所提出的算法利用基于网格的多代理路径计划（MAPP）算法进行僵局，我们引入了子目标优化方法，使代理会收敛到从MAPP生成的无僵局生成的路点。此外，提出的算法通过采用线性安全走廊（LSC）来确保优化问题和避免碰撞的可行性。我们验证所提出的算法不会在随机森林和密集的迷宫中造成僵局，而不论沟通范围如何，并且在飞行时间和距离方面的表现都优于我们以前的工作。我们通过使用十个四肢的硬件演示来验证提出的算法。

随着机器学习变得普遍，减轻培训数据中存在的任何不公平性变得至关重要。在公平的各种概念中，本文的重点是众所周知的个人公平，该公平规定应该对类似的人进行类似的对待。虽然在训练模型（对处理）时可以提高个人公平性，但我们认为在模型培训（预处理）之前修复数据是一个更基本的解决方案。特别是，我们表明标签翻转是改善个人公平性的有效预处理技术。我们的系统IFLIPPER解决了限制了个人公平性违规行为的最小翻转标签的优化问题，当培训数据中的两个类似示例具有不同的标签时，发生违规情况。我们首先证明问题是NP-HARD。然后，我们提出了一种近似的线性编程算法，并提供理论保证其结果与标签翻转数量有关的结果与最佳解决方案有多近。我们还提出了使线性编程解决方案更加最佳的技术，而不会超过违规限制。实际数据集上的实验表明，在看不见的测试集的个人公平和准确性方面，IFLIPPER显着优于其他预处理基线。此外，IFLIPPER可以与处理中的技术结合使用，以获得更好的结果。