检索结果-内蒙古大学图书馆

Matrix Completion over Finite Fields: Bounds and Belief Propagation Algorithms

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Soleymani, Mahdi Liu, Qiang Mahdavifar, Hessam Balzano, Laura Halıcıoglu Data Science Institute University of California San Diego United States The State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Zhejiang University Hangzhou310027 China The Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor United States

We consider the low rank matrix completion problem over finite fields. This problem has been extensively studied in the domain of real/complex numbers, however, to the best of authors' knowledge, there exists merely one efficient algorithm to tackle the problem in the binary field, due to Saunderson et al. [1]. In this paper, we improve upon the theoretical guarantees for the algorithm provided in [1]. Furthermore, we formulate a new graphical model for the matrix completion problem over the finite field of size q, Fq, and present a message passing (MP) based approach to solve this problem. The proposed algorithm is the first one for the considered matrix completion problem over finite fields of arbitrary size. Our proposed method has a significantly lower computational complexity, reducing it from O(n2r+3) in [1] down to O(n2) (where, the underlying matrix has dimension n × n and r denotes its rank), while also improving the performance. Copyright © 2023, The Authors. All rights reserved.

关键词： Message passing

Anomaly Detection Based on Principle of Justifiable Granularity and Probability Density Estimation

学校读者我要写书评

暂无评论

Anomaly Detection Based on Principle of Justifiable Granular...

Chinese Automation Congress (CAC)

作者： Sheng Du Xian Ma Xiang Li Min Wu Weihua Cao Witold Pedrycz School of Automation China University of Geosciences Wuhan China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan China Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan China Department of Electrical and Computer Engineering University of Alberta Edmonton AB Canada Systems Research Institute Polish Academy of Sciences Warsaw Poland Department of Computer Engineering Faculty of Engineering and Natural Sciences Istinye University Sariyer/Istanbul Turkiye

Anomaly detection is essential to ensure the safety of industrial processes. This paper presents an anomaly detection approach based on the probability density estimation and principle of justifiable granularity. First, time series data are transformed into a two-dimensional information granule by the principle of justifiable granularity. Then, the test statistic is constructed, and the probability density and cumulative distribution functions of the test statistic are calculated. Next, the confidence level determines the test threshold. Finally, the time series data of a key parameter in the sintering process is used as a case study. The experimental result demonstrates that the proposed approach can detect abnormal time series data effectively, providing an accurate and effective solution for detecting time series anomalies in industrial processes.

关键词：

Application of Deep Learning Method to Estimate Bottomhole Pressure Dynamics of Oil Wells

学校读者我要写书评

暂无评论

Application of Deep Learning Method to Estimate Bottomhole P...

IEEE International Symposium on Industrial Electronics (ISIE)

作者： Haibo Cheng Shichao Li Peng Zeng Valeriy Vyatkin State Key Laboratory of Robotics Shenyang Institute of Automation Chinese Academy of Sciences Shenyang China Key Laboratory of Networked Control Systems Chinese Academy of Sciences Shenyang China Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences Shenyang China Department of Computer Science Electrical and Space Engineering Luleå University of Technology Luleå Sweden Department of Electrical Engineering and Automation Aalto University Helsinki Finland

Surrogate models, which have become an effective and popular method to close loop reservoir management problems, use a data-driven approach to predict dynamic injection and production wells parameters and optimize waterflooding development. In this study, a deep learning-based surrogate model method is proposed to estimate bottomhole pressure (BHP) of production wells in waterflooding reservoirs. Bidirectional long short-term memory (BiLSTM) network, as an efficient deep learning approach, is applied to BHP estimation using fluctuation data. Extended Fourier amplitude sensitivity test (EFAST) method is employed to analyse the influence of different input factors on BHP dynamics, and a reduced dataset is rebuilt to predict BHP parameter based on BiLSTM-EFAST algorithm. The estimation results are tested on a dataset from Volve oilfield in North Sea, and compared with other deep learning methods. The test results indicate that the proposed method can achieve higher prediction accuracy. A reduced dataset-based approach provides a new attempt to reduce model complexity and improve calculation speed for big data-driven surrogate model in oil and gas industry.

