Neural network-based approaches for solving partial differential equations (PDEs) have recently received special attention. However, the large majority of neural PDE solvers only apply to rectilinear domains, and do not systematically address the imposition of Dirichlet/Neumann boundary conditions over irregular domain boundaries. In this paper, we present a framework to neurally solve partial differential equations over domains with irregularly shaped (non-rectilinear) geometric boundaries. Our network takes in the shape of the domain as an input (represented using an unstructured point cloud, or any other parametric representation such as Non-Uniform Rational B-Splines) and is able to generalize to novel (unseen) irregular domains; the key technical ingredient to realizing this model is a novel approach for identifying the interior and exterior of the computational grid in a differentiable manner. We also perform a careful error analysis which reveals theoretical insights into several sources of error incurred in the model-building process. Finally, we showcase a wide variety of applications, along with favorable comparisons with ground truth solutions.

遗憾已被广泛用作评估分布式多代理系统在线优化算法的性能的首选指标。但是，与代理相关的数据/模型变化可以显着影响决策，并需要在代理之间达成共识。此外，大多数现有的作品都集中在开发（强烈或非严格地）凸出的方法上，对于一般非凸损失的分布式在线优化中的遗憾界限，几乎没有得到很少的结果。为了解决这两个问题，我们提出了一种新型的综合遗憾，并使用新的基于网络的基于遗憾的度量标准来评估分布式在线优化算法。我们具体地定义了复合遗憾的静态和动态形式。通过利用我们的综合遗憾的动态形式，我们开发了一种基于共识的在线归一化梯度（CONGD）的伪convex损失方法，事实证明，它显示了与最佳器路径变化的规律性术语有关的透明性行为。对于一般的非凸损失，我们首先阐明了基于最近进步的分布式在线非凸学习的遗憾，因此没有确定性算法可以实现sublinear的遗憾。然后，我们根据离线优化的Oracle开发了分布式的在线非凸优化（Dinoco），而无需进入梯度。迪诺科（Dinoco）被证明是统一的遗憾。据我们所知，这是对一般分布在线非convex学习的第一个遗憾。

在分布式深度学习的背景下，陈旧的权重或梯度的问题可能导致算法性能差。这个问题通常通过延迟耐受算法来解决，并在目标函数和步进尺寸上有一些温和的假设。在本文中，我们提出了一种不同的方法来开发一种新算法，称为$ \ textbf {p} $ redicting $ \ textbf {c} $ lipping $ \ textbf {a} $ synchronous $ \ textbf {s} textbf {g} $ radient $ \ textbf {d} $ escent（aka，pc-asgd）。具体而言，PC -ASGD有两个步骤 - $ \ textIt {预测步骤} $利用泰勒扩展利用梯度预测来减少过时的权重的稳固性，而$ \ textit {clivipping step} $选择性地降低了过时的权重，以减轻过时的权重他们的负面影响。引入权衡参数以平衡这两个步骤之间的影响。从理论上讲，考虑到平滑的物镜函数弱键和非凸的延迟延迟的延迟，我们介绍了收敛速率。还提出了一种实用的PC-ASGD变体，即采用条件来帮助确定权衡参数。对于经验验证，我们在两个基准数据集上使用两个深神经网络体系结构演示了该算法的性能。

精益燃烧是环境友好的，NOX排放量低，并且在燃烧系统中还提供了更好的燃油效率。但是，接近瘦燃烧会使引擎更容易容易倾斜。精益井喷（LBO）是一种不希望的现象，可能会导致突然的火焰灭绝，从而导致突然失去权力。在设计阶段，对于科学家来说，准确确定最佳的操作限制以避免突然发生LBO的情况非常具有挑战性。因此，至关重要的是，在低NOX排放发动机中开发准确且可计算的框架来在线LBO检测。据我们所知，我们第一次提出了一种深度学习方法来检测燃烧系统中的精益井喷。在这项工作中，我们利用实验室规模的燃烧器收集不同协议的数据。对于每个协议，我们远离LBO，并逐渐朝LBO制度移动，在每个条件下捕获一个准静态时间序列数据集。使用数据集中的一个协议作为参考协议，并在域专家注释的条件下，我们找到了经过培训的深度学习模型的过渡状态指标，以在其他测试协议中检测LBO。我们发现，我们所提出的方法比其他基线模型更准确和计算更快，以检测到LBO的过渡。因此，我们建议使用瘦燃烧引擎中实时性能监视的方法。

我们提出了一种新的多功能增强学习的新型政策梯度方法，其利用了两个不同的差异减少技术，并且不需要在迭代上进行大量批次。具体而言，我们提出了一种基于势头的分散策略梯度跟踪（MDPGT），其中使用新的基于动量的方差减少技术来接近具有重要性采样的本地策略梯度代理，并采用中间参数来跟踪两个连续的策略梯度代理。此外，MDPGT可证明$ \ mathcal {o}的最佳可用样本复杂性（n ^ { - 1} \ epsilon ^ {-3}）$，用于汇聚到全球平均值的$ \ epsilon $ -stationary点n $本地性能函数（可能是非旋转）。这优于在分散的无模型增强学习中的最先进的样本复杂性，并且当用单个轨迹初始化时，采样复杂性与现有的分散的政策梯度方法获得的样本复杂性匹配。我们进一步验证了高斯策略函数的理论索赔。当所需的误差容忍$ \ epsilon $足够小时，MDPGT导致线性加速，以前已经在分散的随机优化中建立，但不是为了加强学习。最后，我们在多智能体增强学习基准环境下提供了实证结果，以支持我们的理论发现。

