A Local Search Framework for Experimental Design
From MaRDI portal
Publication:5092507
DOI10.1137/20M1386542OpenAlexW3115467804MaRDI QIDQ5092507
Publication date: 22 July 2022
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.15805
Optimal statistical designs (62K05) Analysis of algorithms (68W40) Approximation algorithms (68W25) Randomized algorithms (68W20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Freedman's inequality for matrix martingales
- On selecting a maximum volume sub-matrix of a matrix and related problems
- On tail probabilities for martingales
- Near-optimal discrete optimization for experimental design: a regret minimization approach
- Queries and concept learning
- A review of some exchange algorithms for constructing discrete \(D\)-optimal designs
- Subgraph sparsification and nearly optimal ultrasparsifiers
- Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- A Comparison of Algorithms for Constructing Exact D-Optimal Designs
- Algorithmic complexity: threeNP- hard problems in computational 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
- Twice-Ramanujan Sparsifiers
- A spectral approach to network design
- Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design
- Optimal Design of Experiments
- Deterministic Feature Selection for K-Means Clustering
- Maximizing determinants under partition constraints
- On largest volume simplices and sub-determinants
- Faster Subset Selection for Matrices and Applications
- Minimizing Effective Resistance of a Graph
This page was built for publication: A Local Search Framework for Experimental Design
