Automatic physical inference with information maximising neural - PowerPoint PPT Presentation

Jun 05, 2023 •15 likes •75 views

Automatic physical inference with information maximising neural networks Physical Review D 97 , 083004 arXiv:1802.03537 github:information_maximiser Tom Charnock Institut dAstrophysique de Paris charnock@iap.fr DOI 10.5281/zenodo.1175196

Automatic physical inference with information maximising neural networks Physical Review D 97 , 083004 arXiv:1802.03537 github:information_maximiser Tom Charnock Institut d’Astrophysique de Paris charnock@iap.fr DOI 10.5281/zenodo.1175196 DOI 10.5281/zenodo.1175196
How would we like to do inference? 𝓆 ( d ) arXiv:1802.03537, Physical Review D 97 , 083004, charnock@iap.fr Tom Charnock ℒ( d |𝜄) 20.0 17.5 Simulated quasar flux [Photon counts] 15.0 12.5 10.0 7.5 5.0 2.5 410 420 430 440 450 460 [nm] ( | d ) 𝒬 (𝜄| d ) = ℒ( d |𝜄) 𝓆 (𝜄) 4 2 0 2 4 Amplitude of scalar perturbation scaling ln DOI DOI 10.5281/zenodo.1175196 10.5281/zenodo.1175196
How can we do inference without a likelihood? arXiv:1802.03537, Physical Review D 97 , 083004, charnock@iap.fr Tom Charnock 𝒼 ∶ d → 𝓎 {𝜄|𝜄 ↶ 𝓆 (𝜄)} 20.0 20 17.5 Simulated quasar flux Simulated quasar flux [Photon counts] [Photon counts] 15.0 15 12.5 10.0 10 7.5 5 5.0 2.5 0 410 420 430 440 450 460 410 420 430 440 450 460 [nm] [nm] 30 Compressed summary 20 10 ( | x ) 0 10 20 30 4 2 0 2 4 4 2 0 2 4 Amplitude of scalar perturabtion scaling Amplitude of scalar perturbation scaling ln ln DOI DOI 10.5281/zenodo.1175196 10.5281/zenodo.1175196
How can we fjnd the summaries? Tom Charnock charnock@iap.fr Physical Review D 97 , 083004, arXiv:1802.03537, DOI DOI 10.5281/zenodo.1175196 10.5281/zenodo.1175196
Automatic physical inference with information maximising neural networks Tom Charnock charnock@iap.fr Physical Review D 97 , 083004, arXiv:1802.03537, ▶ Simulate data at a fjducial parameter value ▶ Train the network to increase the Fisher information ▶ Compress real data using trained network ▶ Do ABC with the optimally compressed summaries DOI DOI 10.5281/zenodo.1175196 10.5281/zenodo.1175196
Automatic physical inference with information maximising neural networks Physical Review D 97 , 083004 arXiv:1802.03537 github:information_maximiser Tom Charnock Institut d’Astrophysique de Paris charnock@iap.fr DOI 10.5281/zenodo.1175196 DOI 10.5281/zenodo.1175196

Download Presentation

Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Hindley-Milner Type Checking Automatic Type Inference What can be inferred about type of f or x

CSE340 Principles of Programming Languages Hindley-Milner Type Checking Automatic Type Inference What can be inferred about type of f or x from this definition? f(x) = x Automatic Type Inference f(x) = x f is a function that takes a single

1.31k views • 73 slides

Maximising the value of your business: Insights and Best Practices 21 May 2015 | The

Maximising the value of your business: Insights and Best Practices 21 May 2015 | The Runnymede-on-Thames Hotel Welcome agenda Maximising value, more than just about the numbers 08:20 Ian Barton, HMT LLP Maximising the value of

613 views • 34 slides

Towards Automatic Inference of Task Hierarchies in Complex Systems Haohui Mai Chongnan Gao

