Dechter, Rina

114 publications

AISTATS 2025 Graph-Based Complexity for Causal Effect by Empirical Plug-in Rina Dechter, Anna K Raichev, Jin Tian, Alexander Ihler

AISTATS 2024 Surrogate Bayesian Networks for Approximating Evolutionary Games Vincent Hsiao, Dana S Nau, Bobak Pezeshki, Rina Dechter

UAI 2024 Value-Based Abstraction Functions for Abstraction Sampling Bobak Pezeshki, Kalev Kask, Alexander Ihler, Rina Dechter

UAI 2023 Boosting AND/OR-Based Computational Protein Design: Dynamic Heuristics and Generalizable UFO Bobak Pezeshki, Radu Marinescu, Alexander Ihler, Rina Dechter

AISTATS 2022 Fast Fourier Transform Reductions for Bayesian Network Inference Vincent Hsiao, Dana Nau, Rina Dechter

UAI 2022 AND/OR Branch-and-Bound for Computational Protein Design Optimizing K* Bobak Pezeshki, Radu Marinescu, Alexander Ihler, Rina Dechter

UAI 2022 NeuroBE: Escalating Neural Network Approximations of Bucket Elimination Sakshi Agarwal, Kalev Kask, Alex Ihler, Rina Dechter

AAAI 2021 A New Bounding Scheme for Influence Diagrams Radu Marinescu, Junkyu Lee, Rina Dechter

IJCAI 2021 Deep Bucket Elimination Yasaman Razeghi, Kalev Kask, Yadong Lu, Pierre Baldi, Sakshi Agarwal, Rina Dechter

AAAI 2021 Submodel Decomposition Bounds for Influence Diagrams Junkyu Lee, Radu Marinescu, Rina Dechter

IJCAI 2020 Scaling up AND/OR Abstraction Sampling Kalev Kask, Bobak Pezeshki, Filjor Broka, Alexander Ihler, Rina Dechter

UAI 2019 A Weighted Mini-Bucket Bound for Solving Influence Diagram Junkyu Lee, Radu Marinescu, Alexander Ihler, Rina Dechter

AAAI 2019 Anytime Recursive Best-First Search for Bounding Marginal MAP Radu Marinescu, Akihiro Kishimoto, Adi Botea, Rina Dechter, Alexander Ihler

NeurIPS 2019 Counting the Optimal Solutions in Graphical Models Radu Marinescu, Rina Dechter

AAAI 2019 Interleave Variational Optimization with Monte Carlo Sampling: A Tale of Two Approximate Inference Paradigms Qi Lou, Rina Dechter, Alexander Ihler

JAIR 2018 AND/OR Search for Marginal MAP Radu Marinescu, Junkyu Lee, Rina Dechter, Alexander Ihler

UAI 2018 Abstraction Sampling in Graphical Models Filjor Broka, Rina Dechter, Alexander Ihler, Kalev Kask

AAAI 2018 Anytime Anyspace AND/OR Best-First Search for Bounding Marginal MAP Qi Lou, Rina Dechter, Alexander Ihler

UAI 2018 Finite-Sample Bounds for Marginal MAP Qi Lou, Rina Dechter, Alexander Ihler

UAI 2018 Join Graph Decomposition Bounds for Influence Diagrams Junkyu Lee, Alexander Ihler, Rina Dechter

IJCAI 2018 Stochastic Anytime Search for Bounding Marginal MAP Radu Marinescu, Rina Dechter, Alexander Ihler

JAIR 2017 AND/OR Branch-and-Bound on a Computational Grid Lars Otten, Rina Dechter

AAAI 2017 Anytime Anyspace AND/OR Search for Bounding the Partition Function Qi Lou, Rina Dechter, Alexander Ihler

AAAI 2017 Anytime Best+Depth-First Search for Bounding Marginal MAP Radu Marinescu, Junkyu Lee, Alexander Ihler, Rina Dechter

NeurIPS 2017 Dynamic Importance Sampling for Anytime Bounds of the Partition Function Qi Lou, Rina Dechter, Alex Ihler

JAIR 2017 Residual-Guided Look-Ahead in AND/OR Search for Graphical Models William Lam, Kalev Kask, Javier Larrosa, Rina Dechter

AAAI 2016 From Exact to Anytime Solutions for Marginal MAP Junkyu Lee, Radu Marinescu, Rina Dechter, Alexander Ihler

IJCAI 2016 Limited Discrepancy AND/OR Search and Its Application to Optimization Tasks in Graphical Models Javier Larrosa, Emma Rollon, Rina Dechter

AAAI 2016 Look-Ahead with Mini-Bucket Heuristics for MPE Rina Dechter, Kalev Kask, William Lam, Javier Larrosa

IJCAI 2016 Probabilistic Inference Modulo Theories Rodrigo de Salvo Braz, Ciaran O'Reilly, Vibhav Gogate, Rina Dechter

