acceptodds
Under review as a conference paper at ICLR 2027

Query-Pool Geometry and Bayes Risk in Noisy Affine Prediction

Abstract

We show that query-pool geometry improves optimal adaptive prediction while preserving the optimal limiting risk of fixed acquisition. We study two regions: one follows a uniformly drawn noisy binary affine rule, and the other has independent fair labels. Let be the parameter dimension, the noise rate, the budget ratio, and the recovery cost, where is binary entropy. At budget with , uniform random pools of size give the same optimal limiting Bayes Brier risk for fixed, two-batch, and fully adaptive acquisition, including full-pool inspection. A prescribed subcube with the same pool cardinality preserves the fixed-design limit and lets two batches attain the risk when the affine region is known. For the lower bound, we combine uniform early-evidence control with prediction bounds at outcome-dependent counts. The structured policy uses verification labels before recovery. We study the verification-continuation tradeoff through exact acquisition studies and paired experiments, and establish the separation between acquisition classes under positive noise through finite-risk inequalities. The implementation is available at https://anonymous.4open.science/r/LATC-74F7.

Primary area:
learning theory
Keywords:
Query-pool geometry, Adaptive acquisition, Noisy affine prediction

Reviews

Among:
Shape:
1234this paper, Top 15%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 3.00 over 3 reviews, above 85% of the others.
Reviewer_17HfOpenReview ↗
Rating
3
Confidence
1
Informativeness
2
Presentation
2
Soundness
3
Read review
Paper summary

The paper studies how query-pool geometry affects the optimal Bayes prediction risk under a limited label budget. The authors compare fixed, two-batch, and fully adaptive acquisition under random and structured query pools. The main result shows that, within a certain budget regime, a structured two-batch policy can achieve strictly lower asymptotic risk than even fully adaptive acquisition on random pools. The paper also provides numerical experiments to support the theoretical findings.

Critical strengths

I think the paper studies an interesting question about how the geometry of the available query pool affects the value of adaptive acquisition. The main result gives a nontrivial separation: with the same statistical model, pool cardinality, and label budget, a structured pool allows two-batch acquisition to outperform even fully adaptive acquisition on a uniformly random pool. This seems potentially interesting as a demonstration that the usefulness of adaptivity can depend strongly on query access geometry.

Critical weaknesses

My main reservation is that the theoretical setting seems rather specialized, relying on noisy binary affine functions with known regional structure and noise rates. It is not entirely clear to me how broadly the main insights extend to more general active learning problems.

In addition, the theoretical results allow unrestricted computation, and the proposed methods may be computationally expensive. I would appreciate more discussion of the practical implications of the results and whether similar advantages could be achieved by computationally efficient algorithms.

Questions for authors
  • How essential is the noisy affine prediction setting to the main separation result? I would be interested in understanding whether similar results could hold for more general function classes or active learning problems.

  • The main results concern statistical optimality without computational constraints. Do the authors see a promising direction toward computationally efficient algorithms that could achieve similar benefits from structured query pools?

4 comments

Response to Reviewer 17Hf

Thank you for your constructive comments on model generality and computational efficiency. Our allocation argument provides a general framework, while establishing a separation for a new function class requires class-specific testing and recovery guarantees. The diagnostic stage is already computationally efficient, and polynomial-time recovery is also possible when the continuation coordinates can be designed.


Which parts extend beyond noisy affine rules?

General allocation conditions. Theorem 2 (Appendix A) isolates two conditions underlying our random-pool lower bound:

  • (i) early observations reveal negligible information about the signal location;
  • (ii) regions receiving too few labels have negligible expected prediction gain, even when their label counts depend adaptively on the outcomes.

When reaching the evidence cutoff in one region leaves insufficient budget for another to cross the recovery cutoff, at most one region can deliver substantial prediction gain. A strict separation additionally requires a structured-pool diagnostic test that improves regional allocation while preserving enough budget for recovery.

Finite sign dictionaries. In the uniform affine model, labels on affinely independent inputs are jointly fair, and independent flips exponentially attenuate the evidence in long parity checks. Theorem 3 (Appendix B) extends the low-count prediction bound to general finite sign dictionaries under independent flips through the dictionary's effective dimension. This generalizes one component of the lower bound; early indistinguishability, structured testing, and recovery still require class-specific proofs.

