activity
20112026
most citedDynamic Word Embeddings for Evolving Semantic Discovery

109 citations · 457 across the 29 of their papers we have counts for

collaborators
Showing cs.LGShow all

12 papers · 1 filter

cs.LG2023

Simplifying Distributed Neural Network Training on Massive Graphs: Randomized Partitions Improve Model Aggregation

Jiong Zhu, Aishwarya Reganti, Edward Huang +4

Distributed training of GNNs enables learning on massive graphs (e.g., social and e-commerce networks) that exceed the storage and computational capacity of a single machine. To re…

cs.LG2023

You Only Transfer What You Share: Intersection-Induced Graph Transfer Learning for Link Prediction

Wenqing Zheng, Edward W Huang, Nikhil Rao +2

Link prediction is central to many real-world applications, but its performance may be hampered when the graph of interest is sparse. To alleviate issues caused by sparsity, we inv…

cs.LG2022★ 4 cited

Task-Agnostic Graph Explanations

Yaochen Xie, Sumeet Katariya, Xianfeng Tang +4

Graph Neural Networks (GNNs) have emerged as powerful tools to encode graph-structured data. Due to their broad applications, there is an increasing need to develop tools to explai…

cs.LG2021★ 9 cited

Cold Brew: Distilling Graph Node Representations with Incomplete or Missing Neighborhoods

Wenqing Zheng, Edward W Huang, Nikhil Rao +3

Graph Neural Networks (GNNs) have achieved state-of-the-art performance in node classification, regression, and recommendation tasks. GNNs work well when rich and high-quality conn…

cs.LG2021★ 6 cited

Probabilistic Entity Representation Model for Reasoning over Knowledge Graphs

Nurendra Choudhary, Nikhil Rao, Sumeet Katariya +2

Logical reasoning over Knowledge Graphs (KGs) is a fundamental technique that can provide efficient querying mechanism over large and incomplete databases. Current approaches emplo…

cs.LG2021

Cluster-and-Conquer: A Framework For Time-Series Forecasting

Reese Pathak, Rajat Sen, Nikhil Rao +3

We propose a three-stage framework for forecasting high-dimensional time-series data. Our method first estimates parameters for each univariate time series. Next, we use these para…

cs.LG2021★ 4 cited

Maximizing and Satisficing in Multi-armed Bandits with Graph Information

Parth K. Thaker, Mohit Malu, Nikhil Rao +1

Pure exploration in multi-armed bandits has emerged as an important framework for modeling decision-making and search under uncertainty. In modern applications, however, one is oft…

cs.LG2020★ 46 cited

Self-Supervised Hyperboloid Representations from Logical Queries over Knowledge Graphs

Nurendra Choudhary, Nikhil Rao, Sumeet Katariya +2

Knowledge Graphs (KGs) are ubiquitous structures for information storagein several real-world applications such as web search, e-commerce, social networks, and biology. Querying KG…

cs.LG2019★ 4 cited

Graph DNA: Deep Neighborhood Aware Graph Encoding for Collaborative Filtering

Liwei Wu, Hsiang-Fu Yu, Nikhil Rao +2

In this paper, we consider recommender systems with side information in the form of graphs. Existing collaborative filtering algorithms mainly utilize only immediate neighborhood i…

cs.LG2015★ 17 cited

High-dimensional Time Series Prediction with Missing Values

Hsiang-Fu Yu, Nikhil Rao, Inderjit S. Dhillon

High-dimensional time series prediction is needed in applications as diverse as demand forecasting and climatology. Often, such applications require methods that are both highly sc…

cs.LG2014★ 8 cited

Classification with Sparse Overlapping Groups

Nikhil Rao, Robert Nowak, Christopher Cox +1

Classification with a sparsity constraint on the solution plays a central role in many high dimensional machine learning applications. In some cases, the features can be grouped to…

cs.LG2013★ 36 cited

Sparse Overlapping Sets Lasso for Multitask Learning and its Application to fMRI Analysis

Nikhil Rao, Christopher Cox, Robert Nowak +1

Multitask learning can be effective when features useful in one task are also useful for other tasks, and the group lasso is a standard method for selecting a common subset of feat…