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

arXiv 2023年

作者： Koehler, Gregor Wald, Tassilo Ulrich, Constantin Zimmerer, David Jaeger, Paul F. Franke, Jörg K.H. Kohl, Simon Isensee, Fabian Maier-Hein, Klaus H. Heidelberg Division of Medical Image Computing Germany Helmholtz Information and Data Science School for Health Karlsruhe Heidelberg Germany Helmholtz Imaging DKFZ Germany NCT Heidelberg a partnership between DKFZ University Medical Center Heidelberg Germany Interactive Machine Learning Group DKFZ Applied Computer Vision Lab DKFZ Machine Learning Lab University of Freiburg Freiburg Germany London United Kingdom Pattern Analysis and Learning Group Heidelberg University Hospital Heidelberg Germany

Despite the remarkable success of deep learning systems over the last decade, a key difference still remains between neural network and human decision-making: As humans, we can not only form a decision on the spot, but also ponder, revisiting an initial guess from different angles, distilling relevant information, arriving at a better decision. Here, we propose RecycleNet, a latent feature recycling method, instilling the pondering capability for neural networks to refine initial decisions over a number of recycling steps, where outputs are fed back into earlier network layers in an iterative fashion. This approach makes minimal assumptions about the neural network architecture and thus can be implemented in a wide variety of contexts. Using medical image segmentation as the evaluation environment, we show that latent feature recycling enables the network to iteratively refine initial predictions even beyond the iterations seen during training, converging towards an improved decision. We evaluate this across a variety of segmentation benchmarks and show consistent improvements even compared with top-performing segmentation methods. This allows trading increased computation time for improved performance, which can be beneficial, especially for safety-critical applications. © 2023, CC BY.

关键词： Network layers

来源：评论

学校读者我要写书评

暂无评论

Deep Reinforcement learning for Beam Angle Optimization of Intensity-Modulated Radiation Therapy

arXiv

引用

arXiv 2023年

作者： Bao, Peng Wang, Gong Yang, Ruijie Dong, Bin The Center for Data Science Peking University the Department of Radiation Oncology Peking University Third Hospital Beijing China The Department of Radiation Oncology Peking University Third Hospital Beijing China Beijing International Center for Mathematical Research Center for Machine Learning Research National Biomedical Imaging Center Peking University Beijing China

Objective: Intensity-modulated radiation therapy (IMRT) beam angle optimization (BAO) is a challenging combinatorial optimization problem that is NP-hard. In this study, we aim to develop a personalized BAO algorithm for IMRT that improves the quality of the final treatment. Methods: To improve the quality of IMRT treatment planning, we propose a deep reinforcement learning (DRL)based approach for IMRT BAO. We consider the task as a sequential decision-making problem and formulate it as a Markov Decision Process. To facilitate the training process, a 3D-Unet is designed to predict the dose distribution for the different number of beam angles, ranging from 1 to 9, to simulate the IMRT environment. By leveraging the simulation model, double deep-Q network (DDQN) and proximal policy optimization (PPO) are used to train agents to select the personalized beam angle sequentially within a few seconds. Results: The treatment plans with beam angles selected by DRL outperform those with clinically used evenly distributed beam angles. For DDQN, the overall average improvement of the CIs is 0.027, 0.032, and 0.03 for 5, 7, and 9 beam angles respectively. For PPO, the overall average improvement of CIs is 0.045, 0.051, and 0.025 for 5, 7, and 9 beam angles respectively. Conclusion: The proposed DRL-based beam angle selection strategy can generate personalized beam angles within a few seconds, and the resulting treatment plan is superior to that obtained using evenly distributed angles. Significance: A fast and automated personalized beam angle selection approach is been proposed for IMRT BAO. © 2023, CC BY.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Reproducibility and Geometric Intrinsic Dimensionality: An Investigation on Graph Neural Network research

arXiv

引用

arXiv 2024年

作者： Hille, Tobias Stubbemann, Maximilian Hanika, Tom Knowledge & Data Engineering Group University of Kassel Kassel Germany Interdisciplinary Research Center for Information System Design University of Kassel Kassel Germany Information Systems and Machine Learning Lab University of Hildesheim Hildesheim Germany Institute of Computer Science University of Hildesheim Hildesheim Germany

