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

Netanel Yannay

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

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

Artificial intelligence and machine learning · 1 · 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
Robot navigation and mapping · 33% Probabilistic and Bayesian machine learning · 33% Motion planning and robot control · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › bayesian filtering
kalman filtering
0.712023
Optimization or Architecture: How to Hack Kalman Filtering · NeurIPS 2023
Robotics › Motion planning and robot control
parameter tuning
0.712023
Optimization or Architecture: How to Hack Kalman Filtering · NeurIPS 2023
Robotics › Robot navigation and mapping
state estimation
0.712023
Optimization or Architecture: How to Hack Kalman Filtering · NeurIPS 2023

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

neural network · 0.7gradient-based optimization · 0.7
YearPublicationVenuePosition
2023 Optimization or Architecture: How to Hack Kalman Filtering
abstract
In non-linear filtering, it is traditional to compare non-linear architectures such as neural networks to the standard linear Kalman Filter (KF). We observe that this mixes the evaluation of two separate components: the non-linear architecture, and the parameters optimization method. In particular, the non-linear model is often optimized, whereas the reference KF model is not. We argue that both should be optimized similarly, and to that end present the Optimized KF (OKF). We demonstrate that the KF may become competitive to neural models – if optimized using OKF. This implies that experimental conclusions of certain previous studies were derived from a flawed process. The advantage of OKF over the standard KF is further studied theoretically and empirically, in a variety of problems. Conveniently, OKF can replace the KF in real-world systems by merely updating the parameters.
Ido Greenberg, Netanel Yannay, Shie Mannor
NeurIPS2