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

arXiv 2024年

作者： Zhou, Yuyan Li, Ye Feng, Lei Huang, Sheng-Jun MIIT Key Laboratory of Pattern Analysis and Machine Intelligence College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing211106 China Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore

Recent studies showed that the generalization of neural networks is correlated with the sharpness of the loss landscape, and flat minima suggests a better generalization ability than sharp minima. In this paper, we propose a novel method called optimum shifting, which changes the parameters of a neural network from a sharp minimum to a flatter one while maintaining the same training loss value. Our method is based on the observation that when the input and output of a neural network are fixed, the matrix multiplications within the network can be treated as systems of under-determined linear equations, enabling adjustment of parameters in the solution space, which can be simply accomplished by solving a constrained optimization problem. Furthermore, we introduce a practical stochastic optimum shifting technique utilizing the Neural Collapse theory to reduce computational costs and provide more degrees of freedom for optimum shifting. Extensive experiments (including classification and detection) with various deep neural network architectures on benchmark datasets demonstrate the effectiveness of our method. Copyright © 2024, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Distributed nonlinear model predictive control and metric learning for heterogeneous vehicle platooning with cut-in/cut-out maneuvers

arXiv

引用

arXiv 2020年

作者： Basiri, Mohammad Hossein Ghojogh, Benyamin Azad, Nasser L. Fischmeister, Sebastian Karray, Fakhri Crowley, Mark The Department of Systems Design Engineering University of Waterloo ON Canada The Department of Electrical and Computer Engineering University of Waterloo ON Canada The Smart Hybrid and Electric Vehicles Systems Lab The Real-Time Embedded Software Lab The Machine Learning Lab The Centre for Pattern Analysis and Machine Intelligence

Vehicle platooning has been shown to be quite fruitful in the transportation industry to enhance fuel economy, road throughput, and driving comfort. Model Predictive Control (MPC) is widely used in literature for platoon control to achieve certain objectives, such as safely reducing the distance among consecutive vehicles while following the leader vehicle. In this paper, we propose a Distributed Nonlinear MPC (DNMPC), based upon an existing approach, to control a heterogeneous dynamic platoon with unidirectional topologies, handling possible cut-in/cut-out maneuvers. The introduced method addresses a collision-free driving experience while tracking the desired speed profile and maintaining a safe desired gap among the vehicles. The time of convergence in the dynamic platooning is derived based on the time of cut-in and/or cut-out maneuvers. In addition, we analyze the improvement level of driving comfort, fuel economy, and absolute and relative convergence of the method by using distributed metric learning and distributed optimization with Alternating Direction Method of Multipliers (ADMM). Simulation results on a dynamic platoon with cut-in and cut-out maneuvers and with different unidirectional topologies show the effectiveness of the introduced method. Copyright © 2020, The Authors. All rights reserved.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Continual Learning in the Presence of Repetition

arXiv

引用

arXiv 2024年

作者： Hemati, Hamed Pellegrini, Lorenzo Duan, Xiaotian Zhao, Zixuan Xia, Fangfang Masana, Marc Tscheschner, Benedikt Veas, Eduardo Zheng, Yuxiang Zhao, Shiji Li, Shao-Yuan Huang, Sheng-Jun Lomonaco, Vincenzo van de Ven, Gido M. Institute for Computer Science University of St. Gallen Rosenbergstrasse 30 St. Gallen9000 Switzerland Department of Computer Science University of Bologna Via dell’Università 50 Cesena47521 Italy The University of Chicago 5801 S Ellis Ave Chicago60637 United States Argonne National Laboratory 9700 S Cass Ave Lemont60439 United States Graz University of Technology Rechbauerstraße 12 Graz8010 Austria TU Graz - SAL Dependable Embedded Systems Lab Silicon Austria Labs Graz8010 Austria Know-Center GmbH Sandgasse 36/4 Graz8010 Austria MIIT Key Laboratory of Pattern Analysis and Machine Intelligence Nanjing University of Aeronautics and Astronautics Nanjing211106 China Department of Computer Science University of Pisa Piano Secondo Largo Bruno Pontecorvo 3 Pisa56127 Italy Department of Electrical Engineering KU Leuven Kasteelpark Arenberg 10 Leuven3001 Belgium

