Next
Livestream will start soon!
Livestream has already ended.
Presentation has not been recorded yet!
  • title: Solving Marginal MAP Exactly by Probabilistic Circuit Transformations
      0:00 / 0:00
      • Report Issue
      • Settings
      • Playlists
      • Bookmarks
      • Subtitles Off
      • Playback rate
      • Quality
      • Settings
      • Debug information
      • Server sl-yoda-v2-stream-001-alpha.b-cdn.net
      • Subtitles size Medium
      • Bookmarks
      • Server
      • sl-yoda-v2-stream-001-alpha.b-cdn.net
      • sl-yoda-v2-stream-001-beta.b-cdn.net
      • 1824830694.rsc.cdn77.org
      • 1979322955.rsc.cdn77.org
      • Subtitles
      • Off
      • English
      • Playback rate
      • Quality
      • Subtitles size
      • Large
      • Medium
      • Small
      • Mode
      • Video Slideshow
      • Audio Slideshow
      • Slideshow
      • Video
      My playlists
        Bookmarks
          00:00:00
            Solving Marginal MAP Exactly by Probabilistic Circuit Transformations
            • Settings
            • Sync diff
            • Quality
            • Settings
            • Server
            • Quality
            • Server

            Solving Marginal MAP Exactly by Probabilistic Circuit Transformations

            Mar 28, 2022

            Speakers

            YC

            YooJung Choi

            Speaker · 1 follower

            TF

            Tal Friedman

            Speaker · 0 followers

            GVdB
            GVdB

            Guy Van den Broeck

            Speaker · 5 followers

            About

            Probabilistic circuits (PCs) are a class of tractable probabilistic models that allow efficient, often linear-time, inference of queries such as marginals and most probable explanations (MPE). However, marginal MAP, which is central to many decision-making problems, remains a hard query for PCs unless they satisfy highly restrictive structural constraints. In this paper, we develop a pruning algorithm that removes parts of the PC that are irrelevant to a marginal MAP query, shrinking the PC whil…

            Organizer

            A2
            A2

            AISTATS 2022

            Account · 33 followers

            About AISTATS 2022

            AISTATS is an interdisciplinary gathering of researchers at the intersection of computer science, artificial intelligence, machine learning, statistics, and related areas. Since its inception in 1985, the primary goal of AISTATS has been to broaden research in these fields by promoting the exchange of ideas among them. We encourage the submission of all papers which are in keeping with this objective at AISTATS.

            Like the format? Trust SlidesLive to capture your next event!

            Professional recording and live streaming, delivered globally.

            Sharing

            Recommended Videos

            Presentations on similar topic, category or speaker

            KFeature screening with kernel knockoffs
            04:59

            KFeature screening with kernel knockoffs

            Benjamin Poignard, …

            A2
            A2
            AISTATS 2022 3 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            Multi-armed Bandit Algorithm against Strategic Replication
            05:00

            Multi-armed Bandit Algorithm against Strategic Replication

            Suho Shin, …

            A2
            A2
            AISTATS 2022 3 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            A Bayesian Model for Online Activity Sample Sizes
            04:53

            A Bayesian Model for Online Activity Sample Sizes

            Thomas Richardson, …

            A2
            A2
            AISTATS 2022 3 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            Forward Looking Best-Response Multiplicative Weights Update Methods for Bilinear Zero-sum Games
            04:54

            Forward Looking Best-Response Multiplicative Weights Update Methods for Bilinear Zero-sum Games

            Michail Fasoulakis, …

            A2
            A2
            AISTATS 2022 3 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            Momentum Accelerates the Convergence of Stochastic AUPRC Maximization
            05:04

            Momentum Accelerates the Convergence of Stochastic AUPRC Maximization

            Guanghui Wang, …

            A2
            A2
            AISTATS 2022 3 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            Beyond the PG Theorem for Efficient Policy Updates in Actor-Critic Algorithms
            04:47

            Beyond the PG Theorem for Efficient Policy Updates in Actor-Critic Algorithms

            Romain Laroche, …

            A2
            A2
            AISTATS 2022 3 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            Interested in talks like this? Follow AISTATS 2022