facebookresearch/nevergrad

A Python toolbox for performing gradient-free optimization

View on GitHub ↗Jump to charts ↓Open shareable report

Summary Information

Updated 35 minutes ago
Added to GitGenius on September 16th, 2026
Created on November 21st, 2018
Open Issues & Pull Requests: 141 (+0)
GitHub issues: Enabled
Number of forks: 371
Total Stargazers: 4,208 (+0)
Total Subscribers: 55 (+0)

Repository Insights (GitGenius)

Median issue/PR response: 104.8 days
Mean response time: 199.8 days
90th percentile: 663.8 days
Tracked items: 17

Most active contributors

Sign in to see contributor activity.

Charts & Analytics

Fetching additional details & charts...

Issue Activity (beta)

Open issues: 16
New in 7 days: 0
Closed in 7 days: 0
Avg open age: 644 days
Stale 30+ days: 16
Stale 90+ days: 13

Recent activity

Opened in 7 days: 0
Closed in 7 days: 0
Comments in 7 days: 0
Events in 7 days: 0

Top labels

No label distribution available yet.

Most active issues this week

No issue events were indexed in the last 7 days.

Detailed Description

Nevergrad is a Python toolbox for performing gradient-free optimization.

The toolbox addresses optimization problems where gradients are unavailable, expensive to compute, or unreliable. It provides a collection of gradient-free optimization algorithms that can be applied to black-box functions and complex search spaces. The approach works by implementing various optimization strategies that rely on function evaluations rather than derivative information, making it suitable for problems where traditional gradient-based methods cannot be applied.

Developers should consider Nevergrad for optimization tasks involving expensive function evaluations, noisy objectives, or non-differentiable systems. It suits research projects exploring optimization algorithms, hyperparameter tuning in scenarios where gradients are impractical, and engineering problems with complex objective functions. The toolbox is particularly valuable for teams needing a flexible framework to experiment with multiple gradient-free strategies rather than implementing algorithms from scratch.

The project maintains active development with regular updates to its optimization algorithm implementations and documentation. The codebase receives ongoing refinement to improve algorithm performance and usability. The project demonstrates sustained engagement with its user base through continued maintenance of core functionality and examples.