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

arXiv 2024年

作者： Yeghaian, Melda Bodalal, Zuhir van den Broek, Daan Haanen, John B.A.G. Beets-Tan, Regina G.H. Trebeschi, Stefano van Gerven, Marcel A.J. Department of Machine Learning and Neural Computing Donders Institute for Brain Cognition and Behaviour Radboud University Nijmegen Netherlands Department of Radiology Department of Laboratory Medicine Department of Medical Oncology The Netherlands Cancer Institute North Holland Amsterdam1066 CX Netherlands GROW School for Oncology and Developmental Biology Maastricht University Limburg Maastricht6229 ER Netherlands Division of Molecular Oncology and Immunology Oncode Institute Netherlands Cancer Institute Amsterdam Netherlands Department of Medical Oncology Leiden University Medical Center Leiden Netherlands Melanoma Clinic Centre Hospitalier Universitaire Vaudois Lausanne Switzerland Institute of Regional Health Research University of Southern Denmark Odense Denmark

Purpose: Analyzing noninvasive longitudinal and multimodal data using artificial intelligence could potentially transform immunotherapy for cancer patients, paving the way towards precision medicine. Methods: In this study, we integrated pre- and on-treatment blood measurements, prescribed medications and CT-based volumes of organs from a large pan-cancer cohort of 694 patients treated with immunotherapy to predict short and long-term overall survival. By leveraging a combination of recent developments, different variants of our extended multimodal transformer-based simple temporal attention (MMTSimTA) network were trained end-to-end to predict mortality at three, six, nine and twelve months. These models were also compared to baseline methods incorporating intermediate and late fusion based integration methods. Results: The strongest prognostic performance was demonstrated using the extended transformer-based multimodal model with area under the curves (AUCs) of 0.84 ± 0.04, 0.83 ± 0.02, 0.82 ± 0.02, 0.81 ± 0.03 for 3-, 6-, 9-, and 12-month survival prediction, respectively. Conclusion: Our findings suggest that analyzing integrated early treatment data has potential for predicting survival of immunotherapy patients. Integrating complementary noninvasive modalities into a jointly trained model, using our extended transformer-based architecture, demonstrated an improved multimodal prognostic performance, especially in short term survival prediction. © 2024, CC BY.

关键词： Lung cancer

来源：评论

学校读者我要写书评

暂无评论

Overview of the Tenth Dialog System Technology Challenge: DSTC10

引用

IEEE/ACM Transactions on Audio Speech and Language Processing 2024年 32卷 765-778页

作者： Yoshino, Koichiro Chen, Yun-Nung Crook, Paul Kottur, Satwik Li, Jinchao Hedayatnia, Behnam Moon, Seungwhan Fei, Zhengcong Li, Zekang Zhang, Jinchao Feng, Yang Zhou, Jie Kim, Seokhwan Liu, Yang Jin, Di Papangelis, Alexandros Gopalakrishnan, Karthik Hakkani-Tur, Dilek Damavandi, Babak Geramifard, Alborz Hori, Chiori Shah, Ankit Zhang, Chen Li, Haizhou Sedoc, Joao D'haro, Luis F. Banchs, Rafael Rudnicky, Alexander Guardian Robot Project R-IH RIKEN 2-2-2 Hikaridai Seika Shoraku619-0288 Japan Information Science Nara Institute of Science and Technology Ikoma630-0101 Japan Computer Science and Information Engineering National Taiwan University Taipei10617 Taiwan Inc. Palo AltoCA95054 United States Alexa AI *** Inc. SunnyvaleCA94089 United States Meta Seattle RedmondWA98052 United States Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Tencent AI Lab Beijing Beijing China Kexueyuan South Road Zhongguancun Beijing100190 China Beijing 100190 China Alexa AI *** Inc. SunnyvaleCA United States 1120 Enterprise way Sunnyvale94089 United States *** Inc. SeattleWA United States Menlo Park CA United States Audio and Speech Group Mitsubishi Electric Research Laboratories CambridgeMA02139-1955 United States Carnegie Mellon University Department of Language and Information Technologies or just Carnegie Mellon University Pittsburgh United States National University of Singapore Singapore Singapore Department of Electrical and Computer Engineering National University of Singapore Singapore Singapore Shenzhen Research Institute of Big Data School of Data Science Chinese University of Hong Kong Shenzhen518172 China New York University New YorkNY United States ETSI de Telecomunicacion - Speech Technology and Machine Learning Group Universidad Politecnica de Madrid Ciudad Universitaria Madrid28040 Spain Nanyang Technological University Singapore Singapore Carnegie Mellon University PittsburghPA United States

