Pith. sign in

REVIEW 4 major objections 6 minor 300 references

HELP: Human-Efficient Large-Scale Robot Post-Training with Rollout Segmentation

T0 review · 4 major / 6 minor · reviewed 2026-08-02 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read HELP claims that two specialized operators supervising twelve robots, plus a learned rollout-segmentation critic, raise real-world manipulation success to 80–95% and throughput by 1.7–4.2× over the base model.

desk verdict HELP is a well-engineered human-efficiency pipeline with a genuinely useful benchmark, but the headline VLAC-CUT amplification claim is confounded by a missing unsegmented-rollout control arm. read the letter →

arxiv 2607.09776 v2 pith:KAAJOYE7 submitted 2026-07-08 cs.RO cs.AI

Shaopeng Zhai , Qi Zhang , Tianyi Zhang , Haoran Zhang , Fuxian Huang , Zhanhui Lin , Zijun Xu , Weinan Zhang This is my paper · ORCID
classification cs.ROcs.AI
keywords robotpost-trainingvision-language-actionmodelshuman-in-the-looprolloutsegmentationprogresscriticmulti-robotsupervisionflowmatchinghumanefficiency
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to establish that the real bottleneck in adapting vision-language-action (VLA) robot policies to new tasks is human labor, not robot interaction count, and that existing post-training loops waste that labor. Its claim is that a two-operator, twelve-robot setup — a trained teleoperator delivering remote interventions and recovery demonstrations, plus a floor operator monitoring the fleet, triggering takeovers, and performing resets — raises task throughput by 1.7×–4.2× over the base model across four manipulation tasks. The paper further claims that a learned critic, VLAC-CUT, which segments autonomous rollouts into progress-making, idle, failure-inducing, and recovery segments, converts otherwise unusable robot-collected data into training signal, amplifying the gain from a fixed human recovery budget by 1.20×–3.43× in throughput and 1.50×–3.00× in success rate. If true, this outlines a practical route to scale real-world robot learning without scaling human operators proportionally.

What carries the argument

Two pieces carry the argument. The first is the HELP supervision setup: one trained Teleoperator and one Floor Operator supervise twelve robots concurrently, the former giving VR interventions and recovery demonstrations, the latter monitoring the fleet, triggering takeovers, and resetting scenes; the role split is what lets two humans oversee twelve machines. The second is VLAC-CUT, a Vision-Language-Action Critic whose 'cut' operation segments task-conditioned rollouts into progress-making, idle, failure-inducing, and recovery segments using learned signed task-progress estimates; it converts autonomous robot data into curated training signal, and the paper's matched-budget comparisons iso

What would settle it

Run a matched-budget experiment in which the same policy, same checkpoint, and same human recovery trajectories are trained on the same number of rollouts, but the autonomous portions are kept whole or cut at random instead of by VLAC-CUT; if the 1.20×–3.43× throughput and 1.50×–3.00× success-rate amplifications vanish, the critic's causal contribution is falsified. Alternatively, demonstrate a negative-learning-signal objective for flow-matching action decoders and show it matches or beats segmentation-based curation.

Watch

Extended reading notes

Core claim

The central claim is that the human bottleneck in VLA post-training splits into supervision and data curation. HELP's role-specialized two-operator, twelve-robot setup handles supervision; VLAC-CUT, a learned critic, cuts each autonomous rollout into progress-making, idle, failure-inducing, and recovery segments, keeping only useful ones. On four manipulation tasks this brings success to 80–95% and throughput 1.7×–4.2× over the base model; under matched human-recovery budgets VLAC-CUT adds 1.20×–3.43× throughput and 1.50×–3.00× success-rate gains over HITL-only updates.

Load-bearing premise

The pipeline's extra gains rest on the paper's stated but unexperimented premise that training a flow-matching VLA on unsegmented autonomous rollouts would teach it to reproduce repetitive trial-and-error actions and lower throughput, rather than simply benefit from more data; if that premise fails, the segmentation critic loses its causal role.

Editorial extensions

If this is right

  • If the results hold, a two-person team can sustain a twelve-robot post-training loop, removing the one-human-per-robot scaling constraint from real-world VLA adaptation.
  • Process-level curation means autonomous rollouts that fail are not wasted: recovery and progress segments become reusable training data instead of being discarded wholesale.
  • The matched-budget amplification factors imply the segmentation critic, not extra human data, drives the extra gain, so the same human recovery effort yields larger policy improvement.
  • Iterative post-training compounds: the second round in these experiments produced larger throughput jumps than the first because stronger policies generate higher-quality rollouts for the critic to curate.
  • The four-way segmentation schema and the VPB benchmark give the community a way to evaluate progress critics independently of the full pipeline.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Editorial inference: a volume-matched ablation — training on the same number of unsegmented or randomly cut rollouts under the same HITL budget — would directly test whether VLAC-CUT's contribution is segmentation or merely more data.
  • Editorial inference: the paper's negative premise about flow-matching objectives is revisitable; if a reliable way to treat failure-inducing segments as negative supervision emerges, the need for a separate critic and its expensive training would shrink.
  • Editorial inference: the human-efficiency ratio defined here (policy gain per HITL recovery trajectory) could become a standard yardstick for comparing data-curation methods, and the VPB-style progress benchmark could generalize to other long-horizon embodied settings.
  • Editorial inference: external validity is bounded by the four tasks and the single VLA backbone used; testing the scheme on other action decoders would reveal whether the segmentation benefit is specific to flow-matching policies.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 6 minor

Summary. The paper proposes HELP, a pipeline for iterative real-world post-training of vision-language-action (VLA) policies, with the goal of maximizing policy improvement and task throughput per unit of human labor and time. HELP uses two specialized operators supervising twelve robots: a Teleoperator provides remote recovery demonstrations and a Floor Operator monitors the fleet, triggers takeovers, and performs resets. To use the resulting mixed-quality autonomous rollouts, the paper introduces VLAC-CUT, a process-level segmentation critic trained on signed progress annotations, which separates rollouts into progress-making, idle, failure-inducing, and recovery segments and retains only the useful ones. The paper reports a new Video Progress Benchmark (VPB) and evaluates VLAC-CUT on it, then reports real-world post-training experiments on four tasks (Refrigerator, Microplate, Test Tube, Stirrer), claiming 80%–95% success rates, 1.7×–4.2× throughput gains over the base model, and—under matched HITL recovery budgets—1.20×–3.43× amplification of throughput gains and 1.50×–3.00× amplification of success-rate gains relative to HITL-only updates.

Significance. If the central claims hold, the paper makes a practically important contribution: it reframes robot post-training around human efficiency and demonstrates a concrete two-operator/twelve-robot supervision protocol. The detailed annotation schema, the VPB benchmark with seen/unseen and expert/non-expert splits, and the effort to measure VLAC-CUT's contribution under matched HITL budgets are useful assets for the community. However, the headline quantitative attribution to VLAC-CUT is currently supported only by a comparison that also changes data volume, and the reported effect sizes lack statistical grounding. The paper's own premise for segmentation—that unsegmented rollouts are harmful—is asserted rather than tested, which is load-bearing for the main claim.

major comments (4)
  1. [§3.3.1 and §5.2.2 (Tables 5–6)] The central causal claim is not identified by the matched-budget comparison. In Table 5, HELP adds 100–334 curated rollout segments per task-round while HITL-only adds none; the two arms differ in data volume in addition to curation. The only justification that unsegmented rollouts are harmful is the assertion in §3.3.1 that 'we did not find a sufficiently reliable way to directly use failure-inducing action segments as negative learning signals' and that training on unsegmented rollouts would reinforce repetitive trial-and-error. No experiment, ablation, or citation tests this premise. If a flow-matching VLA improves from additional in-distribution rollouts regardless of segmentation, the amplification factors in Table 6 reduce to a volume-of-data effect. Please add control arms matched by segment count, e.g., HELP-raw using the same number of unsegmented autonomous rollouts, or randoml
  2. [§5.2.2 (Tables 4 and 6)] All real-world results are single-run and report no trial counts or confidence intervals. Many amplification factors are computed from small absolute differences—e.g., +4 vs +9 throughput and +15pp vs +25pp success rate in Refrigerator round 1, or +3 vs +5 throughput in Microplate round 1. Without episode counts or variance estimates, it is impossible to assess whether the 1.20×–3.43× range is statistically distinguishable from 1.0. Please report the number of evaluation episodes per cell and provide standard errors, confidence intervals, or repeated-seed/bootstrap estimates at least for the matched comparisons in Table 6.
  3. [§5.2.2 and §3.3.2] The matched comparison does not state whether HITL-only training uses the same optimizer and data-mixing recipe as HELP. Section 3.3.2 introduces ConSFT (Eq. 3) and a 1:1:1 base:HITL:curated-rollout mixture, but §5.2.2 only says 'standard flow-matching objective is adopted.' If HITL-only is trained with plain SFT while HELP uses ConSFT, the amplification factor conflates the effect of VLAC-CUT with the effect of the conservative objective and the mixture protocol. Specify the optimizer and mixing used in each arm and hold them fixed across the comparison.
  4. [§4.2, §4.4, and Table 7] VPB is constructed from the same annotation inventory used to train VLAC-CUT, with held-out records and task units. While the split discipline is careful, the evaluation shares the annotation schema, annotators, and data sources with training, and the comparison baselines are not trained or tuned on this schema. This weakens the claim that VLAC-CUT's large VPB advantage reflects general progress-estimation capability rather than familiarity with the annotation style. Please add an independently annotated or cross-institution held-out evaluation, or at least discuss this limitation explicitly in the benchmark interpretation.
