Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Pierpaolo Vivo

dblp:99/9672 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0002-2366-3080ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Learning theory · 100%
Theoretical computer science
2 papers
Mathematical optimization · 51% Information theory · 49%
Computer networks
1 paper
Physical-layer communications · 87% Optical networks · 13%

Topics — the 12 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory
empirical risk minimization
0.712023
Classification of Heavy-tailed Features in High Dimensions: a Superstatistical Approach · NeurIPS 2023
Machine learning › Learning theory › generalization
generalization analysis
0.712023
Classification of Heavy-tailed Features in High Dimensions: a Superstatistical Approach · NeurIPS 2023
Machine learning › Learning theory › high-dimensional statistics
heavy-tailed distribution
0.712023
Classification of Heavy-tailed Features in High Dimensions: a Superstatistical Approach · NeurIPS 2023
Machine learning › Learning theory
high-dimensional statistics
0.712023
Classification of Heavy-tailed Features in High Dimensions: a Superstatistical Approach · NeurIPS 2023
Machine learning › Learning theory
statistical learning theory
0.712023
Classification of Heavy-tailed Features in High Dimensions: a Superstatistical Approach · NeurIPS 2023
Mathematical optimization › continuous optimization
convex optimization
0.212023
Classification of Heavy-tailed Features in High Dimensions: a Superstatistical Approach · NeurIPS 2023
Mathematical optimization › regularization
regularized empirical risk minimization
0.212023
Classification of Heavy-tailed Features in High Dimensions: a Superstatistical Approach · NeurIPS 2023
Physical-layer communications
MIMO
0.212014
Outage Capacity for the Optical MIMO Channel · IEEE Trans. Inf. Theory 2014
Physical-layer communications › MIMO
optical MIMO
0.212014
Outage Capacity for the Optical MIMO Channel · IEEE Trans. Inf. Theory 2014
Information theory
channel capacity
0.212014
Outage Capacity for the Optical MIMO Channel · IEEE Trans. Inf. Theory 2014
Information theory › channel capacity › fading channel
outage capacity
0.212014
Outage Capacity for the Optical MIMO Channel · IEEE Trans. Inf. Theory 2014
Optical networks
optical fiber communication
0.112014
Outage Capacity for the Optical MIMO Channel · IEEE Trans. Inf. Theory 2014

Methods — techniques the papers use, named apart from their topics

random matrix theory · 1.7superstatistics · 1.3convex optimization · 1.3coulomb gas method · 0.4asymptotic analysis · 0.4
YearPublicationVenuePosition
2023 Classification of Heavy-tailed Features in High Dimensions: a Superstatistical Approach
abstract
We characterise the learning of a mixture of two clouds of data points with generic centroids via empirical risk minimisation in the high dimensional regime, under the assumptions of generic convex loss and convex regularisation. Each cloud of data points is obtained via a double-stochastic process, where the sample is obtained from a Gaussian distribution whose variance is itself a random parameter sampled from a scalar distribution $\varrho$. As a result, our analysis covers a large family of data distributions, including the case of power-law-tailed distributions with no covariance, and allows us to test recent ''Gaussian universality'' claims. We study the generalisation performance of the obtained estimator, we analyse the role of regularisation, and we analytically characterise the separability transition.
Urte Adomaityte, Gabriele Sicuro, Pierpaolo Vivo
NeurIPS3
2014 Outage Capacity for the Optical MIMO Channel
abstract
Multiple-input and multiple-output processing techniques in fiber optical communications have been proposed as a promising approach to meet increasing demand for information throughput. In this context, the multiple channels correspond to the multiple modes or multiple cores or both in the fiber. In this paper, we characterize the distribution of the mutual information with Gaussian input in a simple channel model for this system. Assuming significant crosstalk between cores, negligible backscattering and near-lossless propagation in the fiber, we model the transmission channel as a random complex unitary matrix. The loss in the transmission may be parameterized by a number of unutilized channels in the fiber. We analyze the system in a dual fashion. First, we evaluate a closed-form expression for the outage probability, which is handy for small matrices. We also apply the asymptotic approach, in particular the Coulomb gas method from statistical mechanics, to obtain closed-form results for the ergodic mutual information, its variance as well as the outage probability for Gaussian input in the limit of large number of cores/modes. By comparing our analytic results to simulations, we see that, despite the fact that this method is nominally valid for large number of modes, our method is quite accurate even for small to modest number of channels.
Apostolos Karadimitrakis, Aris L. Moustakas, Pierpaolo Vivo
IEEE Trans. Inf. Theory3