# Multi-instance transformers

**URL:** </static-proxy?url=https%3A%2F%2Fdiscuss.huggingface.co%2Ft%2Fmulti-instance-transformers%2F23659%3E%5C
**Category:** 🤗Transformers\
**Created:** [September 27, 2022, 7:15am UTC](/static-proxy?url=https%3A%2F%2Fdiscuss.huggingface.co%2Ft%2Fmulti-instance-transformers%2F23659 "2022-09-27T07:15:26Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![GuillemGSubies](https://avatars.discourse-cdn.com/v4/letter/g/e56c9b/32.png) [@GuillemGSubies](/static-proxy?url=https%3A%2F%2Fdiscuss.huggingface.co%2Fu%2FGuillemGSubies)%5C
**Post date:** [September 27, 2022, 7:15am UTC](/static-proxy?url=https%3A%2F%2Fdiscuss.huggingface.co%2Ft%2Fmulti-instance-transformers%2F23659%2F1 "2022-09-27T07:15:26Z")

</div>

Hello!

I have a dataset where each sample is composed of n texts (the sum of their lengths in tokens is always greater than 512) and I would like to know if someone know what approach could I take to face this problem. It is a classification problem.

Thank you very much