no code implementations • 12 Jul 2024 • Shun Kotoku, Takatomo Mihana, André Röhm, Ryoichi Horisaki
Multi-agent reinforcement learning (MARL) studies crucial principles that are applicable to a variety of fields, including wireless networking and autonomous driving.
no code implementations • 5 Dec 2023 • Shun Kotoku, Takatomo Mihana, André Röhm, Ryoichi Horisaki, Makoto Naruse
Photonic accelerators have recently attracted soaring interest, harnessing the ultimate nature of light for information processing.
no code implementations • 3 May 2023 • Honoka Shiratori, Hiroaki Shinkawa, André Röhm, Nicolas Chauvet, Etsuo Segawa, Jonathan Laurent, Guillaume Bachelier, Tomoki Yamagami, Ryoichi Horisaki, Makoto Naruse
Quantum processes can realize conflict-free joint decisions among two agents using the entanglement of photons or quantum interference of orbital angular momentum (OAM).
no code implementations • 20 Apr 2023 • Tomoki Yamagami, Etsuo Segawa, Takatomo Mihana, André Röhm, Ryoichi Horisaki, Makoto Naruse
Quantum walks (QWs) have a property that classical random walks (RWs) do not possess -- the coexistence of linear spreading and localization -- and this property is utilized to implement various kinds of applications.
no code implementations • 27 Jan 2023 • Kohei Tsuchiyama, André Röhm, Takatomo Mihana, Ryoichi Horisaki, Makoto Naruse
In recent years, reservoir computing has expanded to new functions such as the autonomous generation of chaotic time series, as well as time series prediction and classification.
no code implementations • 20 Dec 2022 • Hiroaki Shinkawa, Nicolas Chauvet, André Röhm, Takatomo Mihana, Ryoichi Horisaki, Guillaume Bachelier, Makoto Naruse
In addition, we propose a multi-agent architecture in which agents are indirectly connected through quantum interference of light and quantum principles ensure the conflict-free property of state-action pair selections among agents.
no code implementations • 5 Aug 2022 • Hiroaki Shinkawa, Nicolas Chauvet, André Röhm, Takatomo Mihana, Ryoichi Horisaki, Guillaume Bachelier, Makoto Naruse
Second, to derive the optimal joint selection probability matrix, all players must disclose their probabilistic preferences.
no code implementations • 28 Jul 2022 • Daniel J. Gauthier, Ingo Fischer, André Röhm
Reservoir computing is a machine learning approach that can generate a surrogate model of a dynamical system.
no code implementations • 2 May 2022 • Hiroaki Shinkawa, Nicolas Chauvet, Guillaume Bachelier, André Röhm, Ryoichi Horisaki, Makoto Naruse
Here, we theoretically derive conflict-free joint decision-making that can satisfy the probabilistic preferences of all individual players.
no code implementations • 6 Aug 2021 • André Röhm, Daniel J. Gauthier, Ingo Fischer
Reservoir computers are powerful tools for chaotic time series prediction.
1 code implementation • 19 Nov 2020 • Florian Stelzer, André Röhm, Raul Vicente, Ingo Fischer, Serhiy Yanchuk
We present a method for folding a deep neural network of arbitrary size into a single neuron with multiple time-delayed feedback loops.
no code implementations • 7 May 2019 • Florian Stelzer, André Röhm, Kathy Lüdge, Serhiy Yanchuk
Here we show that the case of equal or resonant time-delay and clock cycle could be actively detrimental and leads to an increase of the approximation error of the reservoir.
no code implementations • 23 Feb 2018 • André Röhm, Kathy Lüdge
The reservoir computing scheme is a machine learning mechanism which utilizes the naturally occuring computational capabilities of dynamical systems.