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

丛书名： Cognitive Technologies

1000年

作者： Daniel Schulz Christian Bauckhage

ISBN: (数字)9783031830976

ISBN: (纸本)9783031830969;9783031830990

This open access book presents the concept of Informed machine learning and demonstrates its practical use with a compelling collection of applications of this paradigm in industrial and business use cases. These range from health care over manufacturing and material science to more advanced combinations with deep learning, say, in the form of physical informed neural networks. The book is intended for those interested in modern informed machine learning for a wide range of practical applications where the aspect of small data sets is a challenge. machine learning with small amounts of data? After the recent success of Artificial Intelligence based on training with massive amounts of data, this idea may sound exotic. However, it addresses crucial needs of practitioners in industry. While many industrial applications stand to benefit from the use of AI, the amounts of data needed by current learning paradigms are often hard to come by in industrial settings. As an alternative, learning methods and models are called for which integrate other sources of knowledge in order to compensate for the lack of data. This is where the principle of “Informed machine learning” comes into play. Informed machine learning combines purely data driven learning and knowledge-based techniques to learn from both data and knowledge. This has several advantages. It reduces the need for data, it often results in smaller, less complex and more robust models, and even makes machine learning applicable in settings where data is scarce. The kind of knowledge to be incorporated into learning processes can take many different forms, for example, differential equations, analytical models, simulation results, logical rules, knowledge graphs, or human feedback which makes the approach overall very powerful and widely applicable.

关键词： machine learning Artificial Intelligence Natural Language Processing (NLP) data Structures and Information Theory Knowledge based Systems Multiagent Systems

来源：评论

学校读者我要写书评

暂无评论

System Architecture for Reading and Interpreting Physical Printouts of Medical Forms 22

System Architecture for Reading and Interpreting Physical Pr...

引用

22nd IEEE International Conference of Young Professionals in Electron Devices and Materials, EDM 2021

作者： Snegireva, Ekaterina Khazankin, Grigory R. Mikheenko, Igor Stream Data Analytics and Machine Learning Laboratory Novosibirsk State University Novosibirsk Russia Novosibirsk State University Novosibirsk Russia Meshalkin National Medical Research Center Novosibirsk Russia

ISBN: (纸本)9781665414982

This article describes the developed architecture of the system module for processing and interpreting analog medical data. Patients often undergo examinations in various medical institutions, and since their results are often handed out to the patient in printed form, the receiving institution transfers them to its database manually. There is also a tendency to completely refuse analog media and use only digital ones. But in this case, another problem appears-either loss or conversion of the accumulated analog base into digital format. These days, automatic document management systems for medical institutions-Health information systems (HIS)-are actively developing. The software module developed in accordance with the architecture described in the article can be used by developers of various HIS to automate the work with analog data. If it is necessary, it can also be freely expanded by adding new modules for working with various analog data. In this article, we take ECG scans and medical test results as examples of such data. As a result of the work undertaken the prototype of the designed system was developed and tested. © 2021 IEEE.

关键词： Medical information systems

来源：评论

学校读者我要写书评

暂无评论

An Improved Finite-time analysis of Temporal Difference learning with Deep Neural Networks 41

An Improved Finite-time Analysis of Temporal Difference Lear...

引用

41st International Conference on machine learning, ICML 2024

作者： Ke, Zhifa Wen, Zaiwen Zhang, Junyu Center for Data Science Peking University China Beijing International Center for Mathematical Research Center for Machine Learning Research Changsha Institute for Computing and Digital Economy Beijing China Department of Industrial Systems Engineering and Management National University of Singapore Singapore

Temporal difference (TD) learning algorithms with neural network function parameterization have well-established empirical success in many practical large-scale reinforcement learning tasks. However, theoretical understanding of these algorithms remains challenging due to the nonlinearity of the action-value approximation. In this paper, we develop an improved non-asymptotic analysis of the neural TD method with a general L-layer neural network. New proof techniques are developed and an improved new Õ(ϵ-1) sample complexity is derived. To our best knowledge, this is the first finite-time analysis of neural TD that achieves an Õ(ϵ-1) complexity under the Markovian sampling, as opposed to the best known Õ(ϵ-2) complexity in the existing literature. Copyright 2024 by the author(s)

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

ON SECOND-ORDER SCORING RULES FOR EPISTEMIC UNCERTAINTY QUANTIFICATION

arXiv

引用

arXiv 2023年

作者： Bengs, Viktor Hüllermeier, Eyke Waegeman, Willem Munich Center for Machine Learning Germany Department of Data Analysis and Mathematical Modeling Ghent University Belgium

