Recurrent machines for likelihood-free inference Arthur Pesah - - PowerPoint PPT Presentation

recurrent machines for likelihood free inference
SMART_READER_LITE
LIVE PREVIEW

Recurrent machines for likelihood-free inference Arthur Pesah - - PowerPoint PPT Presentation

Recurrent machines for likelihood-free inference Arthur Pesah Antoine Wehenkel Gilles Louppe KTH ULige ULige 1 Likelihood-free Inference 2 Likelihood-free inference: what? Parameters Goal Finding the parameters corresponding to


slide-1
SLIDE 1

Recurrent machines for likelihood-free inference

Antoine Wehenkel

ULiège

1

Arthur Pesah

KTH

Gilles Louppe

ULiège

slide-2
SLIDE 2

Likelihood-free Inference

2

slide-3
SLIDE 3

Likelihood-free inference: what?

Simulator

Likelihood Parameters Goal Finding the parameters corresponding to real data But... We don’t have the likelihood!

3

How? Maximum likelihood Real data

slide-4
SLIDE 4

Likelihood-free inference: when?

4

slide-5
SLIDE 5

Likelihood-free inference: when?

5

Example: Population biology

The evolution of a population can be modelled by a differential equation that can be solved by a simulator (numerical solver). ODE Solver Coefficients of the differential equations.

slide-6
SLIDE 6

Particle Physics

Likelihood-free inference: when?

6

Particle accelerators (like the LHC) produce particle collisions and

  • bserve the resulting particles with

detectors. Particle collisions simulator (e.g. Geant4) Physical constants (mass of particles, strength of interactions, etc.) Detectors response after a collision

slide-7
SLIDE 7

Likelihood-free inference: how?

7

slide-8
SLIDE 8

Likelihood-free inference: how?

8

What can we do?

slide-9
SLIDE 9

Likelihood-free inference: how?

9

Idea 1: choose a random parameter and simulate it Problem: nothing to do next

slide-10
SLIDE 10

Likelihood-free inference: how?

10

Proposal distribution: Idea 2: sample several parameters from a distribution and simulate them

slide-11
SLIDE 11

Likelihood-free inference: how?

11

Proposal distribution: Then: comparing the different simulated data and choosing an appropriate direction

slide-12
SLIDE 12

Likelihood-free inference: how?

How to choose the best direction in the parameter space?

  • Some algorithms rely on a predefined update rule and a handcrafted similarity measure

between the generated and the real samples.

  • Why not learning this optimization procedure and the similarity measure?
slide-13
SLIDE 13

Likelihood-free inference with meta-learning

13

slide-14
SLIDE 14

Likelihood-free inference with meta-learning

14

Before meta-training After meta-training

slide-15
SLIDE 15

ALFI: Automatic Likelihood-free Inference

Principle: learning a descent using an Recurrent Neural Network

RNN

15

slide-16
SLIDE 16

Simulator

Likelihood-free inference with meta-learning

Simulator Simulator Simulator Simulator Simulator

16

Generate a meta-dataset

slide-17
SLIDE 17

Simulator ALFI

Likelihood-free inference with meta-learning

Simulator ALFI Simulator ALFI Simulator ALFI Simulator ALFI Simulator ALFI

17

Generate a meta-dataset Automatic Likelihood-Free Inference (the name of our RNN-based machine)

slide-18
SLIDE 18

ALFI: Automatic Likelihood-free Inference

Principle: learning a descent using an Recurrent Neural Network

Problem: 1 Step: 1/3

18

slide-19
SLIDE 19

ALFI: Automatic Likelihood-free Inference

Principle: learning a descent using an Recurrent Neural Network

Problem: 1 Step: 2/3

19

slide-20
SLIDE 20

ALFI: Automatic Likelihood-free Inference

Principle: learning a descent using an Recurrent Neural Network

Problem: 1 Step: 3/3

20

slide-21
SLIDE 21

ALFI: Automatic Likelihood-free Inference

Principle: learning a descent using an Recurrent Neural Network

Problem: 200 Step: 1/3

21

slide-22
SLIDE 22

ALFI: Automatic Likelihood-free Inference

Principle: learning a descent using an Recurrent Neural Network

Problem: 200 Step: 2/3

22

slide-23
SLIDE 23

ALFI: Automatic Likelihood-free Inference

Principle: learning a descent using an Recurrent Neural Network

Problem: 200 Step: 3/3

23

slide-24
SLIDE 24

Results

Poisson:

24

With a known likelihood function: With an unknown likelihood function:

Weinberg:

  • Electron muon collision.
  • Parameters are the

beam energy and the fermi constant.

  • Observations are the

angle between the two muons.

slide-25
SLIDE 25

Limitations and future work

25

Limitations

  • Scaling it up on more complex simulators
  • Learning intensive in the number of simulator calls

Future work

  • Getting a better understanding of the optimization procedure learned by ALFI:

○ Is it comparable to other existing methods? ○ Does it generalize to other simulators?

  • Training the model on more complex simulators and compare it to state-of-the-art

likelihood-free inference methods

slide-26
SLIDE 26

Conclusion

26

Thanks

ArXiv: 1811.12932 - Recurrent machines for likelihood-free inference GitHub: github.com/artix41/ALFI-pytorch