21 citations · 33 across the 9 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.LG2018★ 7 cited
Thwarting Adversarial Examples: An -RobustSparse Fourier Transform
Mitali Bafna, Jack Murtagh, Nikhil Vyas
We give a new algorithm for approximating the Discrete Fourier transform of an approximately sparse signal that has been corrupted by worst-case noise, namely a bounded numbe…
cs.DS2018★ 1 cited
Super Strong ETH is False for Random -SAT
Nikhil Vyas
It has been hypothesized that -SAT is hard to solve for randomly chosen instances near the "critical threshold", where the clause-to-variable ratio is . Feige's…
cs.LO2018★ 1 cited
Distribution-based objectives for Markov Decision Processes
S. Akshay, Blaise Genest, Nikhil Vyas
We consider distribution-based objectives for Markov Decision Processes (MDP). This class of objectives gives rise to an interesting trade-off between full and partial information.…