We propose the convergent graph solver (CGS), a deep learning method that learns iterative mappings to predict the properties of a graph system at its stationary state (fixed point) with guaranteed convergence. CGS systematically computes the fixed points of a target graph system and decodes them to estimate the stationary properties of the system without the prior knowledge of existing solvers or intermediate solutions. The forward propagation of CGS proceeds in three steps: (1) constructing the input dependent linear contracting iterative maps, (2) computing the fixed-points of the linear maps, and (3) decoding the fixed-points to estimate the properties. The contractivity of the constructed linear maps guarantees the existence and uniqueness of the fixed points following the Banach fixed point theorem. To train CGS efficiently, we also derive a tractable analytical expression for its gradient by leveraging the implicit function theorem. We evaluate the performance of CGS by applying it to various network-analytic and graph benchmark problems. The results indicate that CGS has competitive capabilities for predicting the stationary properties of graph systems, irrespective of whether the target systems are linear or non-linear. CGS also shows high performance for graph classification problems where the existence or the meaning of a fixed point is hard to be clearly defined, which highlights the potential of CGS as a general graph neural network architecture.

We present gPC-SCP: Generalized Polynomial Chaos-based Sequential Convex Programming method to compute a sub-optimal solution for a continuous-time chance-constrained stochastic nonlinear optimal control problem (SNOC) problem. The approach enables motion planning and control of robotic systems under uncertainty. The proposed method involves two steps. The first step is to derive a deterministic nonlinear optimal control problem (DNOC) with convex constraints that are surrogate to the SNOC by using gPC expansion and the distributionally-robust convex subset of the chance constraints. The second step is to solve the DNOC problem using sequential convex programming (SCP) for trajectory generation and control. We prove that in the unconstrained case, the optimal value of the DNOC converges to that of SNOC asymptotically and that any feasible solution of the constrained DNOC is a feasible solution of the chance-constrained SNOC. We derive a stable stochastic model predictive controller using the gPC-SCP for tracking a trajectory in the presence of uncertainty. We empirically demonstrate the efficacy of the gPC-SCP method for the following three test cases: 1) collision checking under uncertainty in actuation, 2) collision checking with stochastic obstacle model, and 3) safe trajectory tracking under uncertainty in the dynamics and obstacle location by using a receding horizon control approach. We validate the effectiveness of the gPC-SCP method on the robotic spacecraft testbed.

Continual Learning (CL) considers the problem of training an agent sequentially on a set of tasks while seeking to retain performance on all previous tasks. A key challenge in CL is catastrophic forgetting, which arises when performance on a previously mastered task is reduced when learning a new task. While a variety of methods exist to combat forgetting, in some cases tasks are fundamentally incompatible with each other and thus cannot be learnt by a single policy. This can occur, in reinforcement learning (RL) when an agent may be rewarded for achieving different goals from the same observation. In this paper we formalize this ``interference'' as distinct from the problem of forgetting. We show that existing CL methods based on single neural network predictors with shared replay buffers fail in the presence of interference. Instead, we propose a simple method, OWL, to address this challenge. OWL learns a factorized policy, using shared feature extraction layers, but separate heads, each specializing on a new task. The separate heads in OWL are used to prevent interference. At test time, we formulate policy selection as a multi-armed bandit problem, and show it is possible to select the best policy for an unknown task using feedback from the environment. The use of bandit algorithms allows the OWL agent to constructively re-use different continually learnt policies at different times during an episode. We show in multiple RL environments that existing replay based CL methods fail, while OWL is able to achieve close to optimal performance when training sequentially.

Well known to the machine learning community, the random feature model is a parametric approximation to kernel interpolation or regression methods. It is typically used to approximate functions mapping a finite-dimensional input space to the real line. In this paper, we instead propose a methodology for use of the random feature model as a data-driven surrogate for operators that map an input Banach space to an output Banach space. Although the methodology is quite general, we consider operators defined by partial differential equations (PDEs); here, the inputs and outputs are themselves functions, with the input parameters being functions required to specify the problem, such as initial data or coefficients, and the outputs being solutions of the problem. Upon discretization, the model inherits several desirable attributes from this infinite-dimensional viewpoint, including mesh-invariant approximation error with respect to the true PDE solution map and the capability to be trained at one mesh resolution and then deployed at different mesh resolutions. We view the random feature model as a non-intrusive data-driven emulator, provide a mathematical framework for its interpretation, and demonstrate its ability to efficiently and accurately approximate the nonlinear parameter-to-solution maps of two prototypical PDEs arising in physical science and engineering applications: viscous Burgers' equation and a variable coefficient elliptic equation.

