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.

我们研究了一种用于计算聚集模式的正则相互作用粒子方法，以及在两个和三个空间维度中的凯勒 - 渗透（KS）趋化系统的近乎奇异溶液，然后进一步开发出在物理参数变化下学习和生成溶液的Deepparticle（DP）方法。 KS溶液被近似为颗粒的经验度量，这些颗粒是自适应溶液的高梯度部分的。我们利用深神经网络（DNN）的表现力来表示样品从给定的初始（源）分布到有限时间t之前的目标分布的变换，而无需假设变换的可逆性。在训练阶段，我们通过最大程度地减少输入和目标经验措施之间的离散2-wasserstein距离来更新网络权重。为了降低计算成本，我们开发了一种迭代性分裂和诱导算法，以在Wasserstein距离找到最佳的过渡矩阵。我们提出了在层流和混沌流的存在下成功学习和生成KS动力学的DP框架的数值结果。这项工作中的物理参数是化学吸引者的较小扩散率，或者是在以对流为主的状态中流动幅度的相互差异。

变性自动编码器（VAE）是一种有效的神经网络体系结构，可以将语音发言性解散到扬声器身份和语言内容潜在的嵌入式中，然后为目标发言人与源扬声器的语音产生话语。通过将目标扬声器的身份嵌入以及源说明句子的源头嵌入，这是可能的。在这项工作中，我们建议通过自我注意和结构正则化（RGSM）改善VAE模型。具体而言，我们发现了VAE的解码器的合适位置，以添加一个自我发言层，以将非本地信息纳入产生转换的话语并隐藏源说话者的身份。我们应用了放松的小组分裂方法（RGSM）来正规化网络权重并显着提高泛化性能。在VCTK数据集的零射击的零射击实验中，具有自我发项层和放松的小组分裂方法，我们的模型可在未看到的扬声器上获得28.3 \％的扬声器分类准确性，而同时达到28.3 \％就MOSNET分数而言，转化语音质量略有改善。我们令人鼓舞的发现表明，未来的研究将在VAE框架中整合更多各种注意力结构，同时控制模型大小和过度拟合，以推动零射击多次播放的语音转换。

我们介绍所谓的深度氏菌法，以基于从交互粒子方法（IPM）计算的数据的物理参数来学习和生成随机动力系统的不变措施。我们利用深神经网络（DNN）的富有效力来表示从给定的输入（源）分布到任意目标分布的样本的变换，既没有假设在闭合形式中的分布函数也不是样本的有限状态空间。在培训中，我们更新网络权重，以最小化输入和目标样本之间的离散Wasserstein距离。为了降低计算成本，我们提出了一种迭代划分和征服（迷你批次内部点）算法，在WasserStein距离中找到最佳转换矩阵。我们展示了数值结果，以证明我们通过混沌流动计算反应扩散前速度在计算反应扩散前速度中产生的随机动力系统不变措施的IPM计算方法的性能。物理参数是一个大的PECL \'等数字，反映了我们兴趣的平流主导地位。

可区分架构搜索（飞镖）是基于解决双重优化问题的数据驱动神经网络设计的有效方法。尽管在许多体系结构搜索任务中取得了成功，但仍然担心一阶飞镖的准确性和二阶飞镖的效率。在本文中，我们制定了单个级别的替代方案和放松的体系结构搜索（RARTS）方法，该方法通过数据和网络拆分利用整个数据集在体系结构学习中，而无需涉及相应损失功能（如飞镖）的混合第二个衍生物。在我们制定网络拆分的过程中，两个具有不同但相关权重的网络在寻找共享体系结构时进行了合作。 RART比飞镖的优势通过收敛定理和可解析的模型证明是合理的。此外，RART在准确性和搜索效率方面优于飞镖及其变体，如足够的实验结果所示。对于搜索拓扑结构（即边缘和操作）的任务，RART获得了比CIFAR-10上的二阶Darts更高的精度和60 \％的计算成本降低。转移到Imagenet时，RART继续超越表演飞镖，并且与最近的飞镖变体相提并论，尽管我们的创新纯粹是在训练算法上，而无需修改搜索空间。对于搜索宽度的任务，即卷积层中的频道数量，RARTS还优于传统的网络修剪基准。关于公共体系结构搜索基准等NATS BENCH的进一步实验也支持RARTS的优势。

