Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Orest Xherija

dblp:267/1592 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1

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
1 paper
Reinforcement learning · 38% Learning theory · 38% Motion planning and robot control · 23%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory
linear dynamical system learning
0.412020
Memory-Efficient Learning of Stable Linear Dynamical Systems for Prediction and Control · NeurIPS 2020
Machine learning › Reinforcement learning
model-based reinforcement learning
0.412020
Memory-Efficient Learning of Stable Linear Dynamical Systems for Prediction and Control · NeurIPS 2020
Robotics › Motion planning and robot control
manipulator control
0.112020
Memory-Efficient Learning of Stable Linear Dynamical Systems for Prediction and Control · NeurIPS 2020
Robotics › Motion planning and robot control
robot control
0.112020
Memory-Efficient Learning of Stable Linear Dynamical Systems for Prediction and Control · NeurIPS 2020

Methods — techniques the papers use, named apart from their topics

stability characterization · 0.4gradient descent · 0.4
YearPublicationVenuePosition
2020 Memory-Efficient Learning of Stable Linear Dynamical Systems for Prediction and Control
abstract
Learning a stable Linear Dynamical System (LDS) from data involves creating models that both minimize reconstruction error and enforce stability of the learned representation. We propose a novel algorithm for learning stable LDSs. Using a recent characterization of stable matrices, we present an optimization method that ensures stability at every step and iteratively improves the reconstruction error using gradient directions derived in this paper. When applied to LDSs with inputs, our approach---in contrast to current methods for learning stable LDSs---updates both the state and control matrices, expanding the solution space and allowing for models with lower reconstruction error. We apply our algorithm in simulations and experiments to a variety of problems, including learning dynamic textures from image sequences and controlling a robotic manipulator. Compared to existing approaches, our proposed method achieves an \textit{orders-of-magnitude} improvement in reconstruction error and superior results in terms of control performance. In addition, it is \textit{provably} more memory efficient, with an $\mathcal{O}(n^2)$ space complexity compared to $\mathcal{O}(n^4)$ of competing alternatives, thus scaling to higher-dimensional systems when the other methods fail. The code of the proposed algorithm and animations of the results can be found at https://github.com/giorgosmamakoukas/MemoryEfficientStableLDS.
Giorgos Mamakoukas, Orest Xherija, Todd D. Murphey
NeurIPS2