arXiv Statistics ML By Joanna Bieri, Edgar Costa, Alyson Deines, Kyu-Hwan Lee, David Lowry-Duda, Thomas Oliver, Yidi Qi, Tamara Veenstra

Murmurations, Mestre--Nagao sums, and Convolutional Neural Networks for elliptic curves

Read the original on arXiv Statistics ML →

arXiv:2603. 17681v2 Announce Type: replace-cross Abstract: We apply one-dimensional convolutional neural networks to the Frobenius traces of elliptic curves over $\mathbb{Q}$ and evaluate and interpret their predictive capacity.

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 Statistics ML.

arXiv Machine Learning
Sep 23

Continuous Optimization for p-adic Models

arXiv:2609.25501v1 Announce Type: new Abstract: We present the first method for native, continuous gradient descent for machine learning models with $p$-adic parameters. Existing native optimizers ar...

By Julian Salazar, Dimitri Kanevsky, Matt Harvey, Pascal Getreuer, Lucas Dixon
arXiv Computer Vision
Aug 27

MIMONet: Multi-scale Input and Multi-scale Output Network for Salient Object Detection

MIMONet is a saliency detection model that uses multi‑scale inputs and outputs to better handle objects of varying sizes. It processes three differently sized images through separate encoder branches that exchange information, allowing each branch to learn size‑variation knowledge from the others. A Multi‑scale Perception module further refines features, and a Joint Saliency Loss ensures consistent, well‑preserved boundaries across the multiple saliency maps produced.

By Zhaojian Yao, Wei Gao, Tiesong Zhao, Hui Yuan, Sam Kwong
arXiv Machine Learning
Sep 23

Riemannian Optimization on Tree Tensor Networks with Application in Machine Learning

The paper presents a formal analysis of the quotient geometry of tree tensor networks (TTNs) and introduces efficient first- and second-order optimization algorithms that leverage this geometry. It also develops a backpropagation method for training TTNs in a kernel learning context. Numerical experiments on a digit classification task demonstrate a tradeoff between two horizontal distributions: one provides clearer geometric insights, while the other yields more efficient algorithms.

By Marius Willner, Marco Trenti, Dirk Lebiedz