Search Results for author:
Found 35 papers, 14 papers with code
FederatedScope-GNN: Towards a Unified, Comprehensive and Efficient Package for Federated Graph Learning
The incredible development of federated learning (FL) has benefited various tasks in the domains of computer vision and natural language processing, and the existing frameworks such as TFF and FATE has made the deployment easy in real-world applications.
FederatedScope: A Flexible Federated Learning Platform for Heterogeneity
Although remarkable progress has been made by the existing federated learning (FL) platforms to provide fundamental functionalities for development, these platforms cannot well tackle the challenges brought by the heterogeneity of FL scenarios from both academia and industry.
Proactively Control Privacy in Recommender Systems
Then we study users' privacy decision making under different data disclosure mechanisms and recommendation models, and how their data disclosure decisions affect the recommender system's performance.
Learning to be a Statistician: Learned Estimator for Number of Distinct Values
We derive conditions of the learning framework under which the learned model is workload agnostic, in the sense that the model/estimator can be trained with synthetically generated training data, and then deployed into any data warehouse simply as, e. g., user-defined functions (UDFs), to offer efficient (within microseconds on CPU) and accurate NDV estimations for unseen tables and workloads.
Recommendation Unlearning
From the perspective of utility, if a system's utility is damaged by some bad data, the system needs to forget these data to regain utility.
Baihe: SysML Framework for AI-driven Databases
Based on the high level architecture, we then describe a concrete implementation of Baihe for PostgreSQL and present example use cases for learned query optimizers.
Towards Personalized Answer Generation in E-Commerce via Multi-Perspective Preference Modeling
Recently, Product Question Answering (PQA) on E-Commerce platforms has attracted increasing attention as it can act as an intelligent online shopping assistant and improve the customer shopping experience.
Glue: Adaptively Merging Single Table Cardinality to Estimate Join Query Size
Cardinality estimation (CardEst), a central component of the query optimizer, plays a significant role in generating high-quality query plans in DBMS.
Path-specific Causal Fair Prediction via Auxiliary Graph Structure Learning
To tackle these challenges, we propose a novel casual graph based fair prediction framework, which integrates graph structure learning into fair prediction to ensure that unfair pathways are excluded in the causal graph.
Learned Index with Dynamic $\epsilon$
We theoretically analyze prediction error bounds that link $\epsilon$ with data characteristics for an illustrative learned index method.
Coarformer: Transformer for large graph via graph coarsening
We get rid of these obstacles by exploiting the complementary natures of GNN and Transformer, and trade the fine-grained long-range information for the efficiency of Transformer.
iFlood: A Stable and Effective Regularizer
However, our further studies uncover that the design of the loss function of Flooding can lead to a discrepancy between its objective and implementation, and cause the instability issue.
Factual Consistency Evaluation for Text Summarization via Counterfactual Estimation
However, existing metrics either neglect the intrinsic cause of the factual inconsistency or rely on auxiliary tasks, leading to an unsatisfied correlation with human judgments or increasing the inconvenience of usage in practice.
VolcanoML: Speeding up End-to-End AutoML via Scalable Search Space Decomposition
End-to-end AutoML has attracted intensive interests from both academia and industry, which automatically searches for ML pipelines in a space induced by feature engineering, algorithm/model selection, and hyper-parameter tuning.
CausCF: Causal Collaborative Filtering for RecommendationEffect Estimation
It is based on the idea that similar users not only have a similar taste on items, but also have similar treatment effect under recommendations.
Unified Conversational Recommendation Policy Learning via Graph-based Reinforcement Learning
However, existing methods mainly target at solving one or two of these three decision-making problems in CRS with separated conversation and recommendation components, which restrict the scalability and generality of CRS and fall short of preserving a stable training procedure.
Competitive Information Design for Pandora's Box
We study a natural competitive-information-design variant for the Pandora's Box problem (Weitzman, 1979), where each box is associated with a strategic information sender who can design what information about the box's prize value to be revealed to the agent when she inspects the box.
Computer Science and Game Theory
FlashP: An Analytical Pipeline for Real-time Forecasting of Time-Series Relational Data
Our scalable real-time forecasting system FlashP (Flash Prediction) is built based on this idea, with two major challenges to be resolved in this paper: first, we need to figure out how approximate aggregations affect the fitting of forecasting models, and forecasting results; and second, accordingly, what sampling algorithms we should use to obtain these approximate aggregations and how large the samples are.
A Pluggable Learned Index Method via Sampling and Gap Insertion
In this paper, we propose a formal machine learning based framework to quantify the index learning objective, and study two general and pluggable techniques to enhance the learning efficiency and learning effectiveness for learned indexes.
PURE: An Uncertainty-aware Recommendation Framework for Maximizing Expected Posterior Utility of Platform
In this paper, we propose a novel recommendation framework which effectively utilizes the information of user uncertainty over different item dimensions and explicitly takes into consideration the impact of display policy on user in order to achieve maximal expected posterior utility for the platform.
Learning to Mutate with Hypergradient Guided Population
Computing the gradient of model hyperparameters, i. e., hypergradient, enables a promising and natural way to solve the hyperparameter optimization task.
Scalable Graph Neural Networks via Bidirectional Propagation
Most notably, GBP can deliver superior performance on a graph with over 60 million nodes and 1. 8 billion edges in less than half an hour on a single machine.
Contrastive Learning for Sequential Recommendation
Sequential recommendation methods play a crucial role in modern recommender systems because of their ability to capture a user's dynamic interest from her/his historical interactions.
FIVES: Feature Interaction Via Edge Search for Large-Scale Tabular Data
Then we instantiate this search strategy by optimizing both a dedicated graph neural network (GNN) and the adjacency tensor associated with the defined feature graph.
Simple and Deep Graph Convolutional Networks
We propose the GCNII, an extension of the vanilla GCN model with two simple yet effective techniques: {\em Initial residual} and {\em Identity mapping}.
Ranked #1 on
Node Classification
on Cora Full-supervised
Sequential Recommendation with Self-Attentive Multi-Adversarial Network
Recently, deep learning has made significant progress in the task of sequential recommendation.
Practical Data Poisoning Attack against Next-Item Recommendation
In real-world recommendation systems, the cost of retraining recommendation models is high, and the interaction frequency between users and a recommendation system is restricted. Given these real-world restrictions, we propose to let the agent interact with a recommender simulator instead of the target recommendation system and leverage the transferability of the generated adversarial samples to poison the target system.
AdaBERT: Task-Adaptive BERT Compression with Differentiable Neural Architecture Search
Motivated by the necessity and benefits of task-oriented BERT compression, we propose a novel compression method, AdaBERT, that leverages differentiable Neural Architecture Search to automatically compress BERT into task-adaptive small models for specific tasks.
Automated Relational Meta-learning
In order to efficiently learn with small amount of data on new tasks, meta-learning transfers knowledge learned from previous tasks to the new ones.
Improving Utility and Security of the Shuffler-based Differential Privacy
When collecting information, local differential privacy (LDP) alleviates privacy concerns of users because their private information is randomized before being sent it to the central aggregator.
Continuous Integration of Machine Learning Models with ease.ml/ci: Towards a Rigorous Yet Practical Treatment
Continuous integration is an indispensable step of modern software engineering practices to systematically manage the life cycles of system development.
ABC: Efficient Selection of Machine Learning Configuration on Large Dataset
A machine learning configuration refers to a combination of preprocessor, learner, and hyperparameters.
Towards Differentially Private Truth Discovery for Crowd Sensing Systems
To better utilize sensory data, the problem of truth discovery, whose goal is to estimate user quality and infer reliable aggregated results through quality-aware data aggregation, has emerged as a hot topic.
Collecting Telemetry Data Privately
In particular, existing LDP algorithms are not suitable for repeated collection of counter data such as daily app usage statistics.
Learn-Memorize-Recall-Reduce A Robotic Cloud Computing Paradigm
The rise of robotic applications has led to the generation of a huge volume of unstructured data, whereas the current cloud infrastructure was designed to process limited amounts of structured data.
