FerateAi是一个基于Pytorch的图书馆，旨在促进深度神经网络压缩技术的利用，例如稀疏，修剪，知识蒸馏或正则化。该库的构建是为了实现快速实施和实验。尤其是，压缩技术是利用Fastai和Pytorch Lightning等库的回调系统来带来用户友好和高级API。 Forperai的主要资产是其轻巧但功能强大，使用的简单性。确实，由于它是以非常细粒度的方式开发的，因此用户可以使用不同的参数组合来创建数千个独特的实验。在本文中，我们着重于代表图书馆的核心的Perastai的稀疏功能。在forperai中对神经网络进行稀疏只需要在传统培训循环中进行单一的代码，但允许执行最先进的技术，例如彩票票证假设实验

在过去几年中，神经字符动画已经出现并提供了一种动画虚拟字符的自动方法。它们的运动由神经网络合成。用用户定义的控制信号实时控制该运动也是视频游戏中的重要任务。基于全连接层（MLP）和专家混合物（MOE）的解决方案已经令人印象深刻的导致产生和控制环境与虚拟字符之间的近距离相互作用的各种运动。然而，完全连接层的主要缺点是它们的计算和内存成本，可能导致子优化的解决方案。在这项工作中，我们在交互式角色动画的背景下应用修剪算法以压缩MLP-Moe神经网络，这降低了其参数的数量，并在该加速度和合成的运动质量之间进行权衡加速其计算时间。这项工作表明，通过相同数量的专家和参数，修剪模型产生的运动伪像比密集模型更少，并且学习的高级运动功能对于两者相似