Different people speak with diverse personalized speaking styles. Although existing one-shot talking head methods have made significant progress in lip sync, natural facial expressions, and stable head motions, they still cannot generate diverse speaking styles in the final talking head videos. To tackle this problem, we propose a one-shot style-controllable talking face generation framework. In a nutshell, we aim to attain a speaking style from an arbitrary reference speaking video and then drive the one-shot portrait to speak with the reference speaking style and another piece of audio. Specifically, we first develop a style encoder to extract dynamic facial motion patterns of a style reference video and then encode them into a style code. Afterward, we introduce a style-controllable decoder to synthesize stylized facial animations from the speech content and style code. In order to integrate the reference speaking style into generated videos, we design a style-aware adaptive transformer, which enables the encoded style code to adjust the weights of the feed-forward layers accordingly. Thanks to the style-aware adaptation mechanism, the reference speaking style can be better embedded into synthesized videos during decoding. Extensive experiments demonstrate that our method is capable of generating talking head videos with diverse speaking styles from only one portrait image and an audio clip while achieving authentic visual effects. Project Page: https://github.com/FuxiVirtualHuman/styletalk.

Nowadays, time-stamped web documents related to a general news query floods spread throughout the Internet, and timeline summarization targets concisely summarizing the evolution trajectory of events along the timeline. Unlike traditional document summarization, timeline summarization needs to model the time series information of the input events and summarize important events in chronological order. To tackle this challenge, in this paper, we propose a Unified Timeline Summarizer (UTS) that can generate abstractive and extractive timeline summaries in time order. Concretely, in the encoder part, we propose a graph-based event encoder that relates multiple events according to their content dependency and learns a global representation of each event. In the decoder part, to ensure the chronological order of the abstractive summary, we propose to extract the feature of event-level attention in its generation process with sequential information remained and use it to simulate the evolutionary attention of the ground truth summary. The event-level attention can also be used to assist in extracting summary, where the extracted summary also comes in time sequence. We augment the previous Chinese large-scale timeline summarization dataset and collect a new English timeline dataset. Extensive experiments conducted on these datasets and on the out-of-domain Timeline 17 dataset show that UTS achieves state-of-the-art performance in terms of both automatic and human evaluations.

Masked image modeling (MIM) has shown great promise for self-supervised learning (SSL) yet been criticized for learning inefficiency. We believe the insufficient utilization of training signals should be responsible. To alleviate this issue, we introduce a conceptually simple yet learning-efficient MIM training scheme, termed Disjoint Masking with Joint Distillation (DMJD). For disjoint masking (DM), we sequentially sample multiple masked views per image in a mini-batch with the disjoint regulation to raise the usage of tokens for reconstruction in each image while keeping the masking rate of each view. For joint distillation (JD), we adopt a dual branch architecture to respectively predict invisible (masked) and visible (unmasked) tokens with superior learning targets. Rooting in orthogonal perspectives for training efficiency improvement, DM and JD cooperatively accelerate the training convergence yet not sacrificing the model generalization ability. Concretely, DM can train ViT with half of the effective training epochs (3.7 times less time-consuming) to report competitive performance. With JD, our DMJD clearly improves the linear probing classification accuracy over ConvMAE by 5.8%. On fine-grained downstream tasks like semantic segmentation, object detection, etc., our DMJD also presents superior generalization compared with state-of-the-art SSL methods. The code and model will be made public at https://github.com/mx-mark/DMJD.

Improving the visual quality of the given degraded observation by correcting exposure level is a fundamental task in the computer vision community. Existing works commonly lack adaptability towards unknown scenes because of the data-driven patterns (deep networks) and limited regularization (traditional optimization), and they usually need time-consuming inference. These two points heavily limit their practicability. In this paper, we establish a Practical Exposure Corrector (PEC) that assembles the characteristics of efficiency and performance. To be concrete, we rethink the exposure correction to provide a linear solution with exposure-sensitive compensation. Around generating the compensation, we introduce an exposure adversarial function as the key engine to fully extract valuable information from the observation. By applying the defined function, we construct a segmented shrinkage iterative scheme to generate the desired compensation. Its shrinkage nature supplies powerful support for algorithmic stability and robustness. Extensive experimental evaluations fully reveal the superiority of our proposed PEC. The code is available at https://rsliu.tech/PEC.

Diagram object detection is the key basis of practical applications such as textbook question answering. Because the diagram mainly consists of simple lines and color blocks, its visual features are sparser than those of natural images. In addition, diagrams usually express diverse knowledge, in which there are many low-frequency object categories in diagrams. These lead to the fact that traditional data-driven detection model is not suitable for diagrams. In this work, we propose a gestalt-perception transformer model for diagram object detection, which is based on an encoder-decoder architecture. Gestalt perception contains a series of laws to explain human perception, that the human visual system tends to perceive patches in an image that are similar, close or connected without abrupt directional changes as a perceptual whole object. Inspired by these thoughts, we build a gestalt-perception graph in transformer encoder, which is composed of diagram patches as nodes and the relationships between patches as edges. This graph aims to group these patches into objects via laws of similarity, proximity, and smoothness implied in these edges, so that the meaningful objects can be effectively detected. The experimental results demonstrate that the proposed GPTR achieves the best results in the diagram object detection task. Our model also obtains comparable results over the competitors in natural image object detection.