关键词：

Robust Data-Driven Predictive control using Reachability Analysis

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Alanwar, Amr Stürz, Yvonne Johansson, Karl Henrik Computer Science & Electrical Engineering Department Jacobs University Bremen Germany Division of Decision and Control Systems KTH Royal Institute of Technology Sweden Model Predictive Control Laboratory University of California Berkeley United States

We present a robust data-driven control scheme for an unknown linear system model with bounded process and measurement noise. Instead of depending on a system model in traditional predictive control, a controller utilizing data-driven reachable regions is proposed. The data-driven reachable regions are based on a matrix zonotope recursion and are computed based on only noisy input-output data of a trajectory of the system. We assume that measurement and process noise are contained in bounded sets. While we assume knowledge of these bounds, no knowledge about the statistical properties of the noise is assumed. In the noise-free case, we prove that the presented purely data-driven control scheme results in an equivalent closed-loop behavior to a nominal model predictive control scheme. In the case of measurement and process noise, our proposed scheme guarantees robust constraint satisfaction, which is essential in safety-critical applications. Numerical experiments show the effectiveness of the proposed data-driven controller in comparison to model-based control schemes. Copyright © 2021, The Authors. All rights reserved.

关键词： controllers

Distributed CPU Scheduling Subject to Nonlinear Constraints

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Doostmohammadian, Mohammadreza Aghasi, Alireza Rikos, Apostolos I. Grammenos, Andreas Kalyvianaki, Evangelia Hadjicostis, Christoforos N. Johansson, Karl H. Charalambous, Themistoklis The School of Electrical Engineering Aalto University Finland Georgia State University GA United States The Department of Computer Science and Technology University of Cambridge Cambridge The Alan Turing Institute London United Kingdom Department of Computer Science and Technology University of Cambridge Cambridge United Kingdom The Department of Electrical and Computer Engineering University of Cyprus Cyprus Cyprus The Division of Decision and Control Systems KTH Royal Institute of Technology Sweden

This paper considers a network of collaborating agents for local resource allocation subject to nonlinear model constraints. In many applications, it is required (or desirable) that the solution be anytime feasible in terms of satisfying the sum-preserving global constraint. Motivated by this, sufficient conditions on the nonlinear mapping for anytime feasibility (or non-asymptotic feasibility) are addressed in this paper. For the two proposed distributed solutions, one converges over directed weight-balanced networks and the other one over undirected networks. In particular, we elaborate on uniform quantization and discuss the notion of Ε-accurate solution, which gives an estimate of how close we can get to the exact optimizer subject to different quantization levels. This work, further, handles general (possibly non-quadratic) strictly convex objective functions with application to CPU allocation among a cloud of data centers via distributed solutions. The results can be used as a coordination mechanism to optimally balance the tasks and CPU resources among a group of networked servers while addressing quantization or limited server capacity. © 2022, CC BY.

关键词： Multi agent systems

Distributed Optimal Allocation with Quantized Communication and Privacy-Preserving Guarantees

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Nylöf, Jakob Rikos, Apostolos I. Gracy, Sebin Johansson, Karl Henrik Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology and Digital Futures Stockholm Sweden Department of Electrical and Computer Engineering Rice University HoustonTX United States

In this paper, we analyze the problem of optimally allocating resources in a distributed and privacy-preserving manner. We propose a novel distributed optimal resource allocation algorithm with privacy-preserving guarantees, which operates over a directed communication network. Our algorithm converges in finite time and allows each node to process and transmit quantized messages. Our algorithm utilizes a distributed quantized average consensus strategy combined with a privacy-preserving mechanism. We show that the algorithm converges in finite-time, and we prove that, under specific conditions on the network topology, nodes are able to preserve the privacy of their initial state. Finally, to illustrate the results, we consider an example where test kits need to be optimally allocated proportionally to the number of infections in a region. It is shown that the proposed privacy-preserving resource allocation algorithm performs well with an appropriate convergence rate under privacy guarantees. © 2021, CC BY.