A contrasting Gaussian example. Appendix A.5 illustrates why separation is not universal. Both signal states induce identical query laws, and prediction improves with each observation. Fixed, two-batch, and fully adaptive acquisition therefore achieve identical risk for all budgets 0≤b≤D0\le b\le D, where DD is the number of coordinates per region (Eq. 50).

Other loss functions. The separation also holds for log loss and 0-1 classification error. For a common fixed noise rate 0<η<1/20<\eta<1/2 and budget ratio c<λ<c+1c<\lambda<c+1, where c=[1−h2(η)]−1c=[1-h_2(\eta)]^{-1}, Theorem 5 establishes a strict separation between structured two-batch and fully adaptive random-pool acquisition whenever public information leaves uncertainty about the signal location (Appendix F.4, Eqs. 109-110).

Further extensions within the affine model.

  • Multiple weighted regions (Theorem 4): The model allows weighted regions and dependent signal indicators. For a single signal uniformly located among JJ fixed, equally weighted regions with uninformative public evidence, the structured two-batch prediction gain is JJ times that of fully adaptive random-pool acquisition in the separation regime (Appendix R.1, Eq. 226).
  • Unknown coordinate cuts (Proposition 6, Appendix S): Both the splitting coordinate and the active side of the signal region can be unknown in advance.
  • Unknown common noise rate (Appendix E.2): Testing both diagnostic blocks and estimating the flip rate after decoding attains the same oracle limit for every fixed 0<η<1/20<\eta<1/2 and λ>[1−h2(η)]−1\lambda>[1-h_2(\eta)]^{-1}.

When is an efficient algorithm possible?

Diagnostic testing and uniform continuation. A Walsh-Hadamard transform evaluates the diagnostic subcube test in O(tlog⁡t)O(t\log t) operations for t=Θ((log⁡r)2)t=\Theta((\log r)^2) block points, with r=d+1r=d+1. Under the original uniform continuation, our exact computation of the full vector of population predictions takes O(d2d+b)O(d2^d+b) arithmetic operations (Appendix I.1). Whether a polynomial-time predictor can attain the oracle limiting risk at a fresh uniform target under this continuation law remains open.

Polynomial-time recovery with designed continuation. Appendix T.1 gives a constructive route when the data collector can also design the continuation coordinates. Partition the slope coordinates into groups of size Klog⁡r+O(1)K\log r+O(1), with KK sufficiently large, and vary one group at a time while holding the others at zero. Each group then has only polynomially many candidate affine rules. For fixed noise, a sampling ratio ρ\rho with c<ρ<λc<\rho<\lambda lets the second batch recover all groups with probability 1−o(1)1-o(1).

This construction preserves the pool cardinality and label budget while changing the continuation geometry. The resulting predictor attains the oracle limiting risk and requires O(d)O(d) operations per fresh target after polynomial-time recovery.

Finite-sample benefits of two-batch acquisition

As a small exact illustration, consider d=4d=4, η=0.05\eta=0.05, and a budget of nine labels. A four-point parity check followed by a five-label second batch matches the fully adaptive optimum on 18 common held-out targets, achieving a Brier risk of 0.2203910.220391, compared with 0.2291680.229168 for both EPIG and one-step Brier acquisition (Appendices N.5 and O.2, Tables 19 and 24).


We hope these clarifications address your questions about which aspects generalize and when computationally efficient recovery is possible.

I thank the author for the detailed explanations! I find these clarifications helpful in understanding the scope of the paper better. I maintain my positive assessment, although this paper is somewhat outside my area of expertise.

Dear Reviewer 17Hf

Thank you for taking the time in reviewing our paper and positive assessment.

Best regards

Authors

Reviewer_GpgUOpenReview ↗
Rating
3(+1)
Confidence
3
Informativeness
2
Presentation
3
Soundness
3
Read review
Paper summary

This work considers adaptive prediction, establishing a separation between adaptive and non-adaptive algorithms for predicting noisy affine parity labels on the Boolean hypercube. The domain consists of two known copies of the d-dimensional hypercube, containing 2^{d+1} points in total. In one copy, the observed labels are independent fair bits and in the other, labels are given by an unknown affine parity function, independently flipped with probability \eta < 1/2. The learner does not know which copy contains the signal.

