仇恨言论是一种在线骚扰的形式，涉及使用滥用语言，并且在社交媒体帖子中通常可以看到。这种骚扰主要集中在诸如宗教，性别，种族等的特定群体特征上，如今它既有社会和经济后果。文本文章中对滥用语言的自动检测一直是一项艰巨的任务，但最近它从科学界获得了很多兴趣。本文解决了在社交媒体中辨别仇恨内容的重要问题。我们在这项工作中提出的模型是基于LSTM神经网络体系结构的现有方法的扩展，我们在短文中适当地增强和微调以检测某些形式的仇恨语言，例如种族主义或性别歧视。最重要的增强是转换为由复发性神经网络（RNN）分类器组成的两阶段方案。将第一阶段的所有一Vs式分类器（OVR）分类器的输出组合在一起，并用于训练第二阶段分类器，最终决定了骚扰的类型。我们的研究包括对在16K推文的公共语料库中评估的第二阶段提出的几种替代方法的性能比较，然后对另一个数据集进行了概括研究。报道的结果表明，与当前的最新技术相比，在仇恨言论检测任务中，所提出的方案的分类质量出色。

预先训练的大语言模型（LLM）（例如OpenAI Codex）通过从非正式自然语言（NL）意图中生成自然代码来自动化编码的重要方面。但是，生成的代码无法满足用户意图的任何正确性保证。实际上，很难定义正确性的概念，因为自然语言可能是模棱两可的，并且缺乏正式的语义。在本文中，我们通过提出测试驱动的用户形式化（TDUIF）的工作流程来解决以上问题的第一步，该工作流利用轻量级用户的反馈共同将用户的意图正式化为测试（部分规范） ），（b）生成符合正式用户意图的代码。要对算法进行可扩展的大规模自动化评估，而无需循环中的用户，我们描述了如何使用参考解决方案模拟用户与高保真性的互动。我们还描述并实施了几种算法组件（包括突变和排名一组测试）的替代实现，这些实现可用于有效解决TDUIF问题。我们已经开发了一个系统的Ticoder，该系统实现了多种解决方案来进行TDUIF，并将其对MBPP学术代码生成基准测试的相对有效性进行了比较。在MBPP上使用OpenAI Codex LLM的结果很有希望：我们的最佳算法将通行证@1代码生成准确度指标从48.39％提高到单个用户查询，最高为85.48％，最多可达55.48％，最多可提供5个用户查询。其次，我们可以生成与用户意图在1.69个用户查询中的非平凡功能单位测试，该数据集为90.40％的示例，用于此数据集。

无人驾驶汽车（UAV）的使用提供了各种应用程序的许多优势。但是，安全保证是广泛使用的关键障碍，尤其是考虑到无人机所经历的不可预测的操作和环境因素，这些因素很难仅在设计时间内捕获。本文提出了一种称为SAFEDRONES的新可靠性建模方法，以通过实现无人机的运行时可靠性和风险评估来帮助解决此问题。它是可执行数字可靠身份（EDDI）概念的原型实例化，该概念旨在为多机器人系统的实时，数据驱动的可靠性保证创建基于模型的解决方案。通过提供实时可靠性估算，SAFEDRONES允许无人机以自适应方式相应地更新其任务。

认知偏见是人类在处理信息和环境中使用的精神捷径，这会导致偏见的行动和行为（或行动），对自己不知所措。偏见采取了多种形式，认知偏见占据了核心作用，造成公平，问责制，透明，道德，法律，医学和歧视。偏见的检测被认为是朝着缓解措施的必要步骤。在此，我们专注于两个认知偏见 - 锚定和新近度。计算机科学中认知偏见的识别在很大程度上是在信息检索的领域中，并且在注释数据的帮助下在总级别上确定了偏差。提出了不同的偏见检测方向，我们提供了一种原则性的方法，以及机器学习以从用户操作的Web日志中检测这两个认知偏见。我们的个人用户级别检测使其真正个性化，并且不依赖注释的数据。取而代之的是，我们从认知心理学中建立的两个基本原理开始，使用注意力网络的修改培训，并根据这些原则以新颖的方式解释注意力权重，以推断和区分这两种偏见。个性化方法允许对特定用户进行检测，这些用户在执行任务时容易受到这些偏见的影响，并且可以帮助他们之间建立意识以进行偏见缓解。

