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

Exponential convergence for distributed smooth optimization under the restricted secant inequality condition

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Yi, Xinlei Zhang, Shengjun Yang, Tao Johansson, Karl H. Chai, Tianyou Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden Department of Electrical Engineering University of North Texas DentonTX76203 United States State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China

This paper considers the distributed smooth optimization problem in which the objective is to minimize a global cost function formed by a sum of local smooth cost functions, by using local information exchange. The standard assumption for proving exponential/linear convergence of first-order methods is the strong convexity of the cost functions, which does not hold for many practical applications. In this paper, we first show that the continuous-time distributed primal-dual gradient algorithm converges to one global minimizer exponentially under the assumption that the global cost function satisfies the restricted secant inequality condition. This condition is weaker than the strong convexity condition since it does not require convexity and the global minimizers are not necessary to be unique. We then show that the discrete-time distributed primal-dual algorithm constructed by using the Euler's approximation method converges to one global minimizer linearly under the same condition. The theoretical results are illustrated by numerical simulations. Copyright © 2019, The Authors. All rights reserved.

关键词： Continuous time systems

Roadmap on Quantum Thermodynamics

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Campbell, Steve D’Amico, Irene Ciampini, Mario A. Anders, Janet Ares, Natalia Artini, Simone Auffèves, Alexia Oftelie, Lindsay Bassman Bettmann, Laetitia P. Bonança, Marcus V.S. Busch, Thomas Campisi, Michele Cavalcante, Moallison F. Correa, Luis A. Cuestas, Eloisa Dag, Ceren B. Dago, Salambô Deffner, Sebastian Del Campo, Adolfo Deutschmann-Olek, Andreas Donadi, Sandro Doucet, Emery Elouard, Cyril Ensslin, Klaus Erker, Paul Fabbri, Nicole Fedele, Federico Fiusa, Guilherme Fogarty, Thomás Folk, Joshua Guarnieri, Giacomo Hegde, Abhaya S. Hernández-Gómez, Santiago Hu, Chang-Kang Iemini, Fernando Karimi, Bayan Kiesel, Nikolai Landi, Gabriel T. Lasek, Aleksander Lemziakov, Sergei Monaco, Gabriele Lo Lutz, Eric Lvov, Dmitrii Maillet, Olivier Mehboudi, Mohammad Mendonça, Taysa M. Miller, Harry J.D. Mitchell, Andrew K. Mitchison, Mark T. Mukherjee, Victor Paternostro, Mauro Pekola, Jukka Perarnau-Llobet, Martí Poschinger, Ulrich Rolandi, Alberto Rosa, Dario Sánchez, Rafael Santos, Alan C. Sarthour, Roberto S. Sela, Eran Solfanelli, Andrea Souza, Alexandre M. Splettstoesser, Janine Tan, Dian Tesser, Ludovico Van Vu, Tan Widera, Artur Halpern, Nicole Yunger Zawadzki, Krissia School of Physics University College Dublin Belfield Dublin 4 Ireland Centre for Quantum Engineering Science and Technology University College Dublin Dublin 4 Ireland School of Physics Engineering and Technology University of York York United Kingdom York Centre for Quantum Technologies University of York York United Kingdom Boltzmanngasse 5 ViennaA-1090 Austria Institute of Physics and Astronomy University of Potsdam Potsdam14476 Germany Department of Physics and Astronomy University of Exeter ExeterEX4 4QL United Kingdom Department of Engineering Science University of Oxford Parks Road OxfordOX1 3PJ United Kingdom Università degli Studi di Palermo Dipartimento di Fisica e Chimica - Emilio Segrè via Archirafi 36 PalermoI-90123 Italy MajuLab CNRS-UCA-SU-NUS-NTU International Joint Research Laboratory France Centre for Quantum Technologies National University of Singapore Singapore117543 Singapore NEST Istituto Nanoscienze-CNR and Scuola Normale Superiore Pisa56127 Italy School of Physics Trinity College Dublin College Green Dublin 2 Ireland Gleb Wataghin Physics Institute The University of Campinas Campinas São Paulo13083-859 Brazil Quantum Systems Unit OIST Graduate University Okinawa Onna904-0495 Japan Department of Physics University of Maryland Baltimore County BaltimoreMD21250 United States Quantum Science Institute University of Maryland Baltimore County BaltimoreMD21250 United States Universidad de La Laguna La Laguna38203 Spain Departamento de Física Universidad de La Laguna La Laguna38203 Spain Jülich54245 Germany Department of Physics Indiana University BloomingtonIN47405 United States Department of Physics Harvard University 17 Oxford Street CambridgeMA02138 United States National Quantum Laboratory College ParkMD20740 United States Department of Physics and Materials Science University of Luxembourg LuxembourgL-1511 Luxembourg Donostia International Physics Center San SebastianE-20018 Spain Au

