output
19992025
most citedQuantum random walks - an introductory overview

1.4k citations

Showing cs.NEShow all

15 papers · 1 filter

cs.NE2019

On the Behaviour of Differential Evolution for Problems with Dynamic Linear Constraints

Maryam Hasani-Shoreh, María-Yaneli Ameca-Alducin, Wilson Blaikie +2

Evolutionary algorithms have been widely applied for solving dynamic constrained optimization problems (DCOPs) as a common area of research in evolutionary optimization. Current be…

cs.NE2017★ 51 cited

Unbiasing Truncated Backpropagation Through Time

Corentin Tallec, Yann Ollivier

Truncated Backpropagation Through Time (truncated BPTT) is a widespread method for learning recurrent computational graphs. Truncated BPTT keeps the computational benefits of Backp…

cs.NE2017★ 3 cited

Unbiased Online Recurrent Optimization

Corentin Tallec, Yann Ollivier

The novel Unbiased Online Recurrent Optimization (UORO) algorithm allows for online learning of general recurrent computational graphs such as recurrent network models. It works in…

cs.NE2016★ 34 cited

COCO: Performance Assessment

Nikolaus Hansen, Anne Auger, Dimo Brockhoff +2

We present an any-time performance assessment for benchmarking numerical optimization algorithms in a black-box scenario, applied within the COCO benchmarking platform. The perform…

cs.NE2016★ 25 cited

Biobjective Performance Assessment with the COCO Platform

Dimo Brockhoff, Tea Tušar, Dejan Tušar +3

This document details the rationales behind assessing the performance of numerical black-box optimizers on multi-objective problems within the COCO platform and in particular on th…

cs.NE2016★ 15 cited

Practical Riemannian Neural Networks

Gaétan Marceau-Caron, Yann Ollivier

We provide the first experimental results on non-synthetic datasets for the quasi-diagonal Riemannian gradient descents for neural networks introduced in [Ollivier, 2015]. These in…