activity
20092026
most citedA geometric alternative to Nesterov's accelerated gradient descent

85 citations · 237 across the 30 of their papers we have counts for

collaborators
Showing 2020Show all

6 papers · 1 filter

math.NA2020★ 2 cited

Rank one tensor completion problem

Mohit Singh, Alexander Shapiro, Rui Zhang

In this paper, we consider the rank-one tensor completion problem. We address the question of existence and uniqueness of the rank-one solution. In particular we show that the glob…

math.OC2020

Adaptive Bin Packing with Overflow

Sebastian Perez-Salazar, Mohit Singh, Alejandro Toriello

Motivated by bursty bandwidth allocation and by the allocation of virtual machines to servers in the cloud, we consider the online problem of packing items with random sizes into u…

cs.DS2020

Maximizing Determinants under Matroid Constraints

Vivek Madan, Aleksandar Nikolov, Mohit Singh +1

Given vectors and a matroid , we study the problem of finding a basis of such that is maximized…

math.CO2020

Tropicalization of Graph Profiles

Grigoriy Blekherman, Annie Raymond, Mohit Singh +1

A graph profile records all possible densities of a fixed finite set of graphs. Profiles can be extremely complicated; for instance the full profile of any triple of connected grap…

cs.CC2020

& Maximum Variance Embedding: Measuring and Optimizing Connectivity of A Graph Metric

Majid Farhadi, Anand Louis, Mohit Singh +1

Bobkov, Houdré, and the last author [2000] introduced a Poincaré-type functional parameter, , of a graph and related it to connectivity of the graph via Cheeger-type ineq…

cs.DS2020★ 3 cited

On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness

Alfredo Torrico, Mohit Singh, Sebastian Pokutta

Submodular maximization has been widely studied over the past decades, mostly because of its numerous applications in real-world problems. It is well known that the standard greedy…