Skip to main content
Search

# Gibbs sampling

2 related articles

Subscribe to updates
  1. arXiv

    CRAM turns Sudoku into energy descent: 99.996% of Sudoku-Extreme solved after 42 ms of training, 1,000 times faster than looped models

    A trainable energy model called CRAM turns reasoning into repeated descent on an energy function whose weights are learned directly from solved puzzles. It solves 99.996% of Sudoku-Extreme test puzzles and every Maze-Unique test maze, with training on one GPU taking 42 ms and 132 ms respectively, at least 1,000 times faster than looped models. It also cautions that high scores on puzzles like Sudoku and mazes do not indicate how looped reasoning methods will scale to harder tasks.

  2. arXiv

    A polymer memristor probabilistic computer: four p-bits sample Bayesian posteriors in hardware, with statistics inside the finite-sample range of ideal samplers

    Four probabilistic bits (p-bits, stochastic units that take 0 or 1 with a sigmoidal probability of their input) built from solution-processed conjugated-polymer memristors run a closed-loop Gibbs sampler with online drift tracking; on competing, degenerate and cooperative posteriors, both the sampled distribution and its autocorrelation fall inside the finite-sample range of ideal p-bits, with no parameter fitted to the target. Reprogrammed in software, the same circuit also reproduces the invertible AND gate, with temperature fixed in advance rather than fitted.

You’re all caught up