JAIR 2016 Searching for the M Best Solutions in Graphical Models Natalia Flerova, Radu Marinescu, Rina Dechter

IJCAI 2015 Pushing Forward Marginal MAP with Best-First Search Radu Marinescu, Rina Dechter, Alexander Ihler

UAI 2014 AND/OR Search for Marginal MAP Radu Marinescu, Rina Dechter, Alexander Ihler

IJCAI 2013 Predicting the Size of Depth-First Branch and Bound Search Trees Levi H. S. Lelis, Lars Otten, Rina Dechter

IJCAI 2013 Semiring-Based Mini-Bucket Partitioning Schemes Emma Rollon, Javier Larrosa, Rina Dechter

UAI 2012 A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models Lars Otten, Rina Dechter

UAI 2012 Join-Graph Based Cost-Shifting Schemes Alexander Ihler, Natalia Flerova, Rina Dechter, Lars Otten

AAAI 2012 Search Algorithms for M Best Solutions for Graphical Models Rina Dechter, Natalia Flerova, Radu Marinescu

AAAI 2011 Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models Kalev Kask, Andrew Gelfand, Lars Otten, Rina Dechter

AAAI 2011 Stopping Rules for Randomized Greedy Triangulation Schemes Andrew Gelfand, Kalev Kask, Rina Dechter

JAIR 2010 Active Tuples-Based Scheme for Bounding Posterior Beliefs Bozhena Bidyuk, Rina Dechter, Emma Rollon

UAI 2010 BEEM : Bucket Elimination with External Memory Kalev Kask, Rina Dechter, Andrew Gelfand

JAIR 2010 Join-Graph Propagation Algorithms Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina Dechter

AAAI 2010 New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence Emma Rollon, Rina Dechter

AISTATS 2010 On Combining Graph-Based Variance Reduction Schemes Vibhav Gogate, Rina Dechter

UAI 2008 AND/OR Importance Sampling Vibhav Gogate, Rina Dechter

JAIR 2008 AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models Robert Mateescu, Rina Dechter, Radu Marinescu

UAI 2008 Bounding Search Space Size via (Hyper)tree Decompositions Lars Otten, Rina Dechter

UAI 2008 Evaluating Probabilistic Reasoning Systems Adnan Darwiche, Rina Dechter

AAAI 2008 Studies in Solution Sampling Vibhav Gogate, Rina Dechter

IJCAI 2007 A Comparison of Time-Space Schemes for Graphical Models Robert Mateescu, Rina Dechter

UAI 2007 AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models Robert Mateescu, Rina Dechter

AAAI 2007 Approximate Counting by Sampling the Backtrack-Free Search Space Vibhav Gogate, Rina Dechter

AAAI 2007 Best-First AND/OR Search for Graphical Models Radu Marinescu, Rina Dechter

UAI 2007 Best-First AND/OR Search for Most Probable Explanations Radu Marinescu, Rina Dechter

JAIR 2007 Cutset Sampling for Bayesian Networks Bozhena Bidyuk, Rina Dechter

AISTATS 2007 SampleSearch: A Scheme That Searches for Consistent Samples Vibhav Gogate, Rina Dechter

UAI 2007 Studies in Lower Bounding Probabilities of Evidence Using the Markov Inequality Vibhav Gogate, Bozhena Bidyuk, Rina Dechter

AAAI 2006 An Anytime Scheme for Bounding Posterior Beliefs Bozhena Bidyuk, Rina Dechter

UAI 2006 Cutset Sampling with Likelihood Weighting Bozhena Bidyuk, Rina Dechter

AAAI 2006 Memory Intensive Branch-and-Bound Search for Graphical Models Radu Marinescu, Rina Dechter

IJCAI 2005 AND/OR Branch-and-Bound for Graphical Models Radu Marinescu, Rina Dechter

IJCAI 2005 AND/OR Cutset Conditioning Robert Mateescu, Rina Dechter

UAI 2005 Approximate Inference Algorithms for Hybrid Bayesian Networks with Discrete Constraints Vibhav Gogate, Rina Dechter

UAI 2005 Modeling Transportation Routines Using Hybrid Dynamic Mixed Networks Vibhav Gogate, Rina Dechter, Bozhena Bidyuk, Craig Rindt, James Marca

UAI 2005 The Relationship Between AND/OR Search and Variable Elimination Robert Mateescu, Rina Dechter

UAI 2004 A Complete Anytime Algorithm for Treewidth Vibhav Gogate, Rina Dechter

UAI 2004 Mixtures of Deterministic-Probabilistic Networks and Their AND/OR Search Space Rina Dechter, Robert Mateescu

UAI 2004 On Finding Minimal W-Cutset Bozhena Bidyuk, Rina Dechter

UAI 2003 A Simple Insight into Iterative Belief Propagation's Success Rina Dechter, Robert Mateescu

UAI 2003 An Empirical Study of W-Cutset Sampling for Bayesian Networks Bozhena Bidyuk, Rina Dechter

