iNNk: A Multi-Player Game to Deceive a Neural Network

• URL: http://arxiv.org/abs/2007.09177v2
• Date: Fri, 15 Jan 2021 17:31:00 GMT
• Title: iNNk: A Multi-Player Game to Deceive a Neural Network
• Authors: Jennifer Villareale, Ana Acosta-Ruiz, Samuel Arcaro, Thomas Fox, Evan Freed, Robert Gray, Mathias L\"owe, Panote Nuchprayoon, Aleksanteri Sladek, Rush Weigelt, Yifu Li, Sebastian Risi, Jichen Zhu
• Abstract summary: iNNK is a multiplayer drawing game where human players team up against an NN. The players need to successfully communicate a secret code word to each other through drawings, without being deciphered by the NN.
• Score: 9.996299325641939
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper presents iNNK, a multiplayer drawing game where human players team up against an NN. The players need to successfully communicate a secret code word to each other through drawings, without being deciphered by the NN. With this game, we aim to foster a playful environment where players can, in a small way, go from passive consumers of NN applications to creative thinkers and critical challengers.

Related papers

• Neural Population Learning beyond Symmetric Zero-sum Games [52.20454809055356]
  We introduce NeuPL-JPSRO, a neural population learning algorithm that benefits from transfer learning of skills and converges to a Coarse Correlated (CCE) of the game. Our work shows that equilibrium convergent population learning can be implemented at scale and in generality.
  arXiv  Detail & Related papers  (2024-01-10T12:56:24Z)
• Fully Spiking Actor Network with Intra-layer Connections for Reinforcement Learning [51.386945803485084]
  We focus on the task where the agent needs to learn multi-dimensional deterministic policies to control. Most existing spike-based RL methods take the firing rate as the output of SNNs, and convert it to represent continuous action space (i.e., the deterministic policy) through a fully-connected layer. To develop a fully spiking actor network without any floating-point matrix operations, we draw inspiration from the non-spiking interneurons found in insects.
  arXiv  Detail & Related papers  (2024-01-09T07:31:34Z)
• Mindstorms in Natural Language-Based Societies of Mind [110.05229611910478]
  Minsky's "society of mind" and Schmidhuber's "learning to think" inspire diverse societies of large multimodal neural networks (NNs) Recent implementations of NN-based societies of minds consist of large language models (LLMs) and other NN-based experts communicating through a natural language interface. In these natural language-based societies of mind (NLSOMs), new agents -- all communicating through the same universal symbolic language -- are easily added in a modular fashion.
  arXiv  Detail & Related papers  (2023-05-26T16:21:25Z)
• Cluster Flow: how a hierarchical clustering layer make allows deep-NNs more resilient to hacking, more human-like and easily implements relational reasoning [0.0]
  ClusterFlow is a semi-supervised hierarchical clustering framework. It can operate on trained NNs and feature data found at the pre-SoftMax layer. It adds more human-like functionality to modern deep convolutional neural networks.
  arXiv  Detail & Related papers  (2023-04-27T10:41:03Z)
• Graph Neural Network based Agent in Google Research Football [0.5735035463793007]
  Some deep neural networks (CNNs) cannot extract enough information or take too long to obtain enough features from the inputs under specific circumstances of reinforcement learning. This paper proposes a deep q-learning network (DQN) with a graph neural network (GNN) as its model. The GNN transforms the input data into a graph which better represents the football players' locations so that it extracts more information of the interactions between different players.
  arXiv  Detail & Related papers  (2022-04-23T21:26:00Z)
• Deep Reinforcement Learning with Spiking Q-learning [51.386945803485084]
  spiking neural networks (SNNs) are expected to realize artificial intelligence (AI) with less energy consumption. It provides a promising energy-efficient way for realistic control tasks by combining SNNs with deep reinforcement learning (RL)
  arXiv  Detail & Related papers  (2022-01-21T16:42:11Z)
• Dealing with Adversarial Player Strategies in the Neural Network Game iNNk through Ensemble Learning [10.30864720221571]
  In this paper, we focus on the adversarial player strategy aspect in the game iNNk. We present a method that combines transfer learning and ensemble methods to obtain a data-efficient adaptation to these strategies. We expect the methods developed in this paper to be useful for the rapidly growing field of NN-based games.
  arXiv  Detail & Related papers  (2021-07-05T14:25:44Z)
• Finite Group Equivariant Neural Networks for Games [0.0]
  Group equivariant CNNs in existing work create networks which can exploit symmetries to improve learning. We introduce Finite Group Neural Networks (FGNNs), a method for creating agents with an innate understanding of these board positions. FGNNs are shown to improve the performance of networks playing checkers (draughts) and can be easily adapted to other games and learning problems.
  arXiv  Detail & Related papers  (2020-09-10T17:46:09Z)
• Boosting Deep Neural Networks with Geometrical Prior Knowledge: A Survey [77.99182201815763]
  Deep Neural Networks (DNNs) achieve state-of-the-art results in many different problem settings. DNNs are often treated as black box systems, which complicates their evaluation and validation. One promising field, inspired by the success of convolutional neural networks (CNNs) in computer vision tasks, is to incorporate knowledge about symmetric geometrical transformations.
  arXiv  Detail & Related papers  (2020-06-30T14:56:05Z)
• A Limited-Capacity Minimax Theorem for Non-Convex Games or: How I Learned to Stop Worrying about Mixed-Nash and Love Neural Nets [29.606063890097275]
  Adrial training, a special case of multi-objective optimization, is an increasingly prevalent machine learning technique. GAN-based generativeplay techniques have been applied to Poker games such as Go.
  arXiv  Detail & Related papers  (2020-02-14T00:17:24Z)
• Signaling in Bayesian Network Congestion Games: the Subtle Power of Symmetry [66.82463322411614]
  The paper focuses on the problem of optimal ex ante persuasive signaling schemes, showing that symmetry is a crucial property for its solution. We show that an optimal ex ante persuasive scheme can be computed in time when players are symmetric and have affine cost functions.
  arXiv  Detail & Related papers  (2020-02-12T19:38:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.