Continual learning (CL) provides a framework for training models in ever-evolving environments. Although re-occurrence of previously seen objects or tasks is common in real-world problems, the concept of repetition in the data stream is not often considered in standard benchmarks for CL. Unlike with the rehearsal mechanism in buffer-based strategies, where sample repetition is controlled by the strategy, repetition in the data stream naturally stems from the environment. This report provides a summary of the CLVision challenge at CVPR 2023, which focused on the topic of repetition in class-incremental learning. The report initially outlines the challenge objective and then describes three solutions proposed by finalist teams that aim to effectively exploit the repetition in the stream to learn continually. The experimental results from the challenge highlight the effectiveness of ensemble-based solutions that employ multiple versions of similar modules, each trained on different but overlapping subsets of classes. This report underscores the transformative potential of taking a different perspective in CL by employing repetition in the data stream to foster innovative strategy design. © 2024, CC BY.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Why is the Winner the Best?

Why is the Winner the Best?

引用

Conference on Computer Vision and pattern Recognition (CVPR)

作者： M. Eisenmann A. Reinke V. Weru M. D. Tizabi F. Isensee T. J. Adler S. Ali V. Andrearczyk M. Aubreville U. Baid S. Bakas N. Balu S. Bano J. Bernal S. Bodenstedt A. Casella V. Cheplygina M. Daum M. De Bruijne A. Depeursinge R. Dorent J. Egger D. G. Ellis S. Engelhardt M. Ganz N. Ghatwary G. Girard P. Godau A. Gupta L. Hansen K. Harada M. Heinrich N. Heller A. Hering A. Huaulmé P. Jannin A. E. Kavur O. Kodym M. Kozubek J. Li H. Li J. Ma C. Martín-Isla B. Menze A. Noble V. Oreiller N. Padoy S. Pati K. Payette T. Rädsch J. Rafael-Patiño V. Singh Bawa S. Speidel C. H. Sudre K. Van Wijnen M. Wagner D. Wei A. Yamlahi M. H. Yap C. Yuan M. Zenk A. Zia D. Zimmerer D. Aydogan B. Bhattarai L. Bloch R. Brüngel J. Cho C. Choi Q. Dou I. Ezhov C. M. Friedrich C. Fuller R. R. Gaire A. Galdran Á. García Faura M. Grammatikopoulou S. Hong M. Jahanifar I. Jang A. Kadkhodamohammadi I. Kang F. Kofler S. Kondo H. Kuijf M. Li M. Luu T. Martinčič P. Morais M. A. Naser B. Oliveira D. Owen S. Pang J. Park S. Park S. Płotka E. Puybareau N. Rajpoot K. Ryu N. Saeed A. Shephard P. Shi D. Štepec R. Subedi G. Tochon H. R. Torres H. Urien J. L. Vilaça K. A. Wahid H. Wang J. Wang L. Wang X. Wang B. Wiestler M. Wodzinski F. Xia J. Xie Z. Xiong S. Yang Y. Yang Z. Zhao K. Maier-Hein P. F. Jäger A. Kopp-Schneider L. Maier-Hein Division of Intelligent Medical Systems German Cancer Research Center (DKFZ) Heidelberg Germany Helmholtz Imaging German Cancer Research Center (DKFZ) Heidelberg Germany Faculty of Mathematics and Computer Science Heidelberg University Heidelberg Germany Division of Biostatistics German Cancer Research Center (DKFZ) Heidelberg Germany Division of Medical Image Computing German Cancer Research Center (DKFZ) Heidelberg Germany Faculty of Engineering and Physical Sciences School of Computing University of Leeds Leeds UK Institute of Informatics School of Management HES-SO Valais-Wallis University of Applied Sciences and Arts Western Switzerland Sierre Switzerland Department of Nuclear Medicine and Molecular Imaging Lausanne University Hospital Lausanne Switzerland Technische Hochschule Ingolstadt Ingolstadt Germany Center for Artificial Intelligence and Data Science for Integrated Diagnostics (AI2D) and Center for Biomedical Image Computing and Analytics (CBICA) University of Pennsylvania Philadelphia PA USA Department of Pathology and Laboratory Medicine Perelman School of Medicine University of Pennsylvania Philadelphia PA USA Department of Radiology Perelman School of Medicine University of Pennsylvania Philadelphia PA USA Department of Radiology University of Washington Seattle WA USA Department of Computer Science Wellcome/EPSRC Centre for Interventional and Surgical Sciences (WEISS) University College London London UK Universitat Autònoma de Barcelona & Computer Vision Center Barcelona Spain Division of Translational Surgical Oncology National Center for Tumor Diseases (NCT/UCC) Dresden Dresden Germany Department of Advanced Robotics Istituto Italiano di Tecnologia Italy Department of Electronics Information and Bioengineering Politecnico di Milano Milan Italy IT University of Copenhagen Copenhagen Denmark Department of General Visceral and Transplantation Surgery Heidelberg University Hospital Heidelberg Germany Department of Radiology and Nuc

