Search Results for author:
Found 14 papers, 3 papers with code
PBCounter: Weighted Model Counting on Pseudo-Boolean Formulas
The experiments on three domains of benchmarks show that PBCounter is superior to the model counters on CNF formulas.
Spatial-Temporal Interplay in Human Mobility: A Hierarchical Reinforcement Learning Approach with Hypergraph Representation
In the realm of human mobility, the decision-making process for selecting the next-visit location is intricately influenced by a trade-off between spatial and temporal constraints, which are reflective of individual needs and preferences.
A Counterfactual Collaborative Session-based Recommender System
Next, COCO-SBRS adopts counterfactual inference to recommend items based on the outputs of the pre-trained recommendation model considering the causalities to alleviate the data sparsity problem.
Multi-View MOOC Quality Evaluation via Information-Aware Graph Representation Learning
To tackle the challenges, we formulate the problem as a course representation learning task-based and develop an Information-aware Graph Representation Learning(IaGRL) for multi-view MOOC quality evaluation.
Streaming Traffic Flow Prediction Based on Continuous Reinforcement Learning
We propose to formulate the problem as a continuous reinforcement learning task, where the agent is the next flow value predictor, the action is the next time-series flow value in the sensor, and the environment state is a dynamically fused representation of the sensor and transportation network.
Finding and Exploring Promising Search Space for the 0-1 Multidimensional Knapsack Problem
It maintains a set of solutions and utilizes the information from the population to extract good partial assignments.
A Survey of Knowledge Tracing: Models, Variants, and Applications
We hope that the current survey will assist both researchers and practitioners in fostering the development of KT, thereby benefiting a broader range of students.
Simplifying Reinforced Feature Selection via Restructured Choice Strategy of Single Agent
To address the question, we develop a single-agent reinforced feature selection approach integrated with restructured choice strategy.
Disentangled Non-Local Neural Networks
This paper first studies the non-local block in depth, where we find that its attention computation can be split into two terms, a whitened pairwise term accounting for the relationship between two pixels and a unary term representing the saliency of every pixel.
Ranked #20 on
Semantic Segmentation
on Cityscapes test
(using extra training data)
On the Mathematical Understanding of ResNet with Feynman Path Integral
In this paper, we aim to understand Residual Network (ResNet) in a scientifically sound way by providing a bridge between ResNet and Feynman path integral.
Diversified Top-k Partial MaxSAT Solving
We introduce a diversified top-k partial MaxSAT problem, a combination of partial MaxSAT problem and enumeration problem.
Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function
This paper proposes a new local search algorithm for the MWDS problem, which is based on two new ideas.
Augmenting Ordered Binary Decision Diagrams with Conjunctive Decomposition
This paper augments OBDD with conjunctive decomposition to propose a generalization called OBDD[$\wedge$].
Approximate Counting CSP Solutions Using Partition Function
This allows us to directly plug the marginal probabilities into the partition function and efficiently count the number of solutions for CSP.