要将计算负担从实时到延迟关键电源系统应用程序的脱机，最近的作品招待使用深神经网络（DNN）的想法来预测一次呈现的AC最佳功率流（AC-OPF）的解决方案负载需求。随着网络拓扑可能改变的，以样本有效的方式训练该DNN成为必需品。为提高数据效率，这项工作利用了OPF数据不是简单的训练标签，而是构成参数优化问题的解决方案。因此，我们倡导培训一个灵敏度通知的DNN（SI-DNN），不仅可以匹配OPF优化器，而且还匹配它们的部分导数相对于OPF参数（负载）。结果表明，所需的雅可比矩阵确实存在于温和条件下，并且可以从相关的原始/双解决方案中容易地计算。所提出的Si-DNN与广泛的OPF溶剂兼容，包括非凸出的二次约束的二次程序（QCQP），其半纤维程序（SDP）放松和MatPower;虽然Si-DNN可以在其他学习到OPF方案中无缝集成。三个基准电源系统的数值测试证实了SI-DNN在传统训练的DNN上预测的OPF解决方案的高级泛化和约束满意度，尤其是在低数据设置中。

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.

View-dependent effects such as reflections pose a substantial challenge for image-based and neural rendering algorithms. Above all, curved reflectors are particularly hard, as they lead to highly non-linear reflection flows as the camera moves. We introduce a new point-based representation to compute Neural Point Catacaustics allowing novel-view synthesis of scenes with curved reflectors, from a set of casually-captured input photos. At the core of our method is a neural warp field that models catacaustic trajectories of reflections, so complex specular effects can be rendered using efficient point splatting in conjunction with a neural renderer. One of our key contributions is the explicit representation of reflections with a reflection point cloud which is displaced by the neural warp field, and a primary point cloud which is optimized to represent the rest of the scene. After a short manual annotation step, our approach allows interactive high-quality renderings of novel views with accurate reflection flow. Additionally, the explicit representation of reflection flow supports several forms of scene manipulation in captured scenes, such as reflection editing, cloning of specular objects, reflection tracking across views, and comfortable stereo viewing. We provide the source code and other supplemental material on https://repo-sam.inria.fr/ fungraph/neural_catacaustics/

Modelling and forecasting real-life human behaviour using online social media is an active endeavour of interest in politics, government, academia, and industry. Since its creation in 2006, Twitter has been proposed as a potential laboratory that could be used to gauge and predict social behaviour. During the last decade, the user base of Twitter has been growing and becoming more representative of the general population. Here we analyse this user base in the context of the 2021 Mexican Legislative Election. To do so, we use a dataset of 15 million election-related tweets in the six months preceding election day. We explore different election models that assign political preference to either the ruling parties or the opposition. We find that models using data with geographical attributes determine the results of the election with better precision and accuracy than conventional polling methods. These results demonstrate that analysis of public online data can outperform conventional polling methods, and that political analysis and general forecasting would likely benefit from incorporating such data in the immediate future. Moreover, the same Twitter dataset with geographical attributes is positively correlated with results from official census data on population and internet usage in Mexico. These findings suggest that we have reached a period in time when online activity, appropriately curated, can provide an accurate representation of offline behaviour.

Existing federated classification algorithms typically assume the local annotations at every client cover the same set of classes. In this paper, we aim to lift such an assumption and focus on a more general yet practical non-IID setting where every client can work on non-identical and even disjoint sets of classes (i.e., client-exclusive classes), and the clients have a common goal which is to build a global classification model to identify the union of these classes. Such heterogeneity in client class sets poses a new challenge: how to ensure different clients are operating in the same latent space so as to avoid the drift after aggregation? We observe that the classes can be described in natural languages (i.e., class names) and these names are typically safe to share with all parties. Thus, we formulate the classification problem as a matching process between data representations and class representations and break the classification model into a data encoder and a label encoder. We leverage the natural-language class names as the common ground to anchor the class representations in the label encoder. In each iteration, the label encoder updates the class representations and regulates the data representations through matching. We further use the updated class representations at each round to annotate data samples for locally-unaware classes according to similarity and distill knowledge to local models. Extensive experiments on four real-world datasets show that the proposed method can outperform various classical and state-of-the-art federated learning methods designed for learning with non-IID data.

Modern speech recognition systems exhibits rapid performance degradation under domain shift. This issue is especially prevalent in data-scarce settings, such as low-resource languages, where diversity of training data is limited. In this work we propose M2DS2, a simple and sample-efficient finetuning strategy for large pretrained speech models, based on mixed source and target domain self-supervision. We find that including source domain self-supervision stabilizes training and avoids mode collapse of the latent representations. For evaluation, we collect HParl, a $120$ hour speech corpus for Greek, consisting of plenary sessions in the Greek Parliament. We merge HParl with two popular Greek corpora to create GREC-MD, a test-bed for multi-domain evaluation of Greek ASR systems. In our experiments we find that, while other Unsupervised Domain Adaptation baselines fail in this resource-constrained environment, M2DS2 yields significant improvements for cross-domain adaptation, even when a only a few hours of in-domain audio are available. When we relax the problem in a weakly supervised setting, we find that independent adaptation for audio using M2DS2 and language using simple LM augmentation techniques is particularly effective, yielding word error rates comparable to the fully supervised baselines.