minor comments (6)
  1. [§5.2.2 / Table 6] The arithmetic mean row reports 2.15× and 2.21×, but given the small deltas and likely correlated errors, a geometric mean or per-task confidence intervals would be more informative.
  2. [§4.2 vs Appendix A.1] The main text states the curated dataset contains 28,167 records, while Appendix A.1 reports a full inventory of 35,230 records and the curated split in Table 7 sums to 28,167. Please make the relationship between these numbers explicit in the main text to avoid apparent inconsistency.
  3. [§3.3.1] The phrase 'we did not find a sufficiently reliable way...' is a negative result reported without supporting experiments. If it remains, it should be presented as an explicit limitation; better, it should be accompanied by the ablation suggested in the major comments.
  4. [Author contributions] There is a typo: 'eaperiments' should be 'experiments.'
  5. [§5.2.1] The Stirrer task is described as 'relatively simple' and receives only one iteration, but the base model already has 55% success rate and 66 throughput, which is much higher than the other tasks. A sentence explaining why this task was easier or why the base model was already strong would help.
  6. [§5.1.2 / Table 2] Chrono-GVL-Gemini-3.5-Flash outperforms VLAC-CUT on terminal-state accuracy and successful-terminal F1. The narrative emphasizes macro F1, which is fair, but the abstract and introduction state the segmentation critic is superior without this nuance. Please make the trade-off explicit in the main text.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the central human-efficiency and amplification claims are empirical measurements, not derived from fitted quantities; self-citations are present but not load-bearing.

full rationale

The paper's main claims are empirical: HELP's absolute gains (Table 4) and the VLAC-CUT amplification factors (Table 6) are measured on real-world tasks rather than derived from a fitted parameter or an equation that encodes the result. Equation (4) defines the amplification factor as the ratio of measured improvements; it does not force any particular outcome. VLAC-CUT is trained on a progress-annotation dataset and evaluated on the held-out VPB split; Section A.3 explicitly excludes held-out annotations from training, augmentation, and fine-tuning, so the benchmark result is not a self-fulfilling fit. The paper does cite prior work by overlapping authors: ConSFT in Eq. (3) and VLAC in related work. However, these citations are not the load-bearing justification for the central human-efficiency derivation: the ConSFT objective is stated in the paper itself, and the main HELP results do not reduce to the content of those citations. The matched HITL-budget comparison in Section 5.2.2 does not equalize total data volume, since HELP additionally uses VLAC-CUT-curated rollouts (Table 5); this is a potential confound for attributing the improvement to segmentation rather than data volume, but it is an experimental-design limitation, not a circular reduction. No step in the paper's derivation chain reduces by construction to its inputs, so no circularity is flagged.

Assumptions & free parameters 4 free parameters · 5 assumptions · 3 invented entities

The HELP pipeline rests on hand-chosen system and evaluation parameters (τ, 90% terminal threshold, 1:1:1 data mix, per-task time limits), on the asserted premise that failure-inducing segments are unusable as negative signals, on annotation-defined progress ground truth, and on self-cited components (VLAC, ConSFT) without independent replication.

free parameters (4)
  • ConSFT temperature τ = not specified
    Eq. 3; controls conservative scaling sensitivity in the online incremental objective; chosen by hand with no ablation reported.
  • Terminal-state near-completion threshold = 90%
    Eq. 9; hand-chosen tolerance for VPB terminal-state accuracy and F1 metrics; no ablation.
  • Data mixture ratio base:HITL:curated-rollout = ~1:1:1
    Section 5.2.2 states the datasets are 'approximately balancing them at a 1:1:1 ratio to achieve strong model performance'; not ablated.
  • Per-task time limits = 100s / 100s / 200s / 60s
    Section 5.2.1 defines success within a time limit for each task; these cutoffs set the throughput ceiling and directly affect reported throughput numbers.
assumptions (5)
  • domain assumption Failure-inducing action segments cannot be reliably used as negative learning signals under the flow-matching objective
    Section 3.3.1: 'we did not find a sufficiently reliable way to directly use failure-inducing action segments as negative learning signals'; asserted without experiment or citation, and it motivates discarding all failure-inducing data.
  • domain assumption Human-annotated signed progress labels are a consistent and valid ground truth for task progress
    Appendix A.2; the entire VLAC-CUT training and VPB evaluation rest on annotation quality; no inter-annotator agreement statistics are reported.
  • standard math Linear interpolation between sparse progress keyframes yields a valid dense progress trajectory
    A.5, Eq. 5; standard for dense proxy labels but masks non-linear sub-keyframe progress; used for both training interpolation and VPB evaluation.
  • ad hoc to paper ConSFT objective preserves capabilities without reference networks or historical data buffers
    Eq. 3 and Zhang et al., 2026b (same team); load-bearing for the online incremental optimization path; no independent verification or ablation appears in this paper.
  • domain assumption The π0.5 VLA family and flow-matching setup are representative of VLA post-training
    Section 5.2: all real-world experiments use π0.5; generalization to token-output or other action-interface VLAs is not demonstrated.
invented entities (3)
  • VLAC-CUT independent evidence
    purpose: Automatic rollout segmentation critic that classifies trajectory segments as progress-making, idle, failure-inducing, or recovery, and decides what enters the training set
    A new model artifact; evaluated on the held-out VPB benchmark (Section 5.1) and on real-world amplification (Section 5.2), so it is not an unexplained postulate.
  • Predictive takeover model φ and task termination model ψ
    purpose: Predict at each control step whether a takeover is required and whether the task is complete (Eq. 1)
    Components of the architecture mentioned in Section 3.1 but no training data, model details, or standalone evaluation are provided.
  • ARX-data independent evidence
    purpose: In-house real-world dataset of physically executed non-monotonic robot trajectories (grasp failures, drops, wrong-object interactions, recoveries) to train the critic
    Described with statistics and visual examples in Appendix A.1 and Figure 6, but the dataset is not released.

how reviews work

0 comments
Cite this review

Pith. "Pith review of HELP: Human-Efficient Large-Scale Robot Post-Training with Rollout Segmentation." pith.science (2026). https://pith.science/paper/KAAJOYE7

@misc{pith2026260709776,
  author       = {Pith},
  title        = {Pith review of: HELP: Human-Efficient Large-Scale Robot Post-Training with Rollout Segmentation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/KAAJOYE7}},
  note         = {Machine review of arXiv:2607.09776}
}
abstract

When adapting Vision Language Action (VLA) models to downstream tasks, multiple rounds of post-training are often required to progressively address policy weaknesses. In this report, we focus on maximizing human efficiency during this iterative process, measured by policy improvement and task throughput per unit of human labor and time. We propose HELP, a Human-Efficient Large-scale robot Post-training pipeline in which two specialized operators supervise twelve robots concurrently. A trained Teleoperator provides high-value remote interventions and recovery demonstrations, while a Floor Operator monitors the robot fleet, triggers takeovers, and performs physical resets. This role specialization improves human efficiency by reducing task switching, lowering operator training costs, and expanding robot interaction coverage. Beyond increasing rollout volume, concurrent supervision also broadens the range of policy behaviors observed by the human team, making recurring failure modes easier to identify and enabling more targeted takeovers, resets, and recovery demonstrations. To efficiently utilize the large and mixed-quality rollout data, HELP incorporates \vlac, an automatic rollout segmentation critic specifically designed for this setting. It separates autonomous trajectories into progress-making, idle, failure-inducing, and recovery segments. Useful rollout segments are retained and combined with Human-in-the-Loop data for the next post-training round. Across four real-world manipulation tasks, HELP achieves 80\%--95\% success rates and improves task throughput by 1.7$\times$--4.2$\times$ over the base model. Under matched HITL recovery budgets, VLAC-CUT further amplifies throughput gains by 1.20$\times$--3.43$\times$ and success-rate gains by 1.50$\times$--3.00$\times$ over HITL-only updates.

