Efficiently search and mine for specific (targeted) classes/slices in your dataset to improve model performance and personalize your models. TRUST supports a number of algorithms for targeted selection which provides a mechanism to include additional information via data to priortize the semantics of the selection.

git clone https://github.com/decile-team/trust.git
cd trust
pip install -r requirements/requirements.txt

TRUST is a toolkit which provides support for various targeted selection algorithms. Most real-world datasets have one or more charateristics that make its use on the state-of-the-art subset selection algorithms very difficult. Quite often, these characteristics are either known or can be easily found out. For example, real-world data is imbalanced, redudant and has samples that are of not of concern to the task at hand. Hence, there is a need to favor some samples while ignore the others. This is possible via different Submodular Information Measures based algorithms implemented in TRUST.

1. "numpy >= 1.14.2",
2. "scipy >= 1.0.0",
3. "numba >= 0.43.0",
4. "tqdm >= 4.24.0",
5. "torch >= 1.4.0",
6. "submodlib"

Learn more about TRUST by reading our documentation.

1. Rare Classes Demo
2. Fairness Demo

You can also download the .ipynb files from the tutorials folder.

This library takes inspiration, builds upon, and uses pieces of code from several open source codebases. This includes Submodlib for submodular optimization.

TRUST is created and maintained by Suraj Kothawade, Nathan Beck, and Rishabh Iyer. We look forward to have TRUST more community driven. Please use it and contribute to it for your research, and feel free to use it for your commercial projects. We will add the major contributors here.

[1] Kothawade S, Kaushal V, Ramakrishnan G, Bilmes J, Iyer R. PRISM: A Rich Class of Parameterized Submodular Information Measures for Guided Subset Selection. To Appear In 36th AAAI Conference on Artificial Intelligence, AAAI 2022

[2] Iyer, R., Khargoankar, N., Bilmes, J. and Asanani, H., 2021, March. Submodular combinatorial information measures with applications in machine learning. In Algorithmic Learning Theory (pp. 722-754). PMLR.

[3] Anupam Gupta and Roie Levin. The online submodular cover problem. In ACM-SIAM Symposiumon Discrete Algorithms, 2020