arXiv research

Survey examines challenges and solutions in sim-to-real transfer for robotics.

TASID learns policies in high-dimensional settings with abstract simulator knowledge.

HO2 learns options from data efficiently, improving robot manipulation tasks.

According to a mainstream position in contemporary cognitive science and philosophy, the use of abstract compositional concepts is both a necessary and a sufficient condition for the presence of genuine thought. In this article, we show how the ability to develop and utilise abstract conceptual structures can be achiev…

Develops methods to create consistent surrogate models for agent-based simulators.

Deep reinforcement learning has recently shown many impressive successes. However, one major obstacle towards applying such methods to real-world problems is their lack of data-efficiency. To this end, we propose the Bottleneck Simulator: a model-based reinforcement learning method which combines a learned, factorized …

To act and plan in complex environments, we posit that agents should have a mental simulator of the world with three characteristics: (a) it should build an abstract state representing the condition of the world; (b) it should form a belief which represents uncertainty on the world; (c) it should go beyond simple step-…

This review explores the use of machine learning in discovering collective variables for biomolecular dynamics.

Automated method simplifies stochastic chemical reaction network analysis.

Novel hybrid modeling combines ML and physics for real-time diagnosis.

Abstracts index for ML4H workshop at NeurIPS 2019.

Abstraction is a fundamental part when learning behavioral models of systems. Usually the process of abstraction is manually defined by domain experts. This paper presents a method to perform automatic abstraction for network protocols. In particular a weakly supervised clustering algorithm is used to build an abstract…

Optimization of hyper-parameters in reinforcement learning (RL) algorithms is a key task, because they determine how the agent will learn its policy by interacting with its environment, and thus what data is gathered. In this work, an approach that uses Bayesian optimization to perform a two-step optimization is propos…

PHASE dataset simulates complex social interactions in physical environments.

The paper aims to mathematically define and learn abstractions from data.

Unified framework for causal models at different levels of abstraction.

Abstract MDPs enable strategic exploration and fast reward transfer in complex environments.

Oriental ink painting, called Sumi-e, is one of the most appealing painting styles that has attracted artists around the world. Major challenges in computer-based Sumi-e simulation are to abstract complex scene information and draw smooth and natural brush strokes. To automatically find such strokes, we propose to mode…

We introduce the simulation tool SABCEMM (Simulator for Agent-Based Computational Economic Market Models) for agent-based computational economic market (ABCEM) models. Our simulation tool is implemented in C++ and we can easily run ABCEM models with several million agents. The object-oriented software design enables th…

Mnay models situated in the current research landscape of modelling and simulating social processes have roots in physics. This is visible in the name of specialties as Econophysics or Sociophysics. This chapter describes the history of knowledge transfer from physics, in particular physics of self-organization and evo…

Tabular Q-Learning with learned state abstractions solves continuous control tasks.

We propose RecSim, a configurable platform for authoring simulation environments for recommender systems (RSs) that naturally supports sequential interaction with users. RecSim allows the creation of new environments that reflect particular aspects of user behavior and item structure at a level of abstraction well-suit…

New approach to abstract neural network representations using renormalization group.

Study investigates how simple speech sounds can form abstract categories.

Abstract Neural Networks (ANNs) improve DNN verification efficiency.

A distinctive property of human and animal intelligence is the ability to form abstractions by neglecting irrelevant information which allows to separate structure from noise. From an information theoretic point of view abstractions are desirable because they allow for very efficient information processing. In artifici…

Algorithm finds latent structure in value functions for improved reinforcement learning.

Abstraction plays a key role in concept learning and knowledge discovery; this paper is concerned with computational abstraction. In particular, we study the nature of abstraction through a group-theoretic approach, formalizing it as symmetry-driven---as opposed to data-driven---hierarchical clustering. Thus, the resul…

The paper proposes a principle for dynamically adjusting the granularity of reinforcement learning abstractions.

We present PubMed 200k RCT, a new dataset based on PubMed for sequential sentence classification. The dataset consists of approximately 200,000 abstracts of randomized controlled trials, totaling 2.3 million sentences. Each sentence of each abstract is labeled with their role in the abstract using one of the following …

We prove a definable version of the Whitney embedding theorem for abstract-definable $\mathcal{C}^p$ manifolds with $1\leq p<\infty$, namely: every abstract-definable $\mathcal{C}^p$ manifold is abstract-definable $C^p$ embedded into $R^N$, for some positive integer $N$. As a consequence, we show that every abstract-de…

Reinforcement learning frameworks have introduced abstractions to implement and execute algorithms at scale. They assume standardized simulator interfaces but are not concerned with identifying suitable task representations. We present Wield, a first-of-its kind system to facilitate task design for practical reinforcem…

This paper simplifies OPE in large state spaces using state abstractions.

We introduce an algorithm for model-based hierarchical reinforcement learning to acquire self-contained transition and reward models suitable for probabilistic planning at multiple levels of abstraction. We call this framework Planning with Abstract Learned Models (PALM). By representing subtasks symbolically using a n…

CIB compresses variables causally, preserving key causal interactions.

Constellation learns group-level visual relationships for abstract reasoning.

Abstract discusses different corks.

We present a training system, which can provably defend significantly larger neural networks than previously possible, including ResNet-34 and DenseNet-100. Our approach is based on differentiable abstract interpretation and introduces two novel concepts: (i) abstract layers for fine-tuning the precision and scalabilit…

Deep neural network learns discrete state abstractions for efficient planning.

New algorithm efficiently trains machine learning models to atomic forces data.

We present an approach for reconfiguration of dynamic visual sensor networks with deep reinforcement learning (RL). Our RL agent uses a modified asynchronous advantage actor-critic framework and the recently proposed Relational Network module at the foundation of its network architecture. To address the issue of sample…

moment maps arise as a generalization of genuine moment maps on symplectic manifolds when the symplectic structure is discarded, but the relation between the mapping and the action is kept. Particular examples of abstract moment maps had been used in Hamiltonian mechanics for some time, but the abstract notion originat…

Abstraction of Markov Decision Processes is a useful tool for solving complex problems, as it can ignore unimportant aspects of an environment, simplifying the process of learning an optimal policy. In this paper, we propose a new algorithm for finding abstract MDPs in environments with continuous state spaces. It is b…

In this paper, we develop a framework to obtain graph abstractions for decision-making by an agent where the abstractions emerge as a function of the agent's limited computational resources. We discuss the connection of the proposed approach with information-theoretic signal compression, and formulate a novel optimizat…

Defines a generalized string concept for abstract root systems.

The paper focuses on various properties and applications of the homotopy operator, which occurs in the Poincaré lemma. In the first part, an abstract operator calculus is constructed, where the exterior derivative is an abstract derivative and the homotopy operator plays the role of an abstract integral. This operator …

This paper introduces the probabilistic module interface, which allows encapsulation of complex probabilistic models with latent variables alongside custom stochastic approximate inference machinery, and provides a platform-agnostic abstraction barrier separating the model internals from the host probabilistic inferenc…

We study the problem of formally verifying the robustness to adversarial examples of support vector machines (SVMs), a major machine learning model for classification and regression tasks. Following a recent stream of works on formal robustness verification of (deep) neural networks, our approach relies on a sound abst…