The goal is to predict label probabilities over the whole domain. They uses Brier loss (squared difference between the predicted probability and the realized binary label) averaged over all points. In the structured-pool setting, each region query pool contains a prescribed, known small subcube. The adaptive learner can query subcube labels in the first batch to identify which region contains signal, then request subsequent samples only in that region to learn its parity. Non-adaptive learners have access to the same pools, but must choose all queries before observing their labels and therefore cannot redirect their allocation after identifying the signal region.

The main result shows that the two-batch strategy gets the optimal oracle limiting risk, while the best possible non-adaptive limiting risk under either pool design is 1/4-(1-2\eta)^2/16. Even fully adaptive learners restricted to random query pools cannot improve further. The results are information theoretical in nature (they assume unlimited compute e.g. exponential runtime in the dimension).

Critical strengths

I think that selecting adaptively the points to query in learning is an interesting and well-motivated direction.

Critical weaknesses

However I have the following concerns and questions about this work.

The setting studied in the work seems somehow artificial, as the adaptive learner observes two distinct sub-areas one that contains signal and one that is pure noise. The algorithm then seems straightforward (just calculate the likelyhood ratio) and decide which region has the signal, then proceed to do empirical risk minimization on the signal region.

Is the main contribution here more than combining these steps?

Given the structure of the studied instance the result doesn't seem too surprising to me. I think the setting would be more interesting if the learner has to discover the sub-area that contains the signal from scratch (not just selecting from two choices one of each is guaranteed to be a subset of the signal region).

Is there any particular motivation for this design or prior work that studies this setting?

I think the authors should also cite and connect to the existing literature. The labeling noisy model is a special case of general Massart noise [1]. I think the adaptive sampling setting is closely related (the objective is slightly different) to self-directed learning see for example [2,3,4].

[1] Massart and Nédélec. Risk bounds for statistical learning, 2006. [2] Goldman and Sloan. The Power of Self-Directed Learning, 1994. [3] Ben-David, Kushilevitz, Mansour. Online Learning versus Offline Learning, 1997. [4] Diakonikolas, Kontonis, Tzamos, Zarifis. Self-Directed Linear Classification, 2023.

Questions for authors

Please see weaknesses.

5 comments

Response to Reviewer GpgU

We sincerely thank the reviewer for the thoughtful feedback and constructive questions. We agree that the strategy the reviewer describes is natural: compute the likelihood ratio between the two regions, select the more likely one, and then fit its rule. Our structured-pool policy is exactly this two-step procedure. The point of the paper is that whether this strategy works is decided by the geometry of the query pool, not by the strategy itself.


Why the likelihood ratio stays uninformative on random pools. Let rr be the number of binary rule parameters and ⌊λr⌋\lfloor\lambda r\rfloor the label budget. With high probability, every parity relation in a random pool involves Ω(r/log⁡r)\Omega(r/\log r) labels, and any set of at most (1−ε)r(1-\varepsilon)r queries contains only O(log⁡r)O(\log r) independent relations. Fixed noise attenuates the signal of a length-ℓ\ell relation to (1−2η)ℓ(1-2\eta)^{\ell}, so the likelihood ratio stays 1+o(1)1+o(1) uniformly over all such query sets and label outcomes (Lemma 1). By the time one region has received enough labels to make the ratio informative, the remaining budget (λ−1+ε)r(\lambda-1+\varepsilon)r falls below crcr, the number of labels needed to recover the rule in the other region, where c=[1−h2(η)]−1c=[1-h_2(\eta)]^{-1}.

This is not a weakness of the likelihood-ratio rule. Theorem 1 establishes the same limit for every adaptive policy, allowing full inspection of the random pool and adaptation after every observed label:

  • The optimal limiting Brier risk still equals that of a fixed design that selects the publicly most likely region before observing any labels and allocates its label budget there for rule recovery.

What is surprising? We agree that the structured-pool upper bound alone would not be surprising. Our main contribution is the random-pool lower bound: for fixed positive noise and c<λ<c+1c<\lambda<c+1, even fully adaptive acquisition, including the natural strategy above, has the same optimal limiting Brier risk as fixed acquisition. By contrast, inserting a small subcube at the same pool size and label budget preserves the optimal fixed-design limiting risk while allowing just two batches to attain the risk of an oracle that knows which region contains the signal. This improvement is strict whenever public information leaves uncertainty about the signal location:

  • This holds for fixed 0<η<1/20<\eta<1/2 and c<λ<c+1c<\lambda<c+1 (Table 1).

Pool geometry alone therefore decides whether adaptivity has any value.


Why start with two known regions? Can the learner discover the signal region?