Overview Design & Implementation Case Study Conclusion Acknowledgment References Towards Automatic Inference of Task Hierarchies in Complex Systems Haohui Mai Chongnan Gao Xuezheng Liu Xi Wang Geoffrey M. Voelker

566 views • 22 slides

Automatic Inference of Structural Changes for Matching Across Program Versions Miryung Kim,

Automatic Inference of Structural Changes for Matching Across Program Versions Miryung Kim, David Notkin, Dan Grossman Computer Science & Engineering University of Washington Foo.mA(float) Foo.mA() Foo.mB(float) Foo.mB() Foo.mC()

730 views • 52 slides

Automatic Posterior Transformation for Likelihood-free Inference David S Greenberg Marcel

Automatic Posterior Transformation for Likelihood-free Inference David S Greenberg Marcel Nonnenmacher Jakob H Macke Technical University of Munich Computational Neuroengineering Department of Electrical and Computer Engineering For many

270 views • 8 slides

Maximising the value of volunteering Sue Finnigan APSE Associate www.apse.org.uk Maximising the

Maximising the value of volunteering Sue Finnigan APSE Associate www.apse.org.uk Maximising the value of volunteering What is volunteering? an activity that involves spending time, unpaid, doing something that aims to benefit the

241 views • 20 slides

Automatic Identification and Normalisation of Physical Measurements in Scientific Literature

Automatic Identification and Normalisation of Physical Measurements in Scientific Literature Luca Foppiano 1 , Laurent Romary 2 , Masashi Ishii 1 and Mikiko Tanifuji 1 1 Material Data and Integrated System (MaDIS), National Institute for

444 views • 17 slides

Towards Automatic Inference of Inductive Invariants Haojun Ma , Aman Goel, Jean-Baptiste Jeannin

Towards Automatic Inference of Inductive Invariants Haojun Ma , Aman Goel, Jean-Baptiste Jeannin Manos Kapritsos, Baris Kasikci, Karem A. Sakallah University of Michigan Distributed systems are subtle 1 The alternative: formal verification

390 views • 19 slides

Towards Automatic Inference of Kernel Object Semantics from Binary Code Junyuan Zeng, and Zhiqiang

Introduction A RGOS Design Experimental Results Discussions & Related Work Summary & References Towards Automatic Inference of Kernel Object Semantics from Binary Code Junyuan Zeng, and Zhiqiang Lin Department of Computer Science

738 views • 53 slides

Automatic Inference of High-Level Network Intents by Mining Forwarding Patterns Ali Kheradmand

Automatic Inference of High-Level Network Intents by Mining Forwarding Patterns Ali Kheradmand University of Illinois at Urbana-Champaign 1 SOSR, March 2020 Typical network configuration procedure Mostly manual in todays networks

667 views • 25 slides

Security of Cyber-Physical Systems Henrik Sandberg hsan@kth.se Department of Automatic Control,

KTH ROYAL INSTITUTE OF TECHNOLOGY Security of Cyber-Physical Systems Henrik Sandberg hsan@kth.se Department of Automatic Control, KTH, Stockholm, Sweden 7th oCPS PhD School on Cyber-Physical Systems, Lucca, Italy Outline Background and

881 views • 63 slides

Automatic Merging of Automatic Merging of Pedigree Information Pedigree Information Annual

Automatic Merging of Automatic Merging of Pedigree Information Pedigree Information Annual Workshop on Family History Technology April 3, 2003 Sue Dintelman and Tim Maness Pleiades Software Development, Inc. Pleiades Software Development,

340 views • 17 slides

Is automatic cognate detection good enough for phylogenetic inference? Jena, CESC 2017 September

Is automatic cognate detection good enough for phylogenetic inference? Jena, CESC 2017 September 13, 2017 Rama, List, Wahle & Jger cognate detection & phylogenetic inference CESC2017 1 / 19 Taraka Rama 1 , 2 , Johann-Mattis List 3 ,

868 views • 31 slides

Hierarchical Bayesian ARX models for robust inference Johan Dahlin, Fredrik Lindsten, Thomas B.

