Best principal submatrix selection for the maximum entropy sampling problem : scalable algorithms and performance guarantees
Year of publication: |
2024
|
---|---|
Authors: | Li, Yongchun ; Xie, Weijun |
Published in: |
Operations research. - Linthicum, Md. : INFORMS, ISSN 1526-5463, ZDB-ID 2019440-7. - Vol. 72.2024, 2, p. 493-513
|
Subject: | A-optimality | convex integer program | local search algorithm | Machine Learning and Data Science | maximum entropy sampling problem | sampling algorithm | Theorie | Theory | Entropie | Entropy | Stichprobenerhebung | Sampling | Algorithmus | Algorithm | Künstliche Intelligenz | Artificial intelligence | Mathematische Optimierung | Mathematical programming |
-
Is Q-learning minimax optimal? : a tight sample complexity analysis
Li, Gen, (2024)
-
A robust spectral clustering algorithm for sub-Gaussian mixture models with outliers
Srivastava, Prateek R., (2023)
-
Technical note: masking Anstreicher’s linx bound for improved entropy bounds
Chen, Zhongzhu, (2024)
- More ...
-
D-optimal Data Fusion : exact and approximation algorithms
Li, Yongchun, (2024)
-
Sharing the value‐at‐risk under distributional ambiguity
Chen, Zhi, (2020)
-
Regret in the Newsvendor Model with Demand and Yield Randomness
Chen, Zhi, (2021)
- More ...