Thank you for raising this important question regarding our modeling choice and the broader discovery problem.

Why we start with two known regions. Considering two known regions allows us to cleanly isolate the role of query geometry while keeping the prediction task, noise level, pool size, and label budget fixed. Within this setup, the subcube acts as a small factorial design:

  • Observing all combinations of a few binary factors provides a reliable consistency check paid for directly out of the recovery budget.

This design builds upon insights from active property testing (Balcan et al., 2012) as well as the use of early measurements to guide subsequent resource allocation in adaptive sensing (Haupt et al., 2011; Arias-Castro et al., 2012).

Discovering an unknown signal region. Beyond two fixed regions, Proposition 6 (Appendix S) addresses a single cube containing 2d2d candidate signal halves Hs,h={x:xs=h}H_{s,h}=\{x:x_s=h\}, where both the cut coordinate ss and the active side hh are hidden. Here, four-point parallelograms are placed independently of the cut:

  • The learner locates them using only the unlabeled pool coordinates, without any prior indication of which ones lie inside the signal region.

By querying their labels in a single first batch and scoring each candidate half via the parity signs of the parallelograms it contains, the learner identifies the true half with probability 1−o(1)1-o(1) using only 4⌈(log⁡d)2⌉4\lceil(\log d)^2\rceil labels, leaving the second batch for rule recovery. Notably, our fully adaptive random-pool lower bound still holds even if the coordinate ss is revealed in advance. Thus, within this family of candidate halves, the separation persists when both the cut coordinate and the signal-bearing side must be discovered. At the same time, we agree that extending signal discovery to more general boundary families remains an important open problem.

Why does verification fail early in a random pool?

We appreciate the opportunity to clarify the underlying mechanism behind this failure mode.

Noise attenuation in long parity checks. While Alon (2016) showed that testing Boolean linearity from a polynomial-size random pool requires Θ(d/log⁡d)\Theta(d/\log d) label queries in the noiseless setting, the presence of fixed positive noise fundamentally alters the evidence provided by each parity check. Specifically, a length-kk check has an expected sign of (1−2η)k(1-2\eta)^k in the signal region, compared to zero in the fair region. With high probability, every nonzero check available in a random pool is long, and any subset of at most (1−ε)r(1-\varepsilon)r queries yields only O(log⁡r)O(\log r) independent checks for r=d+1r=d+1 and fixed 0<ε<10<\varepsilon<1 (Lemma 1). Consequently, the resulting likelihood ratio remains 1+o(1)1+o(1) uniformly across all such query sets and their label outcomes.

Once one region reaches the early cutoff, the remaining budget prevents the other region from reaching the recovery cutoff. Lemma 2 bounds the latter region’s expected prediction gain even when its final label count depends adaptively on the observed outcomes. Together, these bounds cover all fully adaptive policies, including those that choose their queries after inspecting the entire pool.

Concrete finite-sample gap and vanishing-noise regime. To illustrate this concretely, under equal prior odds with η=0.05\eta=0.05, r=1024r=1024, and b=1946b=1946, Table 33 certifies a random-pool adaptive lower bound of 0.1733690.173369 compared to a structured two-batch upper bound of 0.1490290.149029, establishing a strict risk gap of at least 0.0243400.024340. We also note that this conclusion can change if the noise vanishes as the dimension grows:

  • When ηr=O(log⁡r/r)\eta_r=O(\log r/r) and 1<λ<21<\lambda<2, two random-pool batches are indeed sufficient to attain the oracle limit (Proposition 2).

Please see the following response for connections to the suggested literature.

Relation to the suggested literature

Thank you for pointing us to these highly relevant works. We now discuss all of them in the updated manuscript (Section 2).

Noise structure and margin conditions. Conditional on the affine rule, our signal region satisfies the Massart bounded-noise condition, whereas the fair region has a conditional label probability of 1/21/2 and zero margin (Massart, 2006).

Comparison with sequential mistake-bound frameworks. Regarding the role of query ordering, Goldman (1994) and Diakonikolas (2023) investigate the benefits of actively choosing the prediction order, while Ben-David (1997) also analyzes a fixed order revealed in advance. A key distinction lies in the evaluation objective: whereas their criterion counts online mistakes accumulated along the sequence, our learner pays from a budget for each acquired label and is evaluated on the accuracy of its final probability predictions across the underlying population.