The last two decades has seen quantum thermodynamics become a well established field of research in its own right. In that time, it has demonstrated a remarkably broad applicability, ranging from providing foundational advances in the understanding of how thermodynamic principles apply at the nano-scale and in the presence of quantum coherence, to providing a guiding framework for the development of efficient quantum devices. Exquisite levels of control have allowed state-of-the-art experimental platforms to explore energetics and thermodynamics at the smallest scales which has in turn helped to drive theoretical advances. This Roadmap provides an overview of the recent developments across many of the field’s sub-disciplines, assessing the key challenges and future prospects, providing a guide for its near term progress. Copyright © 2025, The Authors. All rights reserved.

关键词： Temperature

PDP: Parallel Dynamic Programming

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2017年第1期4卷 1-5页

作者： Fei-Yue Wang Jie Zhang Qinglai Wei Xinhu Zheng Li Li IEEE State Key Laboratory of Management and Control for Complex Systems(SKL-MCCS) Institute of AutomationChinese Academy of Sciences(CASIA) School of Computer and Control Engineering University of Chinese Academy of Sciences Research Center for Military Computational Experiments and Parallel Systems Technology National University of Defense Technology State Key Laboratory of Management and Control for Complex Systems Institute of AutomationChinese Academy of Sciences(SKL-MCCSCASIA) Qingdao Academy of Intelligent Industries Department of Computer Science and Engineering University of Minnesota Department of Automation Tsinghua University

Deep reinforcement learning is a focus research area in artificial intelligence. The principle of optimality in dynamic programming is a key to the success of reinforcement learning methods. The principle of adaptive dynamic programming ADP is first presented instead of direct dynamic programming DP , and the inherent relationship between ADP and deep reinforcement learning is developed. Next, analytics intelligence, as the necessary requirement, for the real reinforcement learning, is discussed. Finally, the principle of the parallel dynamic programming, which integrates dynamic programming and analytics intelligence, is presented as the future computational intelligence. © 2014 Chinese Association of automation.

关键词： Artificial intelligence Neural networks Reinforcement learning

IEEE Transactions on Evolutionary Computation Special Issue on Parallel Evolution for Large Scale Optimization

学校读者我要写书评

暂无评论

IEEE Transactions on Evolutionary Computation 2018年第4期22卷 633-633页

作者： Wang, Fei-Yue Wei, Qinglai Tang, Ke Coello Coello, Carlos A. State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences China Qingdao Academy of Intelligent Industries China Department of Computer Science and Engineering Southern University of Science and Technology China Department of Computer Science CINVESTAV-IPN Mexico

Prospective authors are requested to submit new, unpublished manuscripts for inclusion in the upcoming event described in this call for papers.

关键词：

Compare Variation of User’s EEG Owing to Parallax Cue

学校读者我要写书评

暂无评论

Compare Variation of User’s EEG Owing to Parallax Cue

International Conference on Display Technology, ICDT 2018

作者： Hu, Haichen Wang, Danli Yue, Kang Yang, Xinpan Chiu, Steve C. The State Key Laboratory of Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China Beijing Key Lab of Human-Computer Interaction Institute of Software Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China College of Science and Engineering Idaho State University Pocatello United States

ISBN: (纸本)9781510867659

