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

Richa Rastogi

dblp:163/0918 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 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
Probabilistic and Bayesian machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process
0.712023
Semi-Parametric Inducing Point Networks and Neural Processes · ICLR 2023
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › gaussian process
inducing point methods
0.712023
Semi-Parametric Inducing Point Networks and Neural Processes · ICLR 2023
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › gaussian process
neural processes
0.712023
Semi-Parametric Inducing Point Networks and Neural Processes · ICLR 2023
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
semiparametric model
0.212023
Semi-Parametric Inducing Point Networks and Neural Processes · ICLR 2023

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

neural processes · 0.7inducing points · 0.7
YearPublicationVenuePosition
2025 MultiScale Contextual Bandits for Long Term Objectives
abstract
The feedback that AI systems (e.g., recommender systems, chatbots) collect from user interactions is a crucial source of training data. While short-term feedback (e.g., clicks, engagement) is widely used for training, there is ample evidence that optimizing short-term feedback does not necessarily achieve the desired long-term objectives. Unfortunately, directly optimizing for long-term objectives is challenging, and we identify the disconnect in the timescales of short-term interventions (e.g., rankings) and the long-term feedback (e.g., user retention) as one of the key obstacles. To overcome this disconnect, we introduce the framework of MultiScale Policy Learning to contextually reconcile that AI systems need to act and optimize feedback at multiple interdependent timescales. Following a PAC-Bayes motivation, we show how the lower timescales with more plentiful data can provide a data-dependent hierarchical prior for faster learning at higher scales, where data is more scarce. As a result, the policies at all levels effectively optimize for the long-term. We instantiate the framework with MultiScale Off-Policy Bandit Learning (MSBL) and demonstrate its effectiveness on three tasks relating to recommender and conversational systems.
Richa Rastogi, Yuta Saito, Thorsten Joachims
NeurIPS1
2023 Semi-Parametric Inducing Point Networks and Neural Processes
Richa Rastogi, Yair Schiff, Alon Hacohen, Zhaozhi Li, Ian Lee, Yuntian Deng, Mert R. Sabuncu, Volodymyr Kuleshov
ICLR1