在AI，业务流程管理和数据库理论中，在国家关系代表方面运行的动态系统的建模和验证越来越多。为了使这些系统适合验证，需要对每个关系状态中存储的信息量进行界限，否则对动作的前提和影响施加了限制。我们介绍了关系行动基础（RABS）的一般框架，该框架通过抬高这两个限制来概括现有模型：可以通过可以通过数据量化和普遍量化数据的行动来进化无限的关系状态，并且可以利用ArithMmetic的数值数据来量化。谓词。然后，我们通过（近似）基于SMT的向后搜索来研究RABS的参数化安全性，挑选出最终过程的基本元主体，并显示如何通过国家现有验证模块的现成组合来实现它 - ART MCMT模型检查器。我们证明了这种方法在数据感知业务流程的基准上的有效性。最后，我们展示了如何利用通用不变性以使此过程完全正确。

现实生活过程的日志通常具有与记录的时间戳，数据值和/或事件有关的不确定性。我们考虑检查不确定日志与数据吸引参考过程的不确定日志的问题。具体来说，我们展示了如何通过SMT编码来解决它，从而将基于数据感知的SMT符合性检查的先前工作提升为更复杂的设置。我们的方法是模块化的，因为它同质可容纳不同类型的不确定性。此外，使用适当的成本功能，可以解决不同的符合性检查任务。我们通过概念验证实施来展示我们的方法的正确性，并见证了可行性。

增强业务流程管理系统（ABPMS）是一类新兴的过程感知信息系统，可利用值得信赖的AI技术。ABPMS增强了业务流程的执行，目的是使这些过程更加适应性，主动，可解释和上下文敏感。该宣言为ABPMS提供了愿景，并讨论了需要克服实现这一愿景的研究挑战。为此，我们定义了ABPM的概念，概述了ABPMS中流程的生命周期，我们讨论了ABPMS的核心特征，并提出了一系列挑战以实现具有这些特征的系统。

迄今为止，业务流程监测方法主要集中在监控单个过程模型的情况下监控进程的执行。但是，在某些情况下，有必要同时考虑多个过程规范。此外，这些规范可以是程序，声明性或两者的组合。例如，在医学结构域中，描述特定疾病治疗的临床指南不能考虑任何可以对特定患者共存的所有可能的共同因素，因此可能需要考虑额外的约束。在某些情况下，这些限制可能与临床指南不相容，因此要求违反指导方针或限制。在本文中，我们提出了一种监测混合过程规范的相互作用的解决方案，表示为（数据感知）Petri网和时间逻辑规则的组合。在流程执行期间，如果这些规范彼此冲突，则可以违反其中一些。监控系统配备了违规成本模型，系统可以以避免可能违规或最小化违规成本的方式推荐下一步行动。

Computational units in artificial neural networks follow a simplified model of biological neurons. In the biological model, the output signal of a neuron runs down the axon, splits following the many branches at its end, and passes identically to all the downward neurons of the network. Each of the downward neurons will use their copy of this signal as one of many inputs dendrites, integrate them all and fire an output, if above some threshold. In the artificial neural network, this translates to the fact that the nonlinear filtering of the signal is performed in the upward neuron, meaning that in practice the same activation is shared between all the downward neurons that use that signal as their input. Dendrites thus play a passive role. We propose a slightly more complex model for the biological neuron, where dendrites play an active role: the activation in the output of the upward neuron becomes optional, and instead the signals going through each dendrite undergo independent nonlinear filterings, before the linear combination. We implement this new model into a ReLU computational unit and discuss its biological plausibility. We compare this new computational unit with the standard one and describe it from a geometrical point of view. We provide a Keras implementation of this unit into fully connected and convolutional layers and estimate their FLOPs and weights change. We then use these layers in ResNet architectures on CIFAR-10, CIFAR-100, Imagenette, and Imagewoof, obtaining performance improvements over standard ResNets up to 1.73%. Finally, we prove a universal representation theorem for continuous functions on compact sets and show that this new unit has more representational power than its standard counterpart.

