default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRina Dechter
Person information
- affiliation: University of California, Irvine, USA
- award (1991): Presidential Young Investigator Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c155]Vincent Hsiao, Dana S. Nau, Bobak Pezeshki, Rina Dechter:
Surrogate Bayesian Networks for Approximating Evolutionary Games. AISTATS 2024: 2566-2574- [c154]Anna Raichev, Jin Tian, Alexander Ihler, Rina Dechter:
Estimating Causal Effects from Learned Causal Networks. ECAI 2024: 2524-2531 - [i37]Anna Raichev, Alexander Ihler, Jin Tian, Rina Dechter:
Estimating Causal Effects from Learned Causal Networks. CoRR abs/2408.14101 (2024) - 2023
- [c153]Bobak Pezeshki, Radu Marinescu, Alexander Ihler, Rina Dechter:
Boosting AND/OR-based computational protein design: dynamic heuristics and generalizable UFO. UAI 2023: 1662-1672 - [i36]Bobak Pezeshki, Radu Marinescu, Alexander Ihler, Rina Dechter:
Boosting AND/OR-Based Computational Protein Design: Dynamic Heuristics and Generalizable UFO. CoRR abs/2309.00408 (2023) - 2022
- [c152]Vincent Hsiao, Dana S. Nau, Rina Dechter:
Fast Fourier Transform Reductions for Bayesian Network Inference. AISTATS 2022: 6445-6458 - [c151]Sakshi Agarwal, Kalev Kask, Alexander Ihler, Rina Dechter:
NeuroBE: Escalating neural network approximations of Bucket Elimination. UAI 2022: 11-21 - [c150]Bobak Pezeshki, Radu Marinescu, Alexander Ihler, Rina Dechter:
AND/OR branch-and-bound for computational protein design optimizing K. UAI 2022: 1602-1612 - [e3]Hector Geffner, Rina Dechter, Joseph Y. Halpern:
Probabilistic and Causal Inference: The Works of Judea Pearl. ACM Books 36, ACM 2022, ISBN 978-1-4503-9586-1 [contents] - 2021
- [c149]Junkyu Lee, Radu Marinescu, Rina Dechter:
Submodel Decomposition Bounds for Influence Diagrams. AAAI 2021: 12147-12157 - [c148]Radu Marinescu, Junkyu Lee, Rina Dechter:
A New Bounding Scheme for Influence Diagrams. AAAI 2021: 12158-12165 - [c147]Vincent Hsiao, Xinyue Pan, Dana S. Nau, Rina Dechter:
Approximating Spatial Evolutionary Games using Bayesian Networks. AAMAS 2021: 1533-1535 - [c146]Yasaman Razeghi, Kalev Kask, Yadong Lu, Pierre Baldi, Sakshi Agarwal, Rina Dechter:
Deep Bucket Elimination. IJCAI 2021: 4235-4242 - 2020
- [c145]Kalev Kask, Bobak Pezeshki, Filjor Broka, Alexander Ihler, Rina Dechter:
Scaling Up AND/OR Abstraction Sampling. IJCAI 2020: 4266-4274 - [c144]Junkyu Lee, Radu Marinescu, Rina Dechter:
Heuristic AND/OR Search for Solving Influence Diagram. SOCS 2020: 127-128
2010 – 2019
- 2019
- [b3]Rina Dechter:
Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms, Second Edition. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers 2019, ISBN 978-3-031-00455-1 - [c143]Qi Lou, Rina Dechter, Alexander Ihler:
Interleave Variational Optimization with Monte Carlo Sampling: A Tale of Two Approximate Inference Paradigms. AAAI 2019: 7900-7907 - [c142]Radu Marinescu, Akihiro Kishimoto, Adi Botea, Rina Dechter, Alexander Ihler:
Anytime Recursive Best-First Search for Bounding Marginal MAP. AAAI 2019: 7924-7932 - [c141]Radu Marinescu, Rina Dechter:
Counting the Optimal Solutions in Graphical Models. NeurIPS 2019: 12091-12101 - [c140]Junkyu Lee, Radu Marinescu, Alexander Ihler, Rina Dechter:
A Weighted Mini-Bucket Bound for Solving Influence Diagram. UAI 2019: 1159-1168 - 2018
- [j58]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): 1-43 (2018) - [j57]Radu Marinescu, Junkyu Lee, Rina Dechter, Alexander Ihler:
AND/OR Search for Marginal MAP. J. Artif. Intell. Res. 63: 875-921 (2018) - [j56]William Lam, Kalev Kask, Javier Larrosa, Rina Dechter:
Subproblem ordering heuristics for AND/OR best-first search. J. Comput. Syst. Sci. 94: 41-62 (2018) - [c139]Junkyu Lee, Alexander Ihler, Rina Dechter:
Generalized Dual Decomposition for Bounding Maximum Expected Utility of Influence Diagrams with Perfect Recall. AAAI Workshops 2018: 674-681 - [c138]Qi Lou, Rina Dechter, Alexander Ihler:
Anytime Anyspace AND/OR Best-First Search for Bounding Marginal MAP. AAAI 2018: 6392-6400 - [c137]Radu Marinescu, Rina Dechter, Alexander Ihler:
Stochastic Anytime Search for Bounding Marginal MAP. IJCAI 2018: 5074-5081 - [c136]Filjor Broka, Rina Dechter, Alexander Ihler, Kalev Kask:
Abstraction Sampling in Graphical Models. UAI 2018: 632-641 - [c135]Qi Lou, Rina Dechter, Alexander Ihler:
Finite-sample Bounds for Marginal MAP. UAI 2018: 725-734 - [c134]Junkyu Lee, Alexander Ihler, Rina Dechter:
Join Graph Decomposition Bounds for Influence Diagrams. UAI 2018: 1053-1062 - 2017
- [j55]Natalia Flerova, Radu Marinescu, Rina Dechter:
Weighted heuristic anytime search: new schemes for optimization over graphical models. Ann. Math. Artif. Intell. 79(1-3): 77-128 (2017) - [j54]Lars Otten, Rina Dechter:
AND/OR Branch-and-Bound on a Computational Grid. J. Artif. Intell. Res. 59: 351-435 (2017) - [j53]William Lam, Kalev Kask, Javier Larrosa, Rina Dechter:
Residual-Guided Look-Ahead in AND/OR Search for Graphical Models. J. Artif. Intell. Res. 60: 287-346 (2017) - [c133]Qi Lou, Rina Dechter, Alexander Ihler:
Anytime Anyspace AND/OR Search for Bounding the Partition Function. AAAI 2017: 860-867 - [c132]Radu Marinescu, Junkyu Lee, Alexander Ihler, Rina Dechter:
Anytime Best+Depth-First Search for Bounding Marginal MAP. AAAI 2017: 3775-3782 - [c131]Qi Lou, Rina Dechter, Alexander Ihler:
Dynamic Importance Sampling for Anytime Bounds of the Partition Function. NIPS 2017: 3196-3204 - 2016
- [j52]Natalia Flerova, Radu Marinescu, Rina Dechter:
Searching for the M Best Solutions in Graphical Models. J. Artif. Intell. Res. 55: 889-952 (2016) - [c130]Rina Dechter, Kalev Kask, William Lam, Javier Larrosa:
Look-Ahead with Mini-Bucket Heuristics for MPE. AAAI 2016: 694-701 - [c129]Junkyu Lee, Radu Marinescu, Rina Dechter, Alexander Ihler:
From Exact to Anytime Solutions for Marginal MAP. AAAI 2016: 3255-3262 - [c128]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: 1567-1568 - [c127]Javier Larrosa, Emma Rollon, Rina Dechter:
Limited Discrepancy AND/OR Search and Its Application to Optimization Tasks in Graphical Models. IJCAI 2016: 617-623 - [c126]Rodrigo de Salvo Braz, Ciaran O'Reilly, Vibhav Gogate, Rina Dechter:
Probabilistic Inference Modulo Theories. IJCAI 2016: 3591-3599 - [c125]Junkyu Lee, Radu Marinescu, Rina Dechter:
Applying Search Based Probabilistic Inference Algorithms to Probabilistic Conformant Planning: Preliminary Results. ISAIM 2016 - [i35]Rodrigo de Salvo Braz, Ciaran O'Reilly, Vibhav Gogate, Rina Dechter:
Probabilistic Inference Modulo Theories. CoRR abs/1605.08367 (2016) - [i34]Ferdinando Fioretto, Enrico Pontelli, William Yeoh, Rina Dechter:
Accelerating Exact and Approximate Inference for (Distributed) Discrete Optimization with GPUs. CoRR abs/1608.05288 (2016) - 2015
- [c124]Radu Marinescu, Rina Dechter, Alexander Ihler:
Pushing Forward Marginal MAP with Best-First Search. IJCAI 2015: 696-702 - [c123]Rina Dechter, Levi H. S. Lelis, Lars Otten:
Caching in Context-Minimal OR Spaces. SOCS 2015: 171-175 - [c122]William Lam, Kalev Kask, Rina Dechter:
Empowering Mini-Bucket in Anytime Heuristic Search with Look-Ahead: Preliminary Evaluation. SOCS 2015: 212-213 - 2014
- [c121]Junkyu Lee, Radu Marinescu, Rina Dechter:
Applying Marginal MAP Search to Probabilistic Conformant Planning: Initial Results. StarAI@AAAI 2014 - [c120]Levi H. S. Lelis, Lars Otten, Rina Dechter:
Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical Models. CP 2014: 481-496 - [c119]Lars Otten, Rina Dechter:
Anytime AND/OR Depth-First Search for Combinatorial Optimization - (Extended Abstract). CP 2014: 933-937 - [c118]Natalia Flerova, Radu Marinescu, Rina Dechter:
Weighted Best First Search for Graphical Models. ISAIM 2014 - [c117]Natalia Flerova, Radu Marinescu, Rina Dechter:
Evaluating Weighted DFS Branch and Bound over Graphical Models. SOCS 2014: 71-79 - [c116]William Lam, Kalev Kask, Rina Dechter, Alexander Ihler:
Beyond Static Mini-Bucket: Towards Integrating with Iterative Cost-Shifting Based Dynamic Heuristics. SOCS 2014: 105-113 - [c115]Alon Milchgrub, Rina Dechter:
STLS: Cycle-Cutset-Driven Local Search For MPE. SOCS 2014: 204-205 - [c114]Radu Marinescu, Rina Dechter, Alexander Ihler:
AND/OR Search for Marginal MAP. UAI 2014: 563-572 - [i33]Robert Mateescu, Rina Dechter, Radu Marinescu:
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models. CoRR abs/1401.3448 (2014) - [i32]Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina Dechter:
Join-Graph Propagation Algorithms. CoRR abs/1401.3489 (2014) - [i31]Bozhena Bidyuk, Rina Dechter, Emma Rollon:
Active Tuples-based Scheme for Bounding Posterior Beliefs. CoRR abs/1401.3833 (2014) - 2013
- [b2]Rina Dechter:
Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers 2013, ISBN 978-3-031-01566-3 - [j51]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): 197-205 (2013) - [j50]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): 669 (2013) - [c113]Levi H. S. Lelis, Lars Otten, Rina Dechter:
Predicting the Size of Depth-First Branch and Bound Search Trees. IJCAI 2013: 594-600 - [c112]Emma Rollon, Javier Larrosa, Rina Dechter:
Semiring-Based Mini-Bucket Partitioning Schemes. IJCAI 2013: 644-650 - [i30]Rina Dechter, Kalev Kask, Robert Mateescu:
Iterative Join-Graph Propagation. CoRR abs/1301.0564 (2013) - [i29]Rina Dechter, David Ephraim Larkin:
Hybrid Processing of Beliefs and Constraints. CoRR abs/1301.2265 (2013) - [i28]Kalev Kask, Rina Dechter:
Mini-Bucket Heuristics for Improved Search. CoRR abs/1301.6708 (2013) - [i27]Irina Rish, Kalev Kask, Rina Dechter:
Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding. CoRR abs/1301.7409 (2013) - [i26]Rina Dechter, Irina Rish:
A Scheme for Approximating Probabilistic Inference. CoRR abs/1302.1534 (2013) - [i25]Rina Dechter:
Bucket Elimination: A Unifying Framework for Several Probabilistic Inference. CoRR abs/1302.3572 (2013) - [i24]Rina Dechter:
Topological Parameters for Time-Space Tradeoff. CoRR abs/1302.3573 (2013) - [i23]Yousri El Fattah, Rina Dechter:
An Evaluation of Structural Parameters for Probabilistic Reasoning: Results on Benchmark Circuits. CoRR abs/1302.3576 (2013) - [i22]Judea Pearl, Rina Dechter:
Identifying Independencies in Causal Graphs with Feedback. CoRR abs/1302.3595 (2013) - 2012
- [j49]Vibhav Gogate, Rina Dechter:
Importance sampling-based estimation over AND/OR search spaces for graphical models. Artif. Intell. 184-185: 38-77 (2012) - [j48]Lars Otten, Rina Dechter:
Anytime AND/OR depth-first search for combinatorial optimization. AI Commun. 25(3): 211-227 (2012) - [c111]Rina Dechter, Natalia Flerova, Radu Marinescu:
Search Algorithms for m Best Solutions for Graphical Models. AAAI 2012: 1895-1901 - [c110]Lars Otten, Rina Dechter:
Advances in Distributed Branch and Bound. ECAI 2012: 917-918 - [c109]Alexander Ihler, Natalia Flerova, Rina Dechter, Lars Otten:
Join-graph based cost-shifting schemes. UAI 2012: 397-406 - [c108]Lars Otten, Rina Dechter:
A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models. UAI 2012: 665-674 - [i21]Kalev Kask, Rina Dechter, Andrew Gelfand:
BEEM : Bucket Elimination with External Memory. CoRR abs/1203.3487 (2012) - [i20]Vibhav Gogate, Rina Dechter:
AND/OR Importance Sampling. CoRR abs/1206.3232 (2012) - [i19]Lars Otten, Rina Dechter:
Bounding Search Space Size via (Hyper)tree Decompositions. CoRR abs/1206.3284 (2012) - [i18]Vibhav Gogate, Bozhena Bidyuk, Rina Dechter:
Studies in Lower Bounding Probabilities of Evidence using the Markov Inequality. CoRR abs/1206.5242 (2012) - [i17]Robert Mateescu, Rina Dechter:
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models. CoRR abs/1206.5266 (2012) - [i16]Radu Marinescu, Rina Dechter:
Best-First AND/OR Search for Most Probable Explanations. CoRR abs/1206.5268 (2012) - [i15]Bozhena Bidyuk, Rina Dechter:
Cutset Sampling with Likelihood Weighting. CoRR abs/1206.6822 (2012) - [i14]Vibhav Gogate, Rina Dechter, Bozhena Bidyuk, Craig Rindt, James Marca:
Modeling Transportation Routines using Hybrid Dynamic Mixed Networks. CoRR abs/1207.1384 (2012) - [i13]Vibhav Gogate, Rina Dechter:
Approximate Inference Algorithms for Hybrid Bayesian Networks with Discrete Constraints. CoRR abs/1207.1385 (2012) - [i12]Robert Mateescu, Rina Dechter:
The Relationship Between AND/OR Search and Variable Elimination. CoRR abs/1207.1407 (2012) - [i11]Vibhav Gogate, Rina Dechter:
A Complete Anytime Algorithm for Treewidth. CoRR abs/1207.4109 (2012) - [i10]Rina Dechter, Robert Mateescu:
Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space. CoRR abs/1207.4119 (2012) - [i9]Bozhena Bidyuk, Rina Dechter:
On finding minimal w-cutset. CoRR abs/1207.4127 (2012) - [i8]Rina Dechter, Thomas S. Richardson:
Proceedings of the Twenty-Second Conference on Uncertainty in Artificial Intelligence (2006). CoRR abs/1208.5160 (2012) - [i7]Alexander Ihler, Natalia Flerova, Rina Dechter, Lars Otten:
Join-graph based cost-shifting schemes. CoRR abs/1210.4878 (2012) - [i6]Lars Otten, Rina Dechter:
A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models. CoRR abs/1210.4885 (2012) - [i5]Bozhena Bidyuk, Rina Dechter:
An Empirical Study of w-Cutset Sampling for Bayesian Networks. CoRR abs/1212.2449 (2012) - [i4]Rina Dechter, Robert Mateescu:
A Simple Insight into Iterative Belief Propagation's Success. CoRR abs/1212.2463 (2012) - [i3]Radu Marinescu, Kalev Kask, Rina Dechter:
Systematic vs. Non-systematic Algorithms for Solving the MPE Task. CoRR abs/1212.2505 (2012) - 2011
- [j47]Vibhav Gogate, Rina Dechter:
SampleSearch: Importance sampling in presence of determinism. Artif. Intell. 175(2): 694-729 (2011) - [j46]Vibhav Gogate, Rina Dechter:
Sampling-based lower bounds for counting queries. Intelligenza Artificiale 5(2): 171-188 (2011) - [c107]Kalev Kask, Andrew Gelfand, Lars Otten, Rina Dechter:
Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models. AAAI 2011: 54-60 - [c106]Andrew Gelfand, Kalev Kask, Rina Dechter:
Stopping Rules for Randomized Greedy Triangulation Schemes. AAAI 2011: 1043-1048 - [c105]Natalia Flerova, Emma Rollon, Rina Dechter:
Bucket and Mini-bucket Schemes for M Best Solutions over Graphical Models. GKR 2011: 91-118 - [c104]Lars Otten, Rina Dechter:
Finding Most Likely Haplotypes in General Pedigrees Through Parallel Search with Dynamic Load Balancing. Pacific Symposium on Biocomputing 2011: 26-37 - [c103]Lars Otten, Rina Dechter:
Anytime AND/OR Depth-First Search for Combinatorial Optimization. SOCS 2011: 117-124 - [i2]Bozhena Bidyuk, Rina Dechter:
Cutset Sampling for Bayesian Networks. CoRR abs/1110.2740 (2011) - 2010
- [j45]Radu Marinescu, Rina Dechter:
Evaluating the impact of AND/OR search on 0-1 integer linear programming. Constraints An Int. J. 15(1): 29-63 (2010) - [j44]Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina Dechter:
Join-Graph Propagation Algorithms. J. Artif. Intell. Res. 37: 279-328 (2010) - [j43]Bozhena Bidyuk, Rina Dechter, Emma Rollon:
Active Tuples-based Scheme for Bounding Posterior Beliefs. J. Artif. Intell. Res. 39: 335-371 (2010) - [c102]Emma Rollon, Rina Dechter:
New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence. AAAI 2010: 1199-1204 - [c101]Lars Otten, Rina Dechter:
Toward parallel search for optimization in graphical models. ISAIM 2010 - [c100]Emma Rollon, Rina Dechter:
Evaluating partition strategies for mini-bucket elimination. ISAIM 2010 - [c99]Kalev Kask, Rina Dechter, Andrew Gelfand:
BEEM : Bucket Elimination with External Memory. UAI 2010: 268-276 - [c98]Vibhav Gogate, Rina Dechter:
On Combining Graph-based Variance Reduction schemes. AISTATS 2010: 257-264
2000 – 2009
- 2009
- [j42]Radu Marinescu, Rina Dechter:
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models. Artif. Intell. 173(16-17): 1457-1491 (2009) - [j41]Radu Marinescu, Rina Dechter:
Memory intensive AND/OR search for combinatorial optimization in graphical models. Artif. Intell. 173(16-17): 1492-1524 (2009) - 2008
- [j40]Robert Mateescu, Rina Dechter:
Mixed deterministic and probabilistic networks. Ann. Math. Artif. Intell. 54(1-3): 3-51 (2008) - [j39]Robert Mateescu, Rina Dechter, Radu Marinescu:
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models. J. Artif. Intell. Res. 33: 465-519 (2008) - [c97]Vibhav Gogate, Rina Dechter:
Studies in Solution Sampling. AAAI 2008: 271-276 - [c96]Robert Mateescu, Rina Dechter:
AND/OR Multi-valued Decision Diagrams for Constraint Networks. Concurrency, Graphs and Models 2008: 238-257 - [c95]Vibhav Gogate, Rina Dechter:
Approximate Solution Sampling (and Counting) on AND/OR Spaces. CP 2008: 534-538 - [c94]Lars Otten, Rina Dechter:
Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems. CP 2008: 576-581 - [c93]Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Rina Dechter:
Robust Solutions in Unstable Optimization Problems. CSCLP 2008: 116-131 - [c92]Rina Dechter, Lars Otten, Radu Marinescu:
On the Practical Significance of Hypertree vs. TreeWidth. ECAI 2008: 913-914 - [c91]Adnan Darwiche, Rina Dechter:
Evaluating probabilistic reasoning systems. BMA 2008