Rina Dechter
23 papers · 2010–2025 · 5 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+11 more ↓ Show less ↑
🌍 Conference Polyglot (5) 🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🐣 Hot Topic Early Bird 🏃 Academic Marathon (15)
🐝
Cross-Pollinator
(15)
🌉
Interdisciplinary Bridge
🌍
Conference Polyglot
(5)
🏆
Keyword Champion
(3)
🤝
Dynamic Duo
(10)
🔬
Deep Specialist
(11)
🗃️
Keyword Collector
(60)
🚀
Conference Pioneer
💎
Century Club
(23)
🔥
Unstoppable
(11)
📈
Trend Setter
Conferences
IJCAI (8)
UAI (5)
AAAI (4)
AISTATS (4)
NIPS (2)
Top co-authors
Keywords
graphical model
(12)
probabilistic inference
(6)
bayesian network
(4)
partition function
(4)
marginal map
(4)
bucket elimination
(3)
maximum expected utility
(3)
approximate inference
(3)
influence diagram
(3)
and/or search
(2)
message passing
(2)
importance sampling
(2)
variational inference
(2)
combinatorial optimization
(2)
upper bound
(2)
anytime algorithm
(2)
best-first search
(2)
monte carlo method
(2)
branch and bound
(2)
computational protein design
(2)
Papers
Graph-based Complexity for Causal Effect by Empirical Plug-in
AISTATS 2025
Value-Based Abstraction Functions for Abstraction Sampling
UAI 2024
Surrogate Bayesian Networks for Approximating Evolutionary Games
AISTATS 2024
Boosting AND/OR-based computational protein design: dynamic heuristics and generalizable UFO
UAI 2023
AND/OR branch-and-bound for computational protein design optimizing K*
UAI 2022
Fast Fourier Transform Reductions for Bayesian Network Inference
AISTATS 2022
NeuroBE: Escalating neural network approximations of Bucket Elimination
UAI 2022
Submodel Decomposition Bounds for Influence Diagrams
AAAI 2021
A New Bounding Scheme for Influence Diagrams
AAAI 2021
Deep Bucket Elimination
IJCAI 2021
Scaling Up AND/OR Abstraction Sampling
IJCAI 2020
Anytime Recursive Best-First Search for Bounding Marginal MAP
AAAI 2019
Interleave Variational Optimization with Monte Carlo Sampling: A Tale of Two Approximate Inference Paradigms
AAAI 2019
A Weighted Mini-Bucket Bound for Solving Influence Diagram
UAI 2019
Counting the Optimal Solutions in Graphical Models
NIPS 2019
Stochastic Anytime Search for Bounding Marginal MAP
IJCAI 2018
Dynamic Importance Sampling for Anytime Bounds of the Partition Function
NIPS 2017
Probabilistic Inference Modulo Theories
IJCAI 2016
Limited Discrepancy AND/OR Search and Its Application to Optimization Tasks in Graphical Models
IJCAI 2016
Pushing Forward Marginal MAP with Best-First Search
IJCAI 2015
Semiring-Based Mini-Bucket Partitioning Schemes
IJCAI 2013
Predicting the Size of Depth-First Branch and Bound Search Trees
IJCAI 2013
On Combining Graph-based Variance Reduction schemes
AISTATS 2010