research
∙
09/18/2023
LogShrink: Effective Log Compression by Leveraging Commonality and Variability of Log Data
Log data is a crucial resource for recording system events and states du...
share
research
∙
08/16/2023
Stochastic Controlled Averaging for Federated Learning with Communication Compression
Communication compression, a technique aiming to reduce the information ...
research
∙
08/10/2023
CSPM: A Contrastive Spatiotemporal Preference Model for CTR Prediction in On-Demand Food Delivery Services
Click-through rate (CTR) prediction is a crucial task in the context of ...
research
∙
06/13/2023
Differentially Private One Permutation Hashing and Bin-wise Consistent Weighted Sampling
Minwise hashing (MinHash) is a standard algorithm widely used in the ind...
research
∙
05/22/2023
Differential Privacy with Random Projections and Sign Random Projections
In this paper, we develop a series of differential privacy (DP) algorith...
research
∙
04/26/2023
Building K-Anonymous User Cohorts with Consecutive Consistent Weighted Sampling (CCWS)
To retrieve personalized campaigns and creatives while protecting user p...
research
∙
02/07/2023
OPORP: One Permutation + One Random Projection
Consider two D-dimensional data vectors (e.g., embeddings): u, v. In man...
research
∙
11/25/2022
Analysis of Error Feedback in Federated Non-Convex Optimization with Biased Compression
In federated learning (FL) systems, e.g., wireless networks, the communi...
research
∙
06/26/2022
k-Median Clustering via Metric Embedding: Towards Better Initialization with Differential Privacy
When designing clustering algorithms, the choice of initial centers is c...
research
∙
05/03/2022
Asymptotic Independence of the Sum and Maximum of Dependent Random Variables with Applications to High-Dimensional Tests
For a set of dependent random variables, without stationary or the stron...
research
∙
04/29/2022
Breaking the Linear Error Barrier in Differentially Private Graph Distance Release
Releasing all pairwise shortest path (APSP) distances between vertices o...
research
∙
01/05/2022
Communication-Efficient TeraByte-Scale Model Training Framework for Online Advertising
Click-Through Rate (CTR) prediction is a crucial component in the online...
research
∙
11/18/2021
C-OPH: Improving the Accuracy of One Permutation Hashing (OPH) with Circulant Permutations
Minwise hashing (MinHash) is a classical method for efficiently estimati...
research
∙
09/10/2021
Toward Communication Efficient Adaptive Gradient Method
In recent years, distributed optimization is proven to be an effective a...
research
∙
09/10/2021
C-MinHash: Practically Reducing Two Permutations to Just One
Traditional minwise hashing (MinHash) requires applying K independent pe...
research
∙
09/07/2021
C-MinHash: Rigorously Reducing K Permutations to Two
Minwise hashing (MinHash) is an important and practical algorithm for ge...
research
∙
02/25/2021
Quantization Algorithms for Random Fourier Features
The method of random projection (RP) is the standard technique in machin...
research
∙
12/08/2020
When Services Computing Meets Blockchain: Challenges and Opportunities
Services computing can offer a high-level abstraction to support diverse...
research
∙
04/02/2020
IVFS: Simple and Efficient Feature Selection for High Dimensional Topology Preservation
Feature selection is an important tool to deal with high dimensional dat...
research
∙
04/02/2020
Randomized Kernel Multi-view Discriminant Analysis
In many artificial intelligence and computer vision systems, the same ob...
research
∙
03/04/2019