Difficulties in replication and reproducibility of empirical evidences in machine learning research have become a prominent topic in recent years. Ensuring that machine learning research results are sound and reliable requires reproducibility, which verifies the reliability of research findings using the same code and data. This promotes open and accessible research, robust experimental workflows, and the rapid integration of new findings. Evaluating the degree to which research publications support these different aspects of reproducibility is one goal of the present work. For this we introduce an ontology of reproducibility in machine learning and apply it to methods for graph neural networks. Building on these efforts we turn towards another critical challenge in machine learning, namely the curse of dimensionality, which poses challenges in data collection, representation, and analysis, making it harder to find representative data and impeding the training and inference processes. Using the closely linked concept of geometric intrinsic dimension we investigate to which extend the used machine learning models are influenced by the intrinsic dimension of the data sets they are trained *** Codes 68T01 68T07 68T09 51F99 Copyright © 2024, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Marine Predators Algorithm for Energy Scheduling Problem Using Renewable Energy

Marine Predators Algorithm for Energy Scheduling Problem Usi...

引用

Cyber Resilience (ICCR), International Conference on

作者： Sharif Naser Makhadmeh Ammar Kamal Abasi Mohammed Azmi Al-Betar Department of Data Science and Artificial Intelligence University of Petra Amman Jordan Machine Learning Department Mohamed Bin Zayed University of Artificial Intelligence (MBZUAI) Abu Dhabi United Arab Emirates Artificial Intelligence Research Center (AIRC) Ajman University Ajman United Arab Emirates

ISBN: (数字)9798350394962

ISBN: (纸本)9798350394979

The Energy Scheduling Problem (ESP) involves scheduling smart home appliances based on electricity pricing schemes. This entails adjusting the timing of operations for these appliances across different periods. The primary aim of this scheduling approach is to reduce cost and the Peak-to-Average Ratio (PAR), while enhancing user comfort. This study employs the Marine Predators Algorithm (MPA) to address ESP and derive an optimal schedule for smart home appliances. Additionally, a renewable energy source (RES) on the basis of a PV system is introduced to further optimize appliance schedules by providing a smart home with energy, particularly during peak periods. The obtained outcomes demonstrate the effectiveness of the introduced RES in reducing costs of electricity and enhancing user satisfaction. Furthermore, the performance of MPA is compared with that of the wind-driven optimization algorithm, with MPA proving superior in achieving ESP objectives.

关键词： Home appliances Optimization Pricing Heuristic algorithms Optimal scheduling Electricity Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

BIM: Improving Graph Neural Networks with Balanced Influence Maximization

BIM: Improving Graph Neural Networks with Balanced Influence...

引用

International Conference on data Engineering

作者： Wentao Zhang Xinyi Gao Ling Yang Meng Cao Ping Huang Jiulong Shan Hongzhi Yin Bin Cui Center for Machine Learning Research Peking University Institute of Advanced Algorithms Research Shanghai National Engineering Labratory for Big Data Analytics and Applications The University of Queensland Australia Key Lab of High Confidence Software Technologies Peking University Apple Inc. Institute of Computational Social Science Peking University Qingdao

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

The imbalanced data classification problem has aroused lots of concerns from both academia and industry since data imbalance is a widespread phenomenon in many real-world scenarios. Although this problem has been well researched from the view of imbalanced class samples, we further argue that graph neural networks (GNNs) expose a unique source of imbalance from the influenced nodes of different classes of labeled nodes, i.e., labeled nodes are imbalanced in terms of the number of nodes they influenced during the influence propagation in GNNs. To tackle this previously unexplored influence-imbalance issue, we connect social influence maximization with the imbalanced node classification problem and propose balanced influence maximization (BIM). Specifically, BIM greedily assigns the pseudo label to the node which can maximize the number of influenced nodes in GNN training while making the influence of each class more balance. Experimental results on five public datasets demonstrate the effectiveness of our method in relieving the influence-imbalance issue. For example, when training a GCN with an imbalance ratio of 0.1, BIM significantly outperforms the most competitive baseline by 0.6% -9.8% in five public datasets in terms of the F1 score.

关键词： Training Industries data engineering Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Enhancing Predictive Imaging Biomarker Discovery Through Treatment Effect analysis

Enhancing Predictive Imaging Biomarker Discovery Through Tre...

引用

IEEE Workshop on Applications of Computer Vision (WACV)