International benchmarking competitions have become fundamental for the comparative performance assessment of image analysis methods. However, little attention has been given to investigating what can be learnt from these competitions. Do they really generate scientific progress? What are common and successful participation strategies? What makes a solution superior to a competing method? To address this gap in the literature, we performed a multicenter study with all 80 competitions that were conducted in the scope of IEEE ISBI 2021 and MICCAI 2021. Statistical analyses performed based on comprehensive descriptions of the submitted algorithms linked to their rank as well as the underlying participation strategies revealed common characteristics of winning solutions. These typically include the use of multi-task learning (63%) and/or multi-stage pipelines (61%), and a focus on augmentation (100%), image preprocessing (97%), data curation (79%), and post-processing (66%). The “typical” lead of a winning team is a computer scientist with a doctoral degree, five years of experience in biomedical image analysis, and four years of experience in deep learning. Two core general development strategies stood out for highly-ranked teams: the reflection of the metrics in the method design and the focus on analyzing and handling failure cases. According to the organizers, 43% of the winning algorithms exceeded the state of the art but only 11% completely solved the respective domain problem. The insights of our study could help researchers (1) improve algorithm development strategies when approaching new problems, and (2) focus on open research questions revealed by this work.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Author Correction: Federated learning enables big data for rare cancer boundary detection

引用

Nature communications 2023年第1期14卷 436页