3D display has become increasingly popular in many fields. It can provide incredible immersion compared with 2D display. There are many researches referring to the change of user about no matter subjective experience or objective physiology signal while watching 3D content. Similarly, in this paper, we study the variation of user’s EEG when the user watched 3D content. However, we only focus on parallax cue and avoid other cues of 3D content by using Random Dot Stereogram(RDS) as visual stimulus. We designed an experiment which asked the subject to watch RDS with nine kinds of parallaxes(0,±0.5,±1.1,±1.3,±1.7). The users watched one RDS for 1 minute and then closed eyes and rest for 1 minute every time. During watching, EEG signal with 30-channel was recorded. The result suggests that significant variation of the user’s EEG data occurred in the Alpha(8-13Hz) and Beta(14-30Hz) frequency band by different parallax’s comparison. And we found not only parallax but also electrode position can impact the user’s EEG data significantly. Accurately, the EEG data has a significant change in six electrodes position in both frequency bands including CZ 、 PZ 、 OZ 、 O2 in international 10-20 system. It means those electrode positions we detect can be regarded as typical positions where we record EEG signal. It will simplify the process of EEG signal acquisition when we need to study the relationship between parallax cue of 3D display and the user further. © 2018 SID.

关键词： Three dimensional displays

Adaptive-Learning-Based H∞ Optimal Tracking control Design for a Class of Constrained Nonlinear Systems

学校读者我要写书评

暂无评论

Adaptive-Learning-Based H∞ Optimal Tracking Control Design ...

第37届中国控制会议

作者： Jiaxu Hou Ding Wang Derong Liu School of Automation and Electrical Engineering University of Science and Technology Beijing The State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences School of Computer and Control Engineering University of Chinese Academy of Sciences School of Automation Guangdong University of Technology

This paper, considering constrained inputs, focuses on designing the optimal controller for discrete-time H∞ tracking control problems. The neural-network-based iterative learning algorithm is deemed to be an excellent method to work. The iterative heuristic dynamic programming algorithm is employed for developing the formulated regulation of the tracking error. Strict convergence guarantees are given to support the optimality of the adaptive algorithm. A neural-network-based training scheme is adopted to implement the learning algorithm and stabilize the system in the optimal manner. Two numerical examples are provided to illustrate the applicability and good performance of the designed tracking control scheme.

关键词： Adaptive dynamic programming H∞ tracking control constraints convergence proof

Linear convergence of first- And zeroth-order primal-dual algorithms for distributed nonconvex optimization

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Yi, Xinlei Zhang, Shengjun Yang, Tao Chai, Tianyou Johansson, Karl H. Division of Decision and Control Systems School of Electrical Engineering and Computer Science Kth Royal Institute of Technology Digital Futures Stockholm100 44 Sweden Department of Electrical Engineering University of North Texas DentonTX76203 United States State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China

This paper considers the distributed nonconvex optimization problem of minimizing a global cost function formed by a sum of local cost functions by using local information *** first propose a distributed first-order primal-dual algorithm. We show that it converges sublinearly to a stationary point if each local cost function is smooth and linearly to a global optimum under an additional condition that the global cost function satisfies the Polyak-Lojasiewicz condition. This condition is weaker than strong convexity, which is a standard condition for proving linear convergence of distributed optimization algorithms, and the global minimizer is not necessarily unique. Motivated by the situations where the gradients are unavailable, we then propose a distributed zeroth-order algorithm, derived from the proposed distributed first-order algorithm by using a deterministic gradient estimator, and show that it has the same convergence properties as the proposed first-order algorithm under the same conditions. The theoretical results are illustrated by numerical simulations. Copyright © 2019, The Authors. All rights reserved.

关键词： Cost functions

Distributed bandit online convex optimization with time-varying coupled inequality constraints

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Johansson, Karl H. Chai, Tianyou Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden School of Electrical and Electronic Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China

This paper considers the problem of distributed bandit online convex optimization with time-varying coupled inequality constraints. This problem can be defined as a repeated game between a group of learners and an adversary. The learners attempt to minimize a sequence of global loss functions and at the same time satisfy a sequence of coupled constraint functions. The global loss and the coupled constraint functions are the sum of local convex loss and constraint functions, respectively, which are adaptively generated by the adversary. The local loss and constraint functions are revealed in a bandit manner, i.e., only the values of loss and constraint functions at sampled points are revealed to the learners, and the revealed function values are held privately by each learner. We consider two scenarios, one- and two-point bandit feedback, and propose two corresponding distributed bandit online algorithms used by the learners. We show that sublinear expected regret and constraint violation are achieved by these two algorithms, if the accumulated variation of the comparator sequence also grows sublinearly. In particular, we show that O(T θ1 ) expected static regret and O(T 7/4−θ1 ) constraint violation are achieved in the one-point bandit feedback setting, and O(T max{κ,1−κ}) expected static regret and O(T 1−κ/2) constraint violation in the two-point bandit feedback setting, where θ1 ∈ (3/4, 5/6] and κ ∈ (0, 1) are user-defined trade-off parameters. Finally, these theoretical results are illustrated by numerical simulations of a simple power grid example. Copyright © 2019, The Authors. All rights reserved.

