
Learning the Structure of AutoEncoding Recommenders
Autoencoder recommenders have recently shown stateoftheart performanc...
read it

Sidestepping the Triangulation Problem in Bayesian Net Computations
This paper presents a new approach for computing posterior probabilities...
read it

Incremental computation of the value of perfect information in stepwisedecomposable influence diagrams
To determine the value of perfect information in an influence diagram, o...
read it

Intercausal Independence and Heterogeneous Factorization
It is well known that conditional independence can be used to factorize ...
read it

Solving Asymmetric Decision Problems with Influence Diagrams
While influence diagrams have many advantages as a representation framew...
read it

Fast Value Iteration for GoalDirected Markov Decision Processes
Planning problems where effects of actions are nondeterministic can be ...
read it

Independence of Causal Influence and Clique Tree Propagation
This paper explores the role of independence of causal influence (ICI) i...
read it

RegionBased Approximations for Planning in Stochastic Domains
This paper is concerned with planning in stochastic domains by means of ...
read it

Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes
Most exact algorithms for general partially observable Markov decision p...
read it

Planning with Partially Observable Markov Decision Processes: Advances in Exact Solution Method
There is much interest in using partially observable Markov decision pro...
read it

Probabilistic Inference in Influence Diagrams
This paper is about reducing influence diagram (ID) evaluation into Baye...
read it

A Method for Speeding Up Value Iteration in Partially Observable Markov Decision Processes
We present a technique for speeding up the convergence of value iteratio...
read it

Dimension Correction for Hierarchical Latent Class Models
Model complexity is an important factor to consider when selecting among...
read it

A ModelBased Approach to Rounding in Spectral Clustering
In spectral clustering, one defines a similarity matrix for a collection...
read it
Nevin Lianwen Zhang
is this you? claim profile
Professor at The Hong Kong University of Science and Technology