Joachim M. Buhmann

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Alessandro Torcinovich

> Home > Persons > Joachim M. Buhmann

Publications

2025
[i46]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2503-16271
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2503-16271
João B. S. Carvalho, Alessandro Torcinovich, Victor Jimenez Rodriguez, Antonio Emanuele Cinà, Carlos Cotrini, Lea Schönherr, Joachim M. Buhmann:
Rethinking Robustness in Machine Learning: A Posterior Agreement Approach. CoRR abs/2503.16271 (2025)
2024
[j72]
- view
  - electronic edition @ openreview.net (open access)
  - details & citations
- export record
  dblp key:
  - journals/tmlr/GeyerTCMB24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tmlr/GeyerTCMB24
Robin C. Geyer, Alessandro Torcinovich, João B. S. Carvalho, Alexander Meyer, Joachim M. Buhmann:
Measuring Orthogonality in Representations of Generative Models. Trans. Mach. Learn. Res. 2024 (2024)
[i38]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2407-03728
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2407-03728
Robin C. Geyer, Alessandro Torcinovich, João B. S. Carvalho, Alexander Meyer, Joachim M. Buhmann:
Measuring Orthogonality in Representations of Generative Models. CoRR abs/2407.03728 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.