Informatik
Permanent URI for this collection
Browse
Browsing Informatik by Subject "510"
Now showing 1 - 4 of 4
Results Per Page
Sort Options
- ItemAnalysis, simulation and prediction of multivariate random fields with package randomfields(Los Angeles, Calif. : UCLA, Dept. of Statistics, 2015) Schlather, Martin; Malinowski, Alexander; Menck, Peter J.; Oesting, Marco; Strokorb, KirstinModeling of and inference on multivariate data that have been measured in space, such as temperature and pressure, are challenging tasks in environmental sciences, physics and materials science. We give an overview over and some background on modeling with crosscovariance models. The R package RandomFields supports the simulation, the parameter estimation and the prediction in particular for the linear model of coregionalization, the multivariate Matérn models, the delay model, and a spectrum of physically motivated vector valued models. An example on weather data is considered, illustrating the use of RandomFields for parameter estimation and prediction.
- ItemBridging the Gap Between (AI-) Services and Their Application in Research and Clinical Settings Through Interoperability: the OMI-Protocol(Hannover : Technische Informationsbibliothek, 2024-02) Sigle, Stefan; Werner, Patrick; Schweizer, Simon; Caldeira, Liliana; Hosch, René; Dyrba, Martin; Fegeler, Christian; Sigle, Stefan; Werner, Patrick; Schweizer, Simon; Caldeira, Liliana; Hosch, René; Dyrba, Martin; Fegeler, Christian; Grönke, Ana; Seletkov, Dmitrii; Kotter, Elmar; Nensa, Felix; Wehrle, Julius; Kaufmes, Kevin; Scherer, Lucas; Nolden, Marco; Boeker, Martin; Schmidt, Marvin; Pelka, Obioma; Braren, Rickmer; Stump, Shura-Roman; Graetz, Teresa; Pogarell, Tobias; Susetzky, Tobias; Wieland, Tobias; Parmar, Vicky; Wang, YuanbinArtificial Intelligence (AI) in research and clinical contexts is transforming the areas of medical and life sciences permanently. Aspects like findability, accessibility, interoperability, and reusability are often neglected for AI-based inference services. The Open Medical Inference (OMI) protocol aims to support remote inference by addressing the aforementioned aspects. Key component of the proposed protocol is an interoperable registry for remote inference services, which addresses the issue of findability for algorithms. It is complemented by information on how to invoke services remotely. Together, these components lay the basis for the implementation of distributed inference services beyond organizational borders. The OMI protocol considers prior work for aspects like data representation and transmission standards wherever possible. Based on Business Process Modeling of prototypical use cases for the service registry and common inference processes, a generic information model for remote services was inferred. Based on this model, FHIR resources were identified to represent AI-based services. The OMI protocol is first introduced using AI-services in radiology but is designed to be generalizable to other application domains as well. It provides an accessible, open specification as blueprint for the introduction and implementation of remote inference services.
- ItemGeneralized self-concordant analysis of Frank–Wolfe algorithms(Berlin ; Heidelberg : Springer, 2022) Dvurechensky, Pavel; Safin, Kamil; Shtern, Shimrit; Staudigl, MathiasProjection-free optimization via different variants of the Frank–Wolfe method has become one of the cornerstones of large scale optimization for machine learning and computational statistics. Numerous applications within these fields involve the minimization of functions with self-concordance like properties. Such generalized self-concordant functions do not necessarily feature a Lipschitz continuous gradient, nor are they strongly convex, making them a challenging class of functions for first-order methods. Indeed, in a number of applications, such as inverse covariance estimation or distance-weighted discrimination problems in binary classification, the loss is given by a generalized self-concordant function having potentially unbounded curvature. For such problems projection-free minimization methods have no theoretical convergence guarantee. This paper closes this apparent gap in the literature by developing provably convergent Frank–Wolfe algorithms with standard O(1/k) convergence rate guarantees. Based on these new insights, we show how these sublinearly convergent methods can be accelerated to yield linearly convergent projection-free methods, by either relying on the availability of a local liner minimization oracle, or a suitable modification of the away-step Frank–Wolfe method.
- ItemSpecial issue on conceptual structures(Dordrecht [u.a.] : Springer Science + Business Media B.V, 2022) Alam, Mehwish; Braun, Tanya; Endres, Dominik; Yun, Bruno[no abstract available]