Figures

Figures reproduced from arXiv: 2607.09776 by the authors.

Figure 1
Figure 1. System architecture of the proposed distributed hierarchical HITL data collection frame￾work. • Centralized GPU workers: Deployed on a centralized server, these GPU workers manage par￾allel inference and continuous policy optimization using the Ray distributed framework. At each control step, an asynchronous coordination module aggregates multi modal observations from the distributed robotic fleet and routes them to… view at source ↗
Figure 2
Figure 2. Role division between the Teleoperator and the Floor Operator in the proposed data col [PITH_FULL_IMAGE:figures/full_fig_p007_2.png] view at source ↗
Figure 2
Figure 2. Role specialization between the Teleoperator and the Floor Operator in HELP. [PITH_FULL_IMAGE:figures/full_fig_p008_2.png] view at source ↗
Figures from the paper (14 more)
Figure 3
Figure 3. Figure 3: Overview of the VLAC-CUT rollout segmentation pipeline. Given a task-conditioned autonomous rollout trajectory, VLAC-CUT estimates process-level progress, diagnoses local state changes, and segments the trajectory into training-useful and training-harmful portions. 4 V…
Figure 4
Figure 4. Figure 4: Qualitative comparison of signed progress prediction on a representative VPB trajectory. [PITH_FULL_IMAGE:figures/full_fig_p012_4.png]
Figure 5
Figure 5. Figure 5: Qualitative examples of terminal-state recognition on VPB trajectories. Each panel shows [PITH_FULL_IMAGE:figures/full_fig_p013_5.png]
Figure 5
Figure 5. Figure 5: Task execution progress. Each row shows execution states for tasks, and each column corresponds to a normalized task-completion progress from 0% to 100%. input to the VLA models for this task: Open the refrigerator door, grasp the beaker with the gripper, place it insi…
Figure 6
Figure 6. Figure 6: Task execution progress. Each row shows execution states for tasks, and each column corresponds to a normalized task-completion progress from 0% to 100%. model performance. Finally, we train the current inference model on this combined dataset to obtain an updated poli…
Figure 6
Figure 6. Figure 6: Representative failure (Err.) and recovery modes (Rec.) in ARX-data. These examples [PITH_FULL_IMAGE:figures/full_fig_p024_6.png]
Figure 7
Figure 7. Figure 7: Representative failure (Err.) and recovery modes (Rec.) in ARX-data. These examples [PITH_FULL_IMAGE:figures/full_fig_p023_7.png]
Figure 7
Figure 7. Figure 7: Full annotation inventory statistics. (a) Source composition and execution-quality distri [PITH_FULL_IMAGE:figures/full_fig_p025_7.png]
Figure 8
Figure 8. Figure 8: Full annotation inventory statistics. (a) Source composition and execution-quality distri [PITH_FULL_IMAGE:figures/full_fig_p024_8.png]
Figure 8
Figure 8. Figure 8: Semantic and action diversity of the full annotation inventory. The corpus covers a broad [PITH_FULL_IMAGE:figures/full_fig_p025_8.png]
Figure 9
Figure 9. Figure 9: Semantic and action diversity of the full annotation inventory. The corpus covers a broad [PITH_FULL_IMAGE:figures/full_fig_p024_9.png]
Figure 9
Figure 9. Figure 9: Example of sparse progress annotation for a robot manipulation trajectory. Only selected [PITH_FULL_IMAGE:figures/full_fig_p026_9.png]
Figure 10
Figure 10. Figure 10: Example of sparse progress annotation for a robot manipulation trajectory. Only selected [PITH_FULL_IMAGE:figures/full_fig_p025_10.png]
Figure 10
Figure 10. Figure 10: Overview of the VLA-based teleoperation assistance module. Observed VR commands [PITH_FULL_IMAGE:figures/full_fig_p031_10.png]

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

300 extracted references · 21 linked inside Pith

  1. [1]

    AI Magazine , volume=

    Truth is a lie: Crowd truth and the seven myths of human annotation , author=. AI Magazine , volume=

  2. [2]

    Human-centered tools for coping with imperfect algorithms during medical decision-making , author=

  3. [3]

    Proceedings of the 1964 International Congress for Logic, Methodology, and Philosophy of Science , pages=

    Theories of meaning and learnable languages , author=. Proceedings of the 1964 International Congress for Logic, Methodology, and Philosophy of Science , pages=. 1965 , publisher=

    1964

  4. [4]

    The Logic of Decision and Action , year=

    The logical form of action sentences , author=. The Logic of Decision and Action , year=

  5. [5]

    Philosophy, Language, and Artificial Intelligence: Resources for Processing Natural Language , pages=

    Truth and meaning , author=. Philosophy, Language, and Artificial Intelligence: Resources for Processing Natural Language , pages=. 1967 , publisher=

    1967

  6. [6]

    arXiv preprint arXiv:2307.01952 , year=

    Sdxl: Improving latent diffusion models for high-resolution image synthesis , author=. arXiv preprint arXiv:2307.01952 , year=

    arXiv

  7. [7]

    arXiv preprint arXiv:2309.02591 , volume=

    Scaling autoregressive multi-modal models: Pretraining and instruction tuning , author=. arXiv preprint arXiv:2309.02591 , volume=

    arXiv

  8. [8]

    Microsoft

    Lin, Tsung-Yi and Maire, Michael and Belongie, Serge and Hays, James and Perona, Pietro and Ramanan, Deva and Doll. Microsoft