The open-radio access network (O-RAN) embraces cloudification and network function virtualization for base-band function processing by dis-aggregated radio units (RUs), distributed units (DUs), and centralized units (CUs). These enable the cloud-RAN vision in full, where multiple mobile network operators (MNOs) can install their proprietary or open RUs, but lease on-demand computational resources for DU-CU functions from commonly available open-clouds via open x-haul interfaces. In this paper, we propose and compare the performances of min-max fairness and Vickrey-Clarke-Groves (VCG) auction-based x-haul and DU-CU resource allocation mechanisms to create a multi-tenant O-RAN ecosystem that is sustainable for small, medium, and large MNOs. The min-max fair approach minimizes the maximum OPEX of RUs through cost-sharing proportional to their demands, whereas the VCG auction-based approach minimizes the total OPEX for all resources utilized while extracting truthful demands from RUs. We consider time-wavelength division multiplexed (TWDM) passive optical network (PON)-based x-haul interfaces where PON virtualization technique is used to flexibly provide optical connections among RUs and edge-clouds at macro-cell RU locations as well as open-clouds at the central office locations. Moreover, we design efficient heuristics that yield significantly better economic efficiency and network resource utilization than conventional greedy resource allocation algorithms and reinforcement learning-based algorithms.

When testing conditions differ from those represented in training data, so-called out-of-distribution (OOD) inputs can mar the reliability of black-box learned components in the modern robot autonomy stack. Therefore, coping with OOD data is an important challenge on the path towards trustworthy learning-enabled open-world autonomy. In this paper, we aim to demystify the topic of OOD data and its associated challenges in the context of data-driven robotic systems, drawing connections to emerging paradigms in the ML community that study the effect of OOD data on learned models in isolation. We argue that as roboticists, we should reason about the overall system-level competence of a robot as it performs tasks in OOD conditions. We highlight key research questions around this system-level view of OOD problems to guide future research toward safe and reliable learning-enabled autonomy.

Autoencoders are a popular model in many branches of machine learning and lossy data compression. However, their fundamental limits, the performance of gradient methods and the features learnt during optimization remain poorly understood, even in the two-layer setting. In fact, earlier work has considered either linear autoencoders or specific training regimes (leading to vanishing or diverging compression rates). Our paper addresses this gap by focusing on non-linear two-layer autoencoders trained in the challenging proportional regime in which the input dimension scales linearly with the size of the representation. Our results characterize the minimizers of the population risk, and show that such minimizers are achieved by gradient methods; their structure is also unveiled, thus leading to a concise description of the features obtained via training. For the special case of a sign activation function, our analysis establishes the fundamental limits for the lossy compression of Gaussian sources via (shallow) autoencoders. Finally, while the results are proved for Gaussian data, numerical simulations on standard datasets display the universality of the theoretical predictions.

Profile extrusion is a continuous production process for manufacturing plastic profiles from molten polymer. Especially interesting is the design of the die, through which the melt is pressed to attain the desired shape. However, due to an inhomogeneous velocity distribution at the die exit or residual stresses inside the extrudate, the final shape of the manufactured part often deviates from the desired one. To avoid these deviations, the shape of the die can be computationally optimized, which has already been investigated in the literature using classical optimization approaches. A new approach in the field of shape optimization is the utilization of Reinforcement Learning (RL) as a learning-based optimization algorithm. RL is based on trial-and-error interactions of an agent with an environment. For each action, the agent is rewarded and informed about the subsequent state of the environment. While not necessarily superior to classical, e.g., gradient-based or evolutionary, optimization algorithms for one single problem, RL techniques are expected to perform especially well when similar optimization tasks are repeated since the agent learns a more general strategy for generating optimal shapes instead of concentrating on just one single problem. In this work, we investigate this approach by applying it to two 2D test cases. The flow-channel geometry can be modified by the RL agent using so-called Free-Form Deformation, a method where the computational mesh is embedded into a transformation spline, which is then manipulated based on the control-point positions. In particular, we investigate the impact of utilizing different agents on the training progress and the potential of wall time saving by utilizing multiple environments during training.

The recent emergence of new algorithms for permuting models into functionally equivalent regions of the solution space has shed some light on the complexity of error surfaces, and some promising properties like mode connectivity. However, finding the right permutation is challenging, and current optimization techniques are not differentiable, which makes it difficult to integrate into a gradient-based optimization, and often leads to sub-optimal solutions. In this paper, we propose a Sinkhorn re-basin network with the ability to obtain the transportation plan that better suits a given objective. Unlike the current state-of-art, our method is differentiable and, therefore, easy to adapt to any task within the deep learning domain. Furthermore, we show the advantage of our re-basin method by proposing a new cost function that allows performing incremental learning by exploiting the linear mode connectivity property. The benefit of our method is compared against similar approaches from the literature, under several conditions for both optimal transport finding and linear mode connectivity. The effectiveness of our continual learning method based on re-basin is also shown for several common benchmark datasets, providing experimental results that are competitive with state-of-art results from the literature.