Search Results for author:
Found 61 papers, 17 papers with code
A Unified Replay-based Continuous Learning Framework for Spatio-Temporal Prediction on Streaming Data
The widespread deployment of wireless and mobile devices results in a proliferation of spatio-temporal data that is used in applications, e. g., traffic prediction, human mobility mining, and air quality prediction, where spatio-temporal prediction is often essential to enable safety, predictability, or reliability.
Channel Estimation for AFDM With Superimposed Pilots
To improve the SE, we propose a novel AFDM channel estimation scheme by introducing the superimposed pilots in the DAFT domain.
UniSAR: Modeling User Transition Behaviors between Search and Recommendation
In this paper, we propose a framework named UniSAR that effectively models the different types of fine-grained behavior transitions for providing users a Unified Search And Recommendation service.
Poisoning Decentralized Collaborative Recommender System and Its Countermeasures
Knowledge sharing also opens a backdoor for model poisoning attacks, where adversaries disguise themselves as benign clients and disseminate polluted knowledge to achieve malicious goals like promoting an item's exposure rate.
Large Language Models Enhanced Collaborative Filtering
In this paper, drawing inspiration from the in-context learning and chain of thought reasoning in LLMs, we propose the Large Language Models enhanced Collaborative Filtering (LLM-CF) framework, which distils the world knowledge and reasoning capabilities of LLMs into collaborative filtering.
Deep Learning for Trajectory Data Management and Mining: A Survey and Beyond
In this paper, we present a comprehensive review of the development and recent advances in deep learning for trajectory computing (DL4Traj).
Adaptive Hypergraph Network for Trust Prediction
In this paper, we propose an Adaptive Hypergraph Network for Trust Prediction (AHNTP), a novel approach that improves trust prediction accuracy by using higher-order correlations.
Physical Trajectory Inference Attack and Defense in Decentralized POI Recommendation
Empirical results demonstrate that PTIA poses a significant threat to users' historical trajectories.
Parameterized Decision-making with Multi-modal Perception for Autonomous Driving
Autonomous driving is an emerging technology that has advanced rapidly over the last decade.
Batch-Mix Negative Sampling for Learning Recommendation Retrievers
Recommendation retrievers commonly retrieve user potentially preferred items from numerous items, where the query and item representation are learned according to the dual encoders with the log-softmax loss.
Generative Retrieval with Semantic Tree-Structured Item Identifiers via Contrastive Learning
To obtain efficiency and effectiveness, this paper introduces a generative retrieval framework, namely SEATER, which learns SEmAntic Tree-structured item identifiERs via contrastive learning.
To Predict or to Reject: Causal Effect Estimation with Uncertainty on Networked Data
Due to the imbalanced nature of networked observational data, the causal effect predictions for some individuals can severely violate the positivity/overlap assumption, rendering unreliable estimations.
Graph Contrastive Learning with Generative Adversarial Network
Specifically, we present GACN, a novel Generative Adversarial Contrastive learning Network for graph representation learning.
Graph Condensation for Inductive Node Representation Learning
To overcome this issue, we propose mapping-aware graph condensation (MCond), explicitly learning the one-to-many node mapping from original nodes to synthetic nodes to seamlessly integrate new nodes into the synthetic graph for inductive representation learning.
Personalized Elastic Embedding Learning for On-Device Recommendation
Given a memory budget, PEEL efficiently generates PEEs by selecting embedding blocks with the largest weights, making it adaptable to dynamic memory budgets on devices.
PANE-GNN: Unifying Positive and Negative Edges in Graph Neural Networks for Recommendation
Recommender systems play a crucial role in addressing the issue of information overload by delivering personalized recommendations to users.
Instant Representation Learning for Recommendation over Large Dynamic Graphs
Furthermore, the Neighborhood Disturbance existing in dynamic graphs deteriorates the performance of neighbor-aggregation based graph models.
Multi-behavior Self-supervised Learning for Recommendation
Secondly, existing methods utilizing self-supervised learning (SSL) to tackle the data sparsity neglect the serious optimization imbalance between the SSL task and the target task.
Self-Supervised Multi-Modal Sequential Recommendation
To address this issue, we propose a dual-tower retrieval architecture for sequence recommendation.
WizardLM: Empowering Large Language Models to Follow Complex Instructions
In this paper, we show an avenue for creating large amounts of instruction data with varying levels of complexity using LLM instead of humans.
Model-Agnostic Decentralized Collaborative Learning for On-Device POI Recommendation
In light of this, We propose a novel on-device POI recommendation framework, namely Model-Agnostic Collaborative learning for on-device POI recommendation (MAC), allowing users to customize their own model structures (e. g., dimension \& number of hidden layers).
Continuous Input Embedding Size Search For Recommender Systems
Latent factor models are the most popular backbones for today's recommender systems owing to their prominent performance.
A Pattern Discovery Approach to Multivariate Time Series Forecasting
To capture the temporal and multivariate correlations among subsequences, we design a pattern discovery model, that constructs correlations via diverse pattern functions.
Trajectory Flow Map: Graph-based Approach to Analysing Temporal Evolution of Aggregated Traffic Flows in Large-scale Urban Networks
First, we partition the entire network into a set of cells based on the spatial distribution of data points in individual trajectories, where the cells represent spatial regions between which aggregated traffic flows can be measured.
A Comparative Study on Unsupervised Anomaly Detection for Time Series: Experiments and Analysis
The continued digitization of societal processes translates into a proliferation of time series data that cover applications such as fraud detection, intrusion detection, and energy management, where anomaly detection is often essential to enable reliability and safety.
Uncertainty Quantification for Traffic Forecasting: A Unified Approach
To achieve this, we develop Deep Spatio-Temporal Uncertainty Quantification (DeepSTUQ), which can estimate both aleatoric and epistemic uncertainty.
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.
Robust and Explainable Autoencoders for Unsupervised Time Series Outlier Detection---Extended Version
This is an extended version of "Robust and Explainable Autoencoders for Unsupervised Time Series Outlier Detection", to appear in IEEE ICDE 2022.
DeHIN: A Decentralized Framework for Embedding Large-scale Heterogeneous Information Networks
Such heterogeneous network embedding (HNE) methods effectively harness the heterogeneity of small-scale HINs.
Boosting Contrastive Learning with Relation Knowledge Distillation
We delve into this problem and find that the lightweight model is prone to collapse in semantic space when simply performing instance-wise contrast.
Unsupervised Time Series Outlier Detection with Diversity-Driven Convolutional Ensembles -- Extended Version
To improve accuracy, the ensemble employs multiple basic outlier detection models built on convolutional sequence-to-sequence autoencoders that can capture temporal dependencies in time series.
Multimodal Dialogue Response Generation
In such a low-resource setting, we devise a novel conversational agent, Divter, in order to isolate parameters that depend on multimodal dialogues from the entire generation model.
Fast Variational AutoEncoder with Inverted Multi-Index for Collaborative Filtering
Variational AutoEncoder (VAE) has been extended as a representative nonlinear method for collaborative filtering.
Contrast R-CNN for Continual Learning in Object Detection
In our paper, we propose a new scheme for continual learning of object detection, namely Contrast R-CNN, an approach strikes a balance between retaining the old knowledge and learning the new knowledge.
HIFI: Anomaly Detection for Multivariate Time Series with High-order Feature Interactions
Monitoring complex systems results in massive multivariate time series data, and anomaly detection of these data is very important to maintain the normal operation of the systems.
Learning to Ask Appropriate Questions in Conversational Recommendation
Hence, the ability to generate suitable clarifying questions is the key to timely tracing users' dynamic preferences and achieving successful recommendations.
Historical Inertia: A Neglected but Powerful Baseline for Long Sequence Time-series Forecasting
Long sequence time-series forecasting (LSTF) has become increasingly popular for its wide range of applications.
Hierarchical Hyperedge Embedding-based Representation Learning for Group Recommendation
However, the representation learning for a group is most complex beyond the fusion of group member representation, as the personal preferences and group preferences may be in different spaces.
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.
MP-ResNet: Multi-path Residual Network for the Semantic segmentation of High-Resolution PolSAR Images
This CNN architecture can be used as a baseline method for future studies on the semantic segmentation of PolSAR images.
Automated data extraction of bar chart raster images
Objective: To develop software utilizing optical character recognition toward the automatic extraction of data from bar charts for meta-analysis.
Optical Character Recognition
Optical Character Recognition (OCR)
+1
Overcoming Data Sparsity in Group Recommendation
Specifically, we first extend BGEM to model group-item interactions, and then in order to overcome the limitation and sparsity of the interaction data generated by occasional groups, we propose a self-attentive mechanism to represent groups based on the group members.
SOUP: Spatial-Temporal Demand Forecasting and Competitive Supply
In this setting, an assignment authority is to assign agents to requests such that the average idle time of the agents is minimized.
Databases Signal Processing
Stack-Sorting with Consecutive-Pattern-Avoiding Stacks
We introduce consecutive-pattern-avoiding stack-sorting maps $\text{SC}_\sigma$, which are natural generalizations of West's stack-sorting map $s$ and natural analogues of the classical-pattern-avoiding stack-sorting maps $s_\sigma$ recently introduced by Cerbai, Claesson, and Ferrari.
Combinatorics 05A05, 05A15, 37E15
Reconstruction Regularized Deep Metric Learning for Multi-label Image Classification
In this paper, we present a novel deep metric learning method to tackle the multi-label image classification problem.
Locally Differentially Private (Contextual) Bandits Learning
We study locally differentially private (LDP) bandits learning in this paper.
(Locally) Differentially Private Combinatorial Semi-Bandits
In this paper, we study Combinatorial Semi-Bandits (CSB) that is an extension of classic Multi-Armed Bandits (MAB) under Differential Privacy (DP) and stronger Local Differential Privacy (LDP) setting.
On Layer Normalization in the Transformer Architecture
This motivates us to remove the warm-up stage for the training of Pre-LN Transformers.
Bilinear Graph Neural Network with Neighbor Interactions
We term this framework as Bilinear Graph Neural Network (BGNN), which improves GNN representation ability with bilinear interactions between neighbor nodes.
Combinatorial Semi-Bandit in the Non-Stationary Environment
In a special case where the reward function is linear and we have an exact oracle, we design a parameter-free algorithm that achieves nearly optimal regret both in the switching case and in the dynamic case without knowing the parameters in advance.
The Strength of the Weakest Supervision: Topic Classification Using Class Labels
When developing topic classifiers for real-world applications, we begin by defining a set of meaningful topic labels.
Equipping Experts/Bandits with Long-term Memory
We propose the first reduction-based approach to obtaining long-term memory guarantees for online learning in the sense of Bousquet and Warmuth, 2002, by reducing the problem to achieving typical switching regret.
Learning Transferable Self-attentive Representations for Action Recognition in Untrimmed Videos with Weak Supervision
Action recognition in videos has attracted a lot of attention in the past decade.
Efficient Online Portfolio with Logarithmic Regret
We study the decades-old problem of online portfolio management and propose the first algorithm with logarithmic regret that is not based on Cover's Universal Portfolio algorithm and admits much faster implementation.
RUM: network Representation learning throUgh Multi-level structural information preservation
We propose a novel network representations learning model framework called RUM (network Representation learning throUgh Multi-level structural information preservation).
End-to-end Learning for Short Text Expansion
A novel deep memory network is proposed to automatically find relevant information from a collection of longer documents and reformulate the short text through a gating mechanism.
Generalization Bounds of SGLD for Non-convex Learning: Two Theoretical Viewpoints
This is the first algorithm-dependent result with reasonable dependence on aggregated step sizes for non-convex learning, and has important implications to statistical learning aspects of stochastic gradient methods in complicated models such as deep learning.
Collect at Once, Use Effectively: Making Non-interactive Locally Private Learning Possible
For learning with smooth generalized linear losses, we propose an approximate stochastic gradient oracle estimated from non-interactive LDP channel, using Chebyshev expansion.
Efficient Private ERM for Smooth Objectives
For strongly convex and smooth objectives, we prove that gradient descent with output perturbation not only achieves nearly optimal utility, but also significantly improves the running time of previous state-of-the-art private optimization algorithms, for both $\epsilon$-DP and $(\epsilon, \delta)$-DP.
