Jump to content

Connect SuperML | Leeroopedia MCP: Equip your AI agents with best practices, code verification, and debugging knowledge. Powered by Leeroo — building Organizational Superintelligence. Contact us at founders@leeroo.com.

Principle:Google deepmind Mujoco Quasi Random Sequences

From Leeroopedia
Knowledge Sources
Domains Numerical_Methods, Sampling
Last Updated 2026-02-15 06:00 GMT

Overview

Low-discrepancy sequence generation for quasi-random sampling with better uniformity than pseudo-random numbers.

Description

Quasi-Random Sequences, specifically the Halton sequence, provide a deterministic sequence of numbers in [0, 1) with low discrepancy — meaning the points are more evenly distributed than pseudo-random numbers. In MuJoCo, the Halton sequence is used for generating noise signals in benchmarking (Ornstein-Uhlenbeck control noise) and other sampling tasks where uniform coverage of the input space is important.

Usage

Use when generating reproducible, uniformly-distributed sample sequences for benchmarking, control noise generation, or initialization of simulation states.

Theoretical Basis

The Halton sequence in base b is defined by reversing the base-b representation of the index:

Hb(i)=k=0dk(i)b(k+1)

Where dk(i) are the digits of i in base b. For multi-dimensional sequences, different prime bases are used for each dimension (2, 3, 5, 7, ...).

Related Pages

Implemented By

Page Connections

Double-click a node to navigate. Hold to expand connections.
Principle
Implementation
Heuristic
Environment