作者： Sarthak Pati Ujjwal Baid Brandon Edwards Micah Sheller Shih-Han Wang G Anthony Reina Patrick Foley Alexey Gruzdev Deepthi Karkada Christos Davatzikos Chiharu Sako Satyam Ghodasara Michel Bilello Suyash Mohan Philipp Vollmuth Gianluca Brugnara Chandrakanth J Preetha Felix Sahm Klaus Maier-Hein Maximilian Zenk Martin Bendszus Wolfgang Wick Evan Calabrese Jeffrey Rudie Javier Villanueva-Meyer Soonmee Cha Madhura Ingalhalikar Manali Jadhav Umang Pandey Jitender Saini John Garrett Matthew Larson Robert Jeraj Stuart Currie Russell Frood Kavi Fatania Raymond Y Huang Ken Chang Carmen Balaña Jaume Capellades Josep Puig Johannes Trenkler Josef Pichler Georg Necker Andreas Haunschmidt Stephan Meckel Gaurav Shukla Spencer Liem Gregory S Alexander Joseph Lombardo Joshua D Palmer Adam E Flanders Adam P Dicker Haris I Sair Craig K Jones Archana Venkataraman Meirui Jiang Tiffany Y So Cheng Chen Pheng Ann Heng Qi Dou Michal Kozubek Filip Lux Jan Michálek Petr Matula Miloš Keřkovský Tereza Kopřivová Marek Dostál Václav Vybíhal Michael A Vogelbaum J Ross Mitchell Joaquim Farinhas Joseph A Maldjian Chandan Ganesh Bangalore Yogananda Marco C Pinho Divya Reddy James Holcomb Benjamin C Wagner Benjamin M Ellingson Timothy F Cloughesy Catalina Raymond Talia Oughourlian Akifumi Hagiwara Chencai Wang Minh-Son To Sargam Bhardwaj Chee Chong Marc Agzarian Alexandre Xavier Falcão Samuel B Martins Bernardo C A Teixeira Flávia Sprenger David Menotti Diego R Lucio Pamela LaMontagne Daniel Marcus Benedikt Wiestler Florian Kofler Ivan Ezhov Marie Metz Rajan Jain Matthew Lee Yvonne W Lui Richard McKinley Johannes Slotboom Piotr Radojewski Raphael Meier Roland Wiest Derrick Murcia Eric Fu Rourke Haas John Thompson David Ryan Ormond Chaitra Badve Andrew E Sloan Vachan Vadmal Kristin Waite Rivka R Colen Linmin Pei Murat Ak Ashok Srinivasan J Rajiv Bapuraj Arvind Rao Nicholas Wang Ota Yoshiaki Toshio Moritani Sevcan Turk Joonsang Lee Snehal Prabhudesai Fanny Morón Jacob Mandel Konstantinos Kamnitsas Ben Glocker Luke V M Dixon Matthew Williams Peter Zamp Center for Biomedical Image Computing and Analytics (CBICA) University of Pennsylvania Philadelphia PA USA. Department of Radiology Perelman School of Medicine University of Pennsylvania Philadelphia PA USA. Department of Pathology and Laboratory Medicine Perelman School of Medicine University of Pennsylvania Philadelphia PA USA. Department of Informatics Technical University of Munich Munich Bavaria Germany. Intel Corporation Santa Clara CA USA. Department of Neuroradiology Heidelberg University Hospital Heidelberg Germany. Clinical Cooperation Unit Neuropathology German Cancer Consortium (DKTK) within the German Cancer Research Center (DKFZ) Heidelberg Germany. Department of Neuropathology Heidelberg University Hospital Heidelberg Germany. Division of Medical Image Computing German Cancer Research Center Heidelberg Germany. Pattern Analysis and Learning Group Department of Radiation Oncology Heidelberg University Hospital Heidelberg Germany. Neurology Clinic Heidelberg University Hospital Heidelberg Germany. Department of Radiology & Biomedical Imaging University of California San Francisco San Francisco CA USA. Symbiosis Center for Medical Image Analysis Symbiosis International University Pune Maharashtra India. Department of Neuroimaging and Interventional Radiology National Institute of Mental Health and Neurosciences Bangalore Karnataka India. Department of Radiology School of Medicine and Public Health University of Wisconsin Madison WI USA. Department of Medical Physics School of Medicine and Public Health University of Wisconsin Madison WI USA. Leeds Teaching Hospitals Trust Department of Radiology Leeds UK. Department of Radiology Brigham and Women's Hospital Harvard Medical School Boston MA USA. Athinoula A. Martinos Center for Biomedical Imaging Massachusetts General Hospital Charlestown MA USA. Catalan Institute of Oncology Badalona Spain. Consorci MAR Parc de Salut de Barcelona Catalonia Spain. Department of Radiology (IDI

来源：评论

学校读者我要写书评

暂无评论

Improving gradient-based learning algorithms for large scale feedforward networks

Improving gradient-based learning algorithms for large scale...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： M. Ventresca H. R. Tizhoosh Faculty member of the Pattern Analysis and Machine Intelligence laboratory and Opposition-Based Learning Groups in the Systems Design Engineering Department University of Waterloo Waterloo ONT Canada

Large scale neural networks have many hundreds or thousands of parameters (weights and biases) to learn, and as a result tend to have very long training times. Small scale networks can be trained quickly by using second-order information, but these fail for large architectures due to high computational cost. Other approaches employ local search strategies, which also add to the computational cost. In this paper we present a simple method, based on opposite transfer functions which greatly improve the convergence rate and accuracy of gradient-based learning algorithms. We use two variants of the backpropagation algorithm and common benchmark data to highlight the improvements. We find statistically significant improvements in both convergence speed and accuracy.

关键词： Large-scale systems Transfer functions Neural networks Feedforward neural networks Computer architecture Computational efficiency Convergence Backpropagation algorithms Computer networks design engineering

来源：评论

学校读者我要写书评

暂无评论

Quasi-global oppositional fuzzy thresholding

