Related papers: Comparing improved actions for SU(2)
Building upon findings in computational model of handwriting learning and execution, we introduce the concept of stability to explain the difference between the actual movements performed during multiple execution of the subject's…
Active learning comprises many varied techniques that engage students actively in the construction of their understanding. Because of this variation, different active learning techniques may be best suited to achieving different learning…
We consider a quantum control problem involving a spin-1/2 particle in a magnetic field. The magnitude of the field is held constant, and the direction of the field, which is constrained to lie in the x-y plane, serves as a control…
Nature is in constant flux, so animals must account for changes in their environment when making decisions. How animals learn the timescale of such changes and adapt their decision strategies accordingly is not well understood. Recent…
This paper proposes an Adaptive Learning Model Predictive Control strategy for uncertain constrained linear systems performing iterative tasks. The additive uncertainty is modeled as the sum of a bounded process noise and an unknown…
In a couple of previous papers, we initiated a systematic study of semihypergroups and had a thorough discussion on certain analytic and algebraic aspects associated to this class of objects. In this article, we introduce and examine…
Temporal action localization has recently attracted significant interest in the Computer Vision community. However, despite the great progress, it is hard to identify which aspects of the proposed methods contribute most to the increase in…
We explore the first stage of the Symanzik improvement program for lattice Dirac fermions, namely the construction of doubler-free, highly improved classical actions on isotropic as well as anisotropic lattices (where the temporal lattice…
Previous work has shown the unreliability of existing algorithms in the batch Reinforcement Learning setting, and proposed the theoretically-grounded Safe Policy Improvement with Baseline Bootstrapping (SPIBB) fix: reproduce the baseline…
Active inference is a formal approach to study cognition based on the notion that adaptive agents can be seen as engaging in a process of approximate Bayesian inference, via the minimisation of variational and expected free energies.…
Approximations based on two-particle irreducible (2PI) effective actions (also known as $\Phi$-derivable, Cornwall-Jackiw-Tomboulis or Luttinger-Ward functionals depending on context) have been widely used in condensed matter and…
In dynamic epistemic logic, actions are described using action models. In this paper we introduce a framework for studying learnability of action models from observations. We present first results concerning propositional action models.…
Semi-active suspensions have drawn particular attention due to their superior performance over the other types of suspensions. One of their advantages is that their damping coefficient can be controlled without the need for any external…
We study decimation procedures and effective (improved) actions in the framework of Monte Carlo Renormalization Group (MCRG). Particular attention is paid to matching the form of the effective action to the decimation procedure parameters.…
We consider a type of optimal switching problems with non-uniform execution delays and ramping. Such problems frequently occur in the operation of economical and engineering systems. We first provide a solution to the problem by applying a…
This work presents a comprehensive performance analysis and optimization of a multiscale agent-based cellular simulation. The optimizations applied are guided by detailed performance analysis and include memory management, load balance, and…
Training practical agents usually involve offline and online reinforcement learning (RL) to balance the policy's performance and interaction costs. In particular, online fine-tuning has become a commonly used method to correct the erroneous…
The second-order sub-optimal sliding mode control (SMC), known in the literature for the last two decades, is extended by a control-off mode which allows for saving energy during the finite time convergence. The systems with relative degree…
Earlier work on program and thread algebra detailed the functional, observable behavior of programs under execution. In this article we add the modeling of unobservable, mechanistic processing, in particular processing due to jump…
This paper presents the first experimental evaluation of four previously untested modifications of Unbounded Best-First Minimax algorithm. This algorithm explores the game tree by iteratively expanding the most promising sequences of…