On the public citation graph
Near-optimal Bayesian active learning with correlated and noisy tests
0 signed · 40 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11894841_9openalex-snapshot
Active Learning in the Non-realizable Case
inferredcites →https://doi.org/10.1007/3-540-48447-7_17openalex-snapshot
On an Optimal Split Tree Problem
inferredcites →https://doi.org/10.1007/978-3-642-27848-8_769-2openalex-snapshot
Active Learning - Modern Learning Theory
inferredcites →https://doi.org/10.1007/bf00122574openalex-snapshot
Advances in prospect theory: Cumulative representation of uncertainty
inferredcites →https://doi.org/10.1016/j.biocon.2010.12.020openalex-snapshot
Which uncertainty? Using expert elicitation and expected value of information to design an adaptive program
inferredcites →https://doi.org/10.1109/allerton.2008.4797609openalex-snapshot
Generalized binary search
inferredcites →https://doi.org/10.1111/j.1540-6261.1964.tb02865.xopenalex-snapshot
CAPITAL ASSET PRICES: A THEORY OF MARKET EQUILIBRIUM UNDER CONDITIONS OF RISK*
inferredcites →https://doi.org/10.1137/1.9781611973402.107openalex-snapshot
Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover
inferredcites →https://doi.org/10.1145/1060590.1060644openalex-snapshot
Learning with attribute costs
inferredcites →https://doi.org/10.1145/1265530.1265538openalex-snapshot
Decision trees for entity identification
inferredcites →https://doi.org/10.1145/1273496.1273541openalex-snapshot
A bound on the label complexity of agnostic active learning
inferredcites →https://doi.org/10.1145/312624.312682openalex-snapshot
An algorithmic framework for performing collaborative filtering
inferredcites →https://doi.org/10.1214/ss/1177009939openalex-snapshot
Bayesian Experimental Design: A Review
inferredcites →https://doi.org/10.1287/opre.21.5.1071openalex-snapshot
The Optimal Control of Partially Observable Markov Processes over a Finite Horizon
inferredcites →https://doi.org/10.1561/2200000037openalex-snapshot
Theory of Disagreement-Based Active Learning
inferredcites →https://doi.org/10.1609/aaai.v29i1.9694openalex-snapshot
Submodular Surrogates for Value of Information
inferredcites →https://doi.org/10.2307/2334029openalex-snapshot
Rank Analysis of Incomplete Block Designs: I. The Method of Paired Comparisons
inferredcites →https://doi.org/10.31219/osf.io/utvbzopenalex-snapshot
Bayesian Rapid Optimal Adaptive Design (BROAD): Method and application distinguishing models of risky choice
inferredcites →https://doi.org/10.48550/arxiv.1003.3967openalex-snapshot
Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization
inferredcites →https://doi.org/10.48550/arxiv.1010.3091openalex-snapshot
Near-Optimal Bayesian Active Learning with Noisy Observations
inferredcites →https://doi.org/10.48550/arxiv.1407.2657openalex-snapshot
Beyond Disagreement-based Agnostic Active Learning
inferredcites →https://doi.org/10.48550/arxiv.1505.01462openalex-snapshot
Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence
inferredcites →https://doi.org/10.5555/1283383.1283478openalex-snapshot
Noisy binary search and its applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.neucom.2021.11.027openalex-snapshot
Bayesian active learning with abstention feedbacks
inferred← citeshttps://doi.org/10.1109/icra.2017.7989112openalex-snapshot
Learning to gather information via imitation
inferred← citeshttps://doi.org/10.1145/3770855.3818205openalex-snapshot
The Price of Fairness in Active Learning: Fundamental Limits and Optimal Label Acquisition
inferred← citeshttps://doi.org/10.1177/0278364918781001openalex-snapshot
Data-driven planning via imitation learning
inferred← citeshttps://doi.org/10.1184/r1/6714560openalex-snapshot
Acting under Uncertainty for Information Gathering and Shared Autonomy
inferred← citeshttps://doi.org/10.15607/rss.2017.xiii.041openalex-snapshot
Adaptive Information Gathering via Imitation Learning
inferred← citeshttps://doi.org/10.2139/ssrn.4599611openalex-snapshot
Optimal Decision Tree with Noisy Outcomes
inferred← citeshttps://doi.org/10.24963/ijcai.2023/463openalex-snapshot
Efficient Online Decision Tree Learning with Active Feature Acquisition
inferred← citeshttps://doi.org/10.48550/arxiv.1611.04180openalex-snapshot
Learning to Gather Information via Imitation
inferred← citeshttps://doi.org/10.48550/arxiv.1705.07834openalex-snapshot
Adaptive Information Gathering via Imitation Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1705.08481openalex-snapshot
Bayesian Pool-based Active Learning With Abstention Feedbacks
inferred← citeshttps://doi.org/10.48550/arxiv.1805.09964openalex-snapshot
Myopic Bayesian Design of Experiments via Posterior Sampling and Probabilistic Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1906.09458openalex-snapshot
Flattening a Hierarchical Clustering through Active Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1909.12473openalex-snapshot
Noisy Batch Active Learning with Deterministic Annealing
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.