Search Results for author:
Found 60 papers, 29 papers with code
Matching-oriented Embedding Quantization For Ad-hoc Retrieval
In this work, we propose the Matching-oriented Product Quantization (MoPQ), where a novel objective Multinoulli Contrastive Loss (MCL) is formulated.
RecExplainer: Aligning Large Language Models for Recommendation Model Interpretability
Behavior alignment operates in the language space, representing user preferences and item information as text to learn the recommendation model's behavior; intention alignment works in the latent space of the recommendation model, using user and item representations to understand the model's behavior; hybrid alignment combines both language and latent spaces for alignment training.
Deep Group Interest Modeling of Full Lifelong User Behaviors for CTR Prediction
The insights from this subset reveal the user's decision-making process related to the candidate item, improving prediction accuracy.
Frequency-domain MLPs are More Effective Learners in Time Series Forecasting
FreTS mainly involves two stages, (i) Domain Conversion, that transforms time-domain signals into complex numbers of frequency domain; (ii) Frequency Learning, that performs our redesigned MLPs for the learning of real and imaginary part of frequency components.
APGL4SR: A Generic Framework with Adaptive and Personalized Global Collaborative Information in Sequential Recommendation
To this end, we propose a graph-driven framework, named Adaptive and Personalized Graph Learning for Sequential Recommendation (APGL4SR), that incorporates adaptive and personalized global collaborative information into sequential recommendation systems.
1DFormer: Learning 1D Landmark Representations via Transformer for Facial Landmark Tracking
For temporal modeling, we propose a recurrent token mixing mechanism, an axis-landmark-positional embedding mechanism, as well as a confidence-enhanced multi-head attention mechanism to adaptively and robustly embed long-term landmark dynamics into their 1D representations; for structure modeling, we design intra-group and inter-group structure modeling mechanisms to encode the component-level as well as global-level facial structure patterns as a refinement for the 1D representations of landmarks through token communications in the spatial dimension via 1D convolutional layers.
A Data-Centric Multi-Objective Learning Framework for Responsible Recommendation Systems
Recommendation systems effectively guide users in locating their desired information within extensive content repositories.
Towards Anytime Fine-tuning: Continually Pre-trained Language Models with Hypernetwork Prompt
In this work, we first investigate such anytime fine-tuning effectiveness of existing continual pre-training approaches, concluding with unanimously decreased performance on unseen domains.
Large-Scale OD Matrix Estimation with A Deep Learning Method
To alleviate this problem, some researchers incorporate a prior OD matrix as a target in the regression to provide more structural constraints.
Toward Robust Recommendation via Real-time Vicinal Defense
Recommender systems have been shown to be vulnerable to poisoning attacks, where malicious data is injected into the dataset to cause the recommender system to provide biased recommendations.
Label Deconvolution for Node Representation Learning on Large-scale Attributed Graphs against Learning Bias
The inverse mapping leads to an objective function that is equivalent to that by the joint training, while it can effectively incorporate GNNs in the training phase of NEs against the learning bias.
Ranked #1 on
Node Property Prediction
on ogbn-proteins
Interactive Graph Convolutional Filtering
Furthermore, we employ Bayesian meta-learning methods to effectively address the cold-start problem and derive theoretical regret bounds for our proposed method, ensuring a robust performance guarantee.
Recommender AI Agent: Integrating Large Language Models for Interactive Recommendations
We introduce an efficient framework called InteRecAgent, which employs LLMs as the brain and recommender models as tools.
KMF: Knowledge-Aware Multi-Faceted Representation Learning for Zero-Shot Node Classification
However, the multi-faceted semantic orientation in the feature-semantic alignment has been neglected by previous work, i. e. the content of a node usually covers diverse topics that are relevant to the semantics of multiple labels.
Deep Task-specific Bottom Representation Network for Multi-Task Recommendation
In this paper, we focus on the bottom representation learning of MTL in RS and propose the Deep Task-specific Bottom Representation Network (DTRN) to alleviate the negative transfer problem.
When Large Language Models Meet Personalization: Perspectives of Challenges and Opportunities
The advent of large language models marks a revolutionary breakthrough in artificial intelligence.
A DeepLearning Framework for Dynamic Estimation of Origin-Destination Sequence
To this end, this paper proposes an integrated method, which uses deep learning methods to infer the structure of OD sequence and uses structural constraints to guide traditional numerical optimization.
Learning to Substitute Spans towards Improving Compositional Generalization
Despite the rising prevalence of neural sequence models, recent empirical evidences suggest their deficiency in compositional generalization.
Traffic4cast at NeurIPS 2022 -- Predict Dynamics along Graph Edges from Sparse Node Data: Whole City Traffic and ETA from Stationary Vehicle Detectors
We only provide vehicle count data from spatially sparse stationary vehicle detectors in these three cities as model input for this task.
GUESR: A Global Unsupervised Data-Enhancement with Bucket-Cluster Sampling for Sequential Recommendation
Sequential Recommendation is a widely studied paradigm for learning users' dynamic interests from historical interactions for predicting the next potential item.
Improving Recommendation Fairness via Data Augmentation
We augment imbalanced training data towards balanced data distribution to improve fairness.
Resisting Graph Adversarial Attack via Cooperative Homophilous Augmentation
Recent studies show that Graph Neural Networks(GNNs) are vulnerable and easily fooled by small perturbations, which has raised considerable concerns for adapting GNNs in various safety-critical applications.
Transposed Variational Auto-encoder with Intrinsic Feature Learning for Traffic Forecasting
In this technical report, we present our solutions to the Traffic4cast 2022 core challenge and extended challenge.
Towards Robust Recommender Systems via Triple Cooperative Defense
Notably, TCD adds pseudo label data instead of deleting abnormal data, which avoids the cleaning of normal data, and the cooperative training of the three models is also beneficial to model generalization.
Cooperative Retriever and Ranker in Deep Recommenders
Deep recommender systems (DRS) are intensively applied in modern web services.
Boosting Factorization Machines via Saliency-Guided Mixup
Second, considering that MixFM may generate redundant or even detrimental instances, we further put forward a novel Factorization Machine powered by Saliency-guided Mixup (denoted as SMFM).
Cache-Augmented Inbatch Importance Resampling for Training Recommender Retriever
Recommender retrievers aim to rapidly retrieve a fraction of items from the entire item corpus when a user query requests, with the representative two-tower model trained with the log softmax loss.
Self-Supervised Text Erasing with Controllable Image Synthesis
The synthetic training images with erasure ground-truth are then fed to train a coarse-to-fine erasing network.
BSAL: A Framework of Bi-component Structure and Attribute Learning for Link Prediction
Regarding missing link inference of diverse networks, we revisit the link prediction techniques and identify the importance of both the structural and attribute information.
HRCF: Enhancing Collaborative Filtering via Hyperbolic Geometric Regularization
Hyperbolic space offers a spacious room to learn embeddings with its negative curvature and metric properties, which can well fit data with tree-like structures.
Distill-VQ: Learning Retrieval Oriented Vector Quantization By Distilling Knowledge from Dense Embeddings
We perform comprehensive explorations for the optimal conduct of knowledge distillation, which may provide useful insights for the learning of VQ based ANN index.
Investigating Data Variance in Evaluations of Automatic Machine Translation Metrics
Current practices in metric evaluation focus on one single dataset, e. g., Newstest dataset in each year's WMT Metrics Shared Task.
Visualizing the Relationship Between Encoded Linguistic Information and Task Performance
To this end, we study the dynamic relationship between the encoded linguistic information and task performance from the viewpoint of Pareto Optimality.
A Mutually Reinforced Framework for Pretrained Sentence Embeddings
Instead of relying on annotation heuristics defined by humans, it leverages the sentence representation model itself and realizes the following iterative self-supervision process: on one hand, the improvement of sentence representation may contribute to the quality of data annotation; on the other hand, more effective data annotation helps to generate high-quality positive samples, which will further improve the current sentence representation model.
Reinforcement Routing on Proximity Graph for Efficient Recommendation
Instead of searching the nearest neighbor for the query, we search the item with maximum inner product with query on the proximity graph.
Progressively Optimized Bi-Granular Document Representation for Scalable Embedding Based Retrieval
In this work, we tackle this problem with Bi-Granular Document Representation, where the lightweight sparse embeddings are indexed and standby in memory for coarse-grained candidate search, and the heavyweight dense embeddings are hosted in disk for fine-grained post verification.
Meta-learning with an Adaptive Task Scheduler
In ATS, for the first time, we design a neural scheduler to decide which meta-training tasks to use next by predicting the probability being sampled for each candidate task, and train the scheduler to optimize the generalization capacity of the meta-model to unseen tasks.
Learned Index with Dynamic $\epsilon$
We theoretically analyze prediction error bounds that link $\epsilon$ with data characteristics for an illustrative learned index method.
Fast Variational AutoEncoder with Inverted Multi-Index for Collaborative Filtering
Variational AutoEncoder (VAE) has been extended as a representative nonlinear method for collaborative filtering.
Rethinking Lifelong Sequential Recommendation with Incremental Multi-Interest Attention
With the rapid development of these services in the last two decades, users have accumulated a massive amount of behavior data.
Linear-Time Self Attention with Codeword Histogram for Efficient Recommendation
Inspired by the idea of vector quantization that uses cluster centroids to approximate items, we propose LISA (LInear-time Self Attention), which enjoys both the effectiveness of vanilla self-attention and the efficiency of sparse attention.
Assessing Dialogue Systems with Distribution Distances
An important aspect of developing dialogue systems is how to evaluate and compare the performance of different systems.
GraphFormers: GNN-nested Transformers for Representation Learning on Textual Graph
The representation learning on textual graph is to generate low-dimensional embeddings for the nodes based on the individual textual features and the neighbourhood information.
A Unified Transferable Model for ML-Enhanced DBMS
We propose to explore the transferabilities of the ML methods both across tasks and across DBs to tackle these fundamental drawbacks.
Hybrid Encoder: Towards Efficient and Precise Native AdsRecommendation via Hybrid Transformer Encoding Networks
For the sake of efficient recommendation, conventional methods would generate user and advertisement embeddings independently with a siamese transformer encoder, such that approximate nearest neighbour search (ANN) can be leveraged.
Matching-oriented Product Quantization For Ad-hoc Retrieval
In this work, we propose the Matching-oriented Product Quantization (MoPQ), where a novel objective Multinoulli Contrastive Loss (MCL) is formulated.
Efficient Optimal Selection for Composited Advertising Creatives with Tree Structure
Based on the tree structure, Thompson sampling is adapted with dynamic programming, leading to efficient exploration for potential ad creatives with the largest CTR.
Automated Creative Optimization for E-Commerce Advertising
However, interactions between creative elements may be more complex than the inner product, and the FM-estimated CTR may be of high variance due to limited feedback.
A Hybrid Bandit Model with Visual Priors for Creative Ranking in Display Advertising
Creative plays a great important role in e-commerce for exhibiting products.
Deep Pairwise Hashing for Cold-start Recommendation
Specifically, we first pre-train robust item representation from item content data by a Denoising Auto-encoder instead of other deterministic deep learning frameworks; then we finetune the entire framework by adding a pairwise loss objective with discrete constraints; moreover, DPH aims to minimize a pairwise ranking loss that is consistent with the ultimate goal of recommendation.
Sampling-Decomposable Generative Adversarial Recommender
The GAN-style recommenders (i. e., IRGAN) addresses the challenge by learning a generator and a discriminator adversarially, such that the generator produces increasingly difficult samples for the discriminator to accelerate optimizing the discrimination objective.
Learning to Transfer Graph Embeddings for Inductive Graph based Recommendation
The transfer network is designed to approximate the learned item embeddings from graph neural networks by taking each item's visual content as input, in order to tackle the new segment problem in the test phase.
GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions
We observe that existing works on structured entity interaction prediction cannot properly exploit the unique graph of graphs model.
Lightrec: A memory and search-efficient recommender system
On top of such a structure, LightRec will have an item represented as additive composition of B codewords, which are optimally selected from each of the codebooks.
Binarized Graph Neural Network
Our proposed method can be seamlessly integrated into the existing GNN-based embedding approaches to binarize the model parameters and learn the compact embedding.
A Novel User Representation Paradigm for Making Personalized Candidate Retrieval
Our work is undergoing a anonymous review, and it will soon be released after the notification.
Binarized Collaborative Filtering with Distilling Graph Convolutional Networks
Then we distill the ranking information derived from GCN into binarized collaborative filtering, which makes use of binary representation to improve the efficiency of online recommendation.
MCNE: An End-to-End Framework for Learning Multiple Conditional Network Representations of Social Network
Recently, the Network Representation Learning (NRL) techniques, which represent graph structure via low-dimension vectors to support social-oriented application, have attracted wide attention.
A Survey on Session-based Recommender Systems
In recent years, session-based recommender systems (SBRSs) have emerged as a new paradigm of RSs.
Binarized Attributed Network Embedding
To this end, we present a Binarized Attributed Network Embedding model (BANE for short) to learn binary node representation.
Ranked #1 on
Link Prediction
on Wiki