Once again, we sincerely thank the reviewer for their time and constructive feedback. The comments have helped us substantially improve the quality of our manuscript. We would appreciate knowing whether these clarifications address your concerns about the contribution beyond the two-step strategy and the assumption of known regions, or whether a specific concern remains.

Dear Reviewer GpgU,

Thank you again for your review. As the discussion period draws to a close, we would like to briefly highlight two points from our revised response.


Main contribution. We agree that the two-step strategy is natural. Our main contribution is the matching lower bound: on random pools with fixed positive noise and in the stated budget regime, the optimal fully adaptive policy has the same limiting Bayes risk as the optimal fixed design, even when full-pool inspection and adaptation after every label are allowed. At the same pool size and label budget, structured pools allow two batches to attain the oracle limit.


Discovering the signal region. Proposition 6 (Appendix S) extends the separation to a coordinate-cut model in which both the cut coordinate and the signal-bearing side are unknown.

Section 2 now also discusses the Massart-noise and self-directed-learning literature you suggested. We would appreciate hearing whether these clarifications address your concerns, or whether a specific concern remains.


Thank you for your time and consideration.

Authors

Reviewer_zmGGOpenReview ↗
Rating
3
Confidence
1
Informativeness
2
Presentation
2
Soundness
3
Read review
Paper summary

This paper investigates how query-pool geometry affects the optimal Bayes risk of fixed, two-batch, and fully adaptive acquisition. The authors consider a two-region model where one region follows a noisy binary affine rule and the other has independent random labels. The main result establishes a separation between random and structured query pools: under a certain budget regime, all three acquisition classes achieve the same asymptotic optimal risk on random pools, whereas a structured pool allows two-batch acquisition to attain the oracle risk. The paper provides matching theoretical bounds and supporting numerical experiments.

Critical strengths

The paper establishes an exact asymptotic characterization of the optimal Bayes risk across different acquisition classes. In particular, it demonstrates that query-pool geometry can fundamentally change the benefits of adaptive acquisition, even when the pool size and label budget remain unchanged. The result is supported by nontrivial theoretical analysis, including lower bounds that apply to arbitrary adaptive policies.

Critical weaknesses

My main concern is the presentation, which I think could be made considerably more accessible. The introduction moves quickly into a technical example. Readers outside this specific area may find it hard to see the broader motivation, the significance of the setting, and how the work relates to existing literature. Likewise, the results throughout are presented mostly in formal terms, and more intuition, along with clearer links between sections, would help readers follow the overall argument. I believe the paper would benefit from a more accessible introduction, a fuller discussion of motivation and related work, and some intuitive explanation of the main results. I think this would make the paper’s contributions much easier to appreciate.

Questions for authors

The main theorem is established under a rather specific setting involving noisy binary affine functions and two regions, one of which has independent random labels. To what extent can the results be extended to more general hypothesis classes, data distributions, or multiple regions?

2 comments

Response to Reviewer zmGG

We sincerely thank the reviewer for the thoughtful feedback and constructive suggestions. We agree that the motivation, intuition, and scope should be easier to follow. We have revised the abstract, introduction, related work, and main-text discussion accordingly. The central question is whether the available queries reveal where labels will be useful early enough to guide the remaining label budget.


Motivation and intuition for the main result

A more accessible introduction. The introduction now begins with a manufacturer choosing tests from a fixed list of available settings on two production lines. Quality follows a predictable rule on one line and is random on the other. One budget must identify the useful line and learn its rule. The settings form the query pool, and a small factorial block contains every combination of a few binary features. This connects the allocation problem to query geometry while holding the prediction task, noise, public information, pool size, and budget fixed.

Why geometry matters. Under the uniform affine prior, individual labels look equally random in both regions. Identifying the predictive region therefore requires relations among several labels, such as the four-label parity check in Figure 1. Random pools contain long checks with high probability, and fixed positive noise weakens each check exponentially with length. A uniform bound on their combined evidence shows that observations reveal negligible regional information until a region receives nearly rr labels, where rr is the parameter dimension. In our budget range, spending these labels in the uninformative region leaves too few to obtain substantial prediction gain in the other. A structured pool supplies short checks that identify the predictive region using o(r)o(r) labels, leaving enough budget to learn its rule.

