Zobrazeno 1 - 10
of 7 282
pro vyhledávání: '"Naldi A."'
In machine learning and data mining, outliers are data points that significantly differ from the dataset and often introduce irrelevant information that can induce bias in its statistics and models. Therefore, unsupervised methods are crucial to dete
Externí odkaz:
http://arxiv.org/abs/2411.08867
Autor:
Bartolucci, Francesca, Carioni, Marcello, Iglesias, José A., Korolev, Yury, Naldi, Emanuele, Vigogna, Stefano
We revisit the mean field parametrization of shallow neural networks, using signed measures on unbounded parameter spaces and duality pairings that take into account the regularity and growth of activation functions. This setting directly leads to th
Externí odkaz:
http://arxiv.org/abs/2410.14591
This paper deals with the target localisation problem in search and rescue scenarios in which the technology is based on electromagnetic transceivers. The noise floor and the shape of the electromagnetic radiation pattern make this problem challengin
Externí odkaz:
http://arxiv.org/abs/2409.11221
Autor:
Colladon, A. Fronzetti, Naldi, M.
Publikováno v:
Social Networks 81, 1-16 (2025)
This paper responds to a commentary by Neal (2024) regarding the Distinctiveness centrality metrics introduced by Fronzetti Colladon and Naldi (2020). Distinctiveness centrality offers a novel reinterpretation of degree centrality, particularly empha
Externí odkaz:
http://arxiv.org/abs/2408.02076
This paper proposes a data-driven approach for constructing firmly nonexpansive operators. We demonstrate its applicability in Plug-and-Play methods, where classical algorithms such as forward-backward splitting, Chambolle--Pock primal-dual iteration
Externí odkaz:
http://arxiv.org/abs/2407.14156
In this work we apply the recently introduced framework of degenerate preconditioned proximal point algorithms to the hybrid proximal extragradient (HPE) method for maximal monotone inclusions. The latter is a method that allows inexact proximal (or
Externí odkaz:
http://arxiv.org/abs/2407.05893
The $R$-hulloid, in the Euclidean space $\mathbb{R}^3$, of the set of vertices $V$ of a tetrahedron $T$ is the minimal closed set containing $V$ such that its complement is union of open balls of radius $R$. When $R$ is greater than the circumradius
Externí odkaz:
http://arxiv.org/abs/2406.00658
Autor:
Longinetti, Marco, Naldi, Simone
A reformulation of the three circles theorem of Johnson with distance coordinates to the vertices of a triangle is explicitly represented in a polynomial system and solved by symbolic computation. A similar polynomial system in distance coordinates t
Externí odkaz:
http://arxiv.org/abs/2405.16167
This paper deals with the algorithmic aspects of solving feasibility problems of semidefinite programming (SDP), aka linear matrix inequalities (LMI). Since in some SDP instances all feasible solutions have irrational entries, numerical solvers that
Externí odkaz:
http://arxiv.org/abs/2405.13625
In Beyond5G and 6G networks, a common theme is that sensing will play a more significant role than ever before. Over this trend, Integrated Sensing and Communications (ISAC) is focused on unifying the sensing functionalities and the communications on
Externí odkaz:
http://arxiv.org/abs/2405.09963