This article introduces the Tenth Dialog System Technology Challenge (DSTC-10). This edition of the DSTC focuses on applying end-to-end dialog technologies for five distinct tasks in dialog systems, namely 1. Incorporation of Meme images into open domain dialogs, 2. Knowledge-grounded Task-oriented Dialogue Modeling on Spoken Conversations, 3. Situated Interactive Multimodal dialogs, 4. Reasoning for Audio Visual Scene-Aware Dialog, and 5. Automatic Evaluation and Moderation of Open-domainDialogue Systems. This article describes the task definition, provided datasets, baselines, and evaluation setup for each track. We also summarize the results of the submitted systems to highlight the general trends of the state-of-the-art technologies for the tasks. © 2023 The Authors.

关键词： Job analysis

来源：评论

学校读者我要写书评

暂无评论

GSLB: The Graph Structure learning Benchmark

arXiv

引用

arXiv 2023年

作者： Li, Zhixun Wang, Liang Sun, Xin Luo, Yifan Zhu, Yanqiao Chen, Dingshuo Luo, Yingtao Zhou, Xiangxin Liu, Qiang Wu, Shu Yu, Jeffrey Xu Department of Systems Engineering and Engineering Management The Chinese University of Hong Kong Hong Kong Center for Research on Intelligent Perception Computing State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences China School of Artificial Intelligence University of Chinese Academy of Sciences China Department of Automation University of Science and Technology of China China School of Cyberspace Security Beijing University of Posts and Telecommunications China Department of Computer Science University of California Los Angeles United States Heinz College of Information Systems and Public Policy Machine Learning Department School of Computer Science Carnegie Mellon University United States

Graph Structure learning (GSL) has recently garnered considerable attention due to its ability to optimize both the parameters of Graph Neural Networks (GNNs) and the computation graph structure simultaneously. Despite the proliferation of GSL methods developed in recent years, there is no standard experimental setting or fair comparison for performance evaluation, which creates a great obstacle to understanding the progress in this field. To fill this gap, we systematically analyze the performance of GSL in different scenarios and develop a comprehensive Graph Structure learning Benchmark (GSLB) curated from 20 diverse graph datasets and 16 distinct GSL algorithms. Specifically, GSLB systematically investigates the characteristics of GSL in terms of three dimensions: effectiveness, robustness, and complexity. We comprehensively evaluate state-of-the-art GSL algorithms in node- and graph-level tasks, and analyze their performance in robust learning and model complexity. Further, to facilitate reproducible research, we have developed an easy-to-use library for training, evaluating, and visualizing different GSL methods. Empirical results of our extensive experiments demonstrate the ability of GSL and reveal its potential benefits on various downstream tasks, offering insights and opportunities for future research. The code of GSLB is available at: https://***/GSL-Benchmark/GSLB. © 2023, CC BY.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Consensus-Based Optimization Methods Converge Globally

arXiv

引用

arXiv 2021年

作者： Fornasier, Massimo Klock, Timo Riedl, Konstantin Technical University of Munich School of Computation Information and Technology Department of Mathematics Munich Germany Munich Center for Machine Learning Munich Germany Munich Data Science Institute Munich Germany Simula Research Laboratory Department of Numerical Analysis and Scientific Computing Oslo Norway University of San Diego Department of Mathematics San DiegoCA United States

In this paper, we study consensus-based optimization (CBO), which is a multi-agent metaheuristic derivative-free optimization method that can globally minimize nonconvex nonsmooth functions and is amenable to theoretical analysis. Based on an experimentally supported intuition that, on average, CBO performs a gradient descent of the squared Euclidean distance to the global minimizer, we devise a novel technique for proving the convergence to the global minimizer in mean-field law for a rich class of objective functions. The result unveils internal mechanisms of CBO that are responsible for the success of the method. In particular, we prove that CBO performs a convexification of a large class of optimization problems as the number of optimizing agents goes to infinity. Furthermore, we improve prior analyses by requiring mild assumptions about the initialization of the method and by covering objectives that are merely locally Lipschitz continuous. As a core component of this analysis, we establish a quantitative nonasymptotic Laplace principle, which may be of independent interest. From the result of CBO convergence in mean-field law, it becomes apparent that the hardness of any global optimization problem is necessarily encoded in the rate of the mean-field approximation, for which we provide a novel probabilistic quantitative estimate. The combination of these results allows to obtain probabilistic global convergence guarantees of the numerical CBO *** Codes 65K10, 90C26, 90C56, 35Q90, 35Q84 Copyright © 2021, The Authors. All rights reserved.

