Research
On-device research index

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.

168,657 papers · 148 categories

Trend · papers per month

2356 · Apr 202019922001200920172026
48 results for pendulum swing-up

An energy based approach for stabilizing a mechanical system has offered a simple yet powerful control scheme. However, since it does not impose such strong constraints on parameter space of the controller, finding appropriate parameter values for an optimal controller is known to be hard. This paper intends to generat…

2019-04-02abs ↗pdf ↗

Controller seeks informative system observations to predict nonlinear dynamics.

problem Predicting nonlinear dynamics with uncertain parameters.
method Expected free energy minimization for balancing goal state and informative observations.
result Controller improves performance in uncertain parameter scenarios.

A core novelty of Alpha Zero is the interleaving of tree search and deep learning, which has proven very successful in board games like Chess, Shogi and Go. These games have a discrete action space. However, many real-world reinforcement learning domains have continuous action spaces, for example in robotic control, na…

2018-05-24abs ↗pdf ↗

We present an approach to identify concise equations from data using a shallow neural network approach. In contrast to ordinary black-box regression, this approach allows understanding functional relations and generalizing them from observed data to unseen parts of the parameter space. We show how to extend the class o…

2018-06-19abs ↗pdf ↗

Empowerment quantifies the influence an agent has on its environment. This is formally achieved by the maximum of the expected KL-divergence between the distribution of the successor state conditioned on a specific action and a distribution where the actions are marginalised out. This is a natural candidate for an intr…

2015-09-28abs ↗pdf ↗

Bayesian optimization outperforms other methods in hyperparameter tuning for reinforcement learning.

problem Finding optimal hyperparameters that generalize across random seeds in reinforcement learning.
method Benchmarked Successive Halving, Random Search, and Bayesian Optimization with and without repetitions on PPO2 algorithms for Cartpole and Inverted Pendulum tasks.
result Bayesian optimization with noise robust acquisition function is the best choice.

Reinforcement learning algorithms can solve dynamic decision-making and optimal control problems. With continuous-valued state and input variables, reinforcement learning algorithms must rely on function approximators to represent the value function and policy mappings. Commonly used numerical approximators, such as ne…

2019-03-22abs ↗pdf ↗

Reinforcement Learning methods are capable of solving complex problems, but resulting policies might perform poorly in environments that are even slightly different. In robotics especially, training and deployment conditions often vary and data collection is expensive, making retraining undesirable. Simulation training…

2018-09-10abs ↗pdf ↗

Novel framework for data sharing and coordinated exploration in concurrent RL with non-identical environments.

problem Learning more data-efficient and better policies in concurrent RL with non-identical environments.
method Proposes a novel algorithmic framework that leverages causal inference via ANM-MM to extract model parameters and a new data sharing scheme based on similarity measures.
result Demonstrates superior learning speeds on various tasks and effectiveness of diverse action selection.

In this paper we show that there are applications that transform the movement of a pendulum into movements in R3\mathbb{R}^3. This can be done using Euler top system of differential equations. On the constant level surfaces, Euler top system reduces to the equation of a pendulum. Those properties are also considered in…

2009-05-27abs ↗pdf ↗

Study of sub-Riemannian problem on specific Lie groups, revealing symmetries and bounds.

problem Sub-Riemannian problem on solvable, non-nilpotent Lie groups.
method Qualitative phase-space analysis of Hamiltonian system, focusing on vertical component.
result Explicit upper bound for cut time in terms of pendulum period.

We present a data-efficient reinforcement learning algorithm resistant to observation noise. Our method extends the highly data-efficient PILCO algorithm (Deisenroth & Rasmussen, 2011) into partially observed Markov decision processes (POMDPs) by considering the filtering process during policy evaluation. PILCO conduct…

2016-02-08abs ↗pdf ↗

Estimates system parameters from a single observation using kernel-based score.

problem Estimating parameters of a dynamical system from a high-dimensional signal.
method Kernel-based score to compare temporal dependencies between signal and model.
result Accuracy and efficiency demonstrated on chaotic systems.

We adapt the ideas underlying the success of Deep Q-Learning to the continuous action domain. We present an actor-critic, model-free algorithm based on the deterministic policy gradient that can operate over continuous action spaces. Using the same learning algorithm, network architecture and hyper-parameters, our algo…

2015-09-09abs ↗pdf ↗

CW-EDMD improves prediction accuracy by learning local Koopman models for different state-space regions.

problem Inefficient global Koopman operator approximation for distinct local dynamics.
method Cluster-Weighted EDMD (CW-EDMD) learns a soft phase-space partition and per-cluster EDMD operators using EM objective.
result CW-EDMD significantly reduces prediction errors across various systems and configurations.

Reinforcement learning is a powerful paradigm for learning optimal policies from experimental data. However, to find optimal policies, most reinforcement learning algorithms explore all possible actions, which may be harmful for real-world systems. As a consequence, learning algorithms are rarely applied on safety-crit…

2017-05-23abs ↗pdf ↗

Discover conservation laws from trajectories using a neural network.

problem Finding invariants and conservation laws from large-scale data without prior knowledge.
method ConservNet, a neural network trained with noise-variance loss to discover hidden invariants in grouped multi-dimensional observables.
result Successfully discovers underlying invariants from simulated and real-world systems.

