Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleNovember 2024
- research-articleOctober 2024
Asynchronous SGD with stale gradient dynamic adjustment for deep learning training
Information Sciences: an International Journal (ISCI), Volume 681, Issue Chttps://doi.org/10.1016/j.ins.2024.121220AbstractAsynchronous stochastic gradient descent (ASGD) is a computationally efficient algorithm, which speeds up deep learning training and plays an important role in distributed deep learning. However, ASGD suffers from the stale gradient problem, i.e.,...
- research-articleSeptember 2024JUST ACCEPTED
Online Incentive Protocol Design for Reposting Service in Online Social Networks
Reposting plays an essential role in boosting visibility on online social networks (OSNs). In this paper, we study the problem of designing “reposting service” in an OSN to incentivize “transactions” between requesters (users who seek to enhance ...
- research-articleAugust 2024
Adaptive moving average Q-learning
Knowledge and Information Systems (KAIS), Volume 66, Issue 12Pages 7389–7417https://doi.org/10.1007/s10115-024-02190-8AbstractA variety of algorithms have been proposed to address the long-standing overestimation bias problem of Q-learning. Reducing this overestimation bias may lead to an underestimation bias, such as double Q-learning. However, it is still unclear how ...
-
- ArticleMay 2024
False Negative Sample Aware Negative Sampling for Recommendation
Advances in Knowledge Discovery and Data MiningPages 195–206https://doi.org/10.1007/978-981-97-2262-4_16AbstractNegative sampling plays a key role in implicit feedback collaborative filtering. It draws high-quality negative samples from a large number of uninteracted samples. Existing methods primarily focus on hard negative samples, while overlooking the ...
- research-articleMarch 2024
Robust and efficient algorithms for conversational contextual bandit
Information Sciences: an International Journal (ISCI), Volume 657, Issue Chttps://doi.org/10.1016/j.ins.2023.119993AbstractConversational contextual bandit is one of the notable variants of contextual bandit and it is shown to have superior performance in recommendation applications. The core idea of conversational contextual bandits utilizing is conversational ...
- research-articleMarch 2024
Q-learning with heterogeneous update strategy
Information Sciences: an International Journal (ISCI), Volume 656, Issue Chttps://doi.org/10.1016/j.ins.2023.119902AbstractA variety of algorithms has been proposed to mitigate the overestimation bias of Q-learning. These algorithms reduce the estimation of maximum Q-value, i.e., homogeneous update. As a result, some of these algorithms such as Double Q-learning ...
- research-articleMay 2024
Uncertainty-aware instance reweighting for off-policy learning
NIPS '23: Proceedings of the 37th International Conference on Neural Information Processing SystemsArticle No.: 3224, Pages 73691–73718Off-policy learning, referring to the procedure of policy optimization with access only to logged feedback data, has shown importance in various real-world applications, such as search engines and recommender systems. While the ground-truth logging ...
- research-articleNovember 2023
Relieving Popularity Bias in Interactive Recommendation: A Diversity-Novelty-Aware Reinforcement Learning Approach
ACM Transactions on Information Systems (TOIS), Volume 42, Issue 2Article No.: 52, Pages 1–30https://doi.org/10.1145/3618107While personalization increases the utility of item recommendation, it also suffers from the issue of popularity bias. However, previous methods emphasize adopting supervised learning models to relieve popularity bias in the static recommendation, ...
- ArticleDecember 2023
A Voxel-Based Multiview Point Cloud Refinement Method via Factor Graph Optimization
Abstractlidar enables fast reconstruction of the real world using high-precision point cloud maps. It usually requires the pose information (also called trajectory) of point clouds obtained by lidar at different times so that all scans are unified in the ...
- research-articleNovember 2023
Contrastive Learning based Item Representation with Asymmetric Augmentation for Sequential Recommendation
ADMIT '23: Proceedings of the 2023 2nd International Conference on Algorithms, Data Mining, and Information TechnologyPages 68–73https://doi.org/10.1145/3625403.3625418Contrastive learning has been widely applied in sequential recommendation to improve the recommendation performance. Existing contrastive learning methods focus on adjusting the views number of positive and negative samples to enhance the item ...
- research-articleSeptember 2023
Optimizing recommendations under abandonment risks: Models and algorithms
AbstractUser abandonment behaviors are quite common in recommendation applications such as online shopping recommendation and news recommendation. To maximize its total “reward” under the risk of user abandonment, the online platform needs to carefully ...
Highlights- Model the user abandonment behavior in recommendation systems via Markov decision processes.
- Transfer other similar users’ information to optimize future decisions.
- An algorithmic framework with two components and theoretical ...
- ArticleSeptember 2023
Estimating Dynamic Posttraumatic Stress Symptom Trajectories with Functional Data Analysis
AbstractPosttraumatic stress disorder (PTSD) is a mental health condition that may develop following exposure to trauma, with diverse and complex longitudinal trajectories of symptoms during the days to months after a traumatic event. To supplement ...
- research-articleJuly 2023
Probabilistic Modeling of Assimilate-Contrast Effects in Online Rating Systems
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 36, Issue 2Pages 795–808https://doi.org/10.1109/TKDE.2023.3292352Online rating system serves as an indispensable building block for many web applications. Previous studies showed that due to assimilate-contrast effects, historical ratings could significantly distort users’ ratings, leading to low accuracy of ...
- research-articleJuly 2023
A New Outlier Removal Strategy Based on Reliability of Correspondence Graph for Fast Point Cloud Registration
IEEE Transactions on Pattern Analysis and Machine Intelligence (ITPM), Volume 45, Issue 7Pages 7986–8002https://doi.org/10.1109/TPAMI.2022.3226498Registration is a basic yet crucial task in point cloud processing. In correspondence-based point cloud registration, matching correspondences by point feature techniques may lead to an extremely high outlier (false correspondence) ratio. Current outlier ...
- research-articleJuly 2023
Efficient algorithms for multi-armed bandits with additional feedbacks: Modeling and algorithms
Information Sciences: an International Journal (ISCI), Volume 633, Issue CPages 453–468https://doi.org/10.1016/j.ins.2023.03.060AbstractMulti-armed bandits (MAB) are widely applied to optimize networking applications such as crowdsensing and mobile edge computing. Additional feedbacks (or partial feedbacks) on some arms are usually possible to be collected in many networking ...
- ArticleMay 2023
A Thompson Sampling Approach to Unifying Causal Inference and Bandit Learning
Advances in Knowledge Discovery and Data MiningPages 255–266https://doi.org/10.1007/978-3-031-33377-4_20AbstractOffline logged data is quite common in many web applications such as recommendation, Internet advertising, etc., which offers great potentials to improve online decision making. It is a non-trivial task to utilize offline logged data for online ...
- ArticleMay 2023
A Multi-player MAB Approach for Distributed Selection Problems
Advances in Knowledge Discovery and Data MiningPages 243–254https://doi.org/10.1007/978-3-031-33377-4_19AbstractMotivated by distributed selection problems, we formulate a new variant of multi-player multi-armed bandit (MAB) model, which captures stochastic arrival of requests to each arm and the policy of allocating requests to players. The challenge is ...