Research map / Bandits and online learning / Online convex optimization and games
Online A-Optimal Design and Active Linear Regression
Xavier Fontaine, Pierre Perrault, Michal Valko, Vianney Perchet
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use Thompson Sampling instead of the proposed Bandit algorithm | Online A-optimal design · Low-dimensional synthetic data | runtime: approximately 200 times slower | Hurt |
| Use the proposed algorithm in the challenging case of two equal covariates with variances separated by only 1/√T | Online A-optimal design · Synthetic data, challenging K=4 covariates in R^3 | regret rate: T^{-1.36} | Hurt |
Closest papers by meaning
- Improved Leverage Score Sampling for Constrained Active Linear Regression (NeurIPS 2026 · similarity 0.86)
- Stochastic Online Instrumental Variable Regression: Regrets for Endogeneity and Bandit Feedback (AAAI 2025 · similarity 0.85)
- Regret minimization in Linear Bandits with offline data via extended D-optimal exploration. (NeurIPS 2026 · similarity 0.84)
- Active Adaptive Experimental Design for Treatment Effect Estimation with Covariate Choice (ICML 2024 · similarity 0.84)
- Efficient Adaptive Experimentation with Noncompliance (NeurIPS 2025 · similarity 0.84)
- Efficient Low-Rank Matrix Estimation, Experimental Design, and Arm-Set-Dependent Low-Rank Bandits (ICML 2024 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
