Reducing classifier overconfidence against adversaries through graph algorithms

DOI10.1007/s10994-023-06307-yOpenAlexW4324134216MaRDI QIDQ6134332

No author found.

Publication date: 22 August 2023

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-023-06307-y

zbMATH Keywords

overconfidencegossip algorithmadversarial robustness

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Concerning nonnegative matrices and doubly stochastic matrices
• Efficient graph-based image segmentation
• PageRank Beyond the Web
• Random Geometric Graphs
• Stochastic Geometry and Wireless Networks: Volume I Theory
• Stochastic Geometry and Wireless Networks: Volume II Applications
• An Introduction to the Theory of Point Processes
• A Generalization of Sampling Without Replacement From a Finite Universe
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reducing classifier overconfidence against adversaries through graph algorithms