Rina Dechter

Publication Activity (10 Years)

Years Active: 1980-2024
Publications (10 Years): 40

Top Venues

AAAI

UAI

CoRR

SOCS

Publications

Vincent Hsiao, Dana S. Nau, Bobak Pezeshki, Rina Dechter
Surrogate Bayesian Networks for Approximating Evolutionary Games. AISTATS (2024)
Bobak Pezeshki, Radu Marinescu, Alexander Ihler, Rina Dechter
Boosting AND/OR-based computational protein design: dynamic heuristics and generalizable UFO. UAI (2023)
Bobak Pezeshki, Radu Marinescu, Alexander Ihler, Rina Dechter
Boosting AND/OR-Based Computational Protein Design: Dynamic Heuristics and Generalizable UFO. CoRR (2023)
Sakshi Agarwal, Kalev Kask, Alex Ihler, Rina Dechter
NeuroBE: Escalating neural network approximations of Bucket Elimination. UAI (2022)
Bobak Pezeshki, Radu Marinescu, Alexander T. Ihler, Rina Dechter
AND/OR branch-and-bound for computational protein design optimizing K. UAI (2022)
Vincent Hsiao, Dana S. Nau, Rina Dechter
Fast Fourier Transform Reductions for Bayesian Network Inference. AISTATS (2022)
Junkyu Lee, Radu Marinescu, Rina Dechter
Submodel Decomposition Bounds for Influence Diagrams. AAAI (2021)
Radu Marinescu, Junkyu Lee, Rina Dechter
A New Bounding Scheme for Influence Diagrams. AAAI (2021)
Vincent Hsiao, Xinyue Pan, Dana S. Nau, Rina Dechter
Approximating Spatial Evolutionary Games using Bayesian Networks. AAMAS (2021)
Yasaman Razeghi, Kalev Kask, Yadong Lu, Pierre Baldi, Sakshi Agarwal, Rina Dechter
Deep Bucket Elimination. IJCAI (2021)
Kalev Kask, Bobak Pezeshki, Filjor Broka, Alexander T. Ihler, Rina Dechter
Scaling Up AND/OR Abstraction Sampling. IJCAI (2020)
Junkyu Lee, Radu Marinescu, Rina Dechter
Heuristic AND/OR Search for Solving Influence Diagram. SOCS (2020)
Radu Marinescu, Rina Dechter
Counting the Optimal Solutions in Graphical Models. NeurIPS (2019)
Radu Marinescu, Akihiro Kishimoto, Adi Botea, Rina Dechter, Alexander T. Ihler
Anytime Recursive Best-First Search for Bounding Marginal MAP. AAAI (2019)
Qi Lou, Rina Dechter, Alexander T. Ihler
Interleave Variational Optimization with Monte Carlo Sampling: A Tale of Two Approximate Inference Paradigms. AAAI (2019)
Junkyu Lee, Radu Marinescu, Alexander T. Ihler, Rina Dechter
A Weighted Mini-Bucket Bound for Solving Influence Diagram. UAI (2019)
Radu Marinescu, Rina Dechter, Alexander T. Ihler
Stochastic Anytime Search for Bounding Marginal MAP. IJCAI (2018)
Ferdinando Fioretto, Enrico Pontelli, William Yeoh, Rina Dechter
Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs. Constraints An Int. J. 23 (1) (2018)
Junkyu Lee, Alexander T. Ihler, Rina Dechter
Generalized Dual Decomposition for Bounding Maximum Expected Utility of Influence Diagrams with Perfect Recall. AAAI Workshops (2018)
Qi Lou, Rina Dechter, Alexander T. Ihler
Finite-sample Bounds for Marginal MAP. UAI (2018)
Filjor Broka, Rina Dechter, Alexander T. Ihler, Kalev Kask
Abstraction Sampling in Graphical Models. UAI (2018)
Radu Marinescu, Junkyu Lee, Rina Dechter, Alexander T. Ihler
AND/OR Search for Marginal MAP. J. Artif. Intell. Res. 63 (2018)
Junkyu Lee, Alexander T. Ihler, Rina Dechter
Join Graph Decomposition Bounds for Influence Diagrams. UAI (2018)
Qi Lou, Rina Dechter, Alexander T. Ihler
Anytime Anyspace AND/OR Best-First Search for Bounding Marginal MAP. AAAI (2018)
William Lam, Kalev Kask, Javier Larrosa, Rina Dechter
Subproblem ordering heuristics for AND/OR best-first search. J. Comput. Syst. Sci. 94 (2018)
Qi Lou, Rina Dechter, Alexander T. Ihler
Anytime Anyspace AND/OR Search for Bounding the Partition Function. AAAI (2017)
Lars Otten, Rina Dechter
AND/OR Branch-and-Bound on a Computational Grid. J. Artif. Intell. Res. 59 (2017)
Qi Lou, Rina Dechter, Alexander T. Ihler
Dynamic Importance Sampling for Anytime Bounds of the Partition Function. NIPS (2017)
William Lam, Kalev Kask, Javier Larrosa, Rina Dechter
Residual-Guided Look-Ahead in AND/OR Search for Graphical Models. J. Artif. Intell. Res. 60 (2017)
Radu Marinescu, Junkyu Lee, Alexander T. Ihler, Rina Dechter
Anytime Best+Depth-First Search for Bounding Marginal MAP. AAAI (2017)
Natalia Flerova, Radu Marinescu, Rina Dechter
Weighted heuristic anytime search: new schemes for optimization over graphical models. Ann. Math. Artif. Intell. 79 (1-3) (2017)
Natalia Flerova, Radu Marinescu, Rina Dechter
Searching for the M Best Solutions in Graphical Models. J. Artif. Intell. Res. 55 (2016)
Ferdinando Fioretto, Enrico Pontelli, William Yeoh, Rina Dechter
Accelerating Exact and Approximate Inference for (Distributed) Discrete Optimization with GPUs. CoRR (2016)
Javier Larrosa, Emma Rollon, Rina Dechter
Limited Discrepancy AND/OR Search and Its Application to Optimization Tasks in Graphical Models. IJCAI (2016)
Rodrigo de Salvo Braz, Ciaran O'Reilly, Vibhav Gogate, Rina Dechter
Probabilistic Inference Modulo Theories. CoRR (2016)
Rina Dechter, Kalev Kask, William Lam, Javier Larrosa
Look-Ahead with Mini-Bucket Heuristics for MPE. AAAI (2016)
Rodrigo de Salvo Braz, Ciaran O'Reilly, Vibhav Gogate, Rina Dechter
Probabilistic Inference Modulo Theories. IJCAI (2016)
William Lam, Kalev Kask, Rina Dechter, Javier Larrosa
On the Impact of Subproblem Orderings on Anytime AND/OR Best-First Search for Lower Bounds. ECAI (2016)
Junkyu Lee, Radu Marinescu, Rina Dechter, Alexander T. Ihler
From Exact to Anytime Solutions for Marginal MAP. AAAI (2016)
Junkyu Lee, Radu Marinescu, Rina Dechter
Applying Search Based Probabilistic Inference Algorithms to Probabilistic Conformant Planning: Preliminary Results. ISAIM (2016)
William Lam, Kalev Kask, Rina Dechter
Empowering Mini-Bucket in Anytime Heuristic Search with Look-Ahead: Preliminary Evaluation. SOCS (2015)
Rina Dechter, Levi H. S. Lelis, Lars Otten
Caching in Context-Minimal OR Spaces. SOCS (2015)
Radu Marinescu, Rina Dechter, Alexander T. Ihler
Pushing Forward Marginal MAP with Best-First Search. IJCAI (2015)
William Lam, Kalev Kask, Rina Dechter, Alexander T. Ihler
Beyond Static Mini-Bucket: Towards Integrating with Iterative Cost-Shifting Based Dynamic Heuristics. SOCS (2014)
Bozhena Bidyuk, Rina Dechter, Emma Rollon
Active Tuples-based Scheme for Bounding Posterior Beliefs. CoRR (2014)
Natalia Flerova, Radu Marinescu, Rina Dechter
Weighted Best First Search for Graphical Models. ISAIM (2014)
Alon Milchgrub, Rina Dechter
STLS: Cycle-Cutset-Driven Local Search For MPE. SOCS (2014)
Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina Dechter
Join-Graph Propagation Algorithms. CoRR (2014)
Junkyu Lee, Radu Marinescu, Rina Dechter
Applying Marginal MAP Search to Probabilistic Conformant Planning: Initial Results. AAAI Workshop: Statistical Relational Artificial Intelligence (2014)
Robert Mateescu, Rina Dechter, Radu Marinescu
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models. CoRR (2014)
Natalia Flerova, Radu Marinescu, Rina Dechter
Evaluating Weighted DFS Branch and Bound over Graphical Models. SOCS (2014)
Radu Marinescu, Rina Dechter, Alexander T. Ihler
AND/OR Search for Marginal MAP. UAI (2014)
Lars Otten, Rina Dechter
Anytime AND/OR Depth-First Search for Combinatorial Optimization - (Extended Abstract). CP (2014)
Levi H. S. Lelis, Lars Otten, Rina Dechter
Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical Models. CP (2014)
Levi H. S. Lelis, Lars Otten, Rina Dechter
Predicting the Size of Depth-First Branch and Bound Search Trees. IJCAI (2013)
Kalev Kask, Rina Dechter
Mini-Bucket Heuristics for Improved Search CoRR (2013)
Yousri El Fattah, Rina Dechter
An Evaluation of Structural Parameters for Probabilistic Reasoning: Results on Benchmark Circuits CoRR (2013)
Irina Rish, Kalev Kask, Rina Dechter
Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding CoRR (2013)
Mark Silberstein, Omer Weissbrod, Lars Otten, Anna Tzemach, Andrei Anisenia, Oren Shtark, Dvir Tuberg, Eddie Galfrin, Irena Gannon, Adel Shalata, Zvi U. Borochowitz, Rina Dechter, Elizabeth Thompson, Dan Geiger
A system for exact and approximate genetic linkage analysis of SNP data in large pedigrees. Bioinform. 29 (2) (2013)
Rina Dechter, Irina Rish
A Scheme for Approximating Probabilistic Inference CoRR (2013)
Rina Dechter
Topological Parameters for Time-Space Tradeoff CoRR (2013)
Emma Rollon, Javier Larrosa, Rina Dechter
Semiring-Based Mini-Bucket Partitioning Schemes. IJCAI (2013)
Mark Silberstein, Omer Weissbrod, Lars Otten, Anna Tzemach, Andrei Anisenia, Oren Shtark, Dvir Tuberg, Eddie Galfrin, Irena Gannon, Adel Shalata, Zvi U. Borochowitz, Rina Dechter, Elizabeth Thompson, Dan Geiger
A system for exact and approximate genetic linkage analysis of SNP data in large pedigrees. Bioinform. 29 (5) (2013)
Rina Dechter
Bucket Elimination: A Unifying Framework for Several Probabilistic Inference CoRR (2013)
Rina Dechter, David Ephraim Larkin
Hybrid Processing of Beliefs and Constraints CoRR (2013)
Rina Dechter, Kalev Kask, Robert Mateescu
Iterative Join-Graph Propagation CoRR (2013)
Judea Pearl, Rina Dechter
Identifying Independencies in Causal Graphs with Feedback CoRR (2013)
Vibhav Gogate, Rina Dechter
AND/OR Importance Sampling CoRR (2012)
Bozhena Bidyuk, Rina Dechter
An Empirical Study of w-Cutset Sampling for Bayesian Networks CoRR (2012)
Kalev Kask, Rina Dechter, Andrew Gelfand
BEEM : Bucket Elimination with External Memory CoRR (2012)
Bozhena Bidyuk, Rina Dechter
Cutset Sampling with Likelihood Weighting. CoRR (2012)
Rina Dechter, Natalia Flerova, Radu Marinescu
Search Algorithms for m Best Solutions for Graphical Models. AAAI (2012)
Robert Mateescu, Rina Dechter
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models CoRR (2012)
Rina Dechter, Thomas S. Richardson
Proceedings of the Twenty-Second Conference on Uncertainty in Artificial Intelligence (2006) CoRR (2012)
Lars Otten, Rina Dechter
A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models. UAI (2012)
Vibhav Gogate, Rina Dechter
Approximate Inference Algorithms for Hybrid Bayesian Networks with Discrete Constraints CoRR (2012)
Lars Otten, Rina Dechter
A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models CoRR (2012)
Alexander T. Ihler, Natalia Flerova, Rina Dechter, Lars Otten
Join-graph based cost-shifting schemes. UAI (2012)
Rina Dechter, Robert Mateescu
Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space CoRR (2012)
Vibhav Gogate, Rina Dechter, Bozhena Bidyuk, Craig Rindt, James Marca
Modeling Transportation Routines using Hybrid Dynamic Mixed Networks CoRR (2012)
Lars Otten, Rina Dechter
Bounding Search Space Size via (Hyper)tree Decompositions CoRR (2012)
Alexander T. Ihler, Natalia Flerova, Rina Dechter, Lars Otten
Join-graph based cost-shifting schemes CoRR (2012)
Radu Marinescu, Kalev Kask, Rina Dechter
Systematic vs. Non-systematic Algorithms for Solving the MPE Task CoRR (2012)
Vibhav Gogate, Rina Dechter
Importance sampling-based estimation over AND/OR search spaces for graphical models. Artif. Intell. (2012)
Lars Otten, Rina Dechter
Anytime AND/OR depth-first search for combinatorial optimization. AI Commun. 25 (3) (2012)
Robert Mateescu, Rina Dechter
The Relationship Between AND/OR Search and Variable Elimination CoRR (2012)
Vibhav Gogate, Bozhena Bidyuk, Rina Dechter
Studies in Lower Bounding Probabilities of Evidence using the Markov Inequality CoRR (2012)
Rina Dechter, Robert Mateescu
A Simple Insight into Iterative Belief Propagation's Success CoRR (2012)
Radu Marinescu, Rina Dechter
Best-First AND/OR Search for Most Probable Explanations CoRR (2012)
Lars Otten, Rina Dechter
Advances in Distributed Branch and Bound. ECAI (2012)
Bozhena Bidyuk, Rina Dechter
On finding minimal w-cutset CoRR (2012)
Vibhav Gogate, Rina Dechter
A Complete Anytime Algorithm for Treewidth CoRR (2012)
Vibhav Gogate, Rina Dechter
Sampling-based lower bounds for counting queries. Intelligenza Artificiale 5 (2) (2011)
Bozhena Bidyuk, Rina Dechter
Cutset Sampling for Bayesian Networks CoRR (2011)
Lars Otten, Rina Dechter
Finding Most Likely Haplotypes in General Pedigrees Through Parallel Search with Dynamic Load Balancing. Pacific Symposium on Biocomputing (2011)
Andrew Gelfand, Kalev Kask, Rina Dechter
Stopping Rules for Randomized Greedy Triangulation Schemes. AAAI (2011)
Kalev Kask, Andrew Gelfand, Lars Otten, Rina Dechter
Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models. AAAI (2011)
Natalia Flerova, Emma Rollon, Rina Dechter
Bucket and Mini-bucket Schemes for M Best Solutions over Graphical Models. GKR (2011)
Lars Otten, Rina Dechter
Anytime AND/OR Depth-First Search for Combinatorial Optimization. SOCS (2011)
Vibhav Gogate, Rina Dechter
SampleSearch: Importance sampling in presence of determinism. Artif. Intell. 175 (2) (2011)

Rina Dechter.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Rina Dechter