A learning algorithm for source aggregation

DOI10.1002/MMA.4086zbMath1442.68200OpenAlexW2474752170MaRDI QIDQ5374370

Georgios I. Papayiannis, Athanasios N. Yannacopoulos

Publication date: 10 April 2018

Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/mma.4086

zbMATH Keywords

convex optimizationWasserstein barycenterweights selection

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Linear programming (90C05) Programming in abstract spaces (90C48)

Related Items (4)

Robust policy selection and harvest risk quantification for natural resources management under model uncertainty ⋮ Convex risk measures for the aggregation of multiple information sources and applications in insurance ⋮ A framework for treating model uncertainty in the asset liability management problem ⋮ On clustering uncertain and structured data with Wasserstein barycenters and a geodesic criterion for the number of clusters

This page was built for publication: A learning algorithm for source aggregation