Alberto Fachechi

Alberto Fachechi

Auto-generated profile, based on publicly available information

Alberto Fachechi

Dipartimento di Matematica, “Guido Castelnuovo”, Sapienza Università di Roma, Roma, Italy

Research Focus & Metrics

Representative Publications

View All Publications
11 February 2016 in Journal of High Energy Physics
Verified
Journal Article
Open access
PDF file
Matteo BeccariaMatteo Beccaria
Matteo Beccaria
AFAlberto Fachechi
Alberto Fachechi
GMGuido Macorini
Guido Macorini
We consider the semiclassical limit of the vacuum Virasoro block describing the diagonal 4-point correlation functions on the sphere. At large central charge c, after exponentiation, it depends on two fixed ratios h H /c and h L /c, where h H,L are the conformal dimensions of the 4-point function operators. The semiclassical block may be expanded in powers of the light ratio h L /c and the leading non-trivial (linear) order is known in closed form as a function of h H /c. Recently, this contribution has been matched against AdS3 gravity calculations where heavy operators build up a classical geometry corresponding to a BTZ black hole, while the light operators are described by a geodesic in this background. Here, we compute for the first time the next-to-leading quadratic correction \( \mathcal{O} \)((h L /c)2), again in closed form for generic heavy operator ratio h H /c. The result is a highly non-trivial extension of the leading order and may be relevant for further refined AdS3/CFT2 tests. Applications to the two-interval Rényi entropy are also presented.

1 April 2019 in Neural Networks
Verified
Journal Article
Closed access
AFAlberto Fachechi
Alberto Fachechi
EAElena Agliari
Elena Agliari
ABAdriano Barra
Adriano Barra

1 October 2018 in Neural Networks
Verified
Journal Article
Closed access
ABAdriano Barra
Adriano Barra
Matteo BeccariaMatteo Beccaria
Matteo Beccaria
AFAlberto Fachechi
Alberto Fachechi

1 June 2020 in Scientific Reports
Verified
Journal Article
Open access
PDF file
EAElena Agliari
Elena Agliari
ABAdriano Barra
Adriano Barra
OBOrazio Antonio Barra
Orazio Antonio Barra
AFAlberto Fachechi
Alberto Fachechi
LVLorenzo Franceschi Vento
Lorenzo Franceschi Vento
LMLuciano Moretti
Luciano Moretti
In this paper we develop statistical algorithms to infer possible cardiac pathologies, based on data collected from 24 h Holter recording over a sample of 2829 labelled patients; labels highlight whether a patient is suffering from cardiac pathologies. In the first part of the work we analyze statistically the heart-beat series associated to each patient and we work them out to get a coarse-grained description of heart variability in terms of 49 markers well established in the reference community. These markers are then used as inputs for a multi-layer feed-forward neural network that we train in order to make it able to classify patients. However, before training the network, preliminary operations are in order to check the effective number of markers (via principal component analysis) and to achieve data augmentation (because of the broadness of the input data). With such groundwork, we finally train the network and show that it can classify with high accuracy (at most ~85% successful identifications) patients that are healthy from those displaying atrial fibrillation or congestive heart failure. In the second part of the work, we still start from raw data and we get a classification of pathologies in terms of their related networks: patients are associated to nodes and links are drawn according to a similarity measure between the related heart-beat series. We study the emergent properties of these networks looking for features (e.g., degree, clustering, clique proliferation) able to robustly discriminate between networks built over healthy patients or over patients suffering from cardiac pathologies. We find overall very good agreement among the two paved routes.

13 January 2020 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
EAElena Agliari
Elena Agliari
FAFrancesco Alemanno
Francesco Alemanno
ABAdriano Barra
Adriano Barra
MCMartino Centonze
Martino Centonze
AFAlberto Fachechi
Alberto Fachechi
We consider a three-layer Sejnowski machine and show that features learnt via contrastive divergence have a dual representation as patterns in a dense associative memory of order P=4. The latter is known to be able to Hebbian store an amount of patterns scaling as NP−1, where N denotes the number of constituting binary neurons interacting P wisely. We also prove that, by keeping the dense associative network far from the saturation regime (namely, allowing for a number of patterns scaling only linearly with N, while P>2) such a system is able to perform pattern recognition far below the standard signal-to-noise threshold. In particular, a network with P=4 is able to retrieve information whose intensity is O(1) even in the presence of a noise O(N) in the large N limit. This striking skill stems from a redundancy representation of patterns—which is afforded given the (relatively) low-load information storage—and it contributes to explain the impressive abilities in pattern recognition exhibited by new-generation neural networks. The whole theory is developed rigorously, at the replica symmetric level of approximation, and corroborated by signal-to-noise analysis and Monte Carlo simulations.

1 August 2020 in Neural Networks
Verified
Journal Article
Closed access
EAElena Agliari
Elena Agliari
FAFrancesco Alemanno
Francesco Alemanno
ABAdriano Barra
Adriano Barra
AFAlberto Fachechi
Alberto Fachechi