关键词： Fokker Planck equation

来源：评论

学校读者我要写书评

暂无评论

Multi-label Classification with High-rank and High-order Label Correlations

arXiv

引用

arXiv 2022年

作者： Si, Chongjie Jia, Yuheng Wang, Ran Zhang, Min-Ling Feng, Yanghe Qu, Chongxiao The Chien-Shiung Wu College Southeast University Nanjing210096 China The MoE Key Lab of Artificial Intelligence AI Institute Shanghai Jiao Tong University Shanghai200240 China The School of Computer Science and Engineering Southeast University Nanjing210096 China Ministry of Education China School of Computing & Information Sciences Caritas Institute of Higher Education Hong Kong The Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China The School of Mathematical Science Shenzhen University Shenzhen518060 China Shenzhen Key Laboratory of Advanced Machine Learning and Applications Shenzhen University Shenzhen518060 China The College of Systems Engineering National University of Defense Technology China The 52nd Research Institute of China Electronics Technology Group China

Exploiting label correlations is important to multi-label classification. Previous methods capture the high-order label correlations mainly by transforming the label matrix to a latent label space with low-rank matrix factorization. However, the label matrix is generally a full-rank or approximate full-rank matrix, making the low-rank factorization inappropriate. Besides, in the latent space, the label correlations will become implicit. To this end, we propose a simple yet effective method to depict the high-order label correlations explicitly, and at the same time maintain the high-rank of the label matrix. Moreover, we estimate the label correlations and infer model parameters simultaneously via the local geometric structure of the input to achieve mutual enhancement. Comparative studies over twelve benchmark data sets validate the effectiveness of the proposed algorithm in multi-label classification. The exploited high-order label correlations are consistent with common sense empirically. Our code is publicly available at https://***/Chongjie-Si/HOMI. Copyright © 2022, The Authors. All rights reserved.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Unsupervised ensemble learning based on graph embedding for image clustering 25th

Unsupervised ensemble learning based on graph embedding for ...

引用

25th International Conference on Neural Information Processing, ICONIP 2018

作者： Luo, Xiaohui Zhang, Li Li, Fanzhang Hu, Chengxiang School of Computer Science and Technology and Joint International Research Laboratory of Machine Learning and Neuromorphic Computing Provincial Key Laboratory for Computer Information Processing Technology Soochow University SuzhouJiangsu215006 China

ISBN: (纸本)9783030041816

Manifold learning has attracted more and more attention in machine learning for past decades. Unsupervised Large Graph Embedding (ULGE), which performs well on the large-scale data, has been proposed for manifold learning. To improve the clustering performance, a novel Unsupervised Ensemble learning based on Graph Embedding (UEL-GE) is explored, which takes ULGE to get low-dimensional embeddings of the given data and uses the K-means method to obtain the clustering results. Furthermore, the multiple clusterings are corrected by using the bestMap method. Finally, the corrected clusterings are combined to generate the final clustering. Extensive experiments on several data sets are conducted to show the efficiency and effectiveness of the proposed ensemble learning method. © Springer Nature Switzerland AG 2018.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

A multi-objective deep reinforcement learning algorithm for spatio-temporal latency optimization in mobile IoT-enabled edge computing networks

引用

Simulation Modelling Practice and Theory 2025年 143卷

作者： Parisa Khoshvaght Amir Haider Amir Masoud Rahmani Farhad Soleimanian Gharehchopogh Ferzat Anka Jan Lansky Mehdi Hosseinzadeh Institute of Research and Development Duy Tan University Da Nang Vietnam School of Engineering & Technology Duy Tan University Da Nang Vietnam Centre for Research Impact & Outcome Chitkara University Institute of Engineering and Technology Chitkara University Rajpura 140401 Punjab India Department of AI and Robotics Sejong University Seoul 05006 Republic of Korea Future Technology Research Center National Yunlin University of Science and Technology Yunlin Taiwan Department of Computer Engineering Ur. C. Islamic Azad University Urmia Iran Data Science Application and Research Center (VEBIM) Fatih Sultan Mehmet Vakif University Istanbul Türkiye Department of Computer Science and Mathematics Faculty of Economic Studies University of Finance and Administration Prague Czech Republic Pattern Recognition and Machine Learning Laboratory School of Computing Gachon University Seongnam Republic of Korea

