7,590 research outputs found
Reinforcement Knowledge Graph Reasoning for Explainable Recommendation
Recent advances in personalized recommendation have sparked great interest in
the exploitation of rich structured information provided by knowledge graphs.
Unlike most existing approaches that only focus on leveraging knowledge graphs
for more accurate recommendation, we perform explicit reasoning with knowledge
for decision making so that the recommendations are generated and supported by
an interpretable causal inference procedure. To this end, we propose a method
called Policy-Guided Path Reasoning (PGPR), which couples recommendation and
interpretability by providing actual paths in a knowledge graph. Our
contributions include four aspects. We first highlight the significance of
incorporating knowledge graphs into recommendation to formally define and
interpret the reasoning process. Second, we propose a reinforcement learning
(RL) approach featuring an innovative soft reward strategy, user-conditional
action pruning and a multi-hop scoring function. Third, we design a
policy-guided graph search algorithm to efficiently and effectively sample
reasoning paths for recommendation. Finally, we extensively evaluate our method
on several large-scale real-world benchmark datasets, obtaining favorable
results compared with state-of-the-art methods.Comment: Accepted in SIGIR 201
Deception in Optimal Control
In this paper, we consider an adversarial scenario where one agent seeks to
achieve an objective and its adversary seeks to learn the agent's intentions
and prevent the agent from achieving its objective. The agent has an incentive
to try to deceive the adversary about its intentions, while at the same time
working to achieve its objective. The primary contribution of this paper is to
introduce a mathematically rigorous framework for the notion of deception
within the context of optimal control. The central notion introduced in the
paper is that of a belief-induced reward: a reward dependent not only on the
agent's state and action, but also adversary's beliefs. Design of an optimal
deceptive strategy then becomes a question of optimal control design on the
product of the agent's state space and the adversary's belief space. The
proposed framework allows for deception to be defined in an arbitrary control
system endowed with a reward function, as well as with additional
specifications limiting the agent's control policy. In addition to defining
deception, we discuss design of optimally deceptive strategies under
uncertainties in agent's knowledge about the adversary's learning process. In
the latter part of the paper, we focus on a setting where the agent's behavior
is governed by a Markov decision process, and show that the design of optimally
deceptive strategies under lack of knowledge about the adversary naturally
reduces to previously discussed problems in control design on partially
observable or uncertain Markov decision processes. Finally, we present two
examples of deceptive strategies: a "cops and robbers" scenario and an example
where an agent may use camouflage while moving. We show that optimally
deceptive strategies in such examples follow the intuitive idea of how to
deceive an adversary in the above settings
Any-Angle Pathfinding for Multiple Agents Based on SIPP Algorithm
The problem of finding conflict-free trajectories for multiple agents of
identical circular shape, operating in shared 2D workspace, is addressed in the
paper and decoupled, e.g., prioritized, approach is used to solve this problem.
Agents' workspace is tessellated into the square grid on which any-angle moves
are allowed, e.g. each agent can move into an arbitrary direction as long as
this move follows the straight line segment whose endpoints are tied to the
distinct grid elements. A novel any-angle planner based on Safe Interval Path
Planning (SIPP) algorithm is proposed to find trajectories for an agent moving
amidst dynamic obstacles (other agents) on a grid. This algorithm is then used
as part of a prioritized multi-agent planner AA-SIPP(m). On the theoretical,
side we show that AA-SIPP(m) is complete under well-defined conditions. On the
experimental side, in simulation tests with up to 200 agents involved, we show
that our planner finds much better solutions in terms of cost (up to 20%)
compared to the planners relying on cardinal moves only.Comment: Final version as submitted to ICAPS-2017 (main track); 8 pages; 4
figures; 1 algorithm; 2 table
Usage of Network Simulators in Machine-Learning-Assisted 5G/6G Networks
Without any doubt, Machine Learning (ML) will be an important driver of
future communications due to its foreseen performance when applied to complex
problems. However, the application of ML to networking systems raises concerns
among network operators and other stakeholders, especially regarding
trustworthiness and reliability. In this paper, we devise the role of network
simulators for bridging the gap between ML and communications systems. In
particular, we present an architectural integration of simulators in ML-aware
networks for training, testing, and validating ML models before being applied
to the operative network. Moreover, we provide insights on the main challenges
resulting from this integration, and then give hints discussing how they can be
overcome. Finally, we illustrate the integration of network simulators into
ML-assisted communications through a proof-of-concept testbed implementation of
a residential Wi-Fi network
Empowering recommender systems using automatically generated Knowledge Graphs and Reinforcement Learning
Personalized recommendations have a growing importance in direct marketing,
which motivates research to enhance customer experiences by knowledge graph
(KG) applications. For example, in financial services, companies may benefit
from providing relevant financial articles to their customers to cultivate
relationships, foster client engagement and promote informed financial
decisions. While several approaches center on KG-based recommender systems for
improved content, in this study we focus on interpretable KG-based recommender
systems for decision making.To this end, we present two knowledge graph-based
approaches for personalized article recommendations for a set of customers of a
large multinational financial services company. The first approach employs
Reinforcement Learning and the second approach uses the XGBoost algorithm for
recommending articles to the customers. Both approaches make use of a KG
generated from both structured (tabular data) and unstructured data (a large
body of text data).Using the Reinforcement Learning-based recommender system we
could leverage the graph traversal path leading to the recommendation as a way
to generate interpretations (Path Directed Reasoning (PDR)). In the
XGBoost-based approach, one can also provide explainable results using post-hoc
methods such as SHAP (SHapley Additive exPlanations) and ELI5 (Explain Like I
am Five).Importantly, our approach offers explainable results, promoting better
decision-making. This study underscores the potential of combining advanced
machine learning techniques with KG-driven insights to bolster experience in
customer relationship management.Comment: Accepted at KDD (OARS) 2023 [https://oars-workshop.github.io/
- …