It is well known that accurate probabilistic predictors can be trained through empirical risk minimisation with proper scoring rules as loss functions. While such learners capture so-called aleatoric uncertainty of predictions, various machine learning methods have recently been developed with the goal to let the learner also represent its epistemic uncertainty, i.e., the uncertainty caused by a lack of knowledge and data. An emerging branch of the literature proposes the use of a second-order learner that provides predictions in terms of distributions on probability distributions. However, recent work has revealed serious theoretical shortcomings for second-order predictors based on loss minimisation. In this paper, we generalise these findings and prove a more fundamental result: There seems to be no loss function that provides an incentive for a second-order learner to faithfully represent its epistemic uncertainty in the same manner as proper scoring rules do for standard (first-order) learners. As a main mathematical tool to prove this result, we introduce the generalised notion of second-order scoring *** Codes 68T37 (Primary) 68T30 (Secondary) Copyright © 2023, The Authors. All rights reserved.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

A REDUCTION-BASED FRAMEWORK FOR CONSERVATIVE BANDITS AND REINFORCEMENT learning 10

A REDUCTION-BASED FRAMEWORK FOR CONSERVATIVE BANDITS AND REI...

引用

10th International Conference on learning Representations, ICLR 2022

作者： Yang, Yunchang Wu, Tianhao Zhong, Han Garcelon, Evrard Pirotta, Matteo Lazaric, Alessandro Wang, Liwei Du, Simon S. Center for Data Science Peking University China University of California Berkeley United States Facebook AI Research Key Laboratory of Machine Perception MOE School of Artificial Intelligence Peking University China International Center for Machine Learning Research Peking University China University of Washington United States

We study bandits and reinforcement learning (RL) subject to a conservative constraint where the agent is asked to perform at least as well as a given baseline policy. This setting is particular relevant in real-world domains including digital marketing, healthcare, production, finance, etc. In this paper, we present a reduction-based framework for conservative bandits and RL, in which our core technique is to calculate the necessary and sufficient budget obtained from running the baseline policy. For lower bounds, we improve the existing lower bound for conservative multi-armed bandits and obtain new lower bounds for conservative linear bandits, tabular RL and low-rank MDP, through a black-box reduction that turns a certain lower bound in the nonconservative setting into a new lower bound in the conservative setting. For upper bounds, in multi-armed bandits, linear bandits and tabular RL, our new upper bounds tighten or match existing ones with significantly simpler analyses. We also obtain a new upper bound for conservative low-rank MDP. © 2022 ICLR 2022 - 10th International Conference on learning Representationss. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

hmBERT: Historical Multilingual Language Models for Named Entity Recognition

hmBERT: Historical Multilingual Language Models for Named En...

引用

2022 Conference and Labs of the Evaluation Forum, CLEF 2022

作者： Schweter, Stefan März, Luisa Schmid, Katharina Çano, Erion Bayerische Staatsbibliothek München Digital Library/ Munich Digitization Center Munich Germany Digital Philology Research Group Data Mining and Machine Learning University of Vienna Austria Natural Language Processing Expert Center Data:Lab Volkswagen AG Munich Germany

Compared to standard Named Entity Recognition (NER), identifying persons, locations, and organizations in historical texts constitutes a big challenge. To obtain machine-readable corpora, the historical text is usually scanned and Optical Character Recognition (OCR) needs to be performed. As a result, the historical corpora contain errors. Also, entities like location or organization can change over time, which poses another challenge. Overall, historical texts come with several peculiarities that differ greatly from modern texts and large labeled corpora for training a neural tagger are hardly available for this domain. In this work, we tackle NER for historical German, English, French, Swedish, and Finnish by training large historical language models. We circumvent the need for large amounts of labeled data by using unlabeled data for pretraining a language model. We propose hmBert, a historical multilingual BERT-based language model, and release the model in several versions of different sizes. Furthermore, we evaluate the capability of hmBert by solving downstream NER as part of this year’s HIPE-2022 shared task and provide detailed analysis and insights. For the Multilingual Classical Commentary coarse-grained NER challenge, our tagger HISTeria outperforms the other teams’ models for two out of three languages. © 2022 Copyright for this paper by its authors.

关键词： Optical character recognition

来源：评论

学校读者我要写书评

暂无评论

PITFALLS OF EPISTEMIC UNCERTAINTY QUANTIFICATION THROUGH LOSS MINIMISATION

arXiv

引用

arXiv 2022年

作者： Bengs, Viktor Hüllermeier, Eyke Waegeman, Willem Germany Munich Center for Machine Learning Germany Department of Data Analysis and Mathematical Modeling Ghent University Belgium