AISTATS 2003 Bayesian Inference in the Presence of Determinism David Larkin, Rina Dechter

UAI 2003 Systematic vs. Non-Systematic Algorithms for Solving the MPE Task Radu Marinescu, Kalev Kask, Rina Dechter

AAAI 2002 Generating Random Solutions for Constraint Satisfaction Problems Rina Dechter, Kalev Kask, Eyal Bin, Roy Emek

UAI 2002 Iterative Join-Graph Propagation Rina Dechter, Kalev Kask, Robert Mateescu

AAAI 2002 Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28 - August 1, 2002, Edmonton, Alberta, Canada Rina Dechter, Michael J. Kearns, Richard S. Sutton

AAAI 2002 Tree Approximation for Belief Updating Robert Mateescu, Rina Dechter, Kalev Kask

UAI 2001 Hybrid Processing of Beliefs and Constraints Rina Dechter, David Larkin

AAAI 2000 An Implementation of the Combinatorial Auction Problem in ECLiPSe Robert Menke, Rina Dechter

IJCAI 1999 Branch and Bound with Mini-Bucket Heuristics Kalev Kask, Rina Dechter

UAI 1999 Mini-Bucket Heuristics for Improved Search Kalev Kask, Rina Dechter

AISTATS 1999 Stochastic Local Search for Bayesian Network Kalev Kask, Rina Dechter

UAI 1998 Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding Irina Rish, Kalev Kask, Rina Dechter

UAI 1997 A Scheme for Approximating Probabilistic Inference Rina Dechter, Irina Rish

IJCAI 1997 Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning Rina Dechter

AAAI 1996 A Graph-Based Method for Improving GSAT Kalev Kask, Rina Dechter

UAI 1996 An Evaluation of Structural Parameters for Probabilistic Reasoning: Results on Benchmark Circuits Yousri El Fattah, Rina Dechter

UAI 1996 Bucket Elimination: A Unifying Framework for Probabilistic Inference Rina Dechter

UAI 1996 Identifying Independencies in Causal Graphs with Feedback Judea Pearl, Rina Dechter

UAI 1996 Topological Parameters for Time-Space Tradeoff Rina Dechter

IJCAI 1995 Diagnosing Tree-Decomposable Circuits Yousri El Fattah, Rina Dechter

IJCAI 1995 GSAT and Local Consistency Kalev Kask, Rina Dechter

JAIR 1995 Improving Connectionist Energy Minimization Gadi Pinkas, Rina Dechter

IJCAI 1995 Look-Ahead Value Ordering for Constraint Satisfaction Problems Daniel Frost, Rina Dechter

IJCAI 1995 Systematic Versus Stochastic Constraint Satisfaction Eugene C. Freuder, Rina Dechter, Matthew L. Ginsberg, Bart Selman, Edward P. K. Tsang

AAAI 1994 Dead-End Driven Learning Daniel Frost, Rina Dechter

AAAI 1994 In Search of the Best Constraint Satisfaction Search Daniel Frost, Rina Dechter

AAAI 1994 Temporal Reasoning with Constraints on Fluents and Events Eddie Schwalb, Kalev Kask, Rina Dechter

AAAI 1993 Coping with Disjunctions in Temporal Constraint Satisfaction Problems Eddie Schwalb, Rina Dechter

AAAI 1993 On Computing Minimal Models Rachel Ben-Eliyahu, Rina Dechter

AAAI 1992 An Improved Connectionist Activation Function for Energy Minimization Gadi Pinkas, Rina Dechter

AAAI 1991 Default Logic, Propositional Logic, and Constraints Rachel Ben-Eliyahu, Rina Dechter

IJCAI 1991 Directed Constraint Networks: A Relational Framework for Causal Modeling Rina Dechter, Judea Pearl

IJCAI 1991 On the Feasibility of Distributed Constraint Satisfaction Zeev Collin, Rina Dechter, Shmuel Katz

AAAI 1990 On the Expressiveness of Networks with Hidden Variables Rina Dechter

AAAI 1990 Tree Decomposition with Applications to Constraint Processing Itay Meiri, Judea Pearl, Rina Dechter

IJCAI 1989 Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems Rina Dechter, Itay Meiri

COLT 1989 Learning Structure from Data: A Survey Judea Pearl, Rina Dechter

AAAI 1988 Belief Maintenance in Dynamic Constraint Networks Rina Dechter, Avi Dechter

AAAI 1988 Tree-Clustering Schemes for Constraint-Processing Rina Dechter, Judea Pearl

AAAI 1987 Removing Redundancies in Constraint Networks Avi Dechter, Rina Dechter

AAAI 1986 Learning While Searching in Constraint-Satisfaction-Problems Rina Dechter

IJCAI 1985 The Anatomy of Easy Problems: A Constraint-Satisfaction Formulation Rina Dechter, Judea Pearl

AAAI 1983 The Optimality of A* Revisited Rina Dechter, Judea Pearl