← Search

Paul Weng

18 accepted papers

2026

ASAP: Exploiting the Satisficing Generalization Edge in Neural Combinatorial Optimization

ICML 2026poster

Deep Reinforcement Learning (DRL) has emerged as a promising approach for solving Combinatorial Optimization (CO) problems, such as the 3D Bin Packing Problem (3D-BPP), Traveling Salesman Problem (TSP), or Vehicle Routing Problem (VRP), but these neural solvers often exhibit brittleness when facing …

Cited by 0SourceScholar
2026

Generalizable Coarse-to-Fine Robot Manipulation via Language-Aligned 3D Keypoints

ICLR 2026poster

Hierarchical coarse-to-fine policy, where a coarse branch predicts a region of interest to guide a fine-grained action predictor, has demonstrated significant potential in robotic 3D manipulation tasks by especially enhancing sample efficiency and enabling more precise manipulation. However, even au…

Cited by 0SourceScholar
2026

OMP: One-step Meanflow Policy with Directional Alignment

ICML 2026poster

Robot manipulation has increasingly adopted data-driven generative policy frameworks, yet the field faces a persistent trade-off: diffusion models suffer from high inference latency, while flow-based methods often require complex architectural constraints. Although in image generation domain, the Me…

Cited by 0SourceScholar
2025

Comparing Comparisons: Informative and Easy Human Feedback with Distinguishability Queries

ICML 2025poster

Learning human objectives from preference feedback has significantly advanced reinforcement learning (RL) in domains where objectives are hard to formalize. However, traditional methods based on pairwise trajectory comparisons face notable challenges, including the difficulty in comparing trajector…

Cited by 1SourcePDFScholar
2025

DUO: Diverse, Uncertain, On-Policy Query Generation and Selection for Reinforcement Learning from Human Feedback

AAAI 2025technical

Defining a reward function is usually a challenging but critical task for the system designer in reinforcement learning, especially when specifying complex behaviors. Reinforcement learning from human feedback (RLHF) emerges as a promising approach to circumvent this. In RLHF, the agent typically le…

Cited by 0SourcePDFScholar
2025

Enhancing Online Reinforcement Learning with Meta-Learned Objective from Offline Data

AAAI 2025technical

A major challenge in Reinforcement Learning (RL) is the difficulty of learning an optimal policy from sparse rewards. Prior works enhance online RL with conventional Imitation Learning (IL) via a handcrafted auxiliary objective, at the cost of restricting the RL policy to be sub-optimal when the off…

2025

Reinforcement Learning from Imperfect Corrective Actions and Proxy Rewards

ICLR 2025poster

In practice, reinforcement learning (RL) agents are often trained with a possibly imperfect proxy reward function, which may lead to a human-agent alignment issue (i.e., the learned policy either converges to non-optimal performance with low cumulative rewards, or achieves high cumulative rewards bu…

Cited by 1SourcePDFScholar
2025

Time Reversal Symmetry for Efficient Robotic Manipulations in Deep Reinforcement Learning

NeurIPS 2025poster

Symmetry is pervasive in robotics and has been widely exploited to improve sample efficiency in deep reinforcement learning (DRL). However, existing approaches primarily focus on spatial symmetries—such as reflection, rotation, and translation—while largely neglecting temporal symmetries. To address…

Cited by 0SourceScholar
2024

INViT: A Generalizable Routing Problem Solver with Invariant Nested View Transformer

ICML 2024poster

Recently, deep reinforcement learning has shown promising results for learning fast heuristics to solve routing problems. Meanwhile, most of the solvers suffer from generalizing to an unseen distribution or distributions with different scales. To address this issue, we propose a novel architecture,…

2022

Neuro-Symbolic Hierarchical Rule Induction

ICML 2022spotlight

We propose Neuro-Symbolic Hierarchical Rule Induction, an efficient interpretable neuro-symbolic model, to solve Inductive Logic Programming (ILP) problems. In this model, which is built from a pre-defined set of meta-rules organized in a hierarchical structure, first-order rules are invented by lea…

2021

Hyperparameter Auto-Tuning in Self-Supervised Robotic Learning

RA-L 2021

Policy optimization in reinforcement learning requires the selection of numerous hyperparameters across different environments. Fixing them incorrectly may negatively impact optimization performance leading notably to insufficient or redundant learning. Insufficient learning (due to convergence to l

Cited by 10SourcecodeScholar
2021

Learning Fair Policies in Decentralized Cooperative Multi-Agent Reinforcement Learning

ICML 2021spotlight

We consider the problem of learning fair policies in (deep) cooperative multi-agent reinforcement learning (MARL). We formalize it in a principled way as the problem of optimizing a welfare function that explicitly encodes two important aspects of fairness: efficiency and equity. We provide a theore…

Cited by 76SourcePDFScholar
2020

Invariant Transform Experience Replay: Data Augmentation for Deep Reinforcement Learning

RA-L 2020

Deep Reinforcement Learning (RL) is a promising approach for adaptive robot control, but its current application to robotics is currently hindered by high sample requirements. To alleviate this issue, we propose to exploit the symmetries present in robotic tasks. Intuitively, symmetries from observe

Cited by 51SourcecodeScholar
2020

Learning Fair Policies in Multi-Objective (Deep) Reinforcement Learning with Average and Discounted Rewards

ICML 2020poster

As the operations of autonomous systems generally affect simultaneously several users, it is crucial that their designs account for fairness considerations. In contrast to standard (deep) reinforcement learning (RL), we investigate the problem of learning a policy that treats its users equitably. In…

2017

Multi-objective Bandits: Optimizing the Generalized Gini Index

ICML 2017poster

We study the multi-armed bandit (MAB) problem where the agent receives a vectorial feedback that encodes many possibly competing objectives to be optimized. The goal of the agent is to find a policy, which can optimize these objectives simultaneously in a fair way. This multi-objective online optimi…

Cited by 58SourcePDFScholar
2015

Qualitative Multi-Armed Bandits: A Quantile-Based Approach

ICML 2015poster

We formalize and study the multi-armed bandit (MAB) problem in a generalized stochastic setting, in which rewards are not assumed to be numerical. Instead, rewards are measured on a qualitative scale that allows for comparison but invalidates arithmetic operations such as averaging. Correspondingly,…

Cited by 60SourcePDFScholar