Denoising Diffusion Probabilistic Models (DDPMs) are emerging in text-to-speech (TTS) synthesis because of their strong capability of generating high-fidelity samples. However, their iterative refinement process in high-dimensional data space results in slow inference speed, which restricts their application in real-time systems. Previous works have explored speeding up by minimizing the number of inference steps but at the cost of sample quality. In this work, to improve the inference speed for DDPM-based TTS model while achieving high sample quality, we propose ResGrad, a lightweight diffusion model which learns to refine the output spectrogram of an existing TTS model (e.g., FastSpeech 2) by predicting the residual between the model output and the corresponding ground-truth speech. ResGrad has several advantages: 1) Compare with other acceleration methods for DDPM which need to synthesize speech from scratch, ResGrad reduces the complexity of task by changing the generation target from ground-truth mel-spectrogram to the residual, resulting into a more lightweight model and thus a smaller real-time factor. 2) ResGrad is employed in the inference process of the existing TTS model in a plug-and-play way, without re-training this model. We verify ResGrad on the single-speaker dataset LJSpeech and two more challenging datasets with multiple speakers (LibriTTS) and high sampling rate (VCTK). Experimental results show that in comparison with other speed-up methods of DDPMs: 1) ResGrad achieves better sample quality with the same inference speed measured by real-time factor; 2) with similar speech quality, ResGrad synthesizes speech faster than baseline methods by more than 10 times. Audio samples are available at https://resgrad1.github.io/.

Video dubbing aims to translate the original speech in a film or television program into the speech in a target language, which can be achieved with a cascaded system consisting of speech recognition, machine translation and speech synthesis. To ensure the translated speech to be well aligned with the corresponding video, the length/duration of the translated speech should be as close as possible to that of the original speech, which requires strict length control. Previous works usually control the number of words or characters generated by the machine translation model to be similar to the source sentence, without considering the isochronicity of speech as the speech duration of words/characters in different languages varies. In this paper, we propose a machine translation system tailored for the task of video dubbing, which directly considers the speech duration of each token in translation, to match the length of source and target speech. Specifically, we control the speech length of generated sentence by guiding the prediction of each word with the duration information, including the speech duration of itself as well as how much duration is left for the remaining words. We design experiments on four language directions (German -> English, Spanish -> English, Chinese <-> English), and the results show that the proposed method achieves better length control ability on the generated speech than baseline methods. To make up the lack of real-world datasets, we also construct a real-world test set collected from films to provide comprehensive evaluations on the video dubbing task.

像有声读物的综合一样，表达性语音综合仍然对样式表示学习和预测仍然具有挑战性。从参考音频或从文本预测样式标签中得出的标签需要大量标记的数据，这是昂贵的，并且难以准确定义和注释。在本文中，我们提出了一个新颖的框架，以一种自我监督的方式从丰富的纯文本中学习样式表示。它利用情感词典，并使用对比度学习和深度聚类。我们进一步将样式表示形式整合为多式变压器TTS中的条件嵌入。通过预测在同一数据集上训练的样式标签，但通过人类注释，我们的方法根据对声音域内和室外测试集的主观评估来改进结果，从而获得了改进的结果。此外，有了隐性的背景感知样式表示，长期综合音频的情感过渡似乎更自然。音频样本可在演示网络上找到。

如最近的研究所示，支持机器智能的系统容易受到对抗性操纵或自然分配变化产生的测试案例的影响。这引起了人们对现实应用程序部署机器学习算法的极大关注，尤其是在自动驾驶（AD）等安全性领域中。另一方面，由于自然主义场景的传统广告测试需要数亿英里，这是由于现实世界中安全关键方案的高度和稀有性。结果，已经探索了几种自动驾驶评估方法，但是，这些方法通常是基于不同的仿真平台，安全性 - 关键的情况的类型，场景生成算法和驾驶路线变化的方法。因此，尽管在自动驾驶测试方面进行了大量努力，但在相似条件下，比较和了解不同测试场景产生算法和测试机制的有效性和效率仍然是一项挑战。在本文中，我们旨在提供第一个统一的平台Safebench，以整合不同类型的安全性测试方案，场景生成算法以及其他变体，例如驾驶路线和环境。同时，我们实施了4种基于深入学习的AD算法，具有4种类型的输入（例如，鸟类视图，相机，相机），以对SafeBench进行公平的比较。我们发现，我们的生成的测试场景确实更具挑战性，并观察到在良性和关键安全测试方案下的广告代理的性能之间的权衡。我们认为，我们的统一平台安全基地用于大规模和有效的自动驾驶测试，将激发新的测试场景生成和安全AD算法的开发。 SafeBench可从https://safebench.github.io获得。

