research
∙
05/19/2023
Beyond Exponential Graph: Communication-Efficient Topologies for Decentralized Learning via Finite-time Convergence
Decentralized learning has recently been attracting increasing attention...
share
research
∙
01/26/2023
Graph Neural Networks can Recover the Hidden Features Solely from the Graph Structure
Graph Neural Networks (GNNs) are popular models for graph learning probl...
research
∙
10/15/2022
Active Learning from the Web
Labeling data is one of the most costly processes in machine learning pi...
research
∙
09/30/2022
Momentum Tracking: Momentum Acceleration for Decentralized Deep Learning on Heterogeneous Data
SGD with momentum acceleration is one of the key components for improvin...
research
∙
08/21/2022
Towards Principled User-side Recommender Systems
Traditionally, recommendation algorithms have been designed for service ...
research
∙
08/21/2022
Twin Papers: A Simple Framework of Causal Inference for Citations via Coupling
The research process includes many decisions, e.g., how to entitle and w...
research
∙
06/24/2022
Approximating 1-Wasserstein Distance with Trees
Wasserstein distance, which measures the discrepancy between distributio...
research
∙
06/17/2022
CLEAR: A Fully User-side Image Search System
We use many search engines on the Internet in our daily lives. However, ...
research
∙
05/04/2022
Word Tour: One-dimensional Word Embeddings via the Traveling Salesman Problem
Word embeddings are one of the most fundamental technologies used in nat...
research
∙
12/30/2021
Retrieving Black-box Optimal Images from External Databases
Suppose we have a black-box function (e.g., deep neural network) that ta...
research
∙
09/08/2021
Fixed Support Tree-Sliced Wasserstein Barycenter
The Wasserstein barycenter has been widely studied in various fields, in...
research
∙
05/30/2021
Enumerating Fair Packages for Group Recommendations
In package recommendations, a set of items is regarded as a unified pack...
research
∙
05/30/2021
Re-evaluating Word Mover's Distance
The word mover's distance (WMD) is a fundamental technique for measuring...
research
∙
05/26/2021
Private Recommender Systems: How Can Users Build Their Own Fair Recommender Systems without Log Data?
Fairness is an important property in data-mining applications, including...
research
∙
01/27/2021
Supervised Tree-Wasserstein Distance
To measure the similarity of documents, the Wasserstein distance is a po...
research
∙
10/19/2020
Poincare: Recommending Publication Venues via Treatment Effect Estimation
Choosing a publication venue for an academic paper is a crucial step in ...
research
∙
06/04/2020
Fast Unbalanced Optimal Transport on Tree
This study examines the time complexities of the unbalanced optimal tran...
research
∙
03/09/2020
A Survey on The Expressive Power of Graph Neural Networks
Graph neural networks (GNNs) are effective machine learning models for v...
research
∙
02/08/2020
Random Features Strengthen Graph Neural Networks
Graph neural networks (GNNs) are powerful machine learning models for va...
research
∙
02/05/2020
Fast and Robust Comparison of Probability Measures in Heterogeneous Spaces
The problem of comparing distributions endowed with their own geometry a...
research
∙
05/24/2019
Approximation Ratios of Graph Neural Networks for Combinatorial Problems
In this paper, from a theoretical perspective, we study how powerful gra...
research
∙
02/26/2019
Learning to Find Hard Instances of Graph Problems
Finding hard instances, which need a long time to solve, of graph proble...
research
∙
01/23/2019