[D] BertClassification for really long input sentences.

So i have a task that i am trying to solve at the moment, the input strings in my datasets are in 10-20K length. What would be the best way to handle this with the tokenizers in the BertForSeqeuenceClassification?

​

I have checked the LongFormer and BigBird but they are also limited to the 512 and 4096 token length.

some help in this matter would be greatly appreciated.

datasets machinelearning solve strings