Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
From MaRDI portal
Publication:5886342
DOI10.1017/S0963548321000547OpenAlexW3007539016MaRDI QIDQ5886342
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
context-free grammarsrandom samplingself-concordant barriersanalytic combinatoricsconvex optimisationBoltzmann samplerscombinatorial specificationsmultiparametric tuning
Combinatorics in computer science (68R05) Enumerative combinatorics (05A99) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Algorithms for combinatorial structures: well-founded systems and Newton iterations
- An algorithm computing combinatorial specifications of permutation classes
- Statistical mechanics of combinatorial partitions, and their limit shapes
- Random generation of combinatorial structures from a uniform distribution
- Uniform random generation of decomposable structures using floating-point arithmetic
- A calculus for the random generation of labelled combinatorial structures
- Mathematical problems for the next century
- Interior-point methods
- A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time
- Boltzmann samplers for first-order differential specifications
- An algorithm for drawing general undirected graphs
- Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions
- Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models
- A linear algorithm for the random sampling from regular languages
- Simple permutations and pattern restricted permutations
- The number of trees
- Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications
- Increasing Diamonds
- Foundational Property-Based Testing
- Pointed versus singular Boltzmann samplers: a comparative analysis
- Boltzmann Samplers, Pólya Theory, and Cycle Pointing
- Random Sampling of Plane Partitions
- Combinatorics of $\lambda$-terms: a natural approach
- On the number of lambda terms with prescribed size of their De Bruijn representation
- Computing multiple roots of inexact polynomials
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- Validated computation of the local truncation error of Runge–Kutta methods with automatic differentiation
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Boltzmann Sampling of Unlabelled Structures
- On the diversity of pattern distributions in rational language.
- Exact-size Sampling for Motzkin Trees in Linear Time via Boltzmann Samplers and Holonomic Specification
- Analytic Samplers and the Combinatorial Rejection Method
- Polynomial tuning of multiparametric combinatorial samplers
- Analyzing Boltzmann Samplers for Bose–Einstein Condensates with Dirichlet Generating Functions
- Asymptotic counting of BPS operators in superconformal field theories
- A Guide to Monte Carlo Simulations in Statistical Physics
