No article text was recorded for this version.
G-optimal design
Version 1 of 137 papers41 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Order of Addition in Mixture‐Amount Experiments
- Blog: Bandit Pareto Set Identification in a Multi-Output Linear Model
- Blog: G-Optimal Design with Laplacian Regularization
- Blog: Robust Sampling for Active Statistical Inference
- Blog: Fixed-Budget Best-Arm Identification with Heterogeneous Reward Variances
- Blog: Robust Pure Exploration in Linear Bandits with Limited Budget
- Blog: Collaborative Linear Bandits with Adversarial Agents: Near-Optimal Regret Bounds
- Blog: SOME RESULTS ON THE DESIGN OF EXPERIMENTS FOR COMPARING UNREPLICATED TREATMENTS
- Blog: PopArt: Efficient Sparse Regression and Experimental Design for Optimal Sparse Linear Bandits
- Blog: Identifying Best Interventions through Online Importance Sampling
- Blog: A/B Testing and Best-arm Identification for Linear Bandits with Robustness to Non-stationarity
- Blog: Regret Bounds for Batched Bandits
- Blog: Robust and private stochastic linear bandits
- Blog: Learning in Congestion Games with Bandit Feedback
- Blog: Online Learning to Rank with Features
- Blog: Best Policy Identification in Linear MDPs
- Blog: Best-Arm Identification in Linear Bandits
- Blog: Near-Optimal Deployment Efficiency in Reward-Free Reinforcement Learning with Linear Function Approximation
- Blog: Embedding-Aligned Language Models
- Blog: Counterfactual Reasoning in Linear Structural Equation Models
- Blog: Chernoff Sampling for Active Testing and Extension to Active Regression
- Blog: Achieving Minimax Rates in Pool-Based Batch Active Learning
- Blog: Batched Multi-Armed Bandits with Optimal Regret
- Blog: Active learning for logistic regression: an evaluation
- Blog: Provably Efficient Reward-Agnostic Navigation with Linear Value Iteration
- Blog: Fixed-Budget Best-Arm Identification in Structured Bandits
- Blog: Fewer Battles, More Gain: An Information-Efficient Framework for Arena-based LLM Evaluation
- Blog: Minimax Optimal Fixed-Budget Best Arm Identification in Linear Bandits
- Blog: Robust Pure Exploration in Linear Bandits with Limited Budget
- Blog: Multi-task Representation Learning for Pure Exploration in Linear Bandits
- Blog: Differentially Private Linear Bandits with Partial Distributed Feedback
- Blog: Optimal Order Simple Regret for Gaussian Process Bandits
- Blog: Fixed-Budget Best-Arm Identification in Sparse Linear Bandits
- Blog: Best-of-three-worlds Analysis for Linear Bandits with Follow-the-regularized-leader Algorithm
- Blog: Replicable Bandits
- Blog: Learning with Good Feature Representations in Bandits and in RL with a Generative Model
- Blog: SPEED: Experimental Design for Policy Evaluation in Linear Heteroscedastic Bandits
History & citation
Current · Permanent link
- This direction split from Minimax Variance Minimization for Optimal Experimental Design (81% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_g_optimal_design_25e058e3,
title = {G-optimal design},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/g-optimal-design/rdr_25e058e38d9a419bac28d0e782530001},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_g_optimal_design_25e058e3_v1,
title = {G-optimal design},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/g-optimal-design/rdr_25e058e38d9a419bac28d0e782530001/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}