The rapid increase in Mobile Internet of Things (IoT) devices requires novel computational frameworks. These frameworks must meet strict latency and energy efficiency requirements in Edge and Mobile Edge computing (MEC) systems. Spatio-temporal dynamics, which include the position of edge servers and the timing of task schedules, pose a complex optimization problem. These challenges are further exacerbated by the heterogeneity of IoT workloads and the constraints imposed by device mobility. The balance between computational overhead and communication challenges is also a problem. To solve these issues, advanced methods are needed for resource management and dynamic task scheduling in mobile IoT and edge computing environments. In this paper, we propose a Deep Reinforcement learning (DRL) multi-objective algorithm, called a Double Deep Q-learning (DDQN) framework enhanced with Spatio-temporal mobility prediction, latency-aware task offloading, and energy-constrained IoT device trajectory optimization for federated edge computing networks. DDQN was chosen for its optimize stability and reduced overestimation in Q-values. The framework employs a reward-driven optimization model that dynamically prioritizes latency-sensitive tasks, minimizes task migration overhead, and balances energy efficiency across devices and edge servers. It integrates dynamic resource allocation algorithms to address random task arrival patterns and real-time computational demands. Simulations demonstrate up to a 35 % reduction in end-to-end latency, a 28 % improvement in energy efficiency, and a 20 % decrease in the deadline-miss ratio compared to benchmark algorithms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Computational analysis of laminar structure of the human cortex based on local neuron features

arXiv

引用

arXiv 2019年

作者： Stajduhar, Andrija Lipic, Tomislav Sedmak, Goran Loncaric, Sven Judaš, Milos Croatian Institute for Brain Research University of Zagreb School of Medicine Šalata 12 Zagreb10000 Croatia Laboratory for Machine Learning and Knowledge Representation Rud-er Boškovic Institute Faculty of Electrical Engineering and Computing University of Zagreb

In this paper, we present a novel method for analysis and segmentation of laminar structure of the cortex based on tissue characteristics whose change across the gray matter facilitates distinction between cortical layers. We develop and analyze features of individual neurons to investigate changes in architectonic differentiation and present a novel high-performance, automated tree-ensemble method trained on data manually labeled by three human investigators. From the location and basic measures of neurons, more complex features are developed and used in machine learning models for automatic segmentation of cortical layers. Tree ensembles are used on data manually labeled by three human experts. The most accurate classification results were obtained by training three models separately and creating another ensemble by combining probability outputs for final neuron layer classification. Measurement of importances of developed neuron features on both global model level and individual prediction level are obtained. Copyright © 2019, The Authors. All rights reserved.

关键词： Neurons

来源：评论

学校读者我要写书评

暂无评论

DPA-2: a large atomic model as a multi-task learner

arXiv

引用

arXiv 2023年

