Search Results for author: Michael Mock

Found 8 papers, 0 papers with code

Developing trustworthy AI applications with foundation models

no code implementations8 May 2024 Michael Mock, Sebastian Schmidt, Felix Müller, Rebekka Görge, Anna Schmitz, Elena Haedecke, Angelika Voss, Dirk Hecker, Maximillian Poretschkin

Chapter 2 provides an introduction to the technical construction of foundation models and Chapter 3 shows how AI applications can be developed based on them.

Assessing Systematic Weaknesses of DNNs using Counterfactuals

no code implementations3 Aug 2023 Sujan Sai Gannamaneni, Michael Mock, Maram Akila

With the advancement of DNNs into safety-critical applications, testing approaches for such models have gained more attention.

Attribute Autonomous Driving +2

Using ScrutinAI for Visual Inspection of DNN Performance in a Medical Use Case

no code implementations2 Aug 2023 Rebekka Görge, Elena Haedecke, Michael Mock

We use our VA tool to analyse the influence of label variations between different experts on the model performance.

Guideline for Trustworthy Artificial Intelligence -- AI Assessment Catalog

no code implementations20 Jun 2023 Maximilian Poretschkin, Anna Schmitz, Maram Akila, Linara Adilova, Daniel Becker, Armin B. Cremers, Dirk Hecker, Sebastian Houben, Michael Mock, Julia Rosenzweig, Joachim Sicking, Elena Schulz, Angelika Voss, Stefan Wrobel

Artificial Intelligence (AI) has made impressive progress in recent years and represents a key technology that has a crucial impact on the economy and society.

Patch Shortcuts: Interpretable Proxy Models Efficiently Find Black-Box Vulnerabilities

no code implementations22 Apr 2021 Julia Rosenzweig, Joachim Sicking, Sebastian Houben, Michael Mock, Maram Akila

To address this constraint, we present an approach to detect learned shortcuts using an interpretable-by-design network as a proxy to the black-box model of interest.

Autonomous Driving

Communication-Efficient Distributed Online Learning with Kernels

no code implementations28 Nov 2019 Michael Kamp, Sebastian Bothe, Mario Boley, Michael Mock

It extends a previously presented protocol to kernelized online learners that represent their models by a support vector expansion.

Model Compression

Adaptive Communication Bounds for Distributed Online Learning

no code implementations28 Nov 2019 Michael Kamp, Mario Boley, Michael Mock, Daniel Keren, Assaf Schuster, Izchak Sharfman

The learning performance of such a protocol is intuitively optimal if approximately the same loss is incurred as in a hypothetical serial setting.

Cannot find the paper you are looking for? You can Submit a new open access paper.