pntx
pntx is a Python library that turns user-supplied positive/negative text pools
into two independent components:
pntx.t2pn(text → positive/negative) — a family of scikit-learnClassifiers that label arbitrary text aspositiveornegative:LLMPromptingClassifierclassifies via LLM few-shot prompting/scoring (no training), andFineTuningClassifieractually fine-tunes a pretrainedtransformersencoder (default: multilingual BERT).pntx.pn2t(positive/negative → text) — two imbalanced-learn-style oversamplers with different goals:OverSamplergenerates "hard positive" text to balance an imbalanced dataset for classifier training, andSyntheticSamplergenerates anonymized, representative synthetic positives for publishing data you can't share as-is.
The meaning of "positive" and "negative" is entirely up to you. It doesn't have to be
sentiment — it can be formal/casual, policy-compliant/violating, or any other contrast
you define with examples. pntx never interprets the pools; it only uses them as
few-shot and scoring material.
from pntx.t2pn import LLMPromptingClassifier
from pntx.pn2t import OverSampler
# --- t2pn: classification via LLM few-shot prompting (no training) ---
clf = LLMPromptingClassifier(backend="llama", backend_kwargs={"model_path": "model.gguf"})
X = ["The movie was fantastic", "Support was quick and helpful",
"The movie was boring", "Support was slow and unhelpful"]
y = ["positive", "positive", "negative", "negative"] # 0/1 works too
clf.fit(X, y)
clf.predict(["The staff were incredibly friendly"]) # array(['positive'], dtype='<U8')
clf.predict_proba(["The staff were incredibly friendly"]) # shape (1, 2), columns follow clf.classes_
# drops straight into the scikit-learn ecosystem
from sklearn.model_selection import cross_val_score
cross_val_score(clf, X, y, cv=5)
# persist the fitted pools (not the backend -- pass a fresh one back in on load)
clf.save("classifier.json")
loaded = LLMPromptingClassifier.load("classifier.json", backend="llama",
backend_kwargs={"model_path": "model.gguf"})
# --- t2pn: classification via fine-tuning a pretrained encoder (pntx[finetuning]) ---
from pntx.t2pn import FineTuningClassifier
ft_clf = FineTuningClassifier(class_weight="balanced") # default model_name is multilingual BERT
ft_clf.fit(X, y) # this one actually trains
ft_clf.predict_proba(["The staff were incredibly friendly"])
ft_clf.save("finetuned/") # persists the trained weights, not just pooled text
loaded_ft = FineTuningClassifier.load("finetuned/")
# --- pn2t: generation (an imbalanced-learn-style OverSampler) ---
sampler = OverSampler(backend="llama", backend_kwargs={"model_path": "model.gguf"})
X_aug, y_aug = sampler.fit_resample(X, [1, 1, 0, 0]) # binary labels only; positive class = 1
sampler.generation_result_.hard_positives # generated texts + the LLM's rationale for each
# --- pn2t: anonymized synthetic data generation ---
from pntx.pn2t import SyntheticSampler
synth = SyntheticSampler(
backend="llama", backend_kwargs={"model_path": "model.gguf"}, n_synthesized=10
)
X_syn, y_syn = synth.fit_resample(X, [1, 1, 0, 0])
synth.generation_result_.synthetic_texts # generated texts + what was generalized away for each
OverSampler.fit_resample generates "hard positives" — texts an expert would label
positive but that shallow classifiers or untrained humans might mislabel negative — by
first asking the backend to analyze what distinguishes the two classes. It's a full
port of semaxis's HardPositiveOverSampler,
routed through pntx's own Backend abstraction so it can share a loaded model with
LLMPromptingClassifier instead of loading its own. v1 only generates the positive side and
supports binary {0, 1} labels; imbalanced-learn itself isn't required (fit_resample
is duck-typed, so imblearn.pipeline.Pipeline still works if it's installed
separately).
SyntheticSampler.fit_resample has a different goal: instead of hard positives for
classifier augmentation, it generates typical positive-class texts with specific
identifying details (names, exact dates/numbers, locations, verbatim phrases) generalized
away, so the result is safe to publish even when the original pool isn't. The negative
pool is still required (for the same binary-label validation as OverSampler), but it's
never shown to the backend — only positive exemplars inform generation, since contrasting
against negatives would frame generation around the boundary rather than the typical
case. Anonymity is best-effort: besides the prompt instructions, a lightweight verbatim-
substring check (min_verbatim_span, default 20 characters) rejects and retries any
generated text that copies a long span straight out of a positive exemplar — this catches
copy-through leaks but not paraphrased ones, so it's not a privacy guarantee.
Installation
pntx uses uv for package management.
uv add pntx # core (scikit-learn + pydantic)
uv add "pntx[llama]" # + llama.cpp in-process backend
uv add "pntx[finetuning]" # + FineTuningClassifier (transformers + torch)
uv add "pntx[embeddings]" # + semantic similarity for selectors
scikit-learn and pydantic are core dependencies (every t2pn classifier's
scikit-learn contract and OverSampler's structured LLM output need them
respectively). Each backend/feature otherwise lives behind its own extra, and using
one without installing it raises a clear ImportError with the install command to run.
Backends
pntx runs models via a Backend protocol, shared by LLMPromptingClassifier,
OverSampler, and SyntheticSampler. FineTuningClassifier does not use this
abstraction at all -- it has no LLM calls, only a fine-tuned transformers encoder, so
there's no loaded model to share with the others:
LlamaCppBackend(pntx[llama]) — runs a GGUF model in-process viallama-cpp-python. This is the primary, most-tuned backend: classification uses token log-probabilities directly (score_choices), and batched classification reuses the shared few-shot prefix's KV cache across every item instead of re-evaluating it per item.
clf = LLMPromptingClassifier(backend="llama", backend_kwargs={"model_path": "model.gguf"})
# or pass a backend instance directly, e.g. for dependency injection in tests
from pntx.backends.llama import LlamaCppBackend
clf = LLMPromptingClassifier(backend=LlamaCppBackend(model_path="model.gguf"))
A remote API backend can be added later by implementing the Backend protocol
(pntx.backends.base.Backend) and passing an instance directly — no built-in one
ships right now.
backend_kwargs is only used when backend is given as a string; it's a single dict
(rather than **kwargs) so LLMPromptingClassifier/OverSampler/SyntheticSampler stay compatible
with scikit-learn's get_params()/clone().
LlamaCppBackend accepts either a local model_path or a repo_id (optionally
narrowed to one file with filename) to pull a GGUF model from the Hugging Face Hub
via Llama.from_pretrained. Any other keyword — n_ctx, n_gpu_layers,
flash_attn, verbose, ... — is forwarded as-is to llama_cpp.Llama:
clf = LLMPromptingClassifier(
backend="llama",
backend_kwargs={
"repo_id": "Qwen/Qwen2.5-1.5B-Instruct-GGUF",
"filename": "*q4_k_m.gguf",
"n_ctx": 4096,
"n_gpu_layers": -1, # offload all layers to GPU
"flash_attn": True,
},
)
To share one loaded model across LLMPromptingClassifier, OverSampler, and SyntheticSampler
(recommended for local inference — avoids loading the same GGUF twice), construct the
backend once and pass the instance to each:
from pntx.backends.llama import LlamaCppBackend
backend = LlamaCppBackend(model_path="model.gguf")
clf = LLMPromptingClassifier(backend=backend)
sampler = OverSampler(backend=backend)
synth = SyntheticSampler(backend=backend, n_synthesized=10)
Selecting exemplars
When there are more fitted texts (on either side) than comfortably fit in a prompt, a
Selector decides which ones to use — LLMPromptingClassifier calls it independently for the
positive and negative pools:
RandomSelector(default) — a uniform random subset.NearestSelector— picks texts most similar to the text being classified; dynamic, per-query selection.DiversitySelector— greedily picks a maximally diverse subset.BudgetSelector— picks as many texts as fit within a token budget (used internally byOverSamplerfor its exemplar sampling).
NearestSelector and DiversitySelector take a similarity_fn. It defaults to a
dependency-free character n-gram similarity (pntx.dedup.similarity); pass
pntx.embeddings.cosine_similarity_fn() (requires pntx[embeddings]) for semantic
similarity instead:
from pntx.t2pn import LLMPromptingClassifier
from pntx.selection import NearestSelector
clf = LLMPromptingClassifier(
backend="llama", backend_kwargs={"model_path": "model.gguf"}, selector=NearestSelector()
)
LLMPromptingClassifier treats a selector as static or dynamic based on its
query_aware attribute (RandomSelector/DiversitySelector/BudgetSelector are
static; NearestSelector is the only built-in dynamic one):
- Static (default): exemplar selection, ordering, and calibration (see below) are
all resolved once in
fit()and reused by every laterpredict/predict_probacall — this is what lets aBatchScoringBackend(e.g.LlamaCppBackend) evaluate the shared few-shot prefix once per call and reuse its KV cache across the whole batch. - Dynamic (e.g.
NearestSelector): exemplars genuinely relevant to each text can't be known ahead of time, so selection reruns per text insidepredict/predict_probainstead. For aBatchScoringBackendthis forfeits the shared-prefix KV-cache reuse above (each text gets its own prefix and its own backend call), andLLMPromptingClassifierraises aUserWarningonce per call to flag the latency trade-off.
LLMPromptingClassifier also applies content-free calibration (Zhao et al. 2021, "Calibrate
Before Use") by default on the ScoringBackend path: it scores an empty placeholder
query against the same few-shot prefix to estimate the prefix's own label bias (an
artifact of which exemplars ended up in it and in what order — few-shot prompts are
known to be sensitive to this), then divides each real prediction by that baseline and
renormalizes. Pass LLMPromptingClassifier(..., calibrate=False) to disable it and get the raw,
uncalibrated softmax instead.
OverSampler and SyntheticSampler don't take a Selector; instead their
sample_method constructor argument picks a budget-based sampling strategy (a full
port of semaxis's own sample_method/embedding_model for OverSampler;
SyntheticSampler reuses the same mechanism for its positive-only exemplar sampling):
"random"(default) — a uniform random subset, filled until the token budget runs out (BudgetSelectorunder the hood)."kmeans"— embeds the pool viaembedding_model(requirespntx[embeddings]) and picks one representative text per K-Means cluster."votek"— embeds the pool and runs the Vote-K algorithm (Su et al. 2022), balancing representativeness and diversity.
sampler = OverSampler(
backend="llama",
backend_kwargs={"model_path": "model.gguf"},
sample_method="votek",
embedding_model="paraphrase-albert-small-v2", # sentence-transformers model name
)
Development
uv sync # install dev dependencies
uv run pytest # unit tests (integration tests are skipped by default)
uv run ruff check .
uv run mypy src tests
Integration tests that hit a real model or API are opt-in:
PNTX_LLAMA_MODEL_PATH=/path/to/model.gguf uv run pytest tests/integration
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Filter files by name, interpreter, ABI, and platform.
If you're not sure about the file name format, learn more about wheel file names.
Copy a direct link to the current filters
File details
Details for the file pntx-0.12.1.tar.gz.
File metadata
- Download URL: pntx-0.12.1.tar.gz
- Upload date:
- Size: 41.0 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via:
twine/7.0.0 CPython/3.10.20
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
d4429bda67758f4a21ea3cddfa375d90ed21a3fdda3b5db962d224a32e160869
|
|
| MD5 |
d46e91a92d54f7e1de971d69468f9167
|
|
| BLAKE2b-256 |
aa377ada9a70895387c1d27870b20e5da346019ade08616d38996e1ca166c0c4
|
File details
Details for the file pntx-0.12.1-py3-none-any.whl.
File metadata
- Download URL: pntx-0.12.1-py3-none-any.whl
- Upload date:
- Size: 53.6 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
- Uploaded via:
twine/7.0.0 CPython/3.10.20
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
9ef021e8441379f96b5426e613e0494e551aee9caa812fa2f349025e390d500c
|
|
| MD5 |
d0643b917ca7211b6ede4e4c9443e713
|
|
| BLAKE2b-256 |
b18c9b9ce8e59d7b3bd88889258b4e433879eee7104171b898df4679f200afe0
|