Search Results for author:
Found 15 papers, 6 papers with code
Scene-wise Adaptive Network for Dynamic Cold-start Scenes Optimization in CTR Prediction
In the realm of modern mobile E-commerce, providing users with nearby commercial service recommendations through location-based online services has become increasingly vital.
An Advanced Reinforcement Learning Framework for Online Scheduling of Deferrable Workloads in Cloud Computing
Efficient resource utilization and perfect user experience usually conflict with each other in cloud computing platforms.
Better Understandings and Configurations in MaxSAT Local Search Solvers via Anytime Performance Analysis
Though numerous solvers have been proposed for the MaxSAT problem, and the benchmark environment such as MaxSAT Evaluations provides a platform for the comparison of the state-of-the-art solvers, existing assessments were usually evaluated based on the quality, e. g., fitness, of the best-found solutions obtained within a given running time budget.
Entire Chain Uplift Modeling with Context-Enhanced Learning for Intelligent Marketing
ECUP consists of two primary components: 1) the Entire Chain-Enhanced Network, which utilizes user behavior patterns to estimate ITE throughout the entire chain space, models the various impacts of treatments on each task, and integrates task prior information to enhance context awareness across all stages, capturing the impact of treatment on different tasks, and 2) the Treatment-Enhanced Network, which facilitates fine-grained treatment modeling through bit-level feature interactions, thereby enabling adaptive feature adjustment.
Contrastive Learning with Negative Sampling Correction
To correct the negative sampling bias, we propose a novel contrastive learning method named Positive-Unlabeled Contrastive Learning (PUCL).
HiNet: Novel Multi-Scenario & Multi-Task Learning with Hierarchical Information Extraction
Multi-scenario & multi-task learning has been widely applied to many recommendation systems in industrial applications, wherein an effective and practical approach is to carry out multi-scenario transfer learning on the basis of the Mixture-of-Expert (MoE) architecture.
Feature Decomposition for Reducing Negative Transfer: A Novel Multi-task Learning Method for Recommender System
In recent years, thanks to the rapid development of deep learning (DL), DL-based multi-task learning (MTL) has made significant progress, and it has been successfully applied to recommendation systems (RS).
Distributed Evolution Strategies for Black-box Stochastic Optimization
This work concerns the evolutionary approaches to distributed stochastic black-box optimization, in which each worker can individually solve an approximation of the problem with nature-inspired algorithms.
A Surrogate Objective Framework for Prediction+Programming with Soft Constraints
Prediction+optimization is a common real-world paradigm where we have to predict problem parameters before solving the optimization problem.
A Surrogate Objective Framework for Prediction+Optimization with Soft Constraints
Prediction+optimization is a common real-world paradigm where we have to predict problem parameters before solving the optimization problem.
Automatic Loss Function Search for Predict-Then-Optimize Problems with Strong Ranking Property
Combinatorial optimization problems with parameters to be predicted from side information are commonly seen in a variety of problems during the paradigm shift from reactive decision making to proactive decision making.
Hashing-Accelerated Graph Neural Networks for Link Prediction
Networks are ubiquitous in the real world.
COVID-19 Chest CT Image Segmentation -- A Deep Convolutional Neural Network Solution
Inspired by the observation that the boundary of the infected lung can be enhanced by adjusting the global intensity, in the proposed deep CNN, we introduce a feature variation block which adaptively adjusts the global properties of the features for segmenting COVID-19 infection.
Improving the Performance of Stochastic Local Search for Maximum Vertex Weight Clique Problem Using Programming by Optimization
The maximum vertex weight clique problem (MVWCP) is an important generalization of the maximum clique problem (MCP) that has a wide range of real-world applications.
NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover
These two strategies are used in designing a new MVC local search algorithm, which is referred to as NuMVC.
