354 citations
- Institut national de recherche en sciences et technologies du numériqueFR8 papers
- Indian Institute of Science BangaloreIN5 papers
- Indian Institute of Technology KharagpurIN5 papers
- Microsoft (United States)US5 papers
- Indian Institute of Technology DelhiIN4 papers
- Laboratoire d'Informatique de l'École PolytechniqueFR3 papers
- The University of Texas at AustinUS3 papers
- Carnegie Mellon UniversityUS2 papers
- Duke UniversityUS2 papers
- Geometric (India)IN2 papers
- Google (United States)US2 papers
- Hebrew University of JerusalemIL2 papers
7 papers · 1 filter
Streaming, Memory Limited Algorithms for Community Detection
Se-Young Yun, Marc Lelarge, Alexandre Proutiere
In this paper, we consider sparse networks consisting of a finite number of non-overlapping communities, i.e. disjoint clusters, so that there is higher density within clusters tha…
Provable Submodular Minimization using Wolfe's Algorithm
Deeparnab Chakrabarty, Prateek Jain, Pravesh Kothari
Owing to several applications in large scale learning and vision problems, fast submodular function minimization (SFM) has become a critical problem. Theoretically, unconstrained S…
Advanced Proof Viewing in ProofTool
Tomer Libal, Martin Riener, Mikheil Rukhaia
Sequent calculus is widely used for formalizing proofs. However, due to the proliferation of data, understanding the proofs of even simple mathematical arguments soon becomes impos…
Online and Stochastic Gradient Methods for Non-decomposable Loss Functions
Purushottam Kar, Harikrishna Narasimhan, Prateek Jain
Modern applications in sensitive domains such as biometrics and medicine frequently require the use of non-decomposable loss functions such as precision@k, F-measure etc. Compared…
On Iterative Hard Thresholding Methods for High-dimensional M-Estimation
Prateek Jain, Ambuj Tewari, Purushottam Kar
The use of M-estimators in generalized linear regression models in high dimensional settings requires risk minimization with hard constraints. Of the known methods, the class…
On Computing Maximal Independent Sets of Hypergraphs in Parallel
Ioana O. Bercea, Navin Goyal, David G. Harris +1
Whether or not the problem of finding maximal independent sets (MIS) in hypergraphs is in (R)NC is one of the fundamental problems in the theory of parallel computing. Unlike the w…