作者： Shuhan Xiao Lukas Klein Jens Petersen Philipp Vollmuth Paul F. Jaeger Klaus H. Maier-Hein German Cancer Research Center (DKFZ) Heidelberg Division of Medical Image Computing Germany Faculty of Mathematics and Computer Science Heidelberg University Germany DKFZ Heidelberg Interactive Machine Learning Group Germany Institute for Machine Learning ETH Zürich Switzerland DKFZ Heidelberg Helmholtz Imaging Germany Division for Computational Radiology Clinical AI (CCIBonn.ai) Clinic for Neuroradiology University Hospital Bonn Germany Medical Faculty Bonn University of Bonn Germany Department of Radiation Oncology Pattern Analysis and Learning Group Heidelberg University Hospital Germany

ISBN: (数字)9798331510831

ISBN: (纸本)9798331510848

Identifying predictive covariates, which forecast individual treatment effectiveness, is crucial for decision-making across different disciplines such as personalized medicine. These covariates, referred to as biomarkers, are extracted from pretreatment data, often within randomized controlled trials, and should be distinguished from prognostic biomarkers, which are independent of treatment assignment. Our study focuses on discovering predictive imaging biomarkers, specific image features, by leveraging pretreatment images to uncover new causal relationships. Unlike laborintensive approaches relying on handcrafted features prone to bias, we present a novel task of directly learning predictive features from images. We propose an evaluation protocol to assess a model's ability to identify predictive imaging biomarkers and differentiate them from purely prognostic ones by employing statistical testing and a comprehensive analysis of image feature attribution. We explore the suitability of deep learning models originally developed for estimating the conditional average treatment effect (CATE) for this task, which have been assessed primarily for their precision of CATE estimation while overlooking the evaluation of imaging biomarker discovery. Our proof-of-concept analysis demonstrates the feasibility and potential of our approach in discovering and validating predictive imaging biomarkers from synthetic outcomes and real-world image datasets. Our code is available at https://***/MIC-DKFZ/predictive_image_biomarker_analysis.

关键词： Analytical models Statistical analysis Biological system modeling Precision medicine Decision making Imaging Estimation Biomarkers Predictive models Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Improving generative model-based unfolding with Schrödinger bridges

引用

Physical Review D 2024年第7期109卷 076011-076011页

作者： Sascha Diefenbacher Guan-Horng Liu Vinicius Mikuni Benjamin Nachman Weili Nie Physics Division Lawrence Berkeley National Laboratory Berkeley California 94720 USA Autonomous Control and Decision Systems Laboratory Georgia Institute of Technology Atlanta Georgia 30332 USA National Energy Research Scientific Computing Center Berkeley Lab Berkeley California 94720 USA Berkeley Institute for Data Science University of California Berkeley California 94720 USA Machine Learning Research Group NVIDIA Research

machine learning-based unfolding has enabled unbinned and high-dimensional differential cross section measurements. Two main approaches have emerged in this research area; one based on discriminative models and one based on generative models. The main advantage of discriminative models is that they learn a small correction to a starting simulation while generative models scale better to regions of phase space with little data. We propose to use Schrödinger bridges and diffusion models to create sbunfold, an unfolding approach that combines the strengths of both discriminative and generative models. The key feature of sbunfold is that its generative model maps one set of events into another without having to go through a known probability density as is the case for normalizing flows and standard diffusion models. We show that sbunfold achieves excellent performance compared to state of the art methods on a synthetic Z+jets dataset.

关键词： machine learning Particle detectors Probability theory

来源：评论

学校读者我要写书评

暂无评论

Double variance reduction: a smoothing trick for composite optimization problems without first-order gradient 24

Double variance reduction: a smoothing trick for composite o...

引用

Proceedings of the 41st International Conference on machine learning

作者： Hao Di Haishan Ye Yueling Zhang Xiangyu Chang Guang Dai Ivor W. Tsang Center for Intelligent Decision-Making and Machine Learning School of Management Xi'an Jiaotong University China and SGIT AI Lab State Grid Corporation of China International Business School Beijing Foreign Studies University Beijing China Center for Intelligent Decision-Making and Machine Learning School of Management Xi'an Jiaotong University China SGIT AI Lab State Grid Corporation of China CFAR and IHPC Agency for Science Technology and Research (A*STAR) Singapore and College of Computing and Data Science NTU Singapore