视觉关注估计是不同学科的十字路口的一个积极的研究领域：计算机视觉，人工智能和医学。估计表示关注的显着图的最常见方法之一是基于观察到的图像。在本文中，我们表明可以从EEG采集中检索视觉注意力。结果与观察到的图像的传统预测相当，这具有很大的兴趣。为此目的，已经记录了一组信号，并且已经开发出不同的模型来研究视觉关注与大脑活动之间的关系。结果令人鼓舞，与其他方式的其他方法令人鼓舞，与其他方式相比。本文考虑的代码和数据集已在\ URL {https://figshare.com/s/3e353bd1c621962888AD}中提供，以促进该领域的研究。

近年来，深度神经网络在各种应用领域中都有广泛的成功。但是，它们需要重要的计算和内存资源，严重阻碍其部署，特别是在移动设备上或实时应用程序。神经网络通常涉及大量参数，该参数对应于网络的权重。在培训过程中获得的这种参数是用于网络性能的决定因素。但是，它们也非常冗余。修剪方法尤其试图通过识别和移除不相关的重量来减小参数集的大小。在本文中，我们研究了培训策略对修剪效率的影响。考虑和比较了两种培训方式：（1）微调和（2）从头开始。在四个数据集（CIFAR10，CiFAR100，SVHN和CALTECH101）上获得的实验结果和两个不同的CNNS（VGG16和MOBILENET）证明已经在大语料库（例如想象成）上预先培训的网络，然后进行微调特定数据集可以更有效地修剪（高达80％的参数减少），而不是从头开始培训的相同网络。

在神经网络中引入稀疏性是一种有效的方法，可以降低其复杂性，同时保持其性能几乎完好无损。在大多数情况下，使用三阶段管道引入稀疏性：1）训练模型以收敛，2）根据某些标准修剪模型，3）微调修剪模型以恢复性能。最后两个步骤通常是迭代执行的，从而导致合理的结果，但也取得了耗时且复杂的过程。在我们的工作中，我们建议摆脱管道的第一步，并在单个修剪训练周期中结合其他两个步骤，从而使模型在修剪时共同学习最佳权重。我们通过介绍一个名为One Cycle Pruning的小说修剪时间表来做到这一点，该时间表从培训开始就开始修剪，直到最后。采用这样的时间表不仅可以更好地执行修剪模型，而且还大大降低了修剪模型所需的培训预算。实验是在多种架构（VGG-16和RESNET-18）和数据集（CIFAR-10，CIFAR-100和CALTECH-101）上进行的，以及相对较高的稀疏值（80％，90％，95％的权重，删除）。我们的结果表明，按固定的培训预算，一环修剪始终优于通常使用的修剪时间表，例如单发修剪，迭代修剪和自动化逐渐修剪。

Feature selection helps reduce data acquisition costs in ML, but the standard approach is to train models with static feature subsets. Here, we consider the dynamic feature selection (DFS) problem where a model sequentially queries features based on the presently available information. DFS is often addressed with reinforcement learning (RL), but we explore a simpler approach of greedily selecting features based on their conditional mutual information. This method is theoretically appealing but requires oracle access to the data distribution, so we develop a learning approach based on amortized optimization. The proposed method is shown to recover the greedy policy when trained to optimality and outperforms numerous existing feature selection methods in our experiments, thus validating it as a simple but powerful approach for this problem.

We demonstrate how efficient autonomous drone swarms can be in detecting and tracking occluded targets in densely forested areas, such as lost people during search and rescue missions. Exploration and optimization of local viewing conditions, such as occlusion density and target view obliqueness, provide much faster and much more reliable results than previous, blind sampling strategies that are based on pre-defined waypoints. An adapted real-time particle swarm optimization and a new objective function are presented that are able to deal with dynamic and highly random through-foliage conditions. Synthetic aperture sensing is our fundamental sampling principle, and drone swarms are employed to approximate the optical signals of extremely wide and adaptable airborne lenses.

Sequential testing, always-valid $p$-values, and confidence sequences promise flexible statistical inference and on-the-fly decision making. However, unlike fixed-$n$ inference based on asymptotic normality, existing sequential tests either make parametric assumptions and end up under-covering/over-rejecting when these fail or use non-parametric but conservative concentration inequalities and end up over-covering/under-rejecting. To circumvent these issues, we sidestep exact at-least-$\alpha$ coverage and focus on asymptotically exact coverage and asymptotic optimality. That is, we seek sequential tests whose probability of ever rejecting a true hypothesis asymptotically approaches $\alpha$ and whose expected time to reject a false hypothesis approaches a lower bound on all tests with asymptotic coverage at least $\alpha$, both under an appropriate asymptotic regime. We permit observations to be both non-parametric and dependent and focus on testing whether the observations form a martingale difference sequence. We propose the universal sequential probability ratio test (uSPRT), a slight modification to the normal-mixture sequential probability ratio test, where we add a burn-in period and adjust thresholds accordingly. We show that even in this very general setting, the uSPRT is asymptotically optimal under mild generic conditions. We apply the results to stabilized estimating equations to test means, treatment effects, etc. Our results also provide corresponding guarantees for the implied confidence sequences. Numerical simulations verify our guarantees and the benefits of the uSPRT over alternatives.

Large language models (LLMs) have demonstrated impressive capabilities in natural language understanding and generation, but the quality bar for medical and clinical applications is high. Today, attempts to assess models' clinical knowledge typically rely on automated evaluations on limited benchmarks. There is no standard to evaluate model predictions and reasoning across a breadth of tasks. To address this, we present MultiMedQA, a benchmark combining six existing open question answering datasets spanning professional medical exams, research, and consumer queries; and HealthSearchQA, a new free-response dataset of medical questions searched online. We propose a framework for human evaluation of model answers along multiple axes including factuality, precision, possible harm, and bias. In addition, we evaluate PaLM (a 540-billion parameter LLM) and its instruction-tuned variant, Flan-PaLM, on MultiMedQA. Using a combination of prompting strategies, Flan-PaLM achieves state-of-the-art accuracy on every MultiMedQA multiple-choice dataset (MedQA, MedMCQA, PubMedQA, MMLU clinical topics), including 67.6% accuracy on MedQA (US Medical License Exam questions), surpassing prior state-of-the-art by over 17%. However, human evaluation reveals key gaps in Flan-PaLM responses. To resolve this we introduce instruction prompt tuning, a parameter-efficient approach for aligning LLMs to new domains using a few exemplars. The resulting model, Med-PaLM, performs encouragingly, but remains inferior to clinicians. We show that comprehension, recall of knowledge, and medical reasoning improve with model scale and instruction prompt tuning, suggesting the potential utility of LLMs in medicine. Our human evaluations reveal important limitations of today's models, reinforcing the importance of both evaluation frameworks and method development in creating safe, helpful LLM models for clinical applications.

Transformers have been essential to pretraining success in NLP. Other architectures have been used, but require attention layers to match benchmark accuracy. This work explores pretraining without attention. We test recently developed routing layers based on state-space models (SSM) and model architectures based on multiplicative gating. Used together these modeling choices have a large impact on pretraining accuracy. Empirically the proposed Bidirectional Gated SSM (BiGS) replicates BERT pretraining results without attention and can be extended to long-form pretraining of 4096 tokens without approximation.