mlsanityData to 14 Oct 2026

Fast Empirical Scenarios

arXiv 2307.03927 ↗First posted 8 Jul 2023stat.ML cs.LG cs.NAcited by 0

Not on the map. Why?

Abstract (arXiv)

We seek to extract a small number of representative scenarios from large panel data that are consistent with sample moments. Among two novel algorithms, the first identifies scenarios that have not been observed before, and comes with a scenario-based representation of covariance matrices. The second proposal selects important data points from states of the world that have already realized, and are consistent with higher-order sample moment information. Both algorithms are efficient to compute and lend themselves to consistent scenario-based modeling and multi-dimensional numerical integration that can be used for interpretable decision-making under uncertainty. Extensive numerical benchmarking studies and an application in portfolio optimization favor the proposed algorithms.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 57 references that are in the map. First posted on arXiv 8 Jul 2023.

Builds on

8 of 57 references.

References · 8

  1. 2015On the Equivalence between Kernel Quadrature Rules and Random Feature Expansionscited by 138
  2. 2018Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clusteringcited by 94
  3. 2016Coresets for Scalable Bayesian Logistic Regressioncited by 79
  4. 2019Kernel quadrature with DPPscited by 27
  5. 2021Positively Weighted Kernel Quadrature via Subsamplingcited by 25
  6. 2015Exact Worst-case Performance of First-order Methods for Composite Convex Optimizationcited by 16
  7. 2017Adaptive Restart of the Optimized Gradient Method for Convex Optimizationcited by 6
  8. 2020A Randomized Algorithm to Reduce the Support of Discrete Measurescited by 6

Built on by

Not cited yet.