arXiv AI

Approximating SPR Distance Between Phylogenetic Trees with Graph Neural Networks

arXiv:2607. 18311v1 Announce Type: cross Abstract: Comparing phylogenetic tree topologies is essential for understanding epidemic dynamics, yet biologically meaningful distances such as the Subtree Prune and Regraft (SPR) distance are NP-hard to compute and intractable on large datasets.

arXiv Machine Learning
Aug 7

Phylogenetic Tree Inference with Tropical Axial Attention

arXiv:2605. 13894v2 Announce Type: replace-cross Abstract: In this work, we introduce a Tropical Axial Attention neural reasoning architecture that replaces vanilla softmax dot-product attention with max-plus operators, inducing a piecewise-linear structure aligned with dynamic programming formulations.

By Chris Teska, Kurt Pasque, Ruriko Yoshida, Baran Hashemi
arXiv Machine Learning
Jul 23

Refnd: Preventing Data Leakage in Relational Datasets

arXiv:2607. 19376v1 Announce Type: cross Abstract: Machine learning models trained on biochemical data are routinely evaluated using splits that fail to account for relational structure, causing information leakage and over-optimistic performance estimates.

By Anthony Lavertu, Jacob Cote, Jacques Corbeil, Sophie Gobeil, Pascal Germain
Hugging Face Trending Papers
Jun 2

How Many Trees in a Random Forest? A Revisited Approach with Plateau Search and Optuna Integration

Hyperparameter optimization (HPO) for Random Forest faces a specific difficulty in tuning the number of trees: the predictive score typically improves monotonically with ensemble size, so standard methods such as Tree-structured Parzen Estimator (TPE) and Hyperband require a predefined search range and often drive the estimate toward its right boundary. Early-stopping strategies avoid fixing such a range, but can be sensitive to score noise and prone to premature stopping.

arXiv Machine Learning
Jun 30

Friend or Foe

arXiv:2509. 00123v2 Announce Type: replace-cross Abstract: A fundamental challenge in microbial ecology is determining whether bacteria compete or cooperate in different environmental conditions.

By Oleksandr Cherednichenko, Josephine Solowiej-Wedderburn, Laura M. Carroll, Eric Libby
arXiv Machine Learning
Jun 3

How Many Trees in a Random Forest? A Revisited Approach with Plateau Search and Optuna Integration

arXiv:2606. 03549v1 Announce Type: new Abstract: Hyperparameter optimization (HPO) for Random Forest faces a specific difficulty in tuning the number of trees: the predictive score typically improves monotonically with ensemble size, so standard methods such as Tree-structured Parzen Estimator (TPE) and Hyperband require a predefined search range and often drive the estimate toward its right boundary.

By Vadim Porvatov, Andrey Dukhovny, Andrey Lange
arXiv Machine Learning
Jun 11

GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs

arXiv:2606. 11562v1 Announce Type: new Abstract: Graph analysis underlies many applications whose answers cannot be looked up in a single record or retrieved along a path: laundering rings, drug repurposing, user preference, and scientific theme are all inferred from a node together with its neighbourhood.

By Zhuoyi Peng, Jingzhou Jiang, Hanlin Gu, Lixin Fan, Yi Yang