关键词： Resource allocation

A Zeroth-Order Momentum Method for Risk-Averse Online Convex Games

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Wang, Zifan Shen, Yi Bell, Zachary I. Nivison, Scott Zavlanos, Michael M. Johansson, Karl H. Division of Decision and Control Systems School of Electrical Enginnering and Computer Science KTH Royal Institute of Technology StockholmSE-10044 Sweden The Department of Mechanical Engineering and Materials Science Duke University DurhamNC United States The Air Force Research Laboratory Eglin AFB FL United States

We consider risk-averse learning in repeated unknown games where the goal of the agents is to minimize their individual risk of incurring significantly high cost. Specifically, the agents use the conditional value at risk (CVaR) as a risk measure and rely on bandit feedback in the form of the cost values of the selected actions at every episode to estimate their CVaR values and update their actions. A major challenge in using bandit feedback to estimate CVaR is that the agents can only access their own cost values, which, however, depend on the actions of all agents. To address this challenge, we propose a new risk-averse learning algorithm with momentum that utilizes the full historical information on the cost values. We show that this algorithm achieves sub-linear regret and matches the best known algorithms in the literature. We provide numerical experiments for a Cournot game that show that our method outperforms existing methods. © 2022, CC BY.

关键词： Learning algorithms

Deep Neural Network Architecture Search for Accurate Visual Pose Estimation aboard Nano-UAVs

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Cereda, Elia Crupi, Luca Risso, Matteo Burrello, Alessio Benini, Luca Giusti, Alessandro Pagliari, Daniele Jahier Palossi, Daniele The Dalle Molle Institute for Artificial Intelligence USI SUPSI Lugano6962 Switzerland The Department of Control and Computer Engineering Politecnico di Torino Turin10129 Italy The Department of Electrical Electronic and Information Engineering University of Bologna Bologna40136 Italy The Integrated Systems Laboratory ETH Zürich Zürich8092 Switzerland

Miniaturized autonomous unmanned aerial vehicles (UAVs) are an emerging and trending topic. With their form factor as big as the palm of one hand, they can reach spots otherwise inaccessible to bigger robots and safely operate in human surroundings. The simple electronics aboard such robots (sub-100 mW) make them particularly cheap and attractive but pose significant challenges in enabling onboard sophisticated intelligence. In this work, we leverage a novel neural architecture search (NAS) technique to automatically identify several Pareto-optimal convolutional neural networks (CNNs) for a visual pose estimation task. Our work demonstrates how real-life and field-tested robotics applications can concretely leverage NAS technologies to automatically and efficiently optimize CNNs for the specific hardware constraints of small UAVs. We deploy several NAS-optimized CNNs and run them in closed-loop aboard a 27-g Crazyflie nano-UAV equipped with a parallel ultra-low power System-on-Chip. Our results improve the State-of-the-Art by reducing the in-field control error of 32% while achieving a real-time onboard inference-rate of ∼10 Hz@10 mW and ∼50 Hz@90 mW. Copyright © 2023, The Authors. All rights reserved.

关键词： Deep neural networks

State Estimation for Linear systems with Quadratic Outputs

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Berkane, Soulaimane Theodosis, Dionysis Hamel, Tarek Dimarogonas, Dimos V. Département d’informatique et d’ingénierie Université du Québec en Outaouis GatineauQC Canada theDepartment of Electrical Engineering Lakehead University ON Canada the Dynamic Systems and Simulation Laboratory Technical University of Crete Greece the Divi-sion of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden I3S-CNRS University Côte d’Azur Institut universitaire de France France

This letter deals with the problem of state estimation for a class of systems involving linear dynamics with multiple quadratic output measurements. We propose a systematic approach to immerse the original system into a linear time-varying (LTV) system of a higher dimension. The methodology extends the original system by incorporating a minimum number of auxiliary states, ensuring that the resulting extended system exhibits both linear dynamics and linear output. Consequently, any Kalman-type observer can showcase global state estimation, provided the system is uniformly observable. © 2023, CC BY.

关键词： Time varying systems