Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations

Jason Qin, Hans-Hermann Wessels, Carlos Fernandez-Granda, Yuhan Hao
2/14/2026

No confident code implementation found for this paper. 1 possible match 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. 1 weaker match is 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

Deep Random Features for Scalable Interpolation of Spatiotemporal Data

100% match1 repo132026

Neural SDF Flow for 3D Reconstruction of Dynamic Scenes

100% match2026

Learning Optimal Projection for Forecast Reconciliation of Hierarchical Time Series

100% match2026

Linear Multistep Solver Distillation for Fast Sampling of Diffusion Models

100% match2026

Leveraging Generative Models for Unsupervised Alignment of Neural Time Series Data

100% match2026

Stochastic Approximation Algorithms for Systems of Interacting Particles

99% match2026

Cite this paper

@article{qin2026active,
  title  = {Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations},
  author = {Jason Qin and Hans-Hermann Wessels and Carlos Fernandez-Granda and Yuhan Hao},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:49c099ad3f4ac0b0a0810722a7ef290e141c8e32},
  journal = {ICML 2025 2025}
}

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/49c099ad3f4ac0b0a0810722a7ef290e141c8e32.svg)](https://codeofpaper.com/paper/49c099ad3f4ac0b0a0810722a7ef290e141c8e32)

Discussion