Show all 300 references
  1. [9]

    arXiv preprint arXiv:2310.18235 , year=

    Davidsonian scene graph: Improving reliability in fine-grained evaluation for text-image generation , author=. arXiv preprint arXiv:2310.18235 , year=

    arXiv

  2. [10]

    Interacting with computers , volume=

    Steps to take before intelligent user interfaces become real , author=. Interacting with computers , volume=. 2000 , publisher=

    2000

  3. [11]

    Help Me Help the AI

    "Help Me Help the AI": Understanding How Explainability Can Support Human-AI Interaction , author=

  4. [12]

    Re-examining whether, why, and how human-AI interaction is uniquely difficult to design , author=

  5. [13]

    2009 , publisher=

    The Quest for Artificial Intelligence , author=. 2009 , publisher=

    2009

  6. [14]

    Artwhisperer: A dataset for characterizing human-ai interactions in artistic creations , author=

  7. [15]

    arXiv preprint arXiv:2310.07653 , year=

    Mini-dalle3: Interactive text to image by prompting large language models , author=. arXiv preprint arXiv:2310.07653 , year=

    arXiv

  8. [16]

    arXiv preprint arXiv:2404.18919 , year=

    TheaterGen: Character Management with LLM for Consistent Multi-turn Image Generation , author=. arXiv preprint arXiv:2404.18919 , year=

    arXiv

  9. [17]

    arXiv preprint arXiv:2406.01388 , year=

    AutoStudio: Crafting Consistent Subjects in Multi-turn Interactive Image Generation , author=. arXiv preprint arXiv:2406.01388 , year=

    arXiv

  10. [18]

    Instruct-Imagen: Image generation with multi-modal instruction , author=

  11. [19]

    Intelligent Systems with Applications , volume=

    DSG-GAN: Multi-turn text-to-image synthesis via dual semantic-stream guidance with global and local linguistics , author=. Intelligent Systems with Applications , volume=. 2023 , publisher=

    2023

  12. [20]

    arXiv preprint arXiv:2403.08857 , year=

    DialogGen: Multi-modal Interactive Dialogue System for Multi-turn Text-to-Image Generation , author=. arXiv preprint arXiv:2403.08857 , year=

    arXiv

  13. [21]

    Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

    EgoExoLearn: A Dataset for Bridging Asynchronous Ego-and Exo-centric View of Procedural Activities in Real World , author=. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

  14. [22]

    Communications of the ACM , volume=

    How might people interact with agents , author=. Communications of the ACM , volume=. 1994 , publisher=

    1994

  15. [23]

    Guidelines for human-AI interaction , author=

  16. [24]

    arXiv preprint arXiv:2406.07882 , year=

    Designing a Dashboard for Transparency and Control of Conversational AI , author=. arXiv preprint arXiv:2406.07882 , year=

    arXiv

  17. [25]

    arXiv preprint arXiv:2305.02469 , year=

    The system model and the user model: Exploring AI dashboard design , author=. arXiv preprint arXiv:2305.02469 , year=

    arXiv

  18. [26]

    Statistical science , pages=

    Bayesian experimental design: A review , author=. Statistical science , pages=. 1995 , publisher=

    1995

  19. [27]

    The SAGE Handbook of Quantitative Methods in Psychology , pages=

    Experimental design , author=. The SAGE Handbook of Quantitative Methods in Psychology , pages=. 2009 , publisher=

    2009

  20. [28]

    Preference learning with Gaussian processes , author=

  21. [29]

    Pairwise preference learning and ranking , author=

  22. [30]

    Boutilier, Craig , booktitle=aaai, year=. A

  23. [31]

    2016 , publisher=

    Artificial intelligence: A modern approach , author=. 2016 , publisher=

    2016

  24. [32]

    Hu, Yushi and Liu, Benlin and Kasai, Jungo and Wang, Yizhong and Ostendorf, Mari and Krishna, Ranjay and Smith, Noah A , booktitle=iccv, year=

  25. [33]

    Hierarchical task and motion planning in the now , author=

  26. [34]

    Pre-trained Gaussian processes for Bayesian optimization , author=

  27. [35]

    A constraint-based method for solving sequential manipulation planning problems , author=

  28. [36]

    Combined task and motion planning under partial observability: An optimization-based approach , author=

  29. [37]

    arXiv preprint arXiv:2402.03719 , year=

    Empowering Language Models with Active Inquiry for Deeper Understanding , author=. arXiv preprint arXiv:2402.03719 , year=

    arXiv

  30. [38]

    arXiv preprint arXiv:2403.10454 , year=

    Partially Observable Task and Motion Planning with Uncertainty and Risk Awareness , author=. arXiv preprint arXiv:2403.10454 , year=

    arXiv

  31. [39]

    Artificial Intelligence , volume=

    Planning and acting in partially observable stochastic domains , author=. Artificial Intelligence , volume=. 1998 , publisher=

    1998

  32. [40]

    arXiv preprint arXiv:1112.5745 , year=

    Bayesian active learning for classification and preference learning , author=. arXiv preprint arXiv:1112.5745 , year=

    arXiv

  33. [41]

    Machine learning , volume=

    Queries and concept learning , author=. Machine learning , volume=. 1988 , publisher=

    1988

  34. [42]

    Machine learning: An artificial intelligence approach , volume=

    Learning concepts by asking questions , author=. Machine learning: An artificial intelligence approach , volume=

  35. [43]

    2023 , publisher=

    Bayesian optimization , author=. 2023 , publisher=

    2023

  36. [44]

    ACM computing surveys (CSUR) , volume=

    A survey of deep active learning , author=. ACM computing surveys (CSUR) , volume=. 2021 , publisher=

    2021

  37. [45]

    2017 , organization=

    Deep bayesian active learning with image data , author=. 2017 , organization=

    2017

  38. [46]

    Active learning with statistical models , author=

  39. [47]

    Active learning for identifying function threshold boundaries , author=

  40. [48]

    Active Learning Literature Survey , Type =

    Burr Settles , Institution =. Active Learning Literature Survey , Type =

  41. [49]

    Chen, Sanxing and Wiseman, Sam and Dhingra, Bhuwan , journal=

  42. [50]

    Visual programming for step-by-step text-to-image generation and evaluation , author=

  43. [51]

    Artificial Intelligence , volume=

    Probabilistic logic , author=. Artificial Intelligence , volume=. 1986 , publisher=

    1986

  44. [52]

    John McCarthy and Patrick J. Hayes. Some Philosophical Problems from the Standpoint of Artificial Intelligence. Machine Intelligence 4. 1969

    1969

  45. [53]

    u tzner and Malte Helmert and Thomas Liebetraut and Robert Mattm \

    Yusra Alkhazraji and Matthias Frorath and Markus Gr \"u tzner and Malte Helmert and Thomas Liebetraut and Robert Mattm \"u ller and Manuela Ortlieb and Jendrik Seipp and Tobias Springenberg and Philip Stahl and Jan W \"u lfing. Pyperplan. 2020. doi:10.5281/zenodo.3700819

    2020 doi

  46. [54]

    1988 , publisher=

    The Society of Mind , author=. 1988 , publisher=

    1988

  47. [55]

    Formal theories of the commonsense world , pages=

    A formal theory of knowledge and action , author=. Formal theories of the commonsense world , pages=. 1985 , publisher=

    1985

  48. [56]

    1974 , institution=

    A framework for representing knowledge , author=. 1974 , institution=

    1974

  49. [57]

    Artificial Intelligence , volume=

    On the complexity of blocks-world planning , author=. Artificial Intelligence , volume=. 1992 , publisher=

    1992

  50. [58]

    Artificial Intelligence , volume=

    Reasoning about action I: A possible worlds approach , author=. Artificial Intelligence , volume=. 1988 , publisher=

    1988

  51. [59]

    Conference on Language Modeling , year=

    Andukuri, Chinmaya and Fr. Conference on Language Modeling , year=

  52. [60]

    Monographs of the Society for Research in Child Development , pages=

    Children's questions: A mechanism for cognitive development , author=. Monographs of the Society for Research in Child Development , pages=. 2007 , publisher=

    2007

  53. [61]

    Annual Symposium on Machine Programming (MAPS) , year=

    Large Language Models Should Ask Clarifying Questions to Increase Confidence in Generated Code , author=. Annual Symposium on Machine Programming (MAPS) , year=

  54. [62]

    arXiv:2311.09469 [cs.CL] , year=

    Clarify when necessary: Resolving ambiguity through interaction with lms , author=. arXiv:2311.09469 [cs.CL] , year=

    arXiv

  55. [63]

    Tong Zhang and Peixin Qin and Yang Deng and Chen Huang and Wenqiang Lei and Junhong Liu and Dingnan Jin and Hongru Liang and Tat-Seng Chua , year=

  56. [64]

    Min, Sewon and Michael, Julian and Hajishirzi, Hannaneh and Zettlemoyer, Luke , booktitle=

  57. [65]

    Kuhn, Lorenz and Gal, Yarin and Farquhar, Sebastian , journal=

  58. [66]

    Semantic uncertainty: Linguistic invariances for uncertainty estimation in natural language generation , author=

  59. [67]

    arXiv:2402.03271 [cs.CL] , year=

    Uncertainty of Thoughts: Uncertainty-Aware Planning Enhances Information Seeking in Large Language Models , author=. arXiv:2402.03271 [cs.CL] , year=

    arXiv

  60. [68]

    arXiv:2406.12639 [cs.CL] , year=

    Ask-before-Plan: Proactive Language Agents for Real-World Planning , author=. arXiv:2406.12639 [cs.CL] , year=

    arXiv

  61. [69]

    Practical transfer learning for

    Feurer, Matthias and Letham, Benjamin and Hutter, Frank and Bakshy, Eytan , journal=. Practical transfer learning for

  62. [70]

    Asymptotic analysis of maximum likelihood estimation of covariance parameters for

    Bachoc, Fran. Asymptotic analysis of maximum likelihood estimation of covariance parameters for. Advances in Contemporary Statistics and Econometrics: Festschrift in Honor of Christine Thomas-Agnan , pages=. 2021 , publisher=

    2021

  63. [71]

    Distributionally robust neural networks for group shifts: On the importance of regularization for worst-case generalization , author=

  64. [72]

    Adam: A method for stochastic optimization , author=

  65. [73]

    Mathematical Programming , volume=

    Benchmarking optimization software with performance profiles , author=. Mathematical Programming , volume=. 2002 , publisher=

    2002

  66. [74]

    CoRR , volume =

    Ciprian Chelba and Tomas Mikolov and Mike Schuster and Qi Ge and Thorsten Brants and Phillipp Koehn , title =. CoRR , volume =. 2013 , url =

    2013

  67. [75]

    LeCun, Yann and Cortes, Corinna and Burges, CJ , journal=

  68. [76]

    Ten lessons from three generations shaped

    Jouppi, Norman P and Yoon, Doe Hyun and Ashcraft, Matthew and Gottscho, Mark and Jablin, Thomas B and Kurian, George and Laudon, James and Li, Sheng and Ma, Peter and Ma, Xiaoyu and others , booktitle=. Ten lessons from three generations shaped

  69. [77]

    , booktitle=

    Nesterov, Yurii E. , booktitle=. A method of solving a convex programming problem with convergence rate. 1983 , organization=

    1983

  70. [78]

    2006 , publisher=

    Elements of Information Theory , author=. 2006 , publisher=

    2006

  71. [79]

    2010 , publisher=

    Graph kernels , author=. 2010 , publisher=

    2010

  72. [80]

    Yutian Chen and Xingyou Song and Chansoo Lee and Zi Wang and Qiuyi Zhang and David Dohan and Kazuya Kawakami and Greg Kochanski and Arnaud Doucet and Marc'Aurelio Ranzato and Sagi Perel and Nando de Freitas , title =

  73. [81]

    Van der Wilk, Mark and Rasmussen, Carl Edward and Hensman, James , booktitle=neurips, year=

  74. [82]

    2005 , publisher=

    Memory-based Language Processing , author=. 2005 , publisher=

    2005

  75. [83]

    2003 , publisher=

    Artificial intelligence: A modern approach , author=. 2003 , publisher=

    2003

  76. [84]

    Babuschkin, Igor and Baumli, Kate and Bell, Alison and Bhupatiraju, Surya and Bruce, Jake and Buchlovsky, Peter and Budden, David and Cai, Trevor and Clark, Aidan and Danihelka, Ivo and Fantacci, Claudio and Godwin, Jonathan and Jones, Chris and Hemsley, Ross and Hennigan, Tom...

  77. [85]

    Variational learning of inducing variables in sparse

    Titsias, Michalis , booktitle=aistats, year=. Variational learning of inducing variables in sparse

  78. [86]

    Burt and Artem Artemev and Seth Flaxman and Mark van der Wilk and Carl Edward Rasmussen and Hong Ge , title =

    Alexander Terenin and David R. Burt and Artem Artemev and Seth Flaxman and Mark van der Wilk and Carl Edward Rasmussen and Hong Ge , title =. 2024 , volume =

    2024

  79. [87]

    Mondrian forests for large-scale regression when uncertainty matters , author=

  80. [88]

    and Snoek, Jasper and Adams, Ryan P

    Gelbart, Michael A. and Snoek, Jasper and Adams, Ryan P. , title =. 2014 , booktitle =

    2014

  81. [89]

    Constrained Bayesian Optimization and Applications , year=

    Michael Gelbart , school=. Constrained Bayesian Optimization and Applications , year=

  82. [90]

    A general framework for constrained

    Hern\'. A general framework for constrained. 2016 , volume =

    2016

  83. [91]

    2013 , school=

    Jasper Snoek , title=. 2013 , school=

    2013

  84. [92]

    Bayesian Optimization with Inequality Constraints , author =

  85. [93]

    Intelligent Data Analysis , volume=

    An overview of clustering methods , author=. Intelligent Data Analysis , volume=. 2007 , publisher=

    2007

  86. [94]

    3rd Symposium on Advances in Approximate Bayesian Inference , year=

    Understanding variational inference in function-space , author=. 3rd Symposium on Advances in Approximate Bayesian Inference , year=

  87. [95]

    2021 , publisher=

    Learning compositional models of robot skills for task and motion planning , author=. 2021 , publisher=

    2021

  88. [96]

    High-dimensional

    Rolland, Paul and Scarlett, Jonathan and Bogunovic, Ilija and Cevher, Volkan , booktitle=aistats, year=. High-dimensional

  89. [97]

    Discovering and exploiting additive structure for

    Gardner, Jacob and Guo, Chuan and Weinberger, Kilian and Garnett, Roman and Grosse, Roger , booktitle=aistats, year=. Discovering and exploiting additive structure for

  90. [98]

    Functional variational

    Sun, Shengyang and Zhang, Guodong and Shi, Jiaxin and Grosse, Roger , booktitle=iclr, year=. Functional variational

  91. [99]

    arXiv preprint arXiv:1504.00325 , year=

    Microsoft coco captions: Data collection and evaluation server , author=. arXiv preprint arXiv:1504.00325 , year=

    arXiv

  92. [100]

    Machine learning , volume=

    Multitask learning , author=. Machine learning , volume=. 1997 , publisher=

    1997

  93. [101]

    Multi-task

    Bonilla, Edwin V and Chai, Kian and Williams, Christopher , booktitle=neurips, year=. Multi-task

  94. [102]

    Local and global sparse

    Snelson, Edward and Ghahramani, Zoubin , booktitle=aistats, year=. Local and global sparse

  95. [103]

    Sparse on-line

    Csat. Sparse on-line. Neural Computation , volume=. 2002 , publisher=

    2002

  96. [104]

    Understanding probabilistic sparse

    Bauer, Matthias and van der Wilk, Mark and Rasmussen, Carl Edward , journal=neurips, year=. Understanding probabilistic sparse

  97. [105]

    2003 , publisher=

    Probability theory: The logic of science , author=. 2003 , publisher=

    2003

  98. [106]

    Gaussian process optimization with mutual information , author=

  99. [107]

    Neural Information Processing Systems (NeurIPS) Track on Datasets and Benchmarks , year =

    Sebastian Pineda. Neural Information Processing Systems (NeurIPS) Track on Datasets and Benchmarks , year =

  100. [108]

    Quantifying mismatch in

    Schulz, Eric and Speekenbrink, Maarten and Hern. Quantifying mismatch in. NeurIPS Workshop on Bayesian Optimization: Black-box Optimization and Beyond , year=

  101. [109]

    No-regret

    Berkenkamp, Felix and Schoellig, Angela P and Krause, Andreas , journal=jmlr, year =. No-regret

  102. [110]

    Misspecified

    Bogunovic, Ilija and Krause, Andreas , journal=neurips, year=. Misspecified

  103. [111]

    Few-shot

    Wistuba, Martin and Grabocka, Josif , booktitle=iclr, year=. Few-shot

  104. [112]

    A quantile-based approach for hyperparameter transfer learning , author=

  105. [113]

    On the limited memory

    Liu, Dong C and Nocedal, Jorge , journal=. On the limited memory. 1989 , publisher=

    1989

  106. [114]

    Rich feature hierarchies for accurate object detection and semantic segmentation , author=

  107. [115]

    Donahue, Jeff and Jia, Yangqing and Vinyals, Oriol and Hoffman, Judy and Zhang, Ning and Tzeng, Eric and Darrell, Trevor , booktitle = icml, year =

  108. [116]

    Devlin, Jacob and Chang, Ming-Wei and Lee, Kenton and Toutanova, Kristina , booktitle=

  109. [117]

    arXiv:1711.10604 [cs.LG] , year=

    Tensorflow distributions , author=. arXiv:1711.10604 [cs.LG] , year=

    arXiv

  110. [118]

    Jonathan Heek and Anselm Levskaya and Avital Oliver and Marvin Ritter and Bertrand Rondepierre and Andreas Steiner and Marc van

  111. [119]

    Matteo Hessel and David Budden and Fabio Viola and Mihaela Rosca and Eren Sezener and Tom Hennigan , title =

  112. [120]

    2021 , publisher=

    Shields, Benjamin J and Stevens, Jason and Li, Jun and Parasram, Marvin and Damani, Farhan and Alvarado, Jesus I Martinez and Janey, Jacob M and Adams, Ryan P and Doyle, Abigail G , journal=. 2021 , publisher=

    2021

  113. [121]

    Advances in

    Lam, R. Advances in. AIAA Non-Deterministic Approaches Conference , pages=

  114. [122]

    Deep residual learning for image recognition , author=

  115. [123]

    2009 , organization=

    Imagenet: A large-scale hierarchical image database , author=. 2009 , organization=

    2009

  116. [124]

    Exploring the limits of transfer learning with a unified text-to-text transformer , author=

  117. [125]

    2020 , MONTH = Jan, PDF =

    Bouthillier, Xavier and Varoquaux, Ga. 2020 , MONTH = Jan, PDF =

    2020

  118. [126]

    2017 , publisher=

    Hyperband: A novel bandit-based approach to hyperparameter optimization , author=. 2017 , publisher=

    2017

  119. [127]

    NeurIPS 2020 Competition and Demonstration Track , series =

    Bayesian optimization is superior to random search for machine learning hyperparameter tuning: Analysis of the black-box optimization challenge 2020 , author=. NeurIPS 2020 Competition and Demonstration Track , series =

    2020

  120. [128]

    2018 , publisher=

    Pyzer-Knapp, Edward O , journal=. 2018 , publisher=

    2018

  121. [129]

    Hoos and Frank Hutter and Kevin Leyton-Brown , title =

    Lars Kotthoff and Chris Thornton and Holger H. Hoos and Frank Hutter and Kevin Leyton-Brown , title =. 2017 , volume =

    2017

  122. [130]

    Deep Learning for

    Kim, Samuel and Lu, Peter Y and Loh, Charlotte and Smith, Jamie and Snoek, Jasper and Solja. Deep Learning for

  123. [131]

    Constrained

    Griffiths, Ryan-Rhys and Hern. Constrained. Chemical Science , volume=. 2020 , publisher=

    2020

  124. [132]

    Mathematics of computation , volume=

    Updating quasi-Newton matrices with limited storage , author=. Mathematics of computation , volume=

  125. [133]

    Scalable hyperparameter transfer learning , author=

  126. [134]

    Scalable

    Wistuba, Martin and Schilling, Nicolas and Schmidt-Thieme, Lars , journal=. Scalable. 2018 , publisher=

    2018

  127. [135]

    James Bradbury and Roy Frostig and Peter Hawkins and Matthew James Johnson and Chris Leary and Dougal Maclaurin and George Necula and Adam Paszke and Jake Vander

  128. [136]

    End-to-End Learning of Deep Kernel Acquisition Functions for

    Iwata, Tomoharu , journal=. End-to-End Learning of Deep Kernel Acquisition Functions for

  129. [137]

    2017 , organization=

    Learning to learn without gradient descent by gradient descent , author=. 2017 , organization=

    2017

  130. [138]

    Rothfuss, Jonas and Fortuin, Vincent and Josifoski, Martin and Krause, Andreas , booktitle=icml, year=

  131. [139]

    Kathuria, Tarun and Deshpande, Amit and Kohli, Pushmeet , journal=neurips, year=. Batched

  132. [140]

    Wang, Ziyu and Hutter, Frank and Zoghi, Masrour and Matheson, David and de Feitas, Nando , journal=jair, volume=

  133. [141]

    Oh, ChangYong and Gavves, Efstratios and Welling, Max , booktitle=icml, year=. Bock:

  134. [142]

    Batched large-scale

    Wang, Zi and Gehring, Clement and Kohli, Pushmeet and Jegelka, Stefanie , booktitle=aistats, year=. Batched large-scale

  135. [143]

    Neal , title =

    Radford M. Neal , title =. The Annals of Statistics , number =. 2003 , doi =

    2003

  136. [144]

    2019 , publisher=

    Learning to guide task and motion planning using score-space representation , author=. 2019 , publisher=

    2019

  137. [145]

    Meta-learning acquisition functions for transfer learning in

    Volpp, Michael and Fr. Meta-learning acquisition functions for transfer learning in

  138. [146]

    Regret bounds for meta

    Wang, Zi and Kim, Beomjoon and Kaelbling, Leslie Pack , booktitle=neurips, year=. Regret bounds for meta

  139. [147]

    arXiv preprint arXiv:2002.11887 , year=

    Using a thousand optimization tasks to learn hyperparameter search strategies , author=. arXiv preprint arXiv:2002.11887 , year=

    2002 arXiv

  140. [148]

    Rapidly-exploring random trees: Progress and prospects , author=

  141. [149]

    Annals of the Institute of Statistical Mathematics , volume=

    Tolerance regions for a multivariate normal population , author=. Annals of the Institute of Statistical Mathematics , volume=. 1964 , publisher=

    1964

  142. [150]

    R. Diankov. Automated Construction of Robotic Manipulation Programs. 2010

    2010

  143. [151]

    Nature , year=

    Robots that adapt like animals , author=. Nature , year=

  144. [152]

    Neural Architecture Search with

    Kandasamy, Kirthevasan and Neiswanger, Willie and Schneider, Jeff and Poczos, Barnabas and Xing, Eric , journal=. Neural Architecture Search with

  145. [153]

    Deep Semi-Random Features for Nonlinear Function Approximation , author=

  146. [154]

    An empirical

    Robbins, Herbert , booktitle=. An empirical

  147. [155]

    Bernoulli , volume=

    High-dimensional covariance matrix estimation with missing observations , author=. Bernoulli , volume=. 2014 , publisher=

    2014

  148. [156]

    Foundations of Computational mathematics , volume=

    Exact matrix completion via convex optimization , author=. Foundations of Computational mathematics , volume=. 2009 , publisher=

    2009

  149. [157]

    Compound decision theory and empirical

    Zhang, Cun-Hui and others , journal=. Compound decision theory and empirical. 2003 , publisher=

    2003

  150. [158]

    Bayes and empirical

    Petrone, Sonia and Rousseau, Judith and Scricciolo, Catia , journal=. Bayes and empirical. 2014 , publisher=

    2014

  151. [159]

    Bayes, oracle

    Efron, Bradley and others , journal=. Bayes, oracle. 2019 , publisher=

    2019

  152. [160]

    Automating

    Malkomes, Gustavo and Garnett, Roman , booktitle=neurips, year=. Automating

  153. [161]

    Proceedings of the National Academy of Sciences , volume=

    The discovery of structural form , author=. Proceedings of the National Academy of Sciences , volume=. 2008 , publisher=

    2008

  154. [162]

    Adaptive

    Sniekers, Suzanne and van der Vaart, Aad and others , journal=. Adaptive. 2015 , publisher=

    2015

  155. [163]

    2011 , publisher=

    Theoretical Statistics: Topics for a Core Course , author=. 2011 , publisher=

    2011

  156. [164]

    Practical

    Snoek, Jasper and Larochelle, Hugo and Adams, Ryan P , booktitle=neurips, year=. Practical

  157. [165]

    Journal of Mathematical Modelling and Algorithms , volume=

    A no-free-lunch theorem for non-uniform distributions of target functions , author=. Journal of Mathematical Modelling and Algorithms , volume=. 2005 , publisher=

    2005

  158. [166]

    Hyperband: A novel bandit-based approach to hyperparameter optimization , author=

  159. [167]

    1958 , publisher=

    An Introduction to Multivariate Statistical Analysis , author=. 1958 , publisher=

    1958

  160. [168]

    Eaton , title =

    Morris L. Eaton , title =

  161. [169]

    Annals of Statistics , pages=

    Adaptive estimation of a quadratic functional by model selection , author=. Annals of Statistics , pages=. 2000 , publisher=

    2000

  162. [170]

    Sculley , year =

    Daniel Golovin and Benjamin Solnik and Subhodeep Moitra and Greg Kochanski and John Elliot Karro and D. Sculley , year =. Google

  163. [171]

    Learning a

    Platt, John C and Burges, Christopher JC and Swenson, Steven and Weare, Christopher and Zheng, Alice , booktitle=neurips, year=. Learning a

  164. [172]

    Learning

    Schwaighofer, Anton and Tresp, Volker and Yu, Kai , booktitle=neurips, year=. Learning

  165. [173]

    Towards Automated

    Malkomes, Gustavo and Garnett, Roman , booktitle=. Towards Automated

  166. [174]

    Malkomes, Gustavo and Schaff, Charles and Garnett, Roman , booktitle=neurips, year=

  167. [175]

    Learning to guide task and motion planning using score-space representation , author=

  168. [176]

    Feurer, Matthias and Springenberg, Jost and Hutter, Frank , title =

  169. [177]

    Efficient transfer learning method for automatic hyperparameter tuning , author=

  170. [178]

    Theoretical analysis of

    Wang, Ziyu and de Freitas, Nando , booktitle=. Theoretical analysis of

  171. [179]

    Regret bounds for transfer learning in

    Shilton, Alistair and Gupta, Sunil and Rana, Santu and Venkatesh, Svetha , booktitle=aistats, year=. Regret bounds for transfer learning in

  172. [180]

    Warm starting

    Poloczek, Matthias and Wang, Jialei and Frazier, Peter I , booktitle=. Warm starting

  173. [181]

    Multi-task

    Swersky, Kevin and Snoek, Jasper and Adams, Ryan P , booktitle=neurips, year=. Multi-task

  174. [182]

    Multi-information source optimization , author=

  175. [183]

    Scalable Meta-Learning for

    Feurer, Matthias and Letham, Benjamin and Bakshy, Eytan , journal=. Scalable Meta-Learning for

  176. [184]

    Learning to learn without gradient descent by gradient descent , author=

  177. [185]

    Neural computation , volume=

    Long short-term memory , author=. Neural computation , volume=. 1997 , publisher=

    1997

  178. [186]

    Efficient and robust automated machine learning , author=

  179. [187]

    Characterizing the applicability of classification algorithms using meta-level learning , author=

  180. [188]

    Collaborative hyperparameter tuning , author=

  181. [189]

    Baxter, J , booktitle = colt, title =

  182. [190]

    and Picard, Rosalind W

    Minka, Thomas P. and Picard, Rosalind W. , institution =. Learning how to learn is learning with point sets , year =

  183. [191]

    ON LEARNING HOW TO LEARN LEARNING STRATEGIES , year =

  184. [192]

    Artificial intelligence , volume=

    STRIPS: A new approach to the application of theorem proving to problem solving , author=. Artificial intelligence , volume=. 1971 , publisher=

    1971

  185. [193]

    Victoria Xia and Zi Wang and Kelsey Allen and Tom Silver and Leslie Pack Kaelbling , title =

  186. [194]

    Journal of Global Optimization , volume=

    A taxonomy of global optimization methods based on response surfaces , author=. Journal of Global Optimization , volume=. 2001 , publisher=

    2001

  187. [195]

    Parallel and distributed Thompson sampling for large-scale accelerated exploration of chemical space , author=

  188. [196]

    Max-value Entropy Search for Efficient

    Wang, Zi and Jegelka, Stefanie , booktitle=icml, year=. Max-value Entropy Search for Efficient

  189. [197]

    Truncated variance reduction: A unified approach to

    Bogunovic, Ilija and Scarlett, Jonathan and Krause, Andreas and Cevher, Volkan , booktitle=neurips, year=. Truncated variance reduction: A unified approach to

  190. [198]

    Calandra, Roberto , year=

  191. [199]

    Batched High-dimensional

    Wang, Zi and Li, Chengtao and Jegelka, Stefanie and Kohli, Pushmeet , booktitle=icml, year=. Batched High-dimensional

  192. [200]

    Language models are few-shot learners , author=

  193. [201]

    Modeling human function learning with Gaussian processes , author=

  194. [202]

    A conservation law for generalization performance , author=

  195. [203]

    IEEE Transactions on Evolutionary Computation , volume=

    No free lunch theorems for optimization , author=. IEEE Transactions on Evolutionary Computation , volume=. 1997 , publisher=

    1997

  196. [204]

    The human kernel , author=

  197. [205]

    2004 , publisher=

    Convex optimization , author=. 2004 , publisher=

    2004

  198. [206]

    Dropout as a

    Gal, Yarin and Ghahramani, Zoubin , booktitle=icml, year=. Dropout as a

  199. [207]

    Cowen-Rivers, Alexander I and Lyu, Wenlong and Tutunov, Rasul and Wang, Zhi and Grosnit, Antoine and Griffiths, Ryan Rhys and Maraval, Alexandre Max and Jianye, Hao and Wang, Jun and Peters, Jan and Bou-Ammar, Haitham , journal=jair, volume=

  200. [208]

    Simple and scalable predictive uncertainty estimation using deep ensembles , author=

  201. [209]

    Foundations and Trends

    From bandits to Monte-Carlo Tree Search: The optimistic principle applied to optimization and planning , author=. Foundations and Trends. 2014 , publisher=

    2014

  202. [210]

    2016 , publisher=

    Global continuous optimization with error bound and fast convergence , author=. 2016 , publisher=

    2016

  203. [211]

    Springenberg, Jost Tobias and Klein, Aaron and Falkner, Stefan and Hutter, Frank , booktitle=neurips, year=

  204. [212]

    Kawaguchi, Kenji and Kaelbling, Leslie Pack and Lozano-P

  205. [213]

    2007 , publisher=

    Feedback control of dynamic bipedal robot locomotion , author=. 2007 , publisher=

    2007

  206. [214]

    Box2D , A 2D Physics Engine for Games

    Erin Catto. Box2D , A 2D Physics Engine for Games

  207. [215]

    Square Root Inequality

    Weisstein, Eric W. , title = "Square Root Inequality.", howpublished=

  208. [216]

    La distribution de la plus grande de n valeurs , author=. Rev. math. Union interbalcanique , year=

  209. [217]

    GPstuff:

    Vanhatalo, Jarno and Riihim. GPstuff:

  210. [218]

    NIPS workshop on

    Hoffman, Matthew W and Ghahramani, Zoubin , title =. NIPS workshop on

  211. [219]

    Learning composable models of primitive actions , author=

  212. [220]

    2013 , publisher=

    Integrated task and motion planning in belief space , author=. 2013 , publisher=

    2013

  213. [221]

    International Conference on Automated Planning and Scheduling , volume=

    Garrett, Caelan Reed and Lozano-P. International Conference on Automated Planning and Scheduling , volume=

  214. [222]

    Online replanning in belief space for partially observable task and motion problems , author=

  215. [223]

    A Bradford Book , year=

    Reinforcement learning: An introduction , author=. A Bradford Book , year=

  216. [224]

    Reinforcement learning: A survey , author=

  217. [225]

    Focused Model-Learning and Planning for Non-

    Wang, Zi and Jegelka, Stefanie and Kaelbling, Leslie Pack and Lozano-P. Focused Model-Learning and Planning for Non-

  218. [226]

    Bache, Kevin and Lichman, Moshe , year=

  219. [227]

    To be disclosed upon acceptance , author=

  220. [228]

    Random Features for Large-Scale Kernel Machines , author=

  221. [229]

    1930 , publisher=

    The genetical theory of natural selection: a complete variorum edition , author=. 1930 , publisher=

    1930

  222. [230]

    Additive

    Duvenaud, David K and Nickisch, Hannes and Rasmussen, Carl E , booktitle=neurips, year=. Additive

  223. [231]

    Jitkrittum, Wittawat and Gretton, Arthur and Heess, Nicolas and Eslami, S. M. Ali and Lakshminarayanan, Balaji and Sejdinovic, Dino and Szab. Kernel-

  224. [232]

    Philosophical transactions of the royal society of London

    Functions of positive and negative type, and their connection with the theory of integral equations , author=. Philosophical transactions of the royal society of London. Series A, containing papers of a mathematical or physical character , volume=. 1909 , publisher=

    1909

  225. [233]

    2011 , publisher=

    Fourier analysis on groups , author=. 2011 , publisher=

    2011

  226. [234]

    Focused real-time dynamic programming for MDPs: Squeezing more out of a heuristic , author=

  227. [235]

    Numerische Mathematik , volume=

    On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals , author=. Numerische Mathematik , volume=. 1960 , publisher=

    1960

  228. [236]

    2006 , publisher=

    Planning algorithms , author=. 2006 , publisher=

    2006

  229. [237]

    Approximate solutions to

    Gordon, Geoffrey J , journal=. Approximate solutions to

  230. [238]

    Bounded real-time dynamic programming:

    McMahan, H Brendan and Likhachev, Maxim and Gordon, Geoffrey J , booktitle=icml, pages=. Bounded real-time dynamic programming:. 2005 , organization=

    2005

  231. [239]

    2015 , organization=

    Optimism-driven exploration for nonlinear systems , author=. 2015 , organization=

    2015

  232. [240]

    Variational heteroscedastic

    Titsias, Michalis K and L. Variational heteroscedastic

  233. [241]

    Variational mixture of

    Yuan, Chao and Neubauer, Claus , booktitle=. Variational mixture of

  234. [242]

    Heteroscedastic

    Le, Quoc V and Smola, Alex J and Canu, St. Heteroscedastic. 2005 , organization=

    2005

  235. [243]

    Most likely heteroscedastic

    Kersting, Kristian and Plagemann, Christian and Pfaff, Patrick and Burgard, Wolfram , booktitle=icml, pages=. Most likely heteroscedastic. 2007 , organization=

    2007

  236. [244]

    Reinforcement learning with guided policy search using

    Jakab, Hunor S and Csat. Reinforcement learning with guided policy search using. International Joint Conference on Neural Networks (IJCNN) , pages=. 2012 , organization=

    2012

  237. [245]

    Deisenroth, Marc and Rasmussen, Carl E , booktitle=icml, pages=

  238. [246]

    Bandit-Based Planning and Learning in Continuous-Action

    Weinstein, Ari and Littman, Michael L , booktitle=. Bandit-Based Planning and Learning in Continuous-Action

  239. [247]

    2009 , publisher=

    Deisenroth, Marc Peter and Rasmussen, Carl Edward and Peters, Jan , journal=. 2009 , publisher=

    2009

  240. [248]

    , author=

    Model-Based Reinforcement Learning with Continuous States and Actions. , author=. European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning (ESANN) , pages=

  241. [249]

    Adaptive autonomous control using online value iteration with

    Rottmann, Axel and Burgard, Wolfram , booktitle=icra, pages=. Adaptive autonomous control using online value iteration with. 2009 , organization=

    2009

  242. [250]

    More than a Million Ways to Be Pushed:

    Yu, Kuan-Ting and Bauza, Maria and Fazeli, Nima and Rodriguez, Alberto , note=. More than a Million Ways to Be Pushed:. IEEE/RSJ International Conference on Intelligent Robots and Systems , year=

  243. [251]

    arXiv preprint arXiv:1505.00023 , year=

    Deterministic Sampling-Based Motion Planning: Optimality, Complexity, and Performance , author=. arXiv preprint arXiv:1505.00023 , year=

    arXiv

  244. [252]

    Model learning for robot control:

    Nguyen-Tuong, Duy and Peters, Jan , journal=. Model learning for robot control:. 2011 , publisher=

    2011

  245. [253]

    Safe Exploration in Finite

    Turchetta, Matteo and Berkenkamp, Felix and Krause, Andreas , journal=. Safe Exploration in Finite

  246. [254]

    Foundations and Trends in Machine Learning , volume =

    Ghavamzadeh, Mohammad and Mannor, Shie and Pineau, Joelle and Tamar, Aviv and others , year=. Foundations and Trends in Machine Learning , volume =

  247. [255]

    A tutorial on

    Brochu, Eric and Cora, Vlad M and De Freitas, Nando , journal=. A tutorial on

  248. [256]

    2018 , organization=

    Active model learning and diverse action sampling for task and motion planning , author=. 2018 , organization=

    2018

  249. [257]

    Frean, Marcus and Boyle, Phillip , booktitle=. Using. 2008 , organization=

    2008

  250. [258]

    Nonlinear adaptive control using nonparametric

    Murray-Smith, Roderick and Sbarbaro, Daniel , journal=. Nonlinear adaptive control using nonparametric. 2002 , publisher=

    2002

  251. [259]

    2016 , Booktitle = aistats, Author =

    Optimization as Estimation with. 2016 , Booktitle = aistats, Author =

    2016

  252. [260]

    Artificial Intelligence , volume=

    Learning to act using real-time dynamic programming , author=. Artificial Intelligence , volume=. 1995 , publisher=

    1995

  253. [261]

    Planning with noisy probabilistic relational rules , author=

  254. [262]

    2011 , organization=

    Learning to predict how rigid objects behave under simple manipulation , author=. 2011 , organization=

    2011

  255. [263]

    2010 , school=

    Prediction learning in robotic manipulation , author=. 2010 , school=

    2010

  256. [264]

    2009 , organization=

    Prediction learning in robotic pushing manipulation , author=. 2009 , organization=

    2009

  257. [265]

    2016 , publisher=

    An incremental sampling-based algorithm for stochastic optimal control , author=. 2016 , publisher=

    2016

  258. [266]

    Learning symbolic models of stochastic domains , author=

  259. [267]

    Methodology and Computing in Applied Probability , volume=

    Computing bounds on the expected maximum of correlated normal variables , author=. Methodology and Computing in Applied Probability , volume=. 2010 , publisher=

    2010

  260. [268]

    Regression with input-dependent noise:

    Goldberg, Paul W and Williams, Christopher KI and Bishop, Christopher M , journal=neurips, volume=. Regression with input-dependent noise:

  261. [269]

    GP-EST: A Unifying Algorithm for GP-UCB and Probability of Improvement

    Wang, Zi and Zhou, Bolei and Jegelka, Stefanie. GP-EST: A Unifying Algorithm for GP-UCB and Probability of Improvement

  262. [270]

    Most likely heteroscedastic

    Kersting, Kristian and Plagemann, Christian and Pfaff, Patrick and Burgard, Wolfram , booktitle=icml, year=. Most likely heteroscedastic

  263. [271]

    Fan, Zhou and Han, Xinran and Wang, Zi , journal=

  264. [272]

    Transfer Learning for Bayesian Optimization on Heterogeneous Search Spaces , author=

  265. [273]

    Transfer learning with gaussian processes for bayesian optimization , author=

  266. [274]

    Hyperpriors for

    Roininen, Lassi and Girolami, Mark and Lasanen, Sari and Markkanen, Markku , journal =. Hyperpriors for

  267. [275]

    PFNs Are Flexible Models for Real-World

    M. PFNs Are Flexible Models for Real-World. arXiv preprint arXiv:2305.17535 , year=

    arXiv

  268. [276]

    All you need is a good functional prior for

    Tran, Ba-Hien and Rossi, Simone and Milios, Dimitrios and Filippone, Maurizio , journal=jmlr, volume=. All you need is a good functional prior for

  269. [277]

    Operations Research , volume=

    Bayesian optimization allowing for common random numbers , author=. Operations Research , volume=. 2022 , publisher=

    2022

  270. [278]

    Gu, Mengyang and Wang, Xiaojing and Berger, James O , journal=. Robust. 2018 , publisher=

    2018

  271. [279]

    Which algorithmic choices matter at which batch sizes? insights from a noisy quadratic model , author=

  272. [280]

    arXiv:1910.05446 [cs.LG] , year=

    On empirical comparisons of optimizers for deep learning , author=. arXiv:1910.05446 [cs.LG] , year=

    1910 arXiv

  273. [281]

    2011 , publisher=

    Encyclopedia of machine learning , author=. 2011 , publisher=

    2011

  274. [282]

    Joint optimization and variable selection of high-dimensional

    Chen, Bo and Castro, Rui and Krause, Andreas , journal=. Joint optimization and variable selection of high-dimensional

  275. [283]

    SIAM review , volume=

    Optimization by direct search: New perspectives on some classical and modern methods , author=. SIAM review , volume=. 2003 , publisher=

    2003

  276. [284]

    SIAM Journal on Optimization , volume=

    Analysis of generalized pattern searches , author=. SIAM Journal on Optimization , volume=. 2002 , publisher=

    2002

  277. [285]

    Convergence properties of the

    Lagarias, Jeffrey C and Reeds, James A and Wright, Margaret H and Wright, Paul E , journal=. Convergence properties of the. 1998 , publisher=

    1998

  278. [286]

    Lipschitzian optimization without the

    Jones, Donald R and Perttunen, Cary D and Stuckman, Bruce E , journal=. Lipschitzian optimization without the. 1993 , publisher=

    1993

  279. [287]

    2007 , publisher=

    Concentration Inequalities and Model Selection , author=. 2007 , publisher=

    2007

  280. [288]

    The one-sided barrier problem for

    Slepian, David , journal=. The one-sided barrier problem for. 1962 , publisher=

    1962

  281. [289]

    High dimensional

    Kandasamy, Kirthevasan and Schneider, Jeff and Poczos, Barnabas , booktitle=icml, year=. High dimensional

  282. [290]

    Predictive entropy search for efficient global optimization of black-box functions , author=

  283. [291]

    Tedrake, Russ , title =

  284. [292]

    , author=

    Finding locally optimal, collision-free trajectories with sequential convex optimization. , author=

  285. [293]

    Michael Grant and Stephen Boyd , title =

  286. [294]

    Recent Advances in Learning and Control , series =

    Michael Grant and Stephen Boyd , title =. Recent Advances in Learning and Control , series =

  287. [295]

    The MOSEK Optimization Toolbox for MATLAB Manual

    MOSEK ApS. The MOSEK Optimization Toolbox for MATLAB Manual. Version 7.1 (Revision 28)

  288. [296]

    Gurobi Optimizer Reference Manual

    Gurobi Optimization, Inc. Gurobi Optimizer Reference Manual

  289. [297]

    Rasmussen, Carl Edward and Williams, Christopher K.I. , year=

  290. [298]

    Machine learning , volume=

    Finite-time analysis of the multiarmed bandit problem , author=. Machine learning , volume=. 2002 , publisher=

    2002

  291. [299]

    An experimental comparison of

    Calandra, Roberto and Seyfarth, Andr. An experimental comparison of

  292. [300]

    Learning deep features for scene recognition using places database , author=

Pith tools

Reviewed August 2, 2026 · model on record in the stance chip above.