溃疡性结肠炎（UC）分类，是内窥镜诊断的重要任务，涉及两个主要困难。首先，具有关于UC（正或负）注释的内窥镜图像通常是有限的。其次，由于冒号中的位置，它们在外观上显示出大的变化。特别是，第二个困难阻止了我们使用现有的半监督学习技术，这是第一个难度的常见补救措施。在本文中，我们通过新利用两个附加特征，提出了一种用于UC分类的实际半监督学习方法，结肠中的位置（例如，左冒号）和图像捕获顺序，两者通常都附加到内窥镜中的各个图像图像序列。该方法可以通过与这些功能有效地提取UC分类的基本信息。实验结果表明，所提出的方法在分类任务中优于若干现有的半监督学习方法，即使具有少量注释的图像。

我们培训了深度神经网络（DNN）作为中微子能量密度，助熔剂和流体速度的函数，以再现在我们的第一原理核心崩溃超新星（CCSN）模拟中获得的Eddington Tensor。虽然是中微子运输的最流行近似的矩的方法需要闭合关系，但文献中通常采用的分析闭合关系都没有捕获动量空间中的中微子角分布的所有方面。在本文中，我们通过使用将中微子能量密度，磁通量和流体速度作为输入和埃丁顿张量作为输出来开发闭合关系。我们考虑两种DNN：传统的DNN命名为组分 - 明智的神经网络（CWNN）和张力基神经网络（TBNN）。我们发现，埃丁顿张量的对角线组件由DNN比M1封闭关系更好地再现，特别是对于低到中间能量。对于非对角线组件，DNN与Boltzmann求解器更好地达到比大半径的M1闭合更好。在两个DNN之间的比较中，TBNN具有比CWNN稍微更好的性能。通过基于DNN的新的封闭关系，该DNN良好地重现Eddington Tensor的成本更小，我们为瞬间方法开辟了一种新的可能性。

Classification bandits are multi-armed bandit problems whose task is to classify a given set of arms into either positive or negative class depending on whether the rate of the arms with the expected reward of at least h is not less than w for given thresholds h and w. We study a special classification bandit problem in which arms correspond to points x in d-dimensional real space with expected rewards f(x) which are generated according to a Gaussian process prior. We develop a framework algorithm for the problem using various arm selection policies and propose policies called FCB and FTSV. We show a smaller sample complexity upper bound for FCB than that for the existing algorithm of the level set estimation, in which whether f(x) is at least h or not must be decided for every arm's x. Arm selection policies depending on an estimated rate of arms with rewards of at least h are also proposed and shown to improve empirical sample complexity. According to our experimental results, the rate-estimation versions of FCB and FTSV, together with that of the popular active learning policy that selects the point with the maximum variance, outperform other policies for synthetic functions, and the version of FTSV is also the best performer for our real-world dataset.

This study targets the mixed-integer black-box optimization (MI-BBO) problem where continuous and integer variables should be optimized simultaneously. The CMA-ES, our focus in this study, is a population-based stochastic search method that samples solution candidates from a multivariate Gaussian distribution (MGD), which shows excellent performance in continuous BBO. The parameters of MGD, mean and (co)variance, are updated based on the evaluation value of candidate solutions in the CMA-ES. If the CMA-ES is applied to the MI-BBO with straightforward discretization, however, the variance corresponding to the integer variables becomes much smaller than the granularity of the discretization before reaching the optimal solution, which leads to the stagnation of the optimization. In particular, when binary variables are included in the problem, this stagnation more likely occurs because the granularity of the discretization becomes wider, and the existing modification to the CMA-ES does not address this stagnation. To overcome these limitations, we propose a simple extension of the CMA-ES based on lower-bounding the marginal probabilities associated with the generation of integer variables in the MGD. The numerical experiments on the MI-BBO benchmark problems demonstrate the efficiency and robustness of the proposed method. Furthermore, in order to demonstrate the generality of the idea of the proposed method, in addition to the single-objective optimization case, we incorporate it into multi-objective CMA-ES and verify its performance on bi-objective mixed-integer benchmark problems.

