Tootfinder

Oldies but Goldies: The Potential of Character N-grams for Romanian Texts
Dana Lupsa, Sanda-Maria Avram
https://arxiv.org/abs/2506.15650 https://

Oldies but Goldies: The Potential of Character N-grams for Romanian Texts
This study addresses the problem of authorship attribution for Romanian texts using the ROST corpus, a standard benchmark in the field. We systematically evaluate six machine learning techniques: Support Vector Machine (SVM), Logistic Regression (LR), k-Nearest Neighbors (k-NN), Decision Trees (DT), Random Forests (RF), and Artificial Neural Networks (ANN), employing character n-gram features for classification. Among these, the ANN model achieved the highest performance, including perfect clas…

Let's play POLO: Integrating the probability of lesion origin into proton treatment plan optimization for low-grade glioma patients
Tim Ortkamp, Habiba Sallem, Semi Harrabi, Martin Frank, Oliver J\"akel, Julia Bauer, Niklas Wahl
https://arxiv.org/abs/2506.13539

Let's play POLO: Integrating the probability of lesion origin into proton treatment plan optimization for low-grade glioma patients
In proton therapy of low-grade glioma (LGG) patients, contrast-enhancing brain lesions (CEBLs) on magnetic resonance imaging are considered predictive of late radiation-induced lesions. From the observation that CEBLs tend to concentrate in regions of increased dose-averaged linear energy transfer (LET) and proximal to the ventricular system, the probability of lesion origin (POLO) model has been established as a multivariate logistic regression model for the voxel-wise probability prediction o…

This https://arxiv.org/abs/2501.19277 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_sta…

On Pareto Optimality for the Multinomial Logistic Bandit
We provide a new online learning algorithm for tackling the Multinomial Logit Bandit (MNL-Bandit) problem. Despite the challenges posed by the combinatorial nature of the MNL model, we develop a novel Upper Confidence Bound (UCB)-based method that achieves Pareto optimality by balancing regret minimization and estimation error of the assortment revenues and the MNL parameters. We develop theoretical guarantees characterizing the tradeoff between regret and estimation error for the MNL-Bandit pr…