on the hardness of probabilistic inference relaxations
play

On the Hardness of Probabilistic Inference Relaxations Supratik - PowerPoint PPT Presentation

On the Hardness of Probabilistic Inference Relaxations Supratik Chakraborty 1 Kuldeep S. Meel 2 Moshe Y. Vardi 3 1 Indian Institute of Technology, Bombay 2 School of Computing, National University of Singapore 3 Department of Computer Science, Rice


  1. On the Hardness of Probabilistic Inference Relaxations Supratik Chakraborty 1 Kuldeep S. Meel 2 Moshe Y. Vardi 3 1 Indian Institute of Technology, Bombay 2 School of Computing, National University of Singapore 3 Department of Computer Science, Rice University 1 / 3

  2. Probabilistic Models Smoker ( S ) Asthma ( A ) Cough ( C ) Let q = Pr[Asthma( A ) | Cough( C )] Pr[Event | Evidence] 2 / 3

  3. Probabilistic Models Smoker ( S ) Asthma ( A ) Cough ( C ) Let q = Pr[Asthma( A ) | Cough( C )] Pr[Event | Evidence] #P-Hard to compute, so need for relaxations 2 / 3

  4. The Story of Relaxations with a Moral Conclusion Let q = Pr[Event | Evidence] • Additive Relaxations Given: δ, ε Estimate r such that Pr[ q − ε < r < q + ε ] ≥ 1 − δ (Sarkhel et al. 2016); (Fink,Huang, and Olteanu 2013) • Threshold Relaxations Given: thresh , δ if r ≥ thresh, then textbfOutput YES, else textbfOutput NO (Moy´ e 2006; King, Rosopa, and Minium 2010; Zongming 2009; Gordon et al. 2014; Bornholt, Mytkowicz, and McKinley 2014) 3 / 3

  5. The Story of Relaxations with a Moral Conclusion Let q = Pr[Event | Evidence] • Additive Relaxations Given: δ, ε Estimate r such that Pr[ q − ε < r < q + ε ] ≥ 1 − δ (Sarkhel et al. 2016); (Fink,Huang, and Olteanu 2013) • Threshold Relaxations Given: thresh , δ if r ≥ thresh, then textbfOutput YES, else textbfOutput NO (Moy´ e 2006; King, Rosopa, and Minium 2010; Zongming 2009; Gordon et al. 2014; Bornholt, Mytkowicz, and McKinley 2014) The proposed relaxations are as hard as computing q exactly 3 / 3

  6. The Story of Relaxations with a Moral Conclusion Let q = Pr[Event | Evidence] • Additive Relaxations Given: δ, ε Estimate r such that Pr[ q − ε < r < q + ε ] ≥ 1 − δ (Sarkhel et al. 2016); (Fink,Huang, and Olteanu 2013) • Threshold Relaxations Given: thresh , δ if r ≥ thresh, then textbfOutput YES, else textbfOutput NO (Moy´ e 2006; King, Rosopa, and Minium 2010; Zongming 2009; Gordon et al. 2014; Bornholt, Mytkowicz, and McKinley 2014) The proposed relaxations are as hard as computing q exactly Not all is lost. New Relaxation that is efficient to compute and can replace threshold relaxation for statistical testing applications Money Back Guarantee: Come to the poster tonight, and you will leave demanding a rigorous analysis everytime someone proposes new relaxation. 3 / 3

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


More recommend