在具有图形表示学习的结构预测的问题（GRL短路）的问题中，算法返回的假设将目标顶点的\ EMPH {接收字段}的一组特征映射到其标签。为了了解这些算法的可读性，我们介绍了较弱的均匀稳定性形式，称为\ emph {多保真稳定性}，并为弱依赖性图形提供学习保证。我们在接收场稀疏时，在对单个样品的泛化上索取的〜\ CiteT {London2016Stability}的索赔。此外，我们研究了两个流行算法的稳定性诱导：\ TextBF {（1）}在凸面和非凸景观下的随机梯度下降。在该示例中，我们提供了非渐近界，其高度依赖于由算法构建的接收场的稀疏性。 \ TextBF {（2）} 1层线性等级GNN上的约束回归问题。在这个例子中，我们为两种类型的稳定性之间的差异呈现了下限，这使得多保真设计证明了这两种类型的稳定性。

这项工作解决了通过顶点之间的通信学习网络的问题。顶点之间的通信以扰动对测量的形式呈现。我们研究了从均匀ergodic随机图工艺（简称RGPS的RGPS）中汲取样本的场景，这为感兴趣的问题提供了自然的数学上下文。对于二进制分类问题，我们获得的结果使统一的学习能力作为最坏情况的理论限制。我们介绍了结构改造的复杂性，它自然地融合到VC理论中，以至于第一刻。凭借Martingale方法和Marton的耦合，我们建立了统一收敛的尾部，并为经验风险最小化提供了一致性保证。在这项工作中使用的技术来获得高概率界限对于具有和没有网络结构的其他混合过程是独立的兴趣。

我们考虑基于嘈杂的成对比较恢复一组$ N $项等级的问题。我们假设SST类作为生成模型的家庭。我们的分析为确切要求提供了尖锐的信息理论和下限，符合参数限制。我们对瞬间方法引起的算法的严格分析在最低限度的最佳速率下比〜\ CiteT {Shah2017Simple}更好地持续，并有助于他们的公开问题。我们在这项工作中使用的策略以获取信息理论界的基于组合论点，并且是独立的兴趣。

Designing experiments often requires balancing between learning about the true treatment effects and earning from allocating more samples to the superior treatment. While optimal algorithms for the Multi-Armed Bandit Problem (MABP) provide allocation policies that optimally balance learning and earning, they tend to be computationally expensive. The Gittins Index (GI) is a solution to the MABP that can simultaneously attain optimality and computationally efficiency goals, and it has been recently used in experiments with Bernoulli and Gaussian rewards. For the first time, we present a modification of the GI rule that can be used in experiments with exponentially-distributed rewards. We report its performance in simulated 2- armed and 3-armed experiments. Compared to traditional non-adaptive designs, our novel GI modified design shows operating characteristics comparable in learning (e.g. statistical power) but substantially better in earning (e.g. direct benefits). This illustrates the potential that designs using a GI approach to allocate participants have to improve participant benefits, increase efficiencies, and reduce experimental costs in adaptive multi-armed experiments with exponential rewards.

Transformer has achieved impressive successes for various computer vision tasks. However, most of existing studies require to pretrain the Transformer backbone on a large-scale labeled dataset (e.g., ImageNet) for achieving satisfactory performance, which is usually unavailable for medical images. Additionally, due to the gap between medical and natural images, the improvement generated by the ImageNet pretrained weights significantly degrades while transferring the weights to medical image processing tasks. In this paper, we propose Bootstrap Own Latent of Transformer (BOLT), a self-supervised learning approach specifically for medical image classification with the Transformer backbone. Our BOLT consists of two networks, namely online and target branches, for self-supervised representation learning. Concretely, the online network is trained to predict the target network representation of the same patch embedding tokens with a different perturbation. To maximally excavate the impact of Transformer from limited medical data, we propose an auxiliary difficulty ranking task. The Transformer is enforced to identify which branch (i.e., online/target) is processing the more difficult perturbed tokens. Overall, the Transformer endeavours itself to distill the transformation-invariant features from the perturbed tokens to simultaneously achieve difficulty measurement and maintain the consistency of self-supervised representations. The proposed BOLT is evaluated on three medical image processing tasks, i.e., skin lesion classification, knee fatigue fracture grading and diabetic retinopathy grading. The experimental results validate the superiority of our BOLT for medical image classification, compared to ImageNet pretrained weights and state-of-the-art self-supervised learning approaches.

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.