$npx skillfedfor your agent

paretoset

Compute the Pareto (non-dominated) set, i.e., skyline operator/query.

With conditionsPyPI MathematicsReleased May 2025108.2K downloads / moMITPure Python

Decision gist · record as of 2026-08-14

pure-Python wheel — paretoset-1.2.5-py3-none-any.whl
v1.2.5 · released 2025-05-25 · Python >=3.8 · 3 runtime deps: numba, numpy, pandas

Yes, if you need to filter multi-dimensional data for non-dominated points. The package is stable, has no known vulnerabilities, and installs without friction. The aging maintenance status (446 days since last release) is a minor concern but not a blocker for a mature, focused tool. Install it if your workflow involves skyline queries or Pareto front extraction.AI-flagged interpretation of the facts on this page — verify before relying

Before you install

  • Low install friction with a pure Python wheel.
  • Maintenance status is aging—last release was 446 days ago—but the repository remains active and the package is marked Production/Stable.

License · maintenance · safety

MIT (permissive) — MIT license permits unrestricted use, modification, and distribution with minimal attribution requirements.

last release 2025-05-25 (446 days) · last repo commit 2025-05-25 · 69 stars

0 known vulnerabilities (OSV.dev, 2026-08-14) · 108,201 downloads/mo, #12,570 on PyPI

Verify before relying

pip install paretoset

from paretoset import paretoset
import pandas as pd

hotels = pd.DataFrame({"price": [50, 53, 62], "distance": [13, 21, 19]})
mask = paretoset(hotels, sense=["min", "min"])
pareto_hotels = hotels[mask]
  • Whether performance scales acceptably for datasets with thousands of objectives or millions of rows
  • Whether the aging maintenance status (446 days since last release) signals active development or dormancy
Same gist for agents: .md · .json

What it is and what it does

paretoset identifies the subset of observations that represent the best trade-offs across multiple competing objectives. Given a dataset with multiple dimensions, it returns a boolean mask marking which rows are not dominated by any other row—that is, rows where you cannot improve one objective without worsening another. The package wraps numba, numpy, and pandas to provide efficient computation on tabular data.

Typical use cases include finding hotels that balance price and distance, identifying employees with strong performance-to-salary ratios, or filtering optimization solutions to show only Pareto-efficient candidates. You specify the optimization sense for each dimension (minimize, maximize, or ignore) and receive a mask you can use to filter your original data.

Use it for

  • Filter hotel listings to show only those that are cheap or close to the beach, eliminating dominated options
  • Identify top-performing salespeople with high sales relative to salary within each department
  • Extract non-dominated solutions from a multi-objective optimization run to show the efficient frontier
  • Analyze product features to find models that are not strictly worse than competitors on all dimensions
  • Rank candidates in hiring by eliminating those who are strictly dominated on all evaluation criteria

Worth the install?

AI-flagged interpretation of the facts on this page. Verify before relying on it.

With conditions

Yes, if you need to filter multi-dimensional data for non-dominated points.

The package is stable, has no known vulnerabilities, and installs without friction. The aging maintenance status (446 days since last release) is a minor concern but not a blocker for a mature, focused tool. Install it if your workflow involves skyline queries or Pareto front extraction.

Install

paretoset on PyPI

Before you install

Low install friction with a pure Python wheel. Maintenance status is aging—last release was 446 days ago—but the repository remains active and the package is marked Production/Stable.

License in practice

MIT license permits unrestricted use, modification, and distribution with minimal attribution requirements.

Quickstart

pip install paretoset

from paretoset import paretoset
import pandas as pd

hotels = pd.DataFrame({"price": [50, 53, 62], "distance": [13, 21, 19]})
mask = paretoset(hotels, sense=["min", "min"])
pareto_hotels = hotels[mask]

Verify before relying

  • Whether performance scales acceptably for datasets with thousands of objectives or millions of rows
  • Whether the aging maintenance status (446 days since last release) signals active development or dormancy

Package facts

LicenseMIT permissive
Python supportSupports the current Python release >=3.8
Install frictionLow. Pure-Python wheel
Runtime dependencies
3 packages
numbanumpypandas
MaintenanceAging 446 days since the last release
Last repo commit
First released
Downloads108,201 / month, #12,570 on PyPI 30-day window, as of 2026-08-14
Known vulnerabilitiesNone known OSV.dev, checked 2026-08-14
Classifiers
Development Status :: 5 - Production/StableLicense :: OSI Approved :: MIT LicenseProgramming Language :: Python :: 3.10Programming Language :: Python :: 3.11Programming Language :: Python :: 3.12Programming Language :: Python :: 3.13Programming Language :: Python :: 3.9

Evidence: paretoset-1.2.5-py3-none-any.whl

Tags

Capabilities
pareto set computationskyline querynon-dominated solutionsmulti-objective optimizationpareto frontdominance filteringefficient frontier
Topics
optimizationmulti-objectivedata-filtering

Let your AI agent find packages like this

Example. Real query, live index.

You found this page by searching. An agent finds it by wishing: SkillFed indexes 14,416 PyPI packages by what they can do, searchable in plain language.

wish › “pareto set computation”

  • paretosetComputes the Pareto (non-dominated) set from multi-dimensional data,…
  • moocoreProvides fast implementations of core algorithms for multi-objective…
  • pymoopymoo implements single- and multi-objective optimization algorithms…

Give your agent the search over MCP, or paste the wish link into any chat.

More Mathematics packages

networkx Worth it
PyPI · Python Modules · released Dec 2025

NetworkX provides data structures and algorithms for creating, analyzing, and manipulating graphs and networks, supporting everything from simple undirected graphs to complex directed and weighted networks.

BSD-3-Clausepure Python
290.9Mdownloads / mo
kiwisolver Worth it
PyPI · Mathematics · released Mar 2026

kiwisolver is a Python binding to a fast C++ implementation of the Cassowary constraint solver, enabling you to solve systems of linear constraints and inequalities.

Install it if you need to solve constraint systems; skip it if you only need simple linear algebra.

BSD-3-Clausecompiled wheel · 3.10+
205.5Mdownloads / mo
sympy Worth it
PyPI · Scientific/Engineering · released Apr 2025

SymPy is a Python library for symbolic mathematics, performing algebraic manipulation, calculus, equation solving, and mathematical expression simplification without numerical approximation.

BSD-3-Clausepure Python · 3.9+
196.4Mdownloads / mo
contourpy Worth it
PyPI · Information Analysis · released Jul 2025

ContourPy calculates contours of 2D quadrilateral grids using C++11 algorithms wrapped in Python, offering serial and multithreaded implementations without requiring Matplotlib as a dependency.

BSD-3-Clausecompiled wheel · 3.11+
191.2Mdownloads / mo
torch With conditions
PyPI · Software Development · released Jul 2026

PyTorch provides GPU-accelerated tensor computation and automatic differentiation for building and training deep neural networks in Python.

Apache-2.0 AND Apache-2.0 WITH LLVM-exception AND BSD-2-Clause AND BSD-3-Clause AND BSL-1.0 AND MITcompiled wheel · 3.10+
102.5Mdownloads / mo
onnxruntime Worth it
PyPI · Software Development · released Jul 2026

onnxruntime loads and executes Open Neural Network Exchange (ONNX) models with a focus on inference performance across CPUs and accelerators.

Install it if you have ONNX models to run in production or development.

MITcompiled wheel · 3.11+
89.3Mdownloads / mo

See also moocore · pymoo · cmaes · deap · alphashape · pycosat · sparsediffpy · sparse · MAPIE · numpy