Performance Bounds for Active Binary Testing with Information Maximization

Aditya Chattopadhyay, B. Haeffele, René Vidal, Donald Geman
2/12/2026

No confident code implementation found for this paper. 2 possible matches can be shown below.

Semantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Interactive Adjustment for Human Trajectory Prediction with Individual Feedback

100% match2026

Decision Tree for Locally Private Estimation with Public Data

100% match2026

Sample Average Approximation for Conditional Stochastic Optimization with Dependent Data

100% match2026

Approximate Allocation Matching for Structural Causal Bandits with Unobserved Confounders

100% match2026

Benchmarking Structural Inference Methods for Interacting Dynamical Systems with Synthetic Data

100% match2026

A Variational Framework for Estimating Continuous Treatment Effects with Measurement Error

100% match1 repo72026

Cite this paper

@article{chattopadhyay2026performance,
  title  = {Performance Bounds for Active Binary Testing with Information Maximization},
  author = {Aditya Chattopadhyay and B. Haeffele and René Vidal and Donald Geman},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:45087160896803e1e04a4e835a0e48663e708860},
  journal = {ICML 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/45087160896803e1e04a4e835a0e48663e708860.svg)](https://codeofpaper.com/paper/45087160896803e1e04a4e835a0e48663e708860)

Discussion