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

Bastian Jung

dblp:318/3090 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

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
Learning paradigms · 33% Probabilistic and Bayesian machine learning · 33% Motion planning and robot control · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning
dynamical system
0.612022
Efficient learning of nonlinear prediction models with time-series privileged information · NeurIPS 2022
Machine learning › Learning paradigms › supervised learning
learning using privileged information
0.612022
Efficient learning of nonlinear prediction models with time-series privileged information · NeurIPS 2022
Robotics › Motion planning and robot control › system identification
nonlinear system identification
0.612022
Efficient learning of nonlinear prediction models with time-series privileged information · NeurIPS 2022

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

representation learning · 0.6random features · 0.6
YearPublicationVenuePosition
2022 Efficient learning of nonlinear prediction models with time-series privileged information
abstract
In domains where sample sizes are limited, efficient learning algorithms are critical. Learning using privileged information (LuPI) offers increased sample efficiency by allowing prediction models access to auxiliary information at training time which is unavailable when the models are used. In recent work, it was shown that for prediction in linear-Gaussian dynamical systems, a LuPI learner with access to intermediate time series data is never worse and often better in expectation than any unbiased classical learner. We provide new insights into this analysis and generalize it to nonlinear prediction tasks in latent dynamical systems, extending theoretical guarantees to the case where the map connecting latent variables and observations is known up to a linear transform. In addition, we propose algorithms based on random features and representation learning for the case when this map is unknown. A suite of empirical results confirm theoretical findings and show the potential of using privileged time-series information in nonlinear prediction.
Bastian Jung, Fredrik D. Johansson
NeurIPS1