关键词： Convex optimization

Robust medical instrument segmentation challenge 2019

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Roβ, Tobias Reinke, Annika Full, Peter M. Wagner, Martin Kenngott, Hannes Apitz, Martin Hempe, Hellena Filimon, Diana Mindroc Scholz, Patrick Tran, Thuy Nuong Bruno, Pierangela Arbelaéz, Pablo Bian, Gui-Bin Bodenstedt, Sebastian Bolmgren, Jon Lindström Bravo-Sánchez, Laura Chen, Hua-Bin González, Cristina Guo, Dong Halvorsen, Pål Heng, Pheng-Ann Hosgor, Enes Hou, Zeng-Guang Isensee, Fabian Jha, Debesh Jiang, Tingting Kirtac, Kadir Jin, Yueming Kletz, Sabrina Leger, Stefan Li, Zhixuan Maier-Hein, Klaus H. Ni, Zhen-Liang Riegler, Michael A. Schoeffmann, Klaus Shi, Ruohua Speidel, Stefanie Stenze, Michael Twick, Isabell Wang, Gutai Wang, Jiacheng Wang, Liansheng Wang, Lu Zhang, Yujie Zhou, Yan-Jie Zhu, Lei Wiesenfarth, Manuel Kopp-Schneider, Annette Müller-Stich, Beat P. Maier-Hein, Lena Heidelberg Germany University of Heidelberg Germany Heidelberg Germany Department of General Heidelberg University Hospital Visceral and Transplant Surgery Heidelberg Germany caresyntax Berlin Germany University of Chinese Academy Sciences Beijing China State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China SimulaMet Oslo Norway Tromsø Norway Oslo Norway School of Mechanical and Electrical Engineering University of Electronic Science and Technology of China Chengdu China Partner Site Dresden Heidelberg Germany Faculty of Medicine and University Hospital Carl Gustav Carus Technische Universität Dresden Dresden Germany Dresden Germany Universidad de Los Andes Bogotá Colombia Peking University Peking China Department of Computer Science School of Informatics Xiamen University Xiamen China Department of Computer Science and Engineering Chinese University of Hong Kong Hong Kong German Cancer Research Center Division of Biostatistics Heidelberg Germany Institute of Information Technology Klagenfurt University Austria

Intraoperative tracking of laparoscopic instruments is often a prerequisite for computer and roboticassisted interventions. While numerous methods for detecting, segmenting and tracking of medical instruments based on endoscopic video images have been proposed in the literature, key limitations remain to be addressed: Firstly, robustness, that is, the reliable performance of state-of-the-art methods when run on challenging images (e.g. in the presence of blood, smoke or motion artifacts). Secondly, generalization;algorithms trained for a specific intervention in a specific hospital should generalize to other interventions or institutions. In an effort to promote solutions for these limitations, we organized the Robust Medical Instrument Segmentation (ROBUST-MIS) challenge as an international benchmarking competition with a specific focus on the robustness and generalization capabilities of algorithms. For the first time in the field of endoscopic image processing, our challenge included a task on binary segmentation and also addressed multi-instance detection and segmentation. The challenge was based on a surgical data set comprising 10,040 annotated images acquired from a total of 30 surgical procedures from three different types of surgery. The validation of the competing methods for the three tasks (binary segmentation, multi-instance detection and multi-instance segmentation) was performed in three different stages with an increasing domain gap between the training and the test data. The results confirm the initial hypothesis, namely that algorithm performance degrades with an increasing domain gap. While the average detection and segmentation quality of the best-performing algorithms is high, future research should concentrate on detection and segmentation of small, crossing, moving and transparent instrument(s) (parts). Copyright © 2020, The Authors. All rights reserved.

关键词： Endoscopy