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

Priscilla Ong

dblp:340/4317 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0007-0598-8571ORCID · verified

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

Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 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
2 papers
Probabilistic and Bayesian machine learning · 53% Generative modeling · 23% Reinforcement learning · 17%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process
0.912025
Bayesian Basis Function Approximation for Scalable Gaussian Process Priors in Deep Generative Models · ICML 2025
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › gaussian process
gaussian process prior
0.912025
Bayesian Basis Function Approximation for Scalable Gaussian Process Priors in Deep Generative Models · ICML 2025
Machine learning › Generative modeling
variational autoencoder
0.912025
Bayesian Basis Function Approximation for Scalable Gaussian Process Priors in Deep Generative Models · ICML 2025
Machine learning › Reinforcement learning
offline reinforcement learning
0.712023
Deep Offline Reinforcement Learning for Real-world Treatment Optimization Applications · KDD 2023
Machine learning › Probabilistic and Bayesian machine learning › structured models
latent variable model
0.312025
Bayesian Basis Function Approximation for Scalable Gaussian Process Priors in Deep Generative Models · ICML 2025
Machine learning › Time series and sequential data
time series modeling
0.312025
Bayesian Basis Function Approximation for Scalable Gaussian Process Priors in Deep Generative Models · ICML 2025
Medical and health informatics › clinical decision-making
treatment optimization
0.212023
Deep Offline Reinforcement Learning for Real-world Treatment Optimization Applications · KDD 2023

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

transition sampling · 1.3conservative q-learning · 1.3variational inference · 0.9inducing points · 0.9basis function approximation · 0.9
YearPublicationVenuePosition
2025 Bayesian Basis Function Approximation for Scalable Gaussian Process Priors in Deep Generative Models
abstract
High-dimensional time-series datasets are common in domains such as healthcare and economics. Variational autoencoder (VAE) models, where latent variables are modeled with a Gaussian process (GP) prior, have become a prominent model class to analyze such correlated datasets. However, their applications are challenged by the inherent cubic time complexity that requires specific GP approximation techniques, as well as the general challenge of modeling both shared and individual-specific correlations across time. Though inducing points enhance GP prior VAE scalability, optimizing them remains challenging, especially since discrete covariates resist gradient‑based methods. In this work, we propose a scalable basis function approximation technique for GP prior VAEs that mitigates these challenges and results in linear time complexity, with a global parametrization that eliminates the need for amortized variational inference and the associated amortization gap, making it well-suited for conditional generation tasks where accuracy and efficiency are crucial. Empirical evaluations on synthetic and real-world benchmark datasets demonstrate that our approach not only improves scalability and interpretability but also drastically enhances predictive performance.
Mehmet Yigit Balik, Maksim Sinelnikov, Priscilla Ong, Harri Lähdesmäki
ICML3
2023 Deep Offline Reinforcement Learning for Real-world Treatment Optimization Applications
abstract
There is increasing interest in data-driven approaches for recommending optimal treatment strategies in many chronic disease management and critical care applications. Reinforcement learning methods are well-suited to this sequential decision-making problem, but must be trained and evaluated exclusively on retrospective medical record datasets as direct online exploration is unsafe and infeasible. Despite this requirement, the vast majority of treatment optimization studies use off-policy RL methods (e.g., Double Deep Q Networks (DDQN) or its variants) that are known to perform poorly in purely offline settings. Recent advances in offline RL, such as Conservative Q-Learning (CQL), offer a suitable alternative. But there remain challenges in adapting these approaches to real-world applications where suboptimal examples dominate the retrospective dataset and strict safety constraints need to be satisfied. In this work, we introduce a practical and theoretically grounded transition sampling approach to address action imbalance during offline RL training. We perform extensive experiments on two real-world tasks for diabetes and sepsis treatment optimization to compare performance of the proposed approach against prominent off-policy and offline RL baselines (DDQN and CQL). Across a range of principled and clinically relevant metrics, we show that our proposed approach enables substantial improvements in expected health outcomes and in consistency with relevant practice and safety guidelines.
Milashini Nambiar, Supriyo Ghosh, Priscilla Ong, Yu En Chan, Yong Mong Bee, Pavitra Krishnaswamy
KDD3