Quasi-global oppositional fuzzy thresholding

引用

IEEE International Conference on Fuzzy systems (FUZZ-IEEE)

作者： Hamid R. Tizhoosh Farhang Sahba Pattern Analysis and Machine Intelligence Laboratory Systems Design Engineering University of Waterloo Waterloo ONT Canada University of Toronto Toronto ONT Canada

Opposition-based computing is the paradigm for incorporating entities along with their opposites within the search, optimization and learning mechanisms. In this work, we introduce the notion of "opposite fuzzy sets" in order to use the entropy difference between a fuzzy set and its opposite to carry out object discrimination in digital images. A quasi-global scheme is used to execute the calculations, which can be employed by any other existing thresholding technique. Results for prostate ultrasound images have been provided to verify the performance whereas expert's markings have been used as gold standard.

关键词： Fuzzy sets Image segmentation Fuzzy systems machine intelligence Ultrasonic imaging Neural networks pattern analysis Laboratories System analysis and design design engineering

来源：评论

学校读者我要写书评

暂无评论

Particle swarm clustering ensemble 08

Particle swarm clustering ensemble

引用

10th Annual Genetic and Evolutionary Computation Conference, GECCO 2008

作者： Ahmadi, Abbas Karray, Fakhri Kamel, Mohamed Pattern Analysis and Machine Intelligence Lab. Department of Systems Design Engineering University of Waterloo 200 University Avenue West Waterloo ON Canada

ISBN: (纸本)9781605581309

Extracting natural groups of the unlabeled data is known as clustering. To improve the stability and robustness of the clustering outputs, clustering ensembles have emerged recently. In this paper, an ensemble of particle swarm clustering algorithms is proposed. That is, the members of the ensemble are based on the cooperative swarms clustering approaches. The performance of the proposed particle swarm clustering ensemble is evaluated using different data sets and is compared to that of other clustering techniques.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Numerical condition of feedforward networks with opposite transfer functions

Numerical condition of feedforward networks with opposite tr...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Mario Ventresca Hamid Reza Tizhoosh Pattern Analysis and Machine Intelligence (PAMI) laboratory in the Systems Design Engineering Department University of Waterloo Waterloo ONT Canada

Numerical condition affects the learning speed and accuracy of most artificial neural network learning algorithms. In this paper, we examine the influence of opposite transfer functions on the conditioning of feedforward neural network architectures. The goal is not to discuss a new training algorithm nor error surface geometry, but rather to present characteristics of opposite transfer functions which can be useful for improving existing or to develop new algorithms. Our investigation examines two situations: (1) network initialization, and (2) early stages of the learning process. We provide theoretical motivation for the consideration of opposite transfer functions as a means to improve conditioning during these situations. These theoretical results are validated by experiments on a subset of common benchmark problems. Our results also reveal the potential for opposite transfer functions in other areas of, and related to neural networks.

关键词： Transfer functions Neurons Artificial neural networks Jacobian matrices Training Feedforward neural networks Erbium

来源：评论

学校读者我要写书评

暂无评论

Multiple Cooperating Swarms for Data Clustering

Multiple Cooperating Swarms for Data Clustering

引用

IEEE Swarm intelligence Symposium, SIS

作者： Abbas Ahmadi Fakhri Karray Mohamed Kamel Systems Design Engineering Department Pattern Analysis and Machine Intelligence Laboratory Waterloo ONT Canada Electrical and Computer Engineering Department Pattern Analysis and Machine Intelligence Laboratory Waterloo ONT Canada

A new clustering technique by the use of multiple swarms is proposed. The proposed technique mimics the behavior of biological swarms which explore food situated in several places. We model the clustering problem using particle swarm optimization (PSO) approach. The proposed method considers multiple cooperating swarms to find centers of clusters. By assigning a portion of the solution space to each swarm, the exploration ability to find the solution is enhanced. Moreover, the cooperation among swarms increases the between-class distance. The proposed method outperforms k-means clustering as well as conventional PSO-based clustering techniques

关键词： Particle swarm optimization Data engineering design engineering Biology computing Birds Educational institutions Marine animals Space exploration Equations pattern analysis

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：