5 citations · 12 across the 6 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
stat.ML2017★ 1 cited
GeoSeq2Seq: Information Geometric Sequence-to-Sequence Networks
Alessandro Bay, Biswa Sengupta
The Fisher information metric is an important foundation of information geometry, wherein it allows us to approximate the local geometry of a probability distribution. Recurrent ne…
cs.LG2017★ 4 cited
StackSeq2Seq: Dual Encoder Seq2Seq Recurrent Networks
Alessandro Bay, Biswa Sengupta
A widely studied non-deterministic polynomial time (NP) hard problem lies in finding a route between the two nodes of a graph. Often meta-heuristics algorithms such as are…
stat.ML2017★ 5 cited
Approximating meta-heuristics with homotopic recurrent neural networks
Alessandro Bay, Biswa Sengupta
Much combinatorial optimisation problems constitute a non-polynomial (NP) hard optimisation problem, i.e., they can not be solved in polynomial time. One such problem is finding th…