VAR-VAR控制（VVC）是通过控制电源系统中的执行器在健康状态内运行电源分配系统的问题。现有作品主要采用代表电力系统（带有树拓扑的图）作为训练深钢筋学习（RL）策略的向量的常规例程。我们提出了一个将RL与图形神经网络相结合的框架，并研究VVC设置中基于图的策略的好处和局限性。我们的结果表明，与向量表示相比，基于图的策略会渐近地收敛到相同的奖励。我们对观察和行动的影响进行进一步分析：在观察端，我们研究了基于图形的策略对功率系统中两个典型数据采集错误的鲁棒性，即传感器通信失败和测量错误。在动作端，我们表明执行器对系统有各种影响，因此使用由电源系统拓扑引起的图表表示可能不是最佳选择。最后，我们进行了一项案例研究，以证明读取功能架构和图形增强的选择可以进一步提高训练性能和鲁棒性。

使用非均匀Rational B样条（NURBS）的边界表示（B-REP）是CAD中使用的事实标准，但它们在基于深度学习的方法中的实用性并未得到很好的研究。我们提出了一个不同的NURBS模块，将CAD模型的NURBS表示与深度学习方法集成。我们在数学上定义NURBS曲线或表面的衍生品相对于输入参数（控制点，权重和结向量）。这些衍生品用于定义用于执行“落后”评估的近似雅比尼亚，以培训深入学习模型。我们使用GPU加速算法实施了我们的NURBS模块，并与Pytorch集成了一个流行的深度学习框架。我们展示了我们的NURBS模块在执行CAD操作中的功效，例如曲线或表面拟合和表面偏移。此外，我们在深度学习中展示了无监督点云重建和强制分析约束的效用。这些例子表明，我们的模块对某些深度学习框架进行了更好的表现，并且可以与任何需要NURBS的任何深度学习框架直接集成。

Modern telecom systems are monitored with performance and system logs from multiple application layers and components. Detecting anomalous events from these logs is key to identify security breaches, resource over-utilization, critical/fatal errors, etc. Current supervised log anomaly detection frameworks tend to perform poorly on new types or signatures of anomalies with few or unseen samples in the training data. In this work, we propose a meta-learning-based log anomaly detection framework (LogAnMeta) for detecting anomalies from sequence of log events with few samples. LoganMeta train a hybrid few-shot classifier in an episodic manner. The experimental results demonstrate the efficacy of our proposed method

Egocentric 3D human pose estimation with a single head-mounted fisheye camera has recently attracted attention due to its numerous applications in virtual and augmented reality. Existing methods still struggle in challenging poses where the human body is highly occluded or is closely interacting with the scene. To address this issue, we propose a scene-aware egocentric pose estimation method that guides the prediction of the egocentric pose with scene constraints. To this end, we propose an egocentric depth estimation network to predict the scene depth map from a wide-view egocentric fisheye camera while mitigating the occlusion of the human body with a depth-inpainting network. Next, we propose a scene-aware pose estimation network that projects the 2D image features and estimated depth map of the scene into a voxel space and regresses the 3D pose with a V2V network. The voxel-based feature representation provides the direct geometric connection between 2D image features and scene geometry, and further facilitates the V2V network to constrain the predicted pose based on the estimated scene geometry. To enable the training of the aforementioned networks, we also generated a synthetic dataset, called EgoGTA, and an in-the-wild dataset based on EgoPW, called EgoPW-Scene. The experimental results of our new evaluation sequences show that the predicted 3D egocentric poses are accurate and physically plausible in terms of human-scene interaction, demonstrating that our method outperforms the state-of-the-art methods both quantitatively and qualitatively.

The coverage of different stakeholders mentioned in the news articles significantly impacts the slant or polarity detection of the concerned news publishers. For instance, the pro-government media outlets would give more coverage to the government stakeholders to increase their accessibility to the news audiences. In contrast, the anti-government news agencies would focus more on the views of the opponent stakeholders to inform the readers about the shortcomings of government policies. In this paper, we address the problem of stakeholder extraction from news articles and thereby determine the inherent bias present in news reporting. Identifying potential stakeholders in multi-topic news scenarios is challenging because each news topic has different stakeholders. The research presented in this paper utilizes both contextual information and external knowledge to identify the topic-specific stakeholders from news articles. We also apply a sequential incremental clustering algorithm to group the entities with similar stakeholder types. We carried out all our experiments on news articles on four Indian government policies published by numerous national and international news agencies. We also further generalize our system, and the experimental results show that the proposed model can be extended to other news topics.