Uncertainty quantification has received increasing attention in machine learning in the recent past. In particular, a distinction between aleatoric and epistemic uncertainty has been found useful in this regard. The latter refers to the learner's (lack of) knowledge and appears to be especially difficult to measure and quantify. In this paper, we analyse a recent proposal based on the idea of a second-order learner, which yields predictions in the form of distributions over probability distributions. While standard (first-order) learners can be trained to predict accurate probabilities, namely by minimising suitable loss functions on sample data, we show that loss minimisation does not work for second-order predictors: The loss functions proposed for inducing such predictors do not incentivise the learner to represent its epistemic uncertainty in a faithful *** Codes 68T37 (Primary) 68T30 (Secondary) Copyright © 2022, The Authors. All rights reserved.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

On the Effectiveness of Heterogeneous Ensemble Methods for Re-Identification 23

On the Effectiveness of Heterogeneous Ensemble Methods for R...

引用

23rd IEEE International Conference on machine learning and Applications, ICMLA 2024

作者： Klüttermann, Simon Rutinowski, Jérôme Polachowski, Frederik Nguyen, Anh Grimme, Britta Roidl, Moritz Müller, Emmanuel Paderborn University Paderborn Germany Tu Dortmund University Dortmund Germany Lamarr Institute for Machine Learning and Artificial Intelligence Dortmund Germany Research Center Trustworthy Data Science and Security Dortmund Germany

ISBN: (纸本)9798350374889

In this contribution, we introduce a novel ensemble method for the re-identification of industrial entities, using images of chipwood pallets and galvanized metal plates as dataset examples. Our algorithms replace commonly used, complex siamese neural networks with an ensemble of simplified, rudimentary models, providing wider applicability, especially in hardware-restricted scenarios. Each ensemble sub-model uses different types of extracted features of the given data as its input, allowing for the creation of effective ensembles in a fraction of the training duration needed for more complex state-of-the-art models. We reach state-of-the-art performance at our task, with a Rank-1 accuracy of over 77% and a Rank-10 accuracy of over 99%, and introduce five distinct feature extraction approaches, and study their combination using different ensemble methods. © 2024 IEEE.

关键词： Contrastive learning

来源：评论

学校读者我要写书评

暂无评论

Pitfalls in EEG-based brain effective connectivity analysis

Pitfalls in EEG-based brain effective connectivity analysis

引用

International Workshop on machine learning and Interpretation in Neuroimaging, MLINI 2011, Held at Neural Information Processing, NIPS 2011

作者： Haufe, Stefan Nikulin, Vadim V. Nolte, Guido Müller, Klaus-Robert Berlin Institute of Technology Machine Learning Germany Bernstein Focus Neurotechnology Berlin Germany Neurophysics Charité University Medicine Berlin Germany Bernstein Center for Computational Neuroscience Berlin Germany Intelligent Data Analysis Fraunhofer Institute FIRST Berlin Germany

We consider the problem of estimating brain effective connectivity from electroencephalographic (EEG) measurements, which is challenging due to instantaneous correlations in the sensor data caused by volume conduction in the head. We present selected results of a larger realistic simulation study in which we tested the ability of various measures of effective connectivity to recover the information flow between the underlying sources, as well as the ability of linear and nonlinear inverse source reconstruction approaches to improve the estimation. It turns out that factors related to volume conduction dramatically limit the neurophysiological interpretability of sensor-space connectivity maps and may even (depending on the connectivity measure used) lead to conflicting results. The success of connectivity estimation on inverse source estimates crucially depends on the correctness of the source demixing. This in turn depends on the capability of the method to model (multiple) interacting sources, which is in general not achievable by linear inverses. © 2012 Springer-Verlag.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

Improving Generalization and Convergence by Enhancing Implicit Regularization 38

Improving Generalization and Convergence by Enhancing Implic...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Wang, Mingze Wang, Jinbo He, Haotian Wang, Zilin Huang, Guanhua Xiong, Feiyu Li, Zhiyu Weinan, E. Wu, Lei School of Mathematical Sciences Peking University China Center for Machine Learning Research Peking University China China AI for Science Institute China School of Data Science University of Science and Technology of China China ByteDance Research China

In this work, we propose an Implicit Regularization Enhancement (IRE) framework to accelerate the discovery of flat solutions in deep learning, thereby improving generalization and convergence. Specifically, IRE decouples the dynamics of flat and sharp directions, which boosts the sharpness reduction along flat directions while maintaining the training stability in sharp directions. We show that IRE can be practically incorporated with generic base optimizers without introducing significant computational overload. Experiments show that IRE consistently improves the generalization performance for image classification tasks across a variety of benchmark datasets (CIFAR-10/100, ImageNet) and models (ResNets and ViTs). Surprisingly, IRE also achieves a 2× speed-up compared to AdamW in the pre-training of Llama models (of sizes ranging from 60M to 229M) on datasets including Wikitext-103, Minipile, and Openwebtext. Moreover, we provide theoretical guarantees, showing that IRE can substantially accelerate the convergence towards flat minima in sharpness-aware minimization (SAM). © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：