ambr 0.3.1

Agent-based Modeling with Blazingly Efficient Records

AMBER (Agent-based Modeling with Blazingly Efficient Records)

AMBER is a Python framework for agent-based modeling that uses Polars for efficient data handling and analysis. AMBER provides a clean, robust API for creating parallel, high-performance simulations in Python.

🚀 Performance

AMBER stores the entire population as a columnar Polars DataFrame and exposes a vectorized view API (agents.where(...), agents.at[ids], scatter_add) that compiles per-step updates down to a handful of Polars expressions — regardless of population size.

Benchmark against every other ABM framework we found — 5000 agents, 50 steps, Python 3.12, Julia 1.12.3, Apple Silicon. All numbers are wall-clock, averaged over 3 runs (slowest trimmed). Every framework is verified against output invariants (wealth conservation, boundary clamping, S+I+R population conservation) before timing — see benchmarks/correctness_check.py. Reproducer: benchmarks/run_all_frameworks.py.

Framework	Language	Arch.	Wealth Transfer	Random Walk	SIR Epidemic
AMBER (vectorized)	Python	Columnar (Polars)	20 ms 🥈	6 ms 🥇	551 ms 🥇
Agents.jl	Julia	Object	7 ms 🥇	7 ms 🥈	809 ms 🥈
AMBER (loop)	Python	Object	173 ms	319 ms	9.36 s
Mesa	Python	Object	24.40 s	127 ms	17.07 s
AgentPy	Python	Object	262 ms	137 ms	11.05 s
SimPy	Python	Event loop	215 ms	243 ms	5.13 s
Melodie	Python	Hybrid	178 ms	1.02 s	16.21 s

AMBER (vectorized) wins two of three models outright (random walk and SIR) and comes second on wealth transfer, trailing only JIT-compiled Julia. It is the fastest Python-hosted framework on every model at 5000 agents and within 3× of Agents.jl on the one model Julia wins — while every other Python-hosted framework is 5× to 1200× slower on the same workload.

See benchmarks/README.md for the full table at 500 / 1000 / 5000 agents, speedup ratios, a per-model correctness audit, and a discussion of why some of the numbers I previously shipped were measuring different problems across frameworks.

🚀 Quick Start

import ambr as am
import numpy as np

# Define a model with the vectorized view API — no per-agent loops.
class WealthModel(am.Model):
    def setup(self):
        self.add_agents(100, wealth=np.random.randint(1, 10, size=100))

    def step(self):
        donors = self.agents.where(self.agents.wealth > 0)
        donors.wealth -= 1
        ids = self.agents.ids.to_numpy()
        recipients = self.nprandom.choice(ids, size=len(donors))
        self.agents.at[recipients].scatter_add(wealth=1)
        self.record('total_wealth', int(self.agents.wealth.sum()))

model = WealthModel({'steps': 100, 'seed': 42, 'show_progress': False})
results = model.run()
print(results['agents'].head(10))

New in 0.3.0: Setting agent.wealth = 5 on a Python Agent automatically syncs to the DataFrame. You can freely mix OOP-style and vectorized access without desync.

⚡ Vectorized View API

The view API compiles per-step updates to a handful of Polars expressions — regardless of population size:

def step(self):
    # Bulk columnar reads/writes over the entire population
    self.agents.x = self.agents.x + self.nprandom.uniform(-1, 1, len(self.agents))

    # Filtered writes: only agents matching a condition
    infected = self.agents.where(self.agents.status == 1)
    infected.infection_time += 1

    # scatter_add: flow-of-resources with duplicate-id safety
    self.agents.at[[1, 1, 3]].scatter_add(wealth=1)  # agent 1 gets +2, agent 3 gets +1

🔬 Optimization

AMBER includes powerful optimization capabilities for parameter tuning:

from ambr.optimization import ParameterSpace, grid_search

# Define parameter space
parameter_space = ParameterSpace({
    'agents': [10, 50, 100],
    'initial_value': [1, 5, 10],
    'steps': 100
})

# Run optimization
results = grid_search(MyModel, parameter_space, 'some_metric')
best_params = results[0]['parameters']

📦 Installation

pip install ambr

🏗️ Features

• Simple API: Intuitive interface for agent-based modeling
• High Performance: Efficient data handling with Polars DataFrames
• Optimization: Built-in parameter optimization with grid search, random search, and Bayesian optimization
• Environments: Support for grid, network, and continuous space environments
• Experiments: Run multiple simulations with parameter sampling
• Random Number Generation: Reproducible simulations with controlled randomness

📚 Examples

Working examples are available in the examples/ directory:

• Wealth Transfer Model: Economic inequality simulation
• Virus Spread Model: Epidemiological SIR model
• Flocking Simulation: Boids flocking behavior
• Forest Fire Model: Cellular automata fire spread
• Network Simulations: Graph-based agent interactions

📖 Documentation

• Documentation: https://ambr.readthedocs.io/
• Paper: https://arxiv.org/abs/2601.16292

📝 How to cite?

If you use AMBER in your research, please cite our paper:

@article{pham2026amber,
  title={AMBER: A Columnar Architecture for High-Performance Agent-Based Modeling in Python},
  author={Pham, Anh-Duy},
  journal={arXiv preprint arXiv:2601.16292},
  year={2026}
}

🤝 Contributing

We welcome contributions! Please see our contributing guidelines for more information.

📄 License

This project is licensed under the BSD 3-Clause License - see the LICENSE file for details.