Bayesian Neural Networks: A Min-Max Game Framework

Junping Hong, Ercan Engin Kuruoglu
11/18/2023
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

In deep learning, Bayesian neural networks (BNN) provide the role of robustness analysis, and the minimax method is used to be a conservative choice in the traditional Bayesian field. In this paper, we study a conservative BNN with the minimax method and formulate a two-player game between a deterministic neural network $f$ and a sampling stochastic neural network $f + r*ξ$. From this perspective, we understand the closed-loop neural networks with the minimax loss and reveal their connection to the BNN. We test the models on simple data sets, study their robustness under noise perturbation, and report some issues for searching $r$.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{hong2023bayesian,
  title  = {Bayesian Neural Networks: A Min-Max Game Framework},
  author = {Junping Hong and Ercan Engin Kuruoglu},
  year   = {2023},
  eprint = {2311.11126},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2311.11126v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2311.11126.svg)](https://codeofpaper.com/paper/2311.11126)

Discussion