← Search

Gal Novik

8 accepted papers

2023

From Temporal to Contemporaneous Iterative Causal Discovery in the Presence of Latent Confounders

ICML 2023poster

We present a constraint-based algorithm for learning causal structures from observational time-series data, in the presence of latent confounders. We assume a discrete-time, stationary structural vector autoregressive process, with both temporal and contemporaneous causal relations. One may ask if t…

2022

Validate on Sim, Detect on Real - Model Selection for Domain Randomization

ICRA 2022poster

A practical approach to learning robot skills, often termed sim2real, is to train control policies in simulation and then deploy them on a real robot. Popular sim2real techniques build on domain randomization (DR) - training the policy on diverse randomly generated domains for better generalization…

Cited by 7SourceScholar
2021

Efficient Self-Supervised Data Collection for Offline Robot Learning

ICRA 2021poster

A practical approach to robot reinforcement learning is to first collect a large batch of real or simulated robot interaction data, using some data collection policy, and then learn from this data to perform various tasks, using offline learning algorithms. Previous work focused on manually designin…

Cited by 12SourceScholar
2021

Iterative Causal Discovery in the Possible Presence of Latent Confounders and Selection Bias

NeurIPS 2021poster

We present a sound and complete algorithm, called iterative causal discovery (ICD), for recovering causal graphs in the presence of latent confounders and selection bias. ICD relies on the causal Markov and faithfulness assumptions and recovers the equivalence class of the underlying causal graph. I…

2019

Modeling Uncertainty by Learning a Hierarchy of Deep Neural Connections

NeurIPS 2019poster

Modeling uncertainty in deep neural networks, despite recent important advances, is still an open problem. Bayesian neural networks are a powerful solution, where the prior over network weights is a design choice, often a normal distribution or other distribution encouraging sparsity. However, this…

Cited by 18SourcePDFScholar
2018

Bayesian Structure Learning by Recursive Bootstrap

NeurIPS 2018poster

We address the problem of Bayesian structure learning for domains with hundreds of variables by employing non-parametric bootstrap, recursively. We propose a method that covers both model averaging and model selection in the same framework. The proposed method deals with the main weakness of constra…

2018

Constructing Deep Neural Networks by Bayesian Network Structure Learning

NeurIPS 2018poster

We introduce a principled approach for unsupervised structure learning of deep neural networks. We propose a new interpretation for depth and inter-layer connectivity where conditional independencies in the input distribution are encoded hierarchically in the network structure. Thus, the depth of th…

Cited by 42SourcePDFScholar