• Publications
  • Influence
FigureSeer: Parsing Result-Figures in Research Papers
TLDR
This paper introduces FigureSeer, an end-to-end framework for parsing result-figures, that enables powerful search and retrieval of results in research papers and formulates a novel graph-based reasoning approach using a CNN-based similarity metric.
Streaming Submodular Matching Meets the Primal-Dual Method
TLDR
It is shown that the (randomized) primal-dual method, which originated in the study of maximum weight matching (MWM), is also useful in the context of MSM, and this is the first use of primal- dual based analysis for streaming submodular optimization.
Beyond Sentential Semantic Parsing: Tackling the Math SAT with a Cascade of Tree Transducers
We present an approach for answering questions that span multiple sentences and exhibit sophisticated cross-sentence anaphoric phenomena, evaluating on a rich source of such questions – the math
Fully-Dynamic Submodular Cover with Bounded Recourse
  • Anupam Gupta, Roie Levin
  • Computer Science, Mathematics
    IEEE 61st Annual Symposium on Foundations of…
  • 2 September 2020
TLDR
This work simultaneously simplifies and unifies previous results, as well as generalizes to a significantly larger class of covering problems, which includes set-coverage functions, and extensively uses the idea of Mutual Coverage, which generalizes the classic notion of mutual information.
Robust Subspace Approximation in a Stream
TLDR
This work gives the first sublinear approximation algorithm for this problem in the turnstile streaming and arbitrary partition distributed models, achieving the same time guarantees as in the offline case.
PTAS for MAP Assignment on Pairwise Markov Random Fields in Planar Graphs
We present a PTAS for computing the maximum a posteriori assignment on Pairwise Markov Random Fields with non-negative weights in planar graphs. This algorithm is practical and not far behind
Finding Skewed Subcubes Under a Distribution
TLDR
It is shown that finding skewed subcubes is as hard as the sparse noisy parity problem, and hence the algorithms cannot be improved on substantially without a breakthrough on this problem which is believed to be intractable.
Random Order Set Cover is as Easy as Offline
We give a polynomial-time algorithm forOnlineSetCover with a competitive ratio ofO(logmn) when the elements are revealed in random order, essentially matching the best possible offline bound of O(log