8 citations · 19 across the 9 of their papers we have counts for
11 papers
On the Computational Tractability of Robust Bandits
Vanessa Kosoy, Vinayak Pathak
Learning when the environment does not belong to the learner's hypothesis class is typically handled using agnostic learning guarantees. However, for anything beyond supervised lea…
Simplifying Adversarially Robust PAC Learning with Tolerance
Hassan Ashtiani, Vinayak Pathak, Ruth Urner
Adversarially robust PAC learning has proved to be challenging, with the currently best known learners [Montasser et al., 2021a] relying on improper methods based on intricate comp…
Imaging across multiple spatial scales with the multi-camera array microscope
Mark Harfouche, Kanghyun Kim, Kevin C. Zhou +22
This article experimentally examines different configurations of a novel multi-camera array microscope (MCAM) imaging technology. The MCAM is based upon a densely packed array of "…
Tensorial tomographic differential phase-contrast microscopy
Shiqi Xu, Xiang Dai, Xi Yang +5
We report Tensorial Tomographic Differential Phase-Contrast microscopy (T2DPC), a quantitative label-free tomographic imaging method for simultaneous measurement of phase and aniso…
Adversarially Robust Learning with Tolerance
Hassan Ashtiani, Vinayak Pathak, Ruth Urner
We initiate the study of tolerant adversarial PAC-learning with respect to metric perturbation sets. In adversarial PAC-learning, an adversary is allowed to replace a test point $x…
Black-box Certification and Learning under Adversarial Perturbations
Hassan Ashtiani, Vinayak Pathak, Ruth Urner
We formally study the problem of classification under adversarial perturbations from a learner's perspective as well as a third-party who aims at certifying the robustness of a giv…
Reconfiguring Ordered Bases of a Matroid
Anna Lubiw, Vinayak Pathak
For a matroid with an ordered (or "labelled") basis, a basis exchange step removes one element with label and replaces it by a new element that results in a new basis, and with…
Shortest reconfiguration paths in the solution space of Boolean formulas
Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak +1
Given a Boolean formula and a satisfying assignment, a flip is an operation that changes the value of a variable in the assignment so that the resulting assignment remains satisfyi…
Flipping Edge-Labelled Triangulations
Prosenjit Bose, Anna Lubiw, Vinayak Pathak +1
Flips in triangulations have received a lot of attention over the past decades. However, the problem of tracking where particular edges go during the flipping process has not been…
Self-Approaching Graphs
Soroush Alamdari, Timothy M. Chan, Elyot Grant +2
In this paper we introduce self-approaching graph drawings. A straight-line drawing of a graph is self-approaching if, for any origin vertex s and any destination vertex t, there i…
Flip Distance Between Two Triangulations of a Point-Set is NP-complete
Anna Lubiw, Vinayak Pathak
Given two triangulations of a convex polygon, computing the minimum number of flips required to transform one to the other is a long-standing open problem. It is not known whether…