Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers

DOI10.1017/S0963548321000547OpenAlexW3007539016MaRDI QIDQ5886342FDOQ5886342

Authors: Maciej Bendkowski, Olivier Bodini, Sergey Dovgal 

Publication date: 31 March 2023

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.12771

Recommendations

• Polynomial tuning of multiparametric combinatorial samplers
• Analytic samplers and the combinatorial rejection method
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• Boltzmann samplers for first-order differential specifications
• scientific article; zbMATH DE number 2086647

zbMATH Keywords

random samplingcontext-free grammarsanalytic combinatoricsconvex optimisationself-concordant barriersBoltzmann samplerscombinatorial specificationsmultiparametric tuning

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Combinatorics in computer science (68R05)

Cites Work

• Disciplined convex programming
• Foundational Property-Based Testing
• Conic optimization via operator splitting and homogeneous self-dual embedding
• Title not available (Why is that?)
• Interior-point methods
• Analytic combinatorics
• The complexity of counting problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Random generation of combinatorial structures from a uniform distribution
• Title not available (Why is that?)
• Statistical mechanics of combinatorial partitions, and their limit shapes
• Mathematical problems for the next century
• Asymptotic counting of BPS operators in superconformal field theories
• The number of trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An algorithm for drawing general undirected graphs
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• A calculus for the random generation of labelled combinatorial structures
• Computing multiple roots of inexact polynomials
• Uniform random generation of decomposable structures using floating-point arithmetic
• Boltzmann samplers for first-order differential specifications
• Title not available (Why is that?)
• Pointed versus singular Boltzmann samplers: a comparative analysis
• Boltzmann Samplers, Pólya Theory, and Cycle Pointing
• Random Sampling of Plane Partitions
• Title not available (Why is that?)
• Boltzmann Sampling of Unlabelled Structures
• Simple permutations and pattern restricted permutations
• Algorithms for combinatorial structures: well-founded systems and Newton iterations
• Title not available (Why is that?)
• A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time
• Title not available (Why is that?)
• A guide to Monte Carlo simulations in statistical physics.
• An algorithm computing combinatorial specifications of permutation classes
• Title not available (Why is that?)
• Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions
• Analyzing Boltzmann Samplers for Bose–Einstein Condensates with Dirichlet Generating Functions
• A linear algorithm for the random sampling from regular languages
• Exact-size Sampling for Motzkin Trees in Linear Time via Boltzmann Samplers and Holonomic Specification
• Combinatorics of $\lambda$-terms: a natural approach
• Validated computation of the local truncation error of Runge–Kutta methods with automatic differentiation
• On the number of lambda terms with prescribed size of their De Bruijn representation
• Analytic Samplers and the Combinatorial Rejection Method
• Polynomial tuning of multiparametric combinatorial samplers
• On the diversity of pattern distributions in rational language.
• Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications
• Increasing Diamonds
• Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models

Cited In (1)

• Boltzmann distribution on ``short integer partitions with power parts: limit laws and sampling

Uses Software

• MultRoot
• Haskell
• QuickCheck
• SmallCheck
• ECOS
• QuickChick
• DCCP
• SCS

This page was built for publication: Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886342)