Yen-Ting Lin
ABSTRACT
Uniform sampling is an important method in statistics and has various applications in model counting, system verification, algorithm design, among others. Symbolic sampling in a Boolean space is a recently proposed technique that combines sampling and symbolic representation for effective Boolean reasoning. Under the framework of symbolic sampling, we propose a method to construct compact XOR circuits achieving uniform sampling in a given Boolean space. The method is further extended to biased sampling within a focused subspace of interest. Experimental results show the effectiveness of compact sampling circuit generation and its potential to facilitate Boolean reasoning.
- M. Bellare, O. Goldreich, and E. Petrank. 2000. Uniform Generation of NP-Witnesses Using an NP-Oracle. Information and Computation 163 (12 2000), 510--526.Google Scholar
- R. Brayton and A. Mishchenko. 2010. ABC: An Academic Industrial-Strength Verification Tool. In Proceedings of International Conference on Computer Aided Verification (CAV). 24--40.Google Scholar
- S. Chakraborty, D. Fremont, K. Meel, S. Seshia, and M. Vardi. 2015. On Parallel Scalable Uniform SAT Witness Generation. In Proceedings of International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). 304--319.Google Scholar
- S. Chakraborty, K. Meel, and M. Vardi. 2013. A Scalable and Nearly Uniform Generator of SAT Witnesses. In Proceedings of International Conerence on Computer Aided Verification (CAV). 608--623.Google Scholar
- S. Chakraborty, K. Meel, and M. Vardi. 2013. A Scalable Approximate Model Counter. In Proceedings of International Conference on Principles and Practice of Constraint Programming (CP). 200--216.Google Scholar
- S. Chakraborty, K. Meel, and M. Vardi. 2014. Balancing Scalability and Uniformity in SAT Witness Generator. In Proceedings of Design Automation Conference (DAC). 60:1--60:6.Google Scholar
- R. A. Fisher. 1992. Statistical Methods for Research Workers. In Breakthroughs in Statistics: Methodology and Distribution, Samuel Kotz and Norman L. Johnson (Eds.). Springer New York, 66--70.Google Scholar
- J. Gentle. 2003. Random Number Generation and Monte Carlo Methods. Springer New York.Google Scholar
- C. Gomes, A. Sabharwal, and B. Selman. 2006. Model Counting: A New Strategy for Obtaining Good Bounds.. In Proceedings of the National Conference on Artificial Intelligence (AAAI). 54--61.Google Scholar
- C. Gomes and B. Selman. 2006. Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints. In Proceedings of Advances in Neural Information Processing Systems (NIPS). 481--488.Google Scholar
- C.-S Han and J.-H R. Jiang. 2012. When Boolean Satisfiability Meets Gaussian Elimination in a Simplex Way. In Proceedings of International Conference on Computer Aided Verification (CAV). 410--426.Google Scholar
- M. Jerrum, L. Valiant, and V. Vazirani. 1986. Random Generation of Combinatorial Structures from a Uniform Distribution. Theoretical Computer Science 43 (12 1986), 169--188.Google Scholar
- V. N. Kravets, J.-H. R. Jiang, and H. Riener. 2020. Learning to Automate the Design Updates From Observed Engineering Changes in the Chip Development Cycle. In Proceedings of Design, Automation & Test in Europe Conference & Exhibition (DATE). 738--743.Google Scholar
- V. N. Kravets, N.-Z. Lee, and J.-H. R. Jiang. 2019. Comprehensive Search for ECO Rectification Using Symbolic Sampling. In Proceedings of Design Automation Conference (DAC). 71:1--71:6.Google ScholarDigital Library
- K. Pearson. 1992. On the Criterion that a Given System of Deviations from the Probable in the Case of a Correlated System of Variables is Such that it Can be Reasonably Supposed to have Arisen from Random Sampling. In Breakthroughs in Statistics: Methodology and Distribution, Samuel Kotz and Norman L. Johnson (Eds.). Springer New York, 11--28.Google Scholar
- J. P. Schmidt, A. Siegel, and A. Srinivasan. 1995. Chernoff-Hoeffding Bounds for Applications with Limited Independence. SIAM J. Discret. Math. 8, 2 (1995), 223--250.Google ScholarDigital Library
- M. Sipser. 1983. A complexity theoretic approach to randomness. In Proceedings of the ACM Symposium on Theory of Computing (STOC). 330--335.Google ScholarDigital Library
- F. Somenzi. 2005. CUDD: CU Decision Diagram Package (release 2.4.1). University of Colorado at Boulder (2005).Google Scholar
Recommendations
Near-uniform sampling of combinatorial spaces using XOR constraints
NIPS'06: Proceedings of the 19th International Conference on Neural Information Processing SystemsWe propose a new technique for sampling the solutions of combinatorial problems in a near-uniform manner. We focus on problems specified as a Boolean formula, i.e., on SAT instances. Sampling for SAT problems has been shown to have interesting ...
Improving XOR-Dominated Circuits by Exploiting Dependencies between Operands
ASP-DAC '07: Proceedings of the 2007 Asia and South Pacific Design Automation ConferenceLogic synthesis has made impressive progress in the last decade and has pervaded digital design replacing almost universally manual techniques. A remarkable exception is computer arithmetic and datapath design, where designers still rely mostly on well ...
Exact sampling with highly uniform point sets
In 1996, Propp and Wilson came up with a remarkably clever method for generating exact samples from the stationary distribution of a Markov chain [J.G. Propp, D.B. Wilson, Exact sampling with coupled Markov chains and applications to statistical ...
Comments