80 citations · 273 across the 37 of their papers we have counts for
40 papers
Improved Bounds for Multicovering Hypergraphs
Anand Babu, Sundar Vishwanathan
The minimum number of bicliques needed to cover the edge set of the complete graph on vertices is . The Graham-Pollak theorem states that at least …
A coding perspective on the lower bound for diagonal Ramsey numbers
Sundar Vishwanathan
We give a coding based perspective, on a result of Erdós, on a lower bound for the diagonal ramsey numbers.
DS-FACTO: Doubly Separable Factorization Machines
Parameswaran Raman, S. V. N. Vishwanathan
Factorization Machines (FM) are powerful class of models that incorporate higher-order interaction among features to add more expressive power to linear models. They have been used…
Bounds for the Graham-Pollak Theorem for Hypergraphs
Anand Babu, Sundar Vishwanathan
Let represent the minimum number of complete -partite -graphs required to partition the edge set of the complete -uniform hypergraph on vertices. The Graham-P…
Batch-Expansion Training: An Efficient Optimization Framework
Michał Dereziński, Dhruv Mahajan, S. Sathiya Keerthi +2
We propose Batch-Expansion Training (BET), a framework for running a batch optimizer on a gradually expanding dataset. As opposed to stochastic approaches, batches do not need to b…
Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams
Sagar Kale, Sumedh Tirodkar
We consider the maximum matching problem in the semi-streaming model formalized by Feigenbaum, Kannan, McGregor, Suri, and Zhang that is inspired by giant graphs of today. As our m…