The long-standing theory that a colour-naming system evolves under the dual pressure of efficient communication and perceptual mechanism is supported by more and more linguistic studies including the analysis of four decades' diachronic data from the Nafaanra language. This inspires us to explore whether artificial intelligence could evolve and discover a similar colour-naming system via optimising the communication efficiency represented by high-level recognition performance. Here, we propose a novel colour quantisation transformer, CQFormer, that quantises colour space while maintaining the accuracy of machine recognition on the quantised images. Given an RGB image, Annotation Branch maps it into an index map before generating the quantised image with a colour palette, meanwhile the Palette Branch utilises a key-point detection way to find proper colours in palette among whole colour space. By interacting with colour annotation, CQFormer is able to balance both the machine vision accuracy and colour perceptual structure such as distinct and stable colour distribution for discovered colour system. Very interestingly, we even observe the consistent evolution pattern between our artificial colour system and basic colour terms across human languages. Besides, our colour quantisation method also offers an efficient quantisation method that effectively compresses the image storage while maintaining a high performance in high-level recognition tasks such as classification and detection. Extensive experiments demonstrate the superior performance of our method with extremely low bit-rate colours. We will release the source code soon.

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.

我们提出了一种轻巧，准确的方法，用于检测视频中的异常情况。现有方法使用多个实体学习（MIL）来确定视频每个段的正常/异常状态。最近的成功研​​究认为，学习细分市场之间的时间关系很重要，以达到高精度，而不是只关注单个细分市场。因此，我们分析了近年来成功的现有方法，并发现同时学习所有细分市场确实很重要，但其中的时间顺序与实现高准确性无关。基于这一发现，我们不使用MIL框架，而是提出具有自发机制的轻质模型，以自动提取对于确定所有输入段正常/异常非常重要的特征。结果，我们的神经网络模型具有现有方法的参数数量的1.3％。我们在三个基准数据集（UCF-Crime，Shanghaitech和XD-Violence）上评估了方法的帧级检测准确性，并证明我们的方法可以比最新方法实现可比或更好的准确性。

本文提出了一种用于拆分计算的神经体系结构搜索（NAS）方法。拆分计算是一种新兴的机器学习推理技术，可解决在物联网系统中部署深度学习的隐私和延迟挑战。在拆分计算中，神经网络模型通过网络使用Edge服务器和IoT设备进行了分离和合作处理。因此，神经网络模型的体系结构显着影响通信有效载荷大小，模型准确性和计算负载。在本文中，我们解决了优化神经网络体系结构以进行拆分计算的挑战。为此，我们提出了NASC，该NASC共同探讨了最佳模型架构和一个拆分点，以达到延迟需求（即，计算和通信的总延迟较小，都比某个阈值较小）。 NASC采用单发NAS，不需要重复模型培训进行计算高效的体系结构搜索。我们使用硬件（HW） - 基准数据的NAS基础的绩效评估表明，拟议的NASC可以改善``通信潜伏期和模型准确性''的权衡，即，将延迟降低了约40-60％，从基线降低了约40-60％有轻微的精度降解。

现有的视频域改编（DA）方法需要存储视频帧的所有时间组合或配对源和目标视频，这些视频和目标视频成本昂贵，无法扩展到长时间的视频。为了解决这些局限性，我们建议采用以下记忆高效的基于图形的视频DA方法。首先，我们的方法模型每个源或目标视频通过图：节点表示视频帧和边缘表示帧之间的时间或视觉相似性关系。我们使用图形注意力网络来了解单个帧的重量，并同时将源和目标视频对齐到域不变的图形特征空间中。我们的方法没有存储大量的子视频，而是仅构建一个图形，其中一个视频的图形注意机制，从而大大降低了内存成本。广泛的实验表明，与最先进的方法相比，我们在降低内存成本的同时取得了卓越的性能。

图像恢复算法（例如超级分辨率（SR））是低质量图像中对象检测的必不可少的预处理模块。这些算法中的大多数假定降解是固定的，并且已知先验。但是，实际上，实际降解或最佳的上采样率是未知或与假设不同的，导致预处理模块和随之而来的高级任务（例如对象检测）的性能恶化。在这里，我们提出了一个新颖的自我监督框架，以检测低分辨率图像降解的对象。我们利用下采样降解作为一种自我监督信号的一种转换，以探索针对各种分辨率和其他退化条件的模棱两可的表示。自我设计（AERIS）框架中的自动编码分辨率可以进一步利用高级SR体系结构，并使用任意分辨率恢复解码器，以从退化的输入图像中重建原始对应关系。表示学习和对象检测均以端到端的培训方式共同优化。通用AERIS框架可以在具有不同骨架的各种主流对象检测架构上实现。广泛的实验表明，与现有方法相比，我们的方法在面对变化降解情况时取得了卓越的性能。代码将在https://github.com/cuiziteng/eccv_aeris上发布。