activity
20082026
most citedMachine Learning Methods for Data Association in Multi-Object Tracking

45 citations · 206 across the 37 of their papers we have counts for

collaborators

38 papers

cs.LG2026

Brownian Kernel Ladders

Mahdi Mohammadigohari, Giuseppe Di Fatta, Giuseppe Nicosia +1

We introduce Brownian kernel ladders (BKLs), a recursive hierarchy of integral reproducing kernel Hilbert spaces built from linear functionals by repeatedly integrating Brownian pu…

cs.LG2025

On the Koopman-Based Generalization Bounds for Multi-Task Deep Learning

Mahdi Mohammadigohari, Giuseppe Di Fatta, Giuseppe Nicosia +1

The paper establishes generalization bounds for multitask deep neural networks using operator-theoretic techniques. The authors propose a tighter bound than those derived from conv…

cs.LG2025

Operator-Based Generalization Bound for Deep Learning: Insights on Multi-Task Learning

Mahdi Mohammadigohari, Giuseppe Di Fatta, Giuseppe Nicosia +1

This paper presents novel generalization bounds for vector-valued neural networks and deep kernel methods, focusing on multi-task learning through an operator-theoretic framework.…

cs.LG2025

Multi-Task Learning Based on Support Vector Machines and Twin Support Vector Machines: A Comprehensive Survey

Fatemeh Bazikar, Hossein Moosaei, Atefeh Hemmati +1

Multi-task learning (MTL) enables simultaneous training across related tasks, leveraging shared information to improve generalization, efficiency, and robustness, especially in dat…

cs.DM2025

Diagonal Frobenius Number via Gomory's Relaxation and Discrepancy

Dmitry Gribanov, Dmitry Malyshev, Panos Pardalos

For a matrix of rank , the diagonal Frobenius number is defined as the minimum , such that, for any $b \in \text{sp…

math.OC2025

Maximum Shortest Path Interdiction Problem by Upgrading Nodes on Trees under Unit Cost

Qiao Zhang, Xiao Li, Xiucui Guan +1

Network interdiction problems by deleting critical nodes have wide applications. However, node deletion is not always feasible in certain practical scenarios. We consider the maxim…