作者： Zhang, Duo Liu, Xinzijian Zhang, Xiangyu Zhang, Chengqian Cai, Chun Bi, Hangrui Du, Yiming Qin, Xuejian Peng, Anyang Huang, Jiameng Li, Bowen Shan, Yifan Zeng, Jinzhe Zhang, Yuzhi Liu, Siyuan Li, Yifan Chang, Junhan Wang, Xinyan Zhou, Shuo Liu, Jianchuan Luo, Xiaoshan Wang, Zhenyu Jiang, Wanrun Wu, Jing Yang, Yudi Yang, Jiyuan Yang, Manyi Gong, Fu-Qiang Zhang, Linshuang Shi, Mengchao Dai, Fu-Zhi York, Darrin M. Liu, Shi Zhu, Tong Zhong, Zhicheng Lv, Jian Cheng, Jun Jia, Weile Chen, Mohan Ke, Guolin Weinan, E. Zhang, Linfeng Wang, Han AI for Science Institute Beijing100080 China DP Technology Beijing100080 China Academy for Advanced Interdisciplinary Studies Peking University Beijing100871 China State Key Lab of Processors Institute of Computing Technology Chinese Academy of Sciences Beijing100871 China University of Chinese Academy of Sciences Beijing100871 China HEDPS CAPT College of Engineering Peking University Beijing100871 China Ningbo Institute of Materials Technology and Engineering Chinese Academy of Sciences Ningbo315201 China CAS Key Laboratory of Magnetic Materials and Devices Zhejiang Province Key Laboratory of Magnetic Materials and Application Technology Chinese Academy of Sciences Ningbo315201 China School of Electronics Engineering and Computer Science Peking University Beijing100871 China Shanghai Engineering Research Center of Molecular Therapeutics & New Drug Development School of Chemistry and Molecular Engineering East China Normal University Shanghai200062 China Laboratory for Biomolecular Simulation Research Institute for Quantitative Biomedicine Department of Chemistry and Chemical Biology Rutgers University PiscatawayNJ08854 United States Department of Chemistry Princeton University PrincetonNJ08540 United States College of Chemistry and Molecular Engineering Peking University Beijing100871 China Yuanpei College Peking University Beijing100871 China School of Electrical Engineering and Electronic Information Xihua University Chengdu610039 China State Key Laboratory of Superhard Materials College of Physics Jilin University Changchun130012 China Key Laboratory of Material Simulation Methods & Software of Ministry of Education College of Physics Jilin University Changchun130012 China International Center of Future Science Jilin University Changchun130012 China Key Laboratory for Quantum Materials of Zhejiang Province Department of Physics School of Science Westlake University Zhejiang Hangzhou310030 China Atomistic Simulations Italia

The rapid advancements in artificial intelligence (AI) are catalyzing transformative changes in atomic modeling, simulation, and design. AI-driven potential energy models have demonstrated the capability to conduct large-scale, long-duration simulations with the accuracy of ab initio electronic structure methods. However, the model generation process remains a bottleneck for large-scale applications. We propose a shift towards a model-centric ecosystem, wherein a large atomic model (LAM), pre-trained across multiple disciplines, can be efficiently fine-tuned and distilled for various downstream tasks, thereby establishing a new framework for molecular modeling. In this study, we introduce the DPA-2 architecture as a prototype for LAMs. Pre-trained on a diverse array of chemical and materials systems using a multi-task approach, DPA-2 demonstrates superior generalization capabilities across multiple downstream tasks compared to the traditional single-task pre-training and fine-tuning methodologies. Our approach sets the stage for the development and broad application of LAMs in molecular and materials simulation research. Copyright © 2023, The Authors. All rights reserved.

关键词： Multi-task learning

来源：评论

学校读者我要写书评

暂无评论

Magnetostatics and micromagnetics with physics informed neural networks

arXiv

引用

arXiv 2021年

作者： Kovacs, Alexander Exl, Lukas Kornell, Alexander Fischbacher, Johann Hovorka, Markus Gusenbauer, Markus Breth, Leoni Oezelt, Harald Praetorius, Dirk Suess, Dieter Schrefl, Thomas Christian Doppler Laboratory for Magnet design through physics informed machine learning Viktor Kaplan-Straße 2E Wiener Neustadt2700 Austria Department for Integrated Sensor Systems Danube University Krems Viktor Kaplan-Straße 2E Wiener Neustadt2700 Austria Department of Mathematics University of Vienna Oskar-Morgenstern-Platz 1 Vienna1090 Austria Wolfgang Pauli Institute Oskar-Morgenstern-Platz 1 Vienna1090 Austria Research Platform MMM Mathematics-Magnetism-Materials Oskar-Morgenstern-Platz 1 Vienna1090 Austria Institute of Analysis and Scientific Computing TU Wien Wiedner Hauptstraße 8-10 Vienna1040 Austria Physics of Functional Materials University of Vienna Währinger Straße 17 Vienna1090 Austria

Partial differential equations and variational problems can be solved with physics informed neural networks (PINNs). The unknown field is approximated with neural networks. Minimizing the residuals of the static Maxwell equation at collocation points or the magnetostatic energy, the weights of the neural network are adjusted so that the neural network solution approximates the magnetic vector potential. This way, the magnetic flux density for a given magnetization distribution can be estimated. With the magnetization as an additional unknown, inverse magnetostatic problems can be solved. Augmenting the magnetostatic energy with additional energy terms, micromagnetic problems can be solved. We demonstrate the use of physics informed neural networks for solving magnetostatic problems, computing the magnetization for inverse problems, and calculating the demagnetization curves for two-dimensional *** Codes I.6.3, I.6.5, I.2.6 Copyright © 2021, The Authors. All rights reserved.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：