← Search

Bart Selman

9 accepted papers

2023

Weighted Sampling without Replacement for Deep Top-$k$ Classification

ICML 2023poster

The top-$k$ classification accuracy is a crucial metric in machine learning and is often used to evaluate the performance of deep neural networks. These networks are typically trained using the cross-entropy loss, which optimizes for top-$1$ classification and is considered optimal in the case of in…

Cited by 0SourcePDFScholar
2022

Left Heavy Tails and the Effectiveness of the Policy and Value Networks in DNN-based best-first search for Sokoban Planning

NeurIPS 2022accept

Despite the success of practical solvers in various NP-complete domains such as SAT and CSP as well as using deep reinforcement learning to tackle two-player games such as Go, certain classes of PSPACE-hard planning problems have remained out of reach. Even carefully designed domain-specialized solv…

Cited by 2SourcePDFScholar
2020

A Novel Automated Curriculum Strategy to Solve Hard Sokoban Planning Instances

NeurIPS 2020poster

In recent years, we have witnessed tremendous progress in deep reinforcement learning (RL) for tasks such as Go, Chess, video games, and robot control. Nevertheless, other combinatorial domains, such as AI planning, still pose considerable challenges for RL approaches. The key difficulty in those do…

Cited by 26SourcePDFScholar
2020

Solving Hard AI Planning Instances Using Curriculum-Driven Deep Reinforcement Learning

IJCAI 2020poster

Despite significant progress in general AI planning, certain domains remain out of reach of current AI planning systems. Sokoban is a PSPACE-complete planning task and represents one of the hardest domains for current AI planners. Even domain-specific specialized search methods fail quickly due to t…

Cited by 0SourcePDFScholar
2016

Solving Marginal MAP Problems with NP Oracles and Parity Constraints

NeurIPS 2016poster

Arising from many applications at the intersection of decision-making and machine learning, Marginal Maximum A Posteriori (Marginal MAP) problems unify the two main classes of inference, namely maximization (optimization) and marginal inference (counting), and are believed to have higher complexity…

Cited by 26SourcePDFScholar
2016

Watch-Bot: Unsupervised learning for reminding humans of forgotten actions

ICRA 2016

We present a robotic system that watches a human using a Kinect v2 RGB-D sensor, detects what he forgot to do while performing an activity, and if necessary reminds the person using a laser pointer to point out the related object. Our simple setup can be easily deployed on any assistive robot. Our a

Cited by 17SourceScholar