In this study we introduce a new technique for symbolic regression that guarantees global optimality. This is achieved by formulating a mixed integer non-linear program (MINLP) whose solution is a symbolic mathematical expression of minimum complexity that explains the observations. We demonstrate our approach by redis…

2017-10-29abs ↗pdf ↗

Paper proposes adaptive control for unknown systems using reinforcement learning.

problem Adaptive control for unknown, linearizable systems.
method On-policy reinforcement learning for discrete-time, stochastic systems.
result Stability and tracking errors concentrate near zero with high probability.

We present a self-contained proof of the Gauss-Bonnet theorem for two-dimensional surfaces embedded in R3R^3 using just classical vector calculus. The exposition should be accessible to advanced undergraduate and non-expert graduate students. It may be viewed as an illustration and exercise in multivariate calculus and…

2017-01-06abs ↗pdf ↗

We propose directed time series regression, a new approach to estimating parameters of time-series models for use in certainty equivalent model predictive control. The approach combines merits of least squares regression and empirical optimization. Through a computational study involving a stochastic version of a well …

2012-06-26abs ↗pdf ↗

We study the determination of the second-order normal form for perturbed Hamiltonians Hε=H0+εH1+ε22H2H_ε=H_0 +εH_1 +\frac{ε^2}{2} H_2, relative to the periodic flow of the unperturbed Hamiltonian H0H_0. The formalism presented here is global, and can be easily implemented in any CAS. We illustrate it by means of two examples: the H…

2013-01-15abs ↗pdf ↗

Model-based reinforcement learning methods typically learn models for high-dimensional state spaces by aiming to reconstruct and predict the original observations. However, drawing inspiration from model-free reinforcement learning, we propose learning a latent dynamics model directly from rewards. In this work, we int…

2019-12-09abs ↗pdf ↗

Comparison of UQ methods in deep learning for a simple physical system.

problem Uncertainty quantification in deep learning for physical systems.
method Bayesian Neural Networks (BNN), Concrete Dropout (CD), Deep Ensembles (DE), and Analytic Error Propagation.
result Pitfalls in using UQ methods, especially Bayesian Neural Networks and Concrete Dropout.

New AI learns like neurons, generalizing from sparse rewards.

problem Designing AI that learns without explicit instructions and applies that learning to sparse reward scenarios.
method Combining neuroscience principles with computational efficiency, creating the Neurons-in-a-Box architecture.
result The architecture can learn efficiently and generalize across various tasks, including challenging environments.

Almost toric manifolds form a class of singular Lagrangian fibered symplectic manifolds that is a natural generalization of toric manifolds. Notable examples include the K3 surface, the phase space of the spherical pendulum and rational balls useful for symplectic surgeries. The main result of the paper is a complete c…

2003-12-08abs ↗pdf ↗

We consider magnetic geodesic flows of the normal metrics on a class of homogeneous spaces, in particular (co)adjoint orbits of compact Lie groups. We give the proof of the non-commutative integrability of flows and show, in addition, for the case of (co)adjoint orbits, the usual Liouville integrability by means of ana…

2006-09-02abs ↗pdf ↗

Model learns and plans in real-time under constraints for robotic systems.

problem Challenges in applying reinforcement learning to robotic systems, especially handling continuous state and action spaces, time/resource budget, and hard constraints.
method Combines Gaussian Process regression and Receding Horizon Control. Uses sparse spectrum Gaussian Processes for incremental model updates from sensory data.
result Demonstrates benefits of online learning on autonomous racing tasks and reusability of learned dynamics.

This paper detects Markov violations in RL with noise, improving policy development.

problem Partial observability and sensor/actuator noise invalidate Markovian assumptions in RL.
method Combines PCMCI causal discovery with Markov Violation score (MVS).
result Even substantial noise doesn't always disrupt multi-step dependencies.

We briefly review the notion of second order constrained (continuous) system (SOCS) and then propose a discrete time counterpart of it, which we naturally call discrete second order constrained system (DSOCS). To illustrate and test numerically our model, we construct certain integrators that simulate the evolution of …

2013-12-06abs ↗pdf ↗

We study the motion of a particle in the hyperbolic plane (embedded in Minkowski space), under the action of a potential that depends only on one variable. This problem is the analogous to the spherical pendulum in a unidirectional force field. However, for the discussion of the hyperbolic plane one has to distinguish …

2013-05-16abs ↗pdf ↗

Neural SVEs model complex systems with memory, outperforming traditional methods.

problem Modeling systems with memory effects and irregular behavior.
method Introducing neural stochastic Volterra equations as a physics-inspired architecture.
result Neural SVEs outperform neural SDEs and DeepONets in various applications.

Policy gradient algorithms typically combine discounted future rewards with an estimated value function, to compute the direction and magnitude of parameter updates. However, for most Reinforcement Learning tasks, humans can provide additional insight to constrain the policy learning. We introduce a general method to i…

2019-04-05abs ↗pdf ↗

Learning to make decisions from observed data in dynamic environments remains a problem of fundamental importance in a number of fields, from artificial intelligence and robotics, to medicine and finance. This paper concerns the problem of learning control policies for unknown linear dynamical systems so as to maximize…

2018-06-01abs ↗pdf ↗