Near-optimal discrete optimization for experimental design: a regret minimization approach
From MaRDI portal
Publication:2227544
DOI10.1007/s10107-019-01464-2zbMath1459.90172arXiv1711.05174OpenAlexW2999726870MaRDI QIDQ2227544
Yuanzhi Li, Yining Wang, Aarti Singh, Zeyuan Allen Zhu
Publication date: 15 February 2021
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.05174
Related Items (3)
A Local Search Framework for Experimental Design ⋮ A Spectral Approach to Network Design ⋮ Bounds and convex heuristics for bi-objective optimal experiment design in water networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast projection onto the simplex and the \(l_1\) ball
- Two complexity results on \(c\)-optimality in experimental design
- On selecting a maximum volume sub-matrix of a matrix and related problems
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- Queries and concept learning
- Convex trace functions and the Wigner-Yanase-Dyson conjecture
- Submodularity and Randomized rounding techniques for Optimal Experimental Design
- Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates
- Randomized Rounding for the Largest Simplex Problem
- Optimal CUR Matrix Decompositions
- Relative-Error $CUR$ Matrix Decompositions
- Algorithmic complexity: threeNP- hard problems in computational statistics
- Asymptotic Statistics
- Sensor Selection via Convex Optimization
- Signal Recovery on Graphs: Variation Minimization
- Greedy Sampling of Graph Signals
- On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models
- Bayesian Experimental Design: A Review
- Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design
- Optimal Design of Experiments
- Maximizing determinants under partition constraints
- On largest volume simplices and sub-determinants
- Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization
- Faster Subset Selection for Matrices and Applications
- Graph Sparsification by Effective Resistances
This page was built for publication: Near-optimal discrete optimization for experimental design: a regret minimization approach
