Skip to main content

HDLSS-focused tabular learning toolkit with distribution-aware preprocessing, portfolio feature selection, and game-theoretic method aggregation.

Project description

Tabnetics

A Python toolkit for high-dimensional, low-sample-size (HDLSS) tabular classification. Tabnetics grew out of the review paper Machine learning on small size samples: A synthetic knowledge synthesis, which provided the library's initial theoretical background for small-sample learning. The library combines distribution-aware preprocessing, portfolio-based feature selection, and game-theoretic method aggregation into a single pipeline designed for settings where p >> n.

Homepage: tabnetics.org

pip install tabnetics

This base install now matches the ready-to-run public runtime surface and ships every currently packaged direct dependency except TabPFN. For the fully loaded opt-in stack, including TabPFN, use pip install "tabnetics[full]".

Licensed under Apache 2.0.

Tabnetics depends on several third-party libraries with separate licenses and use terms. Those upstream terms still apply when you install or enable the related Tabnetics feature. Review Third-party integrations and licenses before using the packaged dependencies or the full extra.

What's new in 1.1.0

Auto router by default. Tabnetics now ships the V25 calibrated score-router inside the package and enables it by default through DFFSConfig(auto_router_enabled=True). The model computes descriptors directly from the training data, predicts balanced accuracy and macro-F1 for supported candidate profiles, and applies a calibrated conservative policy before the pipeline starts. No network download is required.

Router evidence published. The V25 router was trained with 10-fold dataset-level CV on 57 training datasets and 513 policy groups, excluding the frozen holdout IDs and using only dataset-computable descriptors. Its calibrated policy improves mean balanced accuracy by +0.0038 and macro-F1 by +0.0053 versus the current default-like candidate on the training-CV policy groups, with 124 / 513 non-default selections and 264 / 513 policy-defaulted selections. The latest available frozen-router holdout evidence predates V25 and remains labeled as context rather than claimed V25 holdout validation.

Results browser refreshed. The public interactive browser now includes an Auto Router tab with the V25 policy summary, per-dataset out-of-fold deltas, candidate selection counts, and holdout status alongside the Val-18 through Val-21 benchmark bundle.

Manual flags still work. Set auto_router_enabled=False when reproducing legacy profiles or when an ablation needs explicit method/config flags.

When to use Tabnetics

Tabnetics is built for tabular classification problems where the number of features greatly exceeds the number of samples:

  • Transcriptomics — microarray and RNA-seq gene expression
  • Proteomics and metabolomics — mass-spec feature matrices
  • Other HDLSS settings — any structured tabular problem with p >> n

In these regimes the dominant failure modes are not model selection — they are unstable preprocessing, brittle feature selection, information leakage, and inflated validation estimates. Tabnetics addresses all four.

What Tabnetics adds to the HDLSS problem is not just another selector: it turns many unstable HDLSS choices into a multiplayer portfolio game. Feature-selection methods and classifier candidates are treated as competing players, oracle scores become the payoff structure, and the resulting MNPO equilibrium is used to select a robust portfolio under small-sample constraints.

Usage guide → · Methods & references → · Benchmark results → · Results browser → · Announcements

Call for collaboration

We are actively looking for testers, collaborators, and co-authors to help validate Tabnetics on real-world HDLSS datasets, shape the companion article, and improve the codebase. If you work with high-dimensional tabular data — transcriptomics, proteomics, metabolomics, or similar — we would love to hear from you. See the Discussions page for ongoing conversations, or open a new thread to introduce your use case.

Citation

If you use Tabnetics in research, cite the repository for the specific version you used. The library is still under active development, and a companion paper will be published after the current testing and validation cycle is complete.

Repository URL: https://github.com/klokedm/tabnetics-public