Variance reduction techniques are designed to decrease the sampling variance, thereby accelerating convergence rates of first-order (FO) and zeroth-order (ZO) optimization methods. However, in composite optimization problems, ZO methods encounter an additional variance called the coordinate-wise variance, which stems from the random gradient estimation. To reduce this variance, prior works require estimating all partial derivatives, essentially approximating FO information. This approach demands O(d) function evaluations (d is the dimension size), which incurs substantial computational costs and is prohibitive in high-dimensional scenarios. This paper proposes the Zeroth-order Proximal Double Variance Reduction (ZPDVR) method, which utilizes the averaging trick to reduce both sampling and coordinate-wise variances. Compared to prior methods, ZPDVR relies solely on random gradient estimates, calls the stochastic zeroth-order oracle (SZO) in expectation O(1) times per iteration, and achieves the optimal O(d(n+κ) log(1/ε)) SZO query complexity in the strongly convex and smooth setting, where κ represents the condition number and ε is the desired accuracy. Empirical results validate ZPDVR's linear convergence and demonstrate its superior performance over other related methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ReInform: Selecting paths with reinforcement learning for contextualized link prediction

arXiv

引用

arXiv 2022年

作者： Speranskaya, Marina Methias, Sameh Roth, Benjamin Center for Information and Language Processing LMU Munich Germany Technical University of Munich Munich Germany Research Group Data Mining and Machine Learning University of Vienna Vienna Austria

We propose to use reinforcement learning to inform transformer-based contextualized link prediction models by providing paths that are most useful for predicting the correct answer. This is in contrast to previous approaches, that either used reinforcement learning (RL) to directly search for the answer, or based their prediction on limited or randomly selected context. Our experiments on WN18RR and FB15k-237 show that contextualized link prediction models consistently outperform RL-based answer search, and that additional improvements (of up to 13.5% MRR) can be gained by combining RL with a link prediction model. The PyTorch implementation of the RL agent is available at https://***/marina-sp/reinform. Copyright © 2022, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Back to the Future: Challenges of Sparse and Irregular Medical Image Time Series

Back to the Future: Challenges of Sparse and Irregular M...

引用

Workshop on Longitudinal Disease Tracking and Modeling with Medical Images and data, LDTM 2024, 5th International Workshop on Multiscale Multimodal Medical Imaging, MMMI 2024, 1st Workshop on machine learning for Multimodal/-sensor Healthcare data, ML4MHD2024 and Workshop on Multimodal learning and Fusion Across Scales for Clinical Decision Support, ML-CDS 2024 held in conjunction with the 27th International Conference on Medical Image Computing and Computer Assisted Intervention, MICCAI 2024

作者： Disch, Nico Albert Peretzke, Robin Roy, Saikat Ulrich, Constantin Zimmerer, David Stiefelhagen, Rainer Kleesiek, Jens Maier-Hein, Klaus Division of Medical Image Computing German Cancer Research Center Heidelberg Germany HIDSS4Health - Helmholtz Information and Data Science School for Health Karlsruhe Heidelberg Germany Faculty of Mathematics and Computer Science University of Heidelberg Heidelberg Germany Pattern Analysis and Learning Group Department of Radiation Oncology Heidelberg University Hospital Heidelberg Germany Karlsruhe Institute of Technology Karlsruhe Germany University Hospital Essen Essen Germany University Hospital Essen West German Cancer Center Essen Essen Germany Medical Faculty Heidelberg University of Heidelberg Heidelberg Germany

ISBN: (纸本)9783031845246

In longitudinal medical image analysis, most work focuses on regularly sampled images, or on tasks like regression or classification. However, in the clinical context, images are frequently generated irregularly due to factors such as cost constraints. This work tackles the problem of irregularly sampled longitudinal medical imaging by evaluating methods in segmentation and reconstruction tasks. We examine the reconstruction for real-life MRI from patients with Alzheimer’s Disease (AD), where the model predicts future MRI scans from an arbitrary number of input images sampled at irregular intervals. However, experiments show that most models cannot surpass the performance of using an image from the same patient at a different time point as a baseline. Therefore, we conducted experiments on a synthetic dataset to better isolate effects in temporal learning. These experiments offer insights into model behavior and serve as a benchmark for validating models’ longitudinal learning capability, thus providing a straightforward method to assess temporal understanding in a controlled environment. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Neurodegenerative diseases

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：