no code implementations • 7 Jun 2023 • Darshan Thaker, Paris Giampouras, René Vidal
In this paper, we build on prior work and propose a novel framework for reverse engineering of deceptions which supposes that the clean data lies in the range of a GAN.
no code implementations • 9 Mar 2022 • Darshan Thaker, Paris Giampouras, René Vidal
We pose this problem as a block-sparse recovery problem, where both the signal and the attack are assumed to lie in a union of subspaces that includes one subspace per class and one subspace per attack type.
2 code implementations • 12 Nov 2019 • Qiang Ma, Suwen Ge, Danyang He, Darshan Thaker, Iddo Drori
Furthermore, to approximate solutions to constrained combinatorial optimization problems such as the TSP with time windows, we train hierarchical GPNs (HGPNs) using RL, which learns a hierarchical policy to find an optimal city permutation under constraints.
Ranked #2 on Traveling Salesman Problem on TSPLIB
3 code implementations • 9 Nov 2019 • Iddo Drori, Darshan Thaker, Arjun Srivatsa, Daniel Jeong, Yueqi Wang, Linyong Nan, Fan Wu, Dimitri Leggas, Jinhao Lei, Weiyi Lu, Weilong Fu, Yuan Gao, Sashank Karri, Anand Kannan, Antonio Moretti, Mohammed AlQuraishi, Chen Keasar, Itsik Pe'er
Our dataset consists of amino acid sequences, Q8 secondary structures, position specific scoring matrices, multiple sequence alignment co-evolutionary features, backbone atom distance matrices, torsion angles, and 3D coordinates.