@software{kokol_tabnetics_2026,
  author = {Kokol, Marko},
  title = {Tabnetics},
  year = {2026},
  url = {https://github.com/klokedm/tabnetics-public}
}

Benchmark results

Tabnetics has been evaluated on 63 primary HDLSS benchmark datasets (41-7,000 samples, 500-100,001 features, 2-14 classes) drawn from OpenML, GEO, CuMiDa, Scikit-feature, and UCSC Xena/TCGA, plus 7 additional Val-21 phase-2 RV holdout datasets. Across the consolidated Val-18 through Val-21 evidence base, the refreshed local results summarize 57,217 runs with 278 pipeline profiles. On the primary panel, best profiles exceed published strict-holdout ranges on 29 of 63 datasets, fall within range on 26, and fall below range on 8. Detailed per-dataset results, statistical comparisons, and article references are available in RESULTS.md, and the static results browser exposes the same public surfaces as interactive charts and tables. A refreshed cross-campaign technical report with full methodology, sidecar analysis, and next-experiment recommendations is available.

Auto router

For ordinary use, Tabnetics now auto-calibrates the method/config profile from the training split. The bundled V25 router chooses among supported, already-tested candidates using only descriptors available on a new dataset: sample and feature counts, class-balance statistics, feature-distribution summaries, complexity measures, and candidate action encodings. It does not use holdout labels, validation tiers, or dataset identity.

The goal is to make sensible Tabnetics usage the default path: users should not have to know which validation-campaign flags won on which dataset family before trying the library. See Auto Router for the model card, evidence summary, opt-out flag, and direct inspection API.

Key ideas

  1. Distribution-aware preprocessing. Each feature is fitted to a parametric family (from 20+ candidates) using goodness-of-fit testing, bootstrap calibration, and L-moment prescreening. CDF-based transforms replace ad-hoc normalization.

  2. Portfolio feature selection. Forty feature-selection paths are available overall, including 39 engineered selectors plus a random-baseline reference used in validation. The benchmark MNPO portfolios combine stability selectors, copula knockoffs, tree-based importance, mutual-information filters, IPSS, HSIC-Lasso, and more into a single robust HDLSS feature portfolio. MNPO builds pairwise preference matrices from multiple oracles (performance, stability, complexity, etc.) and solves for a Nash equilibrium via KL-regularized mirror descent. The multiplayer game framing draws conceptual inspiration from Wu et al.'s Multiplayer Nash Preference Optimization, though the HDLSS adaptation is a distinct contribution with different players, oracles, and data regime (see BACKGROUND.md for details).

  3. Regime-aware classification. An MNPO-based classifier oracle picks from regime-appropriate pools. The HDLSS extreme pool now spans 28 candidate backends, including linear/GLM baselines, LDA/QDA families, bias-corrected HDLSS discriminants, PLS and sparse PLS variants, random-projection and random-Fourier lifts, nearest-subspace and spatial-median geometry, copula-style discriminants, confusion-pursuit, DWD / ECOC wrappers, and lightweight or full-fidelity deep-tabular models (TabM, RealMLP). The HDLSS moderate pool carries 29 backends by adding RBF SVM, GPC, KNN, vote ensembles, and TabPFN on top of the HDLSS-safe core. Standard-regime routing can also unlock tree families such as RF, Extra Trees, XGBoost, LightGBM, and CatBoost. The base package now includes the always-shipped boosted-tree and pytabkit backends directly; TabPFN remains the only kept opt-in classifier path, and custom environments still degrade gracefully if any third-party backend is absent.

  4. Strict validation. All learned preprocessing and selection is train-only. The HuggingFace bundle is the authoritative reproducibility mirror of the public upstream datasets used for validation. Synthetic fallback is not allowed for evidence-bearing runs.

Quick start

The quick-start path assumes the recommended expanded install above, so the broader optional selector and backend surface is already available when you need it.

from tabnetics.pipeline import DistributionFeatureSelectionPipeline, DFFSConfig

config = DFFSConfig(random_seed=42)
pipeline = DistributionFeatureSelectionPipeline(config)

result = pipeline.run(X, y, dataset_name="my_dataset", seed=42)

print(f"Accuracy: {result.accuracy:.3f}")
print(f"Selected features: {result.selected_features}")

The quick-start config uses the packaged auto-router. To reproduce legacy manual-default behavior, use DFFSConfig(auto_router_enabled=False).

Operational defaults

The packaged runtime currently follows the promoted post-review workflow:

  • auto_router_enabled=True is the default, so the V25 packaged score-router chooses the supported method/config profile from the training split before DF/FS/classification run.
  • df_stage_position="after_fs" is the default, so distribution fitting runs on the feature space that actually survives selection.
  • Evidence-bearing benchmark and validation runs treat the HuggingFace bundle as the authoritative reproducibility mirror of the public upstream datasets and default to dataset_integrity_policy="error".
  • Conformal prediction is opt-in and should be interpreted as an uncertainty layer (coverage, prediction-set size, singleton rate), not as a balanced-accuracy optimizer.
  • multiomics_adapter="split_halves" is a benchmark-time shortcut; real multi-omics studies should use explicit blocks with tabnetics.multiomics.

Command line workflows

Editable installs expose installed wrappers, and every wrapper has the same packaged python -m ... equivalent:

tabnetics-benchmark --datasets leukemia_golub --seeds 11 23 37
tabnetics-validation-plan --plan-kind validation17 --num-pods 4
tabnetics-validation-suite --dataset-sets fs_easy --seeds 11 23 37

The corresponding module entrypoints are:

  • python -m tabnetics.benchmarks.cli
  • python -m tabnetics.validation.generate_plan
  • python -m tabnetics.validation.core.shard_runner
  • python -m tabnetics.validation.suite

Selected literature anchors

The full methods table lives in BACKGROUND.md. For a quick orientation, these are the main papers behind the current public positioning:

Package structure

Subpackage Purpose
tabnetics.auto_router Packaged V25 router model, dataset descriptor builder, and runtime profile application
tabnetics.core MNPO game-theoretic primitives, sklearn compatibility layer, runtime configuration
tabnetics.distribution Univariate distribution fitting (20+ families), bootstrap GOF, CDF-based transforms
tabnetics.feature_selection 30 selection methods, MNPO portfolio aggregation, copula knockoffs, stability selectors
tabnetics.classification Regime-aware classifier pools, classical and specialist HDLSS backends, MNPO classifier oracle, and conformal helpers
tabnetics.pipeline End-to-end DF+FS+classification pipeline with leakage prevention
tabnetics.datasets Dataset registry, HuggingFace/OpenML loaders, meta-feature extraction
tabnetics.domains Domain adapters (bioinformatics prefilters, face-domain projection)
tabnetics.multiomics Multi-block PLS-DA (DIABLO-style) and MINT batch-correction integration
tabnetics.benchmarks Benchmark runner, method-set profiles, SOTA comparison, gaming detection
tabnetics.validation Validation campaign planner, shard execution, promotion gates

Feature selection methods

The FeatureSelector supports 40 methods out of the box, including 39 engineered selectors plus a random-baseline reference path:

Category Methods
Stability selectors Lasso stability, subspace stability, decorrelated stability, cluster stability, TIGRESS
Wrapper methods RFECV (SVM, RF, LR), Boruta
Filter methods ANOVA F-test, mutual information, mRMR, JMI, CMIM, FCBF, Wilcoxon AUC
Tree-based GBDT importance, TreeSHAP, random forest
Knockoff methods Copula knockoff (D-vine, FDR-controlled via e-values), derandomized knockoffs
Embedded OA-Elastic Net, Joint AUC+L1, HSIC-Lasso
Other IPSS, k-TSP, OVA/ECOC wrappers, Rashomon importance

Methods are aggregated via MNPO with configurable oracle presets (minimal, perf_only, perf_complexity, full, etc.).

See BACKGROUND.md for the full list of implemented papers, USING.md for detailed usage, and RESULTS.md for benchmark results.

Installation

Recommended install for the quick-start and usage-guide examples:

pip install tabnetics

Full install profile (same package plus the opt-in TabPFN path):

pip install "tabnetics[full]"

Requirements

  • Python >= 3.11
  • Plain tabnetics is the ready-to-run public runtime surface
  • Optional install profile: full adds the TabPFN path

Development

git clone https://github.com/klokedm/tabnetics-public.git
cd tabnetics-public
pip install -e ".[dev]"
pytest

License

Apache 2.0 — see LICENSE.


This documentation is auto-generated from internal notes and sources with the support of rule-based transformations and generative AI. Errors are possible — please report any issues via Discussions.

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

tabnetics-1.1.0.tar.gz (1.5 MB view details)

Uploaded Source

Built Distribution

If you're not sure about the file name format, learn more about wheel file names.

tabnetics-1.1.0-py3-none-any.whl (1.3 MB view details)

Uploaded Python 3

File details

Details for the file tabnetics-1.1.0.tar.gz.

File metadata

  • Download URL: tabnetics-1.1.0.tar.gz
  • Upload date:
  • Size: 1.5 MB
  • Tags: Source
  • Uploaded using Trusted Publishing? No
  • Uploaded via: twine/6.2.0 CPython/3.12.3

File hashes

Hashes for tabnetics-1.1.0.tar.gz
Algorithm Hash digest
SHA256 ab618659180cb00f574c195d576e7f26fb9e0c641d2a9aaa50bce8cc2fb5eb22
MD5 2bf0e8af448f4599cb7a508b155993e0
BLAKE2b-256 73a8d3263d56ecaee49c6971ac9e5eecce5ad115cc0c5c484b80698e882871a3

See more details on using hashes here.

File details

Details for the file tabnetics-1.1.0-py3-none-any.whl.

File metadata

  • Download URL: tabnetics-1.1.0-py3-none-any.whl
  • Upload date:
  • Size: 1.3 MB
  • Tags: Python 3
  • Uploaded using Trusted Publishing? No
  • Uploaded via: twine/6.2.0 CPython/3.12.3

File hashes

Hashes for tabnetics-1.1.0-py3-none-any.whl
Algorithm Hash digest
SHA256 1128bacb3048db356af9bd761a1a9a2976c65765eccb7264b9e2677a0082ca98
MD5 d7a8a1a30caa3f3b55463ca3d1e7d274
BLAKE2b-256 76c1eee76c7356948d92b5446ac10f6e21df06c8dff5deea4b8a24aa2854fcec

See more details on using hashes here.

Supported by

AWS Cloud computing and Security Sponsor Datadog Monitoring Depot Continuous Integration Fastly CDN Google Download Analytics Pingdom Monitoring Sentry Error logging StatusPage Status page