Search Results for author:
Found 91 papers, 17 papers with code
A Benchmark for Automatic Medical Consultation System: Frameworks, Tasks and Datasets
In recent years, interest has arisen in using machine learning to improve the efficiency of automatic medical consultation and enhance patient experience.
PAnDR: Fast Adaptation to New Environments from Offline Experiences via Decoupling Policy and Environment Representations
In online adaptation phase, with the environment context inferred from few experiences collected in new environments, the policy is optimized by gradient ascent with respect to the PDVF.
LHNN: Lattice Hypergraph Neural Network for VLSI Congestion Prediction
Precise congestion prediction from a placement solution plays a crucial role in circuit placement.
PMIC: Improving Multi-Agent Reinforcement Learning with Progressive Mutual Information Collaboration
Learning to collaborate is critical in multi-agent reinforcement learning (MARL).
Coach-assisted Multi-Agent Reinforcement Learning Framework for Unexpected Crashed Agents
To the best of our knowledge, this work is the first to study the unexpected crashes in the multi-agent system.
Multi-agent Reinforcement Learning
reinforcement-learning
+2
API: Boosting Multi-Agent Reinforcement Learning via Agent-Permutation-Invariant Networks
Multi-agent reinforcement learning suffers from poor sample efficiency due to the exponential growth of the state-action space.
Plan Your Target and Learn Your Skills: Transferable State-Only Imitation Learning via Decoupled Policy Optimization
Recent progress in state-only imitation learning extends the scope of applicability of imitation learning to real-world settings by relieving the need for observing expert actions.
Generalizable Information Theoretic Causal Representation
It is evidence that representation learning can improve model's performance over multiple downstream tasks in many real-world scenarios, such as image classification and recommender systems.
Revisiting QMIX: Discriminative Credit Assignment by Gradient Entropy Regularization
In cooperative multi-agent systems, agents jointly take actions and receive a team reward instead of individual rewards.
Introduction to The Dynamic Pickup and Delivery Problem Benchmark -- ICAPS 2021 Competition
The Dynamic Pickup and Delivery Problem (DPDP) is an essential problem within the logistics domain.
Debiased Recommendation with User Feature Balancing
To alleviate these problems, in this paper, we propose a novel debiased recommendation framework based on user feature balancing.
A Survey on Interpretable Reinforcement Learning
To that aim, we distinguish interpretability (as a property of a model) and explainability (as a post-hoc operation, with the intervention of a proxy) and discuss them in the context of RL with an emphasis on the former notion.
ED2: An Environment Dynamics Decomposition Framework for World Model Construction
To reduce the model error, previous works use a single well-designed network to fit the entire environment dynamics, which treats the environment dynamics as a black box.
A Hierarchical Reinforcement Learning Based Optimization Framework for Large-scale Dynamic Pickup and Delivery Problems
To address this problem, existing methods partition the overall DPDP into fixed-size sub-problems by caching online generated orders and solve each sub-problem, or on this basis to utilize the predicted future orders to optimize each sub-problem further.
Adaptive Online Packing-guided Search for POMDPs
A belief is a distribution of states representing state uncertainty.
Model-Based Reinforcement Learning via Imagination with Derived Memory
Model-based reinforcement learning aims to improve the sample efficiency of policy learning by modeling the dynamics of the environment.
Learning State Representations via Retracing in Reinforcement Learning
We propose learning via retracing, a novel self-supervised approach for learning the state representation (and the associated dynamics model) for reinforcement learning tasks.
Uncertainty-aware Low-Rank Q-Matrix Estimation for Deep Reinforcement Learning
Such a reconstruction exploits the underlying structure of value matrix to improve the value approximation, thus leading to a more efficient learning process of value function.
Lifelong Reinforcement Learning with Temporal Logic Formulas and Reward Machines
In this paper, we propose Lifelong reinforcement learning with Sequential linear temporal logic formulas and Reward Machines (LSRM), which enables an agent to leverage previously learned knowledge to fasten learning of logically specified tasks.
SEIHAI: A Sample-efficient Hierarchical AI for the MineRL Competition
The MineRL competition is designed for the development of reinforcement learning and imitation learning algorithms that can efficiently leverage human demonstrations to drastically reduce the number of environment interactions needed to solve the complex \emph{ObtainDiamond} task with sparse rewards.
Dynamic Bottleneck for Robust Self-Supervised Exploration
Exploration methods based on pseudo-count of transitions or curiosity of dynamics have achieved promising results in solving reinforcement learning with sparse rewards.
Flattening Sharpness for Dynamic Gradient Projection Memory Benefits Continual Learning
The backpropagation networks are notably susceptible to catastrophic forgetting, where networks tend to forget previously learned skills upon learning new ones.
Ranking Cost: Building An Efficient and Scalable Circuit Routing Planner with Evolution-Based Optimization
In this work, we propose a new algorithm for circuit routing, named Ranking Cost, which innovatively combines search-based methods (i. e., A* algorithm) and learning-based methods (i. e., Evolution Strategies) to form an efficient and trainable router.
Online Ad Hoc Teamwork under Partial Observability
Autonomous agents often need to work together as a team to accomplish complex cooperative tasks.
OVD-Explorer: A General Information-theoretic Exploration Approach for Reinforcement Learning
Many exploration strategies are built upon the optimism in the face of the uncertainty (OFU) principle for reinforcement learning.
Learning Explicit Credit Assignment for Multi-agent Joint Q-learning
In contrast, we formulate an \emph{explicit} credit assignment problem where each agent gives its suggestion about how to weight individual Q-values to explicitly maximize the joint Q-value, besides guaranteeing the Bellman optimality of the joint Q-value.
Informative Robust Causal Representation for Generalizable Deep Learning
In many real-world scenarios, such as image classification and recommender systems, it is evidence that representation learning can improve model's performance over multiple downstream tasks.
Learning Pseudometric-based Action Representations for Offline Reinforcement Learning
Offline reinforcement learning is a promising approach for practical applications since it does not require interactions with real-world environments.
Plan Your Target and Learn Your Skills: State-Only Imitation Learning via Decoupled Policy Optimization
State-only imitation learning (SOIL) enables agents to learn from massive demonstrations without explicit action or reward information.
Exploration in Deep Reinforcement Learning: A Comprehensive Survey
In this paper, we conduct a comprehensive survey on existing exploration methods in DRL and deep MARL for the purpose of providing understandings and insights on the critical problems and solutions.
HyAR: Addressing Discrete-Continuous Action Reinforcement Learning via Hybrid Action Representation
Discrete-continuous hybrid action space is a natural setting in many practical problems, such as robot control and game AI.
CMML: Contextual Modulation Meta Learning for Cold-Start Recommendation
Meta learning, especially gradient based one, can be adopted to tackle this problem by learning initial parameters of the model and thus allowing fast adaptation to a specific task from limited data examples.
Modeling Scale-free Graphs with Hyperbolic Geometry for Knowledge-aware Recommendation
Aiming to alleviate data sparsity and cold-start problems of traditional recommender systems, incorporating knowledge graphs (KGs) to supplement auxiliary information has recently gained considerable attention.
A Graph-Enhanced Click Model for Web Search
To better exploit search logs and model users' behavior patterns, numerous click models are proposed to extract users' implicit interaction feedback.
Contrastive ACE: Domain Generalization Through Alignment of Causal Mechanisms
Domain generalization aims to learn knowledge invariant across different distributions while semantically meaningful for downstream tasks from multiple source domains, to improve the model's generalization ability on unseen target domains.
Cooperative Multi-Agent Transfer Learning with Level-Adaptive Credit Assignment
In addition, we use a novel agent network named Population Invariant agent with Transformer (PIT) to realize the coordination transfer in more varieties of scenarios.
Learning to Select Cuts for Efficient Mixed-Integer Programming
In the online A/B testing of the product planning problems with more than $10^7$ variables and constraints daily, Cut Ranking has achieved the average speedup ratio of 12. 42% over the production solver without any accuracy loss of solution.
Ordering-Based Causal Discovery with Reinforcement Learning
It is a long-standing question to discover causal relations among a set of variables in many empirical sciences.
Principled Exploration via Optimistic Bootstrapping and Backward Induction
In this paper, we propose a principled exploration method for DRL through Optimistic Bootstrapping and Backward Induction (OB2I).
An Adversarial Imitation Click Model for Information Retrieval
Modern information retrieval systems, including web search, ads placement, and recommender systems, typically rely on learning from user feedback.
Learning Symbolic Rules for Interpretable Deep Reinforcement Learning
To address this challenge and improve the transparency, we propose a Neural Symbolic Reinforcement Learning framework by introducing symbolic logic into DRL.
Learning State Representations via Temporal Cycle-Consistency Constraint in Model-Based Reinforcement Learning
Representation learning is a popular approach for reinforcement learning (RL) tasks with partially observable Markov decision processes.
Addressing Action Oscillations through Learning Policy Inertia
We propose Nested Policy Iteration as a general training algorithm for PIC-augmented policy which ensures monotonically non-decreasing updates under some mild conditions.
Foresee then Evaluate: Decomposing Value Estimation with Latent Future Prediction
Value function is the central notion of Reinforcement Learning (RL).
Approximating Pareto Frontier through Bayesian-optimization-directed Robust Multi-objective Reinforcement Learning
Thirdly, the agent’s learning process is regarded as a black-box, and the comprehensive metric we proposed is computed after each episode of training, then a Bayesian optimization (BO) algorithm is adopted to guide the agent to evolve towards improving the quality of the approximated Pareto frontier.
Ranking Cost: One-Stage Circuit Routing by Directly Optimizing Global Objective Function
In our method, we introduce a new set of variables called cost maps, which can help the A* router to find out proper paths to achieve the global object.
Understanding and Leveraging Causal Relations in Deep Reinforcement Learning
Reinforcement Learning (RL) has shown great potential to deal with sequential decision-making problems.
Optimistic Exploration with Backward Bootstrapped Bonus for Deep Reinforcement Learning
However, such an approach is challenging in developing practical exploration algorithms for Deep Reinforcement Learning (DRL).
Robust Memory Augmentation by Constrained Latent Imagination
The latent dynamics model summarizes an agent’s high dimensional experiences in a compact way.
Robust Multi-Agent Reinforcement Learning Driven by Correlated Equilibrium
Therefore, to achieve robust CMARL, we introduce novel strategies to encourage agents to learn correlated equilibrium while maximally preserving the convenience of the decentralized execution.
MQES: Max-Q Entropy Search for Efficient Exploration in Continuous Reinforcement Learning
Recently, the principle of optimism in the face of (aleatoric and epistemic) uncertainty has been utilized to design efficient exploration strategies for Reinforcement Learning (RL).
Interpretable Reinforcement Learning With Neural Symbolic Logic
Recent progress in deep reinforcement learning (DRL) can be largely attributed to the use of neural networks.
Hierarchical Reinforcement Learning
reinforcement-learning
+1
Critic PI2: Master Continuous Planning via Policy Improvement with Path Integrals and Deep Actor-Critic Reinforcement Learning
Extensive experiments demonstrate that Critic PI2 achieved a new state of the art in a range of challenging continuous domains.
Learning to Utilize Shaping Rewards: A New Approach of Reward Shaping
In this paper, we consider the problem of adaptively utilizing a given shaping reward function.
SMARTS: Scalable Multi-Agent Reinforcement Learning Training School for Autonomous Driving
We open-source the SMARTS platform and the associated benchmark tasks and evaluation metrics to encourage and empower research on multi-agent learning for autonomous driving.
What About Inputing Policy in Value Function: Policy Representation and Policy-extended Value Function Approximator
We study Policy-extended Value Function Approximator (PeVFA) in Reinforcement Learning (RL), which extends conventional value function approximator (VFA) to take as input not only the state (and action) but also an explicit policy representation.
Event-Triggered Multi-agent Reinforcement Learning with Communication under Limited-bandwidth Constraint
Then the design of the event-triggered strategy is formulated as a constrained Markov decision problem, and reinforcement learning finds the best communication protocol that satisfies the limited bandwidth constraint.
Multiagent Systems
Towards Effective Context for Meta-Reinforcement Learning: an Approach based on Contrastive Learning
How to collect informative trajectories of which the corresponding context reflects the specification of tasks?
What About Taking Policy as Input of Value Function: Policy-extended Value Function Approximator
The value function lies in the heart of Reinforcement Learning (RL), which defines the long-term evaluation of a policy in a given state.
Transfer among Agents: An Efficient Multiagent Transfer Learning Framework
In many cases, each agent's experience is inconsistent with each other which causes the option-value estimation to oscillate and to become inaccurate.
Dynamic Horizon Value Estimation for Model-based Reinforcement Learning
Existing model-based value expansion methods typically leverage a world model for value estimation with a fixed rollout horizon to assist policy learning.
Dynamic Knapsack Optimization Towards Efficient Multi-Channel Sequential Advertising
In E-commerce, advertising is essential for merchants to reach their target users.
Triple-GAIL: A Multi-Modal Imitation Learning Framework with Generative Adversarial Nets
Generative adversarial imitation learning (GAIL) has shown promising results by taking advantage of generative adversarial nets, especially in the field of robot learning.
Continuous Multiagent Control using Collective Behavior Entropy for Large-Scale Home Energy Management
With the increasing popularity of electric vehicles, distributed energy generation and storage facilities in smart grid systems, an efficient Demand-Side Management (DSM) is urgent for energy savings and peak loads reduction.
Learning to Accelerate Heuristic Searching for Large-Scale Maximum Weighted b-Matching Problems in Online Advertising
Bipartite b-matching is fundamental in algorithm design, and has been widely applied into economic markets, labor markets, etc.
CausalVAE: Disentangled Representation Learning via Neural Structural Causal Models
Learning disentanglement aims at finding a low dimensional representation which consists of multiple explanatory and generative factors of the observational data.
Efficient Deep Reinforcement Learning via Adaptive Policy Transfer
Transfer Learning (TL) has shown great potential to accelerate Reinforcement Learning (RL) by leveraging prior knowledge from past learned policies of relevant tasks.
KoGuN: Accelerating Deep Reinforcement Learning via Integrating Human Suboptimal Knowledge
Our framework consists of a fuzzy rule controller to represent human knowledge and a refine module to fine-tune suboptimal prior knowledge.
Neighborhood Cognition Consistent Multi-Agent Reinforcement Learning
Social psychology and real experiences show that cognitive consistency plays an important role to keep human society in order: if people have a more consistent cognition about their environments, they are more likely to achieve better cooperation.
Multi-Agent Game Abstraction via Graph Attention Neural Network
Traditional methods attempt to use pre-defined rules to capture the interaction relationship between agents.
There is Limited Correlation between Coverage and Robustness for Deep Neural Networks
In this work, we conduct an empirical study to evaluate the relationship between coverage, robustness and attack/defense metrics for DNN.
MGHRL: Meta Goal-generation for Hierarchical Reinforcement Learning
Most meta reinforcement learning (meta-RL) methods learn to adapt to new tasks by directly optimizing the parameters of policies over primitive action space.
Efficient meta reinforcement learning via meta goal generation
Meta reinforcement learning (meta-RL) is able to accelerate the acquisition of new tasks by learning from past experience.
From Few to More: Large-scale Dynamic Multiagent Curriculum Learning
In this paper, we design a novel Dynamic Multiagent Curriculum Learning (DyMA-CL) to solve large-scale problems by starting from learning on a multiagent scenario with a small size and progressively increasing the number of agents.
Learning Action-Transferable Policy with Action Embedding
Transfer learning (TL) is a promising way to improve the sample efficiency of reinforcement learning.
Action Semantics Network: Considering the Effects of Actions in Multiagent Systems
ASN characterizes different actions' influence on other agents using neural networks based on the action semantics between them.
Spectral-based Graph Convolutional Network for Directed Graphs
Our approach can work directly on directed graph data in semi-supervised nodes classification tasks.
Disentangling Dynamics and Returns: Value Function Decomposition with Future Prediction
Value functions are crucial for model-free Reinforcement Learning (RL) to obtain a policy implicitly or guide the policy updates.
Deep Multi-Agent Reinforcement Learning with Discrete-Continuous Hybrid Action Spaces
Deep Reinforcement Learning (DRL) has been applied to address a variety of cooperative multi-agent problems with either discrete action spaces or continuous action spaces.
A Deep Bayesian Policy Reuse Approach Against Non-Stationary Agents
In multiagent domains, coping with non-stationary agents that change behaviors from time to time is a challenging problem, where an agent is usually required to be able to quickly detect the other agent's policy during online interaction, and then adapt its own policy accordingly.
Hierarchical Deep Multiagent Reinforcement Learning with Temporal Abstraction
Besides, we propose a new experience replay mechanism to alleviate the issue of the sparse transitions at the high level of abstraction and the non-stationarity of multiagent learning.
SCC-rFMQ Learning in Cooperative Markov Games with Continuous Actions
Although many reinforcement learning methods have been proposed for learning the optimal solutions in single-agent continuous-action domains, multiagent coordination domains with continuous actions have received relatively few investigations.
Towards Efficient Detection and Optimal Response against Sophisticated Opponents
This paper proposes a novel approach called Bayes-ToMoP which can efficiently detect the strategy of opponents using either stationary or higher-level reasoning strategies.
Multiagent Systems
Learning Adaptive Display Exposure for Real-Time Advertising
In this paper, we investigate the problem of advertising with adaptive exposure: can we dynamically determine the number and positions of ads for each user visit under certain business constraints so that the platform revenue can be increased?
An Optimal Rewiring Strategy for Reinforcement Social Learning in Cooperative Multiagent Systems
Multiagent coordination in cooperative multiagent systems (MASs) has been widely studied in both fixed-agent repeated interaction setting and the static social learning framework.
Falsification of Cyber-Physical Systems Using Deep Reinforcement Learning
With the rapid development of software and distributed computing, Cyber-Physical Systems (CPS) are widely adopted in many application areas, e. g., smart grid, autonomous automobile.
SA-IGA: A Multiagent Reinforcement Learning Method Towards Socially Optimal Outcomes
In multiagent environments, the capability of learning is important for an agent to behave appropriately in face of unknown opponents and dynamic environment.
Towards Cooperation in Sequential Prisoner's Dilemmas: a Deep Multiagent Reinforcement Learning Approach
We introduce a Sequential Prisoner's Dilemma (SPD) game to better capture the aforementioned characteristics.
Weighted Double Deep Multiagent Reinforcement Learning in Stochastic Cooperative Environments
Recently, multiagent deep reinforcement learning (DRL) has received increasingly wide attention.
Blind Image Denoising via Dependent Dirichlet Process Tree
This paper addresses this problem and proposes a novel blind image denoising algorithm to recover the clean image from noisy one with the unknown noise model.