What the theorem establishes. For fixed 0<η<1/20<\eta<1/2 and budgets b=⌊λr⌋b=\lfloor\lambda r\rfloor with c<λ<c+1c<\lambda<c+1 (cc is the recovery cost per parameter dimension), Table 1 summarizes the comparison. Random-pool acquisition has limiting risk 1/4−gα1/4-g\alpha in all three classes. Here, gg is the oracle prediction gain and α\alpha is the best regional selection accuracy using public information alone. Structured two-batch acquisition attains 1/4−g1/4-g, while the fixed-design limit stays unchanged. Our main contribution is the matching lower bound for every adaptive random-pool policy, including full-pool inspection and interleaved queries across regions.


Changes to the presentation and supporting examples

Related work and reading aids. Section 2 now connects the problem to active learning, prediction-oriented design, structural testing, and best-arm identification. It explains how comparison with a fixed design optimized over the inspected pool isolates the value of label feedback. It also contrasts evidence from label relations with mean estimation in best-arm identification, and discusses Massart noise and the different evaluation objective in self-directed learning. Section 5 opens with a proof roadmap. Section 6 distinguishes the roles of the finite studies, and Sections 5.5 and 7 explain the extensions and their limits.

The role of the noise scale. Section 4 clarifies that when ηr=O(log⁡r/r)\eta_r=O(\log r/r) and 1<λ<21<\lambda<2, two batches on random pools also attain the oracle limit 1/81/8 (Proposition 2). Slower noise decay can preserve the separation (Appendix D.6).

Finite examples and certificates. A complementary finite example illustrates the value of feedback. With d=4d=4, η=.05\eta=.05, b=9b=9, and equal regional prior probabilities, each regional pool has six points containing a four-label parity check. On eighteen common held-out targets, two batches match the fully adaptive optimum at Brier risk 0.2203910.220391, compared with 0.2291680.229168 for fixed acquisition, expected predictive information gain (EPIG), and one-step Brier (Section 6.1, Appendices N.5 and O.2). Section 6.3 separately provides finite risk certificates under the main theorem's assumptions, comparing structured two-batch acquisition with every adaptive random-pool policy.

Scope beyond the main setting

Thank you for asking about the extent of generalization. We establish an exact extension to multiple affine regions. Beyond affine models, we provide a general allocation framework and a broader prediction bound, with additional conditions needed for a full separation.

General hypothesis classes. Theorem 2 (Appendix A) formalizes the shared-budget argument through early-evidence and low-count prediction conditions, including label counts that depend on observed outcomes. Theorem 3 (Appendix B) extends the prediction bound to finite sign dictionaries under independent label flips, using an effective dimension determined by the dictionary and its prior. A full separation for another class additionally requires class-specific early-evidence, structured-testing, and recovery guarantees. Section 5.5 makes this distinction explicit.

Data distributions. The exact separation uses uniform targets within each region and conditionally uniform affine priors. Theorem 4 allows unequal population weights across regions. Extending the separation to other within-region target distributions requires verifying the conditions of the allocation framework. The contrasting Gaussian example in Appendix A.5 has identical query laws across signal states and gradual prediction gains. All three acquisition classes have the same optimal risk for 0≤b≤D0\leq b\leq D, where DD is the number of coordinates per region.

Multiple regions. Theorem 4 (Appendix F.2) covers any fixed number of regions with positive weights, a common fixed positive noise rate, and conditionally uniform affine priors, allowing dependent signal indicators. For a single uniformly located signal among JJ equally weighted regions with uninformative public evidence, structured two-batch acquisition attains JJ times the optimal random-pool limiting prediction gain over the constant predictor in the separation regime (Appendix R.1).

Unknown regions and further extensions. Proposition 6 (Appendix S) allows both a coordinate cut and its predictive side to be unknown. A first batch identifies the signal half, and a second batch recovers its rule. The random-pool lower bound persists even when the cut coordinate is revealed. More general boundary families remain open. Within the affine model, structured two-batch acquisition can also attain the oracle limit while estimating an unknown common noise rate (Appendix E.2). Theorem 5 extends the separation to log loss and classification error (Appendix F.4).


We sincerely thank the reviewer again for helping us improve the presentation. We hope these revisions make the motivation, main mechanism, and scope of the results easier to follow.

Comments on the paper

1 comment

Dear Reviewer,

As the discussion period draws to a close, we would like to briefly follow up on our updated response and revised manuscript. We would appreciate hearing whether our clarifications address your concerns. If there are any remaining points, we are happy to clarify further.

Thank you again for your time and consideration.

Authors

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.