The stochastic contextual bandit problem, which models the trade-off between exploration and exploitation, has many real applications, including recommender systems, online advertising and clinical trials. As many other machine learning algorithms, contextual bandit algorithms often have one or more hyper-parameters. As an example, in most optimal stochastic contextual bandit algorithms, there is an unknown exploration parameter which controls the trade-off between exploration and exploitation. A proper choice of the hyper-parameters is essential for contextual bandit algorithms to perform well. However, it is infeasible to use offline tuning methods to select hyper-parameters in contextual bandit environment since there is no pre-collected dataset and the decisions have to be made in real time. To tackle this problem, we first propose a two-layer bandit structure for auto tuning the exploration parameter and further generalize it to the Syndicated Bandits framework which can learn multiple hyper-parameters dynamically in contextual bandit environment. We show our Syndicated Bandits framework can achieve the optimal regret upper bounds and is general enough to handle the tuning tasks in many popular contextual bandit algorithms, such as LinUCB, LinTS, UCB-GLM, etc. Experiments on both synthetic and real datasets validate the effectiveness of our proposed framework.

Starting this summer, a team of international scientists working with the Dark Energy Spectroscopic Instrument survey project will use the supercomputer, dubbed Perlmutter, to analyze tens of thousands of astronomical objects observed each night by the Mayall telescope, part of the Kitt Peak National Observatory outside Tucson, Ariz. The goal is to capture light from more than 30 million galaxies and quasars, said Stephen Bailey, a physicist at Berkeley Lab and technical lead for DESI's data systems. Previous projects that mapped the universe analyzed sky surveys that totaled just a few million objects, according to Dr. Bailey. Perlmutter is named after Berkeley Lab's Nobel Prize-winning astrophysicist Saul Perlmutter. And even testing basic gravity," said Dr. Bailey.

Description Geospatial Data Analyses & Remote Sensing: 5 Classes in 1 Do you need to design a GIS map or satellite-imagery based map for your Remote Sensing or GIS project but you don't know how to do this? Have you heard about Remote Sensing object-based image analysis and machine learning or maybe QGIS or Google Earth Engine but did not know where to start with such analyses? Do you find Remote Sensing and GIS manuals too not practical and looking for a course that takes you by hand, teach you all the concepts, and get you started on a real-life GIS mapping project? I'm very excited that you found my Practical Geospatial Masterclass on Geospatial Data Analyses & Remote Sensing. This course provides and information that is usually delivered in 4 separate Geospatial Data Analyses & Remote Sensing courses, and thus you with learning all the necessary information to start and advance with Geospatial analysis and includes more than 9 hours of video content, plenty of practical analysis, and downloadable materials.

The Russian government has issued a detailed plan of legal changes in support of AV testing and the launch of commercial use on public roads, without a safety driver in the cabin. The legislative work on the plan, initiated in mid-2020, was given a powerful boost early this year, the federal ministry of transportation stated in a press release back in March. The program "will set the regulatory conditions for inclusion of autonomous vehicles into the transportation system in the period from 2021 to 2024" in a way that "ensures safety of road users and compliance with the existing norms and rules". The ministry has had consultations with technological companies Yandex and Sber, truckmakers Gaz and Kamaz and oil company Gazprom Neft, all major benefactors of the legal changes. These companies, as well as a number of smaller AV developers and potential consumers, have often claimed to be ready for the wider use of AVs when legislation allows.

HUAWEI CLOUD's Enterprise Intelligence (EI) has achieved strong results in numerous industry competitions and evaluations. HUAWEI CLOUD has invested heavily in basic research AI in three domains: computer vision, speech and semantics, and decision optimization. To help AI empower all industries, the ModelArts enabling platform supports plug-and-play deployment of HUAWEI CLOUD's research results in areas such as automatic machine learning, small sample learning, federated learning, and pre-training models. In the area of perception, HUAWEI CLOUD continues to be an industry-leader in ImageNet large-scale image classification, WebVision large-scale network image classification, MS-COCO two-dimensional object detection, nuScenes three-dimensional object detection, and visual pre-training model verification, including downstream classification, detection, and segmentation. Perception models driven by ModelArts have been widely used in sectors such as medical image analysis, oil and gas exploration, and fault detection in manufacturing. In cognition, HUAWEI CLOUD integrates industry data based on its expertise in semantic analysis and knowledge graphs.

The representation of functions by artificial neural networks depends on a large number of parameters in a non-linear fashion. Suitable parameters of these are found by minimizing a 'loss functional', typically by stochastic gradient descent (SGD) or an advanced SGD-based algorithm. In a continuous time model for SGD with noise that follows the 'machine learning scaling', we show that in a certain noise regime, the optimization algorithm prefers 'flat' minima of the objective function in a sense which is different from the flat minimum selection of continuous time SGD with homogeneous noise.