1.7k citations · 2.4k across the 56 of their papers we have counts for
11 papers · 1 filter
Revisiting Non-Progressive Influence Models: Scalable Influence Maximization
Golshan Golnari, Amir Asiaee, Arindam Banerjee +1
While influence maximization in social networks has been studied extensively in computer science community for the last decade the focus has been on the progressive influence model…
Properties of Lyubeznik numbers under localization and polarization
Arindam Banerjee, Luis Núñez-Betancourt, Kohji Yanagawa
We exhibit a global bound for the Lyubeznik numbers of a ring of prime characteristic. In addition, we show that for a monomial ideal, the Lyubeznik numbers of the quotient rings o…
Regularity of Path Ideals of Gap Free Graphs
Arindam Banerjee
In this paper we study the Castelnuovo-Mumford regularity of the path ideals of finite simple graphs. We find new upper bounds for various path ideals of gap free graphs. In partic…
Multi-task Sparse Structure Learning
Andre R. Goncalves, Puja Das, Soumyadeep Chatterjee +3
Multi-task learning (MTL) aims to improve generalization performance by learning multiple related tasks simultaneously. While sometimes the underlying task relationship structure i…
Powers of edge ideals of regularity three bipartite graphs
Ali Alilooee, Arindam Banerjee
In this paper we prove that if is a bipartite edge ideal with regularity three then for all the regularity of is exactly .
Randomized Block Coordinate Descent for Online and Stochastic Optimization
Huahua Wang, Arindam Banerjee
Two types of low cost-per-iteration gradient descent methods have been extensively studied in parallel. One is online or stochastic gradient descent (OGD/SGD), and the other is ran…