PackIt creates a virtual space for testing geometric planning skills.
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
Virtual reality (VR) offers immersive visualization and intuitive interaction. We leverage VR to enable any biomedical professional to deploy a deep learning (DL) model for image classification. While DL models can be powerful tools for data analysis, they are also challenging to understand and develop. To make deep le…
Hindsight Experience Replay (HER) is a multi-goal reinforcement learning algorithm for sparse reward functions. The algorithm treats every failure as a success for an alternative (virtual) goal that has been achieved in the episode. Virtual goals are randomly selected, irrespective of which are most instructive for the…
Enhances graph neural networks by creating virtual data examples.
Concept drift is formally defined as the change in joint distribution of a set of input variables X and a target variable y. The two types of drift that are extensively studied are real drift and virtual drift where the former is the change in posterior probabilities p(y|X) while the latter is the change in distributio…
Paper introduces IAD for detecting anomalous VMMs in cloud without VMM access.
Learning optimal policies from sparse feedback is a known challenge in reinforcement learning. Hindsight Experience Replay (HER) is a multi-goal reinforcement learning algorithm that comes to solve such tasks. The algorithm treats every failure as a success for an alternative (virtual) goal that has been achieved in th…
In recent years, distance education has enjoyed a major boom. Much work at The Open University (OU) has focused on improving retention rates in these modules by providing timely support to students who are at risk of failing the module. In this paper we explore methods for analysing student activity in online virtual l…
CEA augments reinforcement learning by generating counterfactual experiences.
Study uses sentiment analysis to predict cryptocurrency token returns in virtual reality.
Robots hold promise in many scenarios involving outdoor use, such as search-and-rescue, wildlife management, and collecting data to improve environment, climate, and weather forecasting. However, autonomous navigation of outdoor trails remains a challenging problem. Recent work has sought to address this issue using de…
Recent progress in the field of reinforcement learning has been accelerated by virtual learning environments such as video games, where novel algorithms and ideas can be quickly tested in a safe and reproducible manner. We introduce the Google Research Football Environment, a new reinforcement learning environment wher…
The detection of Denial of Service (DoS) attacks remains a challenge for the cloud environment, affecting a massive number of services and applications hosted by such virtualized infrastructures. Typically, in the literature, the detection of DoS attacks is performed solely by analyzing the traffic of packets in the ne…
The virtualization of compute and network resources enables an unseen flexibility for deploying network services. A wide spectrum of emerging technologies allows an ever-growing range of orchestration possibilities in cloud-based environments. But in this context it remains challenging to rhyme dynamic cloud configurat…
We develop the first basic Operational Risk perspective on key risk management issues associated with the development of new forms of electronic currency in the real economy. In particular, we focus on understanding the development of new risks types and the evolution of current risk types as new components of financia…
A machine learning environment for detecting autonomous vehicle corner cases.
Efficiently updates beliefs with virtual observations.
Neuro-symbolic traders suppress market prices, highlighting risks to stability.
The aim of multi-task reinforcement learning is two-fold: (1) efficiently learn by training against multiple tasks and (2) quickly adapt, using limited samples, to a variety of new tasks. In this work, the tasks correspond to reward functions for environments with the same (or similar) dynamical models. We propose to l…
We present a modelling framework for the investigation of prototype-based classifiers in non-stationary environments. Specifically, we study Learning Vector Quantization (LVQ) systems trained from a stream of high-dimensional, clustered data.We consider standard winner-takes-all updates known as LVQ1. Statistical prope…
Training deep reinforcement learning agents complex behaviors in 3D virtual environments requires significant computational resources. This is especially true in environments with high degrees of aliasing, where many states share nearly identical visual features. Minecraft is an exemplar of such an environment. We hypo…
Reinforcement Learning AI commonly uses reward/penalty signals that are objective and explicit in an environment -- e.g. game score, completion time, etc. -- in order to learn the optimal strategy for task performance. However, Human-AI interaction for such AI agents should include additional reinforcement that is impl…
Predicting movement of objects while the action of learning agent interacts with the dynamics of the scene still remains a key challenge in robotics. We propose a multi-layer Long Short Term Memory (LSTM) autoendocer network that predicts future frames for a robot navigating in a dynamic environment with moving obstacl…
DyFEn simulates blockchain for fee setting in payment channels.
New virtualized Δ-move simplifies virtual knots and links.
Virtual index cocycles reformulate virtual link invariants.
Model-free reinforcement learning based methods such as Proximal Policy Optimization, or Q-learning typically require thousands of interactions with the environment to approximate the optimum controller which may not always be feasible in robotics due to safety and time consumption. Model-based methods such as PILCO or…
The paper studies strict equivalence in multi-virtual linkoids with new invariants.
The study enumerates virtual quandles up to isomorphism.
New virtual version of Thompson's group created to handle virtual knots.
The paper extends CF-moves to classify virtual links of any number of components.
Refines virtual link equality criterion for diagrams with one virtual crossing.
Extend writhe polynomial from virtual knots to multi-virtual knots
New invariants for virtual knots and links defined via quiver representations.
Study virtualized Delta, Sharp, and Pass moves for oriented virtual knots and links.
The virtual unknotting number of a virtual knot is the minimal number of crossing changes that makes the virtual knot to be the unknot, which is defined only for virtual knots virtually homotopic to the unknot. We focus on the virtual knot obtained from the standard (p,q)-torus knot diagram by replacing all crossings o…
This paper connects virtual biquandles to biquandles for virtual link colorings.
Virtual knots and links get multicrossings and petal diagrams.
New method identifies causal variables from multi-node interventions, expanding on previous single-node approaches.
A virtual string can be defined as an equivalence class of planar diagrams under certain kinds of diagrammatic moves. Virtual strings are related to virtual knots in that a simple operation on a virtual knot diagram produces a diagram for a virtual string. In this paper we consider three operations on a virtual string …
A virtual -string is a chord diagram with core circles and a collection of arrows between core circles. We consider virtual -strings up to virtual homotopy, compositions of flat virtual Reidemeister moves on chord diagrams. Given a virtual 1-string , Turaev associated a based matrix that encodes invariants…
A new model for simulating cloth manipulation in robots, accurate to within 1cm.
New invariant for virtual n-links defined and studied.
Given a virtual knot , we construct a group called the virtual knot group, and we use the elementary ideals of to define invariants of called the virtual Alexander invariants. For instance, associated to the ideal is a polynomial in three variables which we call the virtual Alexa…
A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative. Normal virtual links have some properties similar to classical links.In this paper, we introduce a method of converting a virtual link d…
New polynomial invariants for virtual links are stronger than F-polynomials.
Virtual singular braids are generalizations of singular braids and virtual braids. We define the virtual singular braid monoid via generators and relations, and prove Alexander- and Markov-type theorems for virtual singular links. We also show that the virtual singular braid monoid has another presentation with fewer g…
Study algebraic invariants of multi-virtual links.