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

Ruian Shi

dblp:238/2739 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 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
2 papers
Probabilistic and Bayesian machine learning · 57% Time series and sequential data · 23% Deep learning architectures and training · 15%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning
causal inference
0.712023
Structured Neural Networks for Density Estimation and Causal Inference · NeurIPS 2023
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
density estimation
0.712023
Structured Neural Networks for Density Estimation and Causal Inference · NeurIPS 2023
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal model
structural equation models
0.712023
Structured Neural Networks for Density Estimation and Causal Inference · NeurIPS 2023
Machine learning › Deep learning architectures and training
structured neural networks
0.712023
Structured Neural Networks for Density Estimation and Causal Inference · NeurIPS 2023
Machine learning › Time series and sequential data
change-point detection
0.512021
Segmenting Hybrid Trajectories using Latent ODEs · ICML 2021
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model › latent state space model
latent ODE
0.512021
Segmenting Hybrid Trajectories using Latent ODEs · ICML 2021
Machine learning › Time series and sequential data
time series modeling
0.512021
Segmenting Hybrid Trajectories using Latent ODEs · ICML 2021
Machine learning › Generative modeling
normalizing flow
0.212023
Structured Neural Networks for Density Estimation and Causal Inference · NeurIPS 2023

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

normalizing flow · 0.7masking · 0.7binary matrix factorization · 0.7pruned exact linear time · 0.5marginal likelihood · 0.5
YearPublicationVenuePosition
2023 Structured Neural Networks for Density Estimation and Causal Inference
abstract
Injecting structure into neural networks enables learning functions that satisfy invariances with respect to subsets of inputs. For instance, when learning generative models using neural networks, it is advantageous to encode the conditional independence structure of observed variables, often in the form of Bayesian networks. We propose the Structured Neural Network (StrNN), which injects structure through masking pathways in a neural network. The masks are designed via a novel relationship we explore between neural network architectures and binary matrix factorization, to ensure that the desired independencies are respected. We devise and study practical algorithms for this otherwise NP-hard design problem based on novel objectives that control the model architecture. We demonstrate the utility of StrNN in three applications: (1) binary and Gaussian density estimation with StrNN, (2) real-valued density estimation with Structured Autoregressive Flows (StrAFs) and Structured Continuous Normalizing Flows (StrCNF), and (3) interventional and counterfactual analysis with StrAFs for causal inference. Our work opens up new avenues for learning neural networks that enable data-efficient generative modeling and the use of normalizing flows for causal effect estimation.
Asic Q. Chen, Ruian Shi, Xiang Gao 0019, Ricardo Baptista, Rahul G. Krishnan
NeurIPS2
2022 PAN-cODE: COVID-19 forecasting using conditional latent ODEs
abstract
The coronavirus disease 2019 (COVID-19) pandemic has caused millions of deaths around the world and revealed the need for data-driven models of pandemic spread. Accurate pandemic caseload forecasting allows informed policy decisions on the adoption of non-pharmaceutical interventions (NPIs) to reduce disease transmission. Using COVID-19 as an example, we present Pandemic conditional Ordinary Differential Equation (PAN-cODE), a deep learning method to forecast daily increases in pandemic infections and deaths. By using a deep conditional latent variable model, PAN-cODE can generate alternative caseload trajectories based on alternate adoptions of NPIs, allowing stakeholders to make policy decisions in an informed manner. PAN-cODE also allows caseload estimation for regions that are unseen during model training. We demonstrate that, despite using less detailed data and having fully automated training, PAN-cODE's performance is comparable to state-of-the-art methods on 4-week-ahead and 6-week-ahead forecasting. Finally, we highlight the ability of PAN-cODE to generate realistic alternative outcome trajectories on select US regions.
Ruian Shi, Haoran Zhang 0003, Quaid Morris
J. Am. Medical Informatics Assoc.1
2021 Segmenting Hybrid Trajectories using Latent ODEs
abstract
Smooth dynamics interrupted by discontinuities are known as hybrid systems and arise commonly in nature. Latent ODEs allow for powerful representation of irregularly sampled time series but are not designed to capture trajectories arising from hybrid systems. Here, we propose the Latent Segmented ODE (LatSegODE), which uses Latent ODEs to perform reconstruction and changepoint detection within hybrid trajectories featuring jump discontinuities and switching dynamical modes. Where it is possible to train a Latent ODE on the smooth dynamical flows between discontinuities, we apply the pruned exact linear time (PELT) algorithm to detect changepoints where latent dynamics restart, thereby maximizing the joint probability of a piece-wise continuous latent dynamical representation. We propose usage of the marginal likelihood as a score function for PELT, circumventing the need for model-complexity-based penalization. The LatSegODE outperforms baselines in reconstructive and segmentation tasks including synthetic data sets of sine waves, Lotka Volterra dynamics, and UCI Character Trajectories.
Ruian Shi, Quaid Morris
ICML1