EDBT 2026 Demo / reviewers in the wild / expert
Motoya Ohnishi
dblp:207/9907
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 2020
0000-0003-4306-3127ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
3 papers |
Reinforcement learning · 55% Motion planning and robot control · 17% Kernel, tree and ensemble methods · 14% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Kernel, tree and ensemble methods › kernel methods
reproducing kernel hilbert space |
0.5 | 2 | 2020 | Continuous-time Value Function Approximation in Reproducing Kernel Hilbert Spaces · NeurIPS 2018 Information Theoretic Regret Bounds for Online Nonlinear Control · NeurIPS 2020 |
Robotics › Motion planning and robot control › robot control
nonlinear control |
0.4 | 1 | 2020 | Information Theoretic Regret Bounds for Online Nonlinear Control · NeurIPS 2020 |
Machine learning › Reinforcement learning
online control |
0.4 | 1 | 2020 | Information Theoretic Regret Bounds for Online Nonlinear Control · NeurIPS 2020 |
Machine learning › Learning theory › online learning
regret bounds |
0.4 | 1 | 2020 | Information Theoretic Regret Bounds for Online Nonlinear Control · NeurIPS 2020 |
Machine learning › Reinforcement learning
safe reinforcement learning |
0.4 | 1 | 2019 | Barrier-Certified Adaptive Reinforcement Learning With Applications to Brushbot Navigation · IEEE Trans. Robotics 2019 |
Machine learning › Reinforcement learning
continuous-time reinforcement learning |
0.3 | 1 | 2018 | Continuous-time Value Function Approximation in Reproducing Kernel Hilbert Spaces · NeurIPS 2018 |
Machine learning › Reinforcement learning › value function approximation
kernel-based value function approximation |
0.3 | 1 | 2018 | Continuous-time Value Function Approximation in Reproducing Kernel Hilbert Spaces · NeurIPS 2018 |
Machine learning › Reinforcement learning
value function approximation |
0.3 | 1 | 2018 | Continuous-time Value Function Approximation in Reproducing Kernel Hilbert Spaces · NeurIPS 2018 |
Robotics › Motion planning and robot control
nonlinear dynamics |
0.1 | 1 | 2020 | Information Theoretic Regret Bounds for Online Nonlinear Control · NeurIPS 2020 |
Methods — techniques the papers use, named apart from their topics
lower confidence bound · 0.4RKHS · 0.4sparse optimization · 0.4kernel-based function estimation · 0.4control barrier certificates · 0.4kernel adaptive filter · 0.3gaussian process · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Information Theoretic Regret Bounds for Online Nonlinear ControlabstractThis work studies the problem of sequential control in an unknown, nonlinear dynamical system, where we model the underlying system dynamics as an unknown function in a known Reproducing Kernel Hilbert Space. This framework yields a general setting that permits discrete and continuous control inputs as well as non-smooth, non-differentiable dynamics. Our main result, the Lower Confidence-based Continuous Control (LC3) algorithm, enjoys a near-optimal $O(\sqrt{T})$ regret bound against the optimal controller in episodic settings, where $T$ is the number of episodes. The bound has no explicit dependence on dimension of the system dynamics, which could be infinite, but instead only depends on information theoretic quantities. We empirically show its application to a number of nonlinear control tasks and demonstrate the benefit of exploration for learning model dynamics. Sham M. Kakade, Akshay Krishnamurthy, Kendall Lowrey, Motoya Ohnishi, Wen Sun 0002 |
NeurIPS | 4 |
| 2019 | Barrier-Certified Adaptive Reinforcement Learning With Applications to Brushbot NavigationabstractThis paper presents a safe learning framework that employs an adaptive model learning algorithm together with barrier certificates for systems with possibly nonstationary agent dynamics. To extract the dynamic structure of the model, we use a sparse optimization technique. We use the learned model in combination with control barrier certificates that constrain policies (feedback controllers) in order to maintain safety, which refers to avoiding particular undesirable regions of the state space. Under certain conditions, recovery of safety in the sense of Lyapunov stability after violations of safety due to the nonstationarity is guaranteed. In addition, we reformulate an action-value function approximation to make any kernel-based nonlinear function estimation method applicable to our adaptive learning framework. Lastly, solutions to the barrier-certified policy optimization are guaranteed to be globally optimal, ensuring the greedy policy improvement under mild conditions. The resulting framework is validated via simulations of a quadrotor, which has previously been used under stationarity assumptions in the safe learnings literature, and is then tested on a real robot, the brushbot, whose dynamics is unknown, highly complex, and nonstationary. Motoya Ohnishi, Li Wang 0050, Gennaro Notomista, Magnus Egerstedt |
IEEE Trans. Robotics | 1 |
| 2018 | Continuous-time Value Function Approximation in Reproducing Kernel Hilbert SpacesabstractMotivated by the success of reinforcement learning (RL) for discrete-time tasks such as AlphaGo and Atari games, there has been a recent surge of interest in using RL for continuous-time control of physical systems (cf. many challenging tasks in OpenAI Gym and DeepMind Control Suite). Since discretization of time is susceptible to error, it is methodologically more desirable to handle the system dynamics directly in continuous time. However, very few techniques exist for continuous-time RL and they lack flexibility in value function approximation. In this paper, we propose a novel framework for model-based continuous-time value function approximation in reproducing kernel Hilbert spaces. The resulting framework is so flexible that it can accommodate any kind of kernel-based approach, such as Gaussian processes and kernel adaptive filters, and it allows us to handle uncertainties and nonstationarity without prior knowledge about the environment or what basis functions to employ. We demonstrate the validity of the presented framework through experiments. Motoya Ohnishi, Masahiro Yukawa, Masashi Sugiyama |
NeurIPS | 1 |