arXiv Machine Learning By Ozgur Yilmaz

ArrowFlow: Hierarchical Machine Learning in the Space of Permutations

Read the original on arXiv Machine Learning →

arXiv:2604. 04087v2 Announce Type: replace Abstract: We introduce ArrowFlow, a machine learning architecture that operates entirely in the space of permutations.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI
Aug 25

BIRDNet: Mining and Encoding Boolean Implication Knowledge Graphs as Interpretable Deep Neural Networks

BIRDNet is a neural network that mines Boolean implication relationships (BIRs) from tabular data and encodes them as a sparse, interpretable architecture where each hidden unit represents a mined rule connecting two features. The design yields a model that is at most 2/d of the weights active per layer and retains symbolic identities for each unit, allowing direct rule extraction without surrogate models. Experiments on six transcriptomic and proteomic datasets show BIRDNet achieves AUROC within 0.02 of the best dense baseline while using up to 95× fewer active parameters, and its first‑layer rules align with known biological signatures.

By Tirtharaj Dash
arXiv AI
2d ago

Four Ways to Grow a Classifier and Why One of Them Cannot Learn

The paper investigates four ways to grow a classifier—adding a tree level, a hidden unit, a leaf split, and a statistically significant split—under a fixed protocol for tree‑structured and constructive models. It shows that the most natural method of deepening a soft decision tree by duplicating a leaf’s class distribution leaves the gradient of new gates identically zero, preventing learning, and proposes a small random perturbation as a fix. The other three growth decisions each provide a distinct benefit: fitting a new hidden unit to residual error yields a smaller network, splitting the leaf with the largest expected error adds sparsity, and requiring statistical significance before splitting adds no value and reduces accuracy.

By Cagri Temel
arXiv AI
Jun 10

Is Fairness Truly Fair? Towards Reliable Lipschitz Fairness in Multi-Task Learning via Fixed-\texorpdfstring{$\delta$}{delta} Alignment

arXiv:2606. 10632v1 Announce Type: cross Abstract: Lipschitz-style individual fairness formalizes the idea that semantically similar examples should receive similar predictions, but its evaluation in multi-task learning (MTL) can be confounded by method-induced representation scales.

By Junbo Ding, Xin Zang, Chenchen Pan, Donghao Song, Jiaxin Zhu, Danhuai Guo