Hierarchical Bayesian ARX models for robust inference Johan Dahlin, Fredrik Lindsten, Thomas B. Sch on, Adrian Wills Division of Automatic Control, Link oping University School of EECS, University of Newcastle, Australia AUTOMATIC

326 views • 17 slides

Maximising Achievement INFORMATION FOR PARENTS Miss Burgess Lead Teacher for KS4 English Tudor

Slide 1 GCSE English Maximising Achievement INFORMATION FOR PARENTS Miss Burgess Lead Teacher for KS4 English Tudor Grange Academy Slide 2 Class of 2017 AIMS To clarify the current situation in English for Year 11 To explain the

833 views • 30 slides

FY 2018 Results Maximising value capture from the portfolio 26 April 2019 Disclaimer The

FY 2018 Results Maximising value capture from the portfolio 26 April 2019 Disclaimer The following presentation, including any printed or electronic copy of these slides, the talks given by the presenters, the information communicated during

456 views • 20 slides

The tangent FFT D. J. Bernstein University of Illinois at Chicago See online version of paper,

The tangent FFT D. J. Bernstein University of Illinois at Chicago See online version of paper, particularly for bibliography: http://cr.yp.to /papers.html#tangentfft Algebraic

511 views • 26 slides

Exascale-ability Today N=4096 3 12.3 10 12 Flops 1.1 TB of Data 3D FFT Exascale-ability

O N THE C OMMUNICATION C OMPLEXITY OF 3D FFT S AND ITS I MPLICATIONS FOR E XASCALE Kent Czechowski, Chris McClanahan, Casey Battaglino, Kartik Iyer, P .-K. Yeung, and Richard Vuduc Exascale-ability Today N=4096 3 12.3 10 12 Flops 1.1 TB of

651 views • 37 slides

Approximating Orthogonal Matrices with Effective Givens Factorization Thomas Frerix Technical

Approximating Orthogonal Matrices with Effective Givens Factorization Thomas Frerix Technical University of Munich joint work with Joan Bruna (NYU) Poster #164 Givens Factorization of Orthogonal Matrices 1 0 0 0

589 views • 18 slides

for BlueGene/P Franz Franchetti 1 , Yevgen Voronenko 2 , Gheorghe Almasi 3 1 Carnegie Mellon

Carnegie Mellon Carnegie Mellon Automatic Generation of the HPC Challenge's Global FFT Benchmark for BlueGene/P Franz Franchetti 1 , Yevgen Voronenko 2 , Gheorghe Almasi 3 1 Carnegie Mellon University and SpiralGen, Inc. 2 AccuRay, Inc., 3 IBM

588 views • 25 slides

Model dependences, uncertain1es, and combined analysis Intro

Model dependences, uncertain1es, and combined analysis Intro Cosmological neutrino mass limits are robust for a given, well-defined model, e.g., LCDM +mnu.

97 views • 7 slides

Gravitational wave and lensing inference from the CMB polarization Ethan Anderes : (UC Davis

Gravitational wave and lensing inference from the CMB polarization Ethan Anderes : (UC Davis Statistics Department) Joint with Marius Millea (UC Berkeley) and Ben Wandelt (Institut dAstrophysique de Paris) : Research supported by: IHES-IHP

934 views • 67 slides

Bayesian Hierarchical Models for parameter inference with missing

Bayesian Hierarchical Models for parameter inference with missing data: Supernova cosmology case study. Marisa Cris)na March, University of Pennsylvania New

454 views • 18 slides

Near Detectors for the Hyper-K Experiment Mark Hartz TRIUMF & Kavli IPMU TAUP 2019, Toyama,

Near Detectors for the Hyper-K Experiment Mark Hartz TRIUMF & Kavli IPMU TAUP 2019, Toyama, September 12 1 Near Detectors Hyper-Kamiokande Experiment Hyper-Kamiokande Water Cherenokov detector with 187 kton fiducial mass (8x larger than

525 views • 27 slides