Robotics · arXiv:2610.35604 v1 · submitted 26 Oct 2026 · 30 references
RoboDoctor: Training-Free Recursive Self-Improvement for Robot Policies
The paper says
“Generalist robot policies and language-model agents provide complementary capabilities, but completing a task also requires adapting their use to the consequences of physical interaction.”
more of the abstract
We study execution as a locus of adaptation: feedback guides the current action and supplies evidence for revising subsequent decisions under fixed model weights. We introduce RoboDoctor, a training-free framework that connects diagnosis, grounded action, and persistent experience across three revision targets. The harness allocates control between policy and agent; intervention determines when to assist while preserving useful policy behavior; and operation refines physical methods through observed effects. Linked experience records retain the reason for a decision, the attempted method, its outcome, and conditions for reuse. On a curated archive of 54 RoboDojo-Sim task entries, RoboDoctor achieves a five-dimension mean score of 57.10, with a native success rate of 49.44%. Recorded interactions illustrate strategy changes, selective correction, and grasp revision. These findings characterize execution-time adaptation in the evaluated system; controlled trials remain necessary to isolate the contribution of cross-episode experience.
from the abstract
Pith says
Machine review · deepseek-v4-flash · 27 Oct 2026 · what was read was not recorded · not checked by a person
It can be wrong. Challenge this review or reply to it.
Holds up, with conditions. A careful framework paper with an honestly labeled but selection-biased headline number; the architecture is worth knowing, the 57.10 is not yet evidence for experience-driven gains. This line is wrong
2 major objections · 6 minor
How often objections from reviews like this one are right: not yet measured
Not checked: figures, code, what the 30 references say.
The paper says, at 4.1, Tables 1 and 4
The review did not quote this passage.
A classifier read this sentence of the paper as acknowledging the concern (probability 0.76):
“Because selected outcomes may originate from different source runs and memory histories, the stage comparison characterizes the archived results rather than a prospectively controlled treatment effect.”
Pith says: Objection 1 of 2 · major
Section 4.1 discloses that the archive retains the highest valid score among candidate outcomes with deterministic tie-breaking and that selected outcomes may originate from different source runs and memory histories, but it never states the number of candidates per slot, whether Warmup's three outcomes per task were likewise selection maxima, or how many candidate runs were discarded as invalid.
more of objection 1
Refinement has six nominal slots versus Warmup's three (301/324 versus 162/162 in Table 1), Table 4 shows 23 absent slots with eight tasks at n=3 or n=4, and the per-task Refinement means are therefore order statistics over candidate pools of unknown size with validity filtering on top. If each Refinement slot keeps the best of several candidates while Warmup slots are single outcomes, a null system with no experience and no revision produces a positive Warmup-to-Refinement gap by construction; the reported magnitudes (7.37 points, 8.61 percentage points; per-task jumps such as align_blocks 0 to 100 and push_T_random 0 to 83.33) are within the plausible range of such bias, especially for near-zero-baseline tasks where six Bernoulli attempts make an all-success selected mean likely. The paper acknowledges that the stage comparison characterizes archived results rather than a prospectively controlled treatment effect (Section 4.1) and that retrospective selection and differing source histories limit attribution (Section 6); the unresolved residue is that even the descriptive headline cannot be interpreted without the candidate counts. Please report per-slot candidate counts and per-stage selection policies, and include a selection-matched recomputation (for instance, the first valid outcome per slot for both stages, or best-of-k with matched k) to show that the gain direction and magnitude survive; if they do not, reframe the abstract, Figure 1, and Section 4.2 accordingly.
The paper says, at 4.2, Table 1
The review did not quote this passage.
A classifier read this sentence of the paper as acknowledging the concern (probability 0.75):
“Although these methods share the same aggregation convention, their in- teraction budgets, run-selection procedures, and configurations are not matched.”
Pith says: Objection 2 of 2 · major
Section 4.2 states that Refinement exceeds HexaShell-Preview by 3.92 points and 2.59 percentage points and exceeds WorldScape-R2SI, EmbodiedEvo, and VPP2 by 10.52, 12.02, and 17.84 points. These exceedance claims compare a local archive whose Refinement outcomes are score-selected maxima against published leaderboard entries whose own run-selection procedures are unstated; the qualifications appear in the Table 1 caption and in the following sentence about protocol differences, but the exceedance statements themselves are unqualified.
more of objection 2
A best-of-N selected aggregate is not like-for-like with a leaderboard submission even under a shared aggregation convention, so please either remove the exceedance claims or attach the qualification inline to each such sentence, and mark Figure 3(a) with the same caveat.
6 minor objections
The paper says, at 1, title block
Pith says: minor objection 1 of 6
The title block on page 1 renders as "TRAINING-FREERECURSIVE SELF-IMPROVEMENT FORROBOTPOLICIES" with missing spaces, and several names carry spacing artifacts ("WorldScape-R2SI" versus "WorldScape-R 2SI", "V oxPoser", "V oyager"); these should be normalized.
The paper says, at 3.2, Eq. (2)
Pith says: minor objection 2 of 6
Equation (2) is typeset as an unreadable "13 P2k=0 sk"; it should be displayed as (1/3) times a summation, and the paper should state what the harness does when fewer than three Warmup episodes yield valid scores, since the gate averages only over valid scores.
show 4 more
The paper says, at 3.2-3.4
Pith says: minor objection 3 of 6
The 0.30 gate threshold, the 16-step release cap, and the five-step correction budget are design parameters with no sensitivity analysis; because the per-task route in Table 4 is itself a reported outcome of the gate, a brief statement of how the results depend on the 0.30 threshold would strengthen the presentation.
The paper says, at 4.1, Table 1
Pith says: minor objection 4 of 6
The notation "162/162" versus "301/324" in Table 1 invites the reading that Warmup was exhaustive while Refinement was merely partial; a footnote defining the semantics of the denominator (nominal slots versus reported episodes, with the selection policy stated) would prevent a misreading of the stage comparison.
The paper says, at 5, Figure 4, Appendix C
Pith says: minor objection 5 of 6
Appendix C states that the examples are "distinct interactions rather than a single continuous episode," which is in tension with captions implying temporal continuity ("The policy then resumes tilting"); please state explicitly for each panel whether it is one continuous episode or a composite, and ideally provide episode identifiers or timestamps for the depicted frames.
The paper says, at 2, Related Work
Pith says: minor objection 6 of 6
The evaluated policy, PrismWAM (Xin et al., 2026), is concurrent work with overlapping authorship; since the text already notes that transfer to other policy families is unmeasured, it should also state the authorship overlap explicitly so that readers can weigh the absence of independent validation of the underlying policy.
What would settle it
Recompute Table 1 from the archive's selection log with score-based selection disabled: take the first valid outcome per slot for both Warmup and Refinement, keep zero-score valid outcomes, apply the same Eq. 5 weighting, and report stage-level five-dimension means and success rates alongside the candidate count N per slot per stage. If the selection-free Refinement mean still exceeds selection-free Warmup by roughly 7.37 points, the concern is void; if the gap collapses or reverses, the headline numbers are properties of the selection rule rather than of experience-guided adaptation. The same log should state whether Warmup's three outcomes per task were themselves selection maxima, since stage-asymmetric selection is the specific confound.
from the skeptic's reading
How the review went
4 readings by deepseek-v4-flash · 27 Oct 2026
- Reader holds up, with conditions
- Skeptic agrees
- Editor wrote the verdict above
- Referee major revision: 2 major objections, 6 minor
Not run on this paper: the simulated authors' defence.
Pith did not check this review's objections against the paper.
The review in full
The review in brief, machine-written
My take: this is one of the more readable entries in the crowded embodied-RSI line, but the headline number does not yet measure the method. What is actually new is the explicit three-level decomposition—harness, intervention, operation—plus the linked experience record schema that ties a diagnostic trigger to the preserved behavior, the attempted method, and the applicability conditions. Equation 3's FK-preview gated release (keep up to 16 proposed steps or substitute a 1–5 step grounded correction) is a clean, implementable mechanism. I also verified the aggregation: the five dimension means average exactly to 57.10, Table 4 supports the stage split, and the appendix evidence contracts are unusually careful about what a pose measurement does and does not certify. The paper repeatedly states its own limitations, and those statements are accurate: retrospective selection, unmatched reference protocols, no code or data release, no reset-experience control.
The soft spots are real, and the main one is load-bearing. The 49.74→57.10 gain is computed from an archive that retains the highest valid score per slot, with candidate counts and source-run quality unstated. Refinement is 301/324 episodes versus Warmup's 162/162, and the asymmetry means part of the 7.37-point gap is a property of the selection rule, not of adaptation. The paper acknowledges this; what remains unknown is whether the gap survives a selection-free recomputation. The central mechanism, cross-episode experience, is never tested against a reset-experience baseline. The authors say this plainly in the abstract and in Section 6, which is to their credit, but it leaves the paper as a characterization rather than a demonstration.
The stress-test note caught one internal inconsistency worth fixing: Eq. 2 routes DIRECT only when mean Warmup score is below 0.30, yet deposit_coin has W = 46.67 and is labeled Direct in Table 4. Maybe the route labels describe the selected Refinement records rather than the Eq. 2 allocation, but the text does not say so. Minor, but a careful reviewer will trip on it.
Where I push back on the skeptics: the novelty is not damaged by the ingredient list. Experience memory, reflection, and harness revision all appear in the cited literature, but the specific coupling and the record schema are more than a repackaging. The reference comparisons are clearly labeled as unmatched protocols, so that is acknowledged, not hidden. The missing reset-experience control is a real omission, but the authors put it on the table and propose the right matched design: same routes, seeds, budgets, with persistent versus reset experience.
This deserves a serious referee. The reviewer's job is to demand a selection-free recomputation and a reset-experience comparison, not to reject the architecture. I would bring it to reading group and cite it for the framework; the empirical claims stay conditional.
The strongest objection
The central claim — that fixed-weight execution-time adaptation lifts performance from 49.74 to 57.10 and from 40.83% to 49.44% — requires that the Refinement aggregate measure the method rather than the archive's selection rule. Section 4.1 discloses that 'the archive includes score-based selection among candidate outcomes, retaining the highest valid score with deterministic tie-breaking' and that 'selected outcomes may originate from different source runs and memory histories,' but it never states the candidate count per slot, whether Warmup's three outcomes per task were likewise selection maxima, or how many candidate runs were discarded as invalid. Refinement also has six nominal slots versus three for Warmup, and Table 4 shows 23 of 324 Refinement slots absent (n = 3 or 4 in eight tasks), so per-task Refinement means are order statistics over unknown candidate pools with validity filtering on top. If each Refinement slot keeps the best of N candidates while Warmup uses single outcomes, a null system with no experience and no revision would still show a positive gap; the reported magnitudes (7.37 points, 8.61 pp) are within the plausible range of best-of-N bias for low-success tasks such as align_blocks (0→100) and push_T_random (0→83.33). The paper itself states the stage comparison 'characterizes the archived results rather than a prospectively controlled treatment effect,' so this is an acknowledged limitation; the unresolved residue is that even the qualitative content of the headline depends on the unstated N, so whether the gap survives selection removal is not knowable from the text. Two internal observations sharpen this: deposit_coin has W = 46.67, which by Eq. 2 (DIRECT iff mean Warmup score < 0.30) should route HYBRID, yet Table 4 lists it as Direct, so the described harness rule does not verifiably generate the archived routes; and for build_tower (n = 3/6, R = 100), the missing half of the slots is invisible in the aggregate.
I checked the internal aggregation: the five dimension means average exactly to the reported values (Refinement: (56.98+47.60+52.92+77.50+50.52)/5 = 57.10; Warmup: 49.74), the per-task table is consistent with the episode counts (162/162 Warmup; 301/324 = 324 minus the 23 missing slots in Table 4's n column), and the reported deltas follow (7.37 points, 8.61 pp). The architecture is coherent and the paper is unusually candid: Sections 4.1 and 6 state explicitly that the stage comparison is not a controlled treatment effect, that cross-episode experience is not isolated, that reference protocols are unmatched, and that cost analysis and real-robot transfer are unmeasured; those are acknowledged limitations, not new findings. The load-bearing residual is the archive's score-based selection: candidate counts per slot are unstated, so the headline 57.10 / 49.44% cannot be decomposed into selection effects versus the method's own adaptation, and the same ambiguity infects the Warmup-to-Refinement comparison. The deposit_coin route (W = 46.67 yet Direct, contradicting the Eq. 2 threshold of 0.30) and the 23 absent Refinement slots show that the archived routes and episode sets are not verifiably generated by the described protocol. Because the paper's own claim is a hedged characterization and the reader's CONDITIONAL verdict already encodes this condition, I do not change the verdict: the concern is real, decisive to test, and presently unanswered, which is exactly what CONDITIONAL expresses. Independent support to credit: the per-task table and the arithmetic are internally consistent, the limitations are stated in the text, and the proposed prospective design (persistent versus reset experience under matched routes, seeds, and budgets) is the correct and sufficient experiment.
The referee's report
Taken at face value, the framework is well specified: the three-level decomposition is cogent, the equations are explicit, Appendix A gives concrete runtime contracts, and Table 3's evidence-contract distinction (policy proposal versus measured pose versus RGB-D observation versus native outcome) is a genuinely useful evaluation-hygiene contribution for agentic robotics. The empirical arithmetic is internally consistent: the five dimension means average to 57.10 exactly, and the per-task deltas in Table 4 match the summary counts of 24 improved, 20 declined, and 10 unchanged, as well as the cited example gains and regressions. The paper is unusually candid about limitations, explicitly stating that retrospective selection and differing source histories preclude causal attribution (Sections 4.1, 4.3, 6). The stress-test concern about best-of-N selection does land: because candidate counts are never reported, the Refinement aggregates are not yet interpretable as describing RoboDoctor's adaptive behavior rather than the archive's selection rule.
Pith's reading of the paper (a machine's summary, not the authors')
RoboDoctor tries to establish that a robot's execution itself is a place where capability can improve: without updating a single weight, a frozen generalist policy and a frozen language-model agent can get better at manipulation tasks by reallocating who controls the motion, deciding when to correct a proposed action rather than accept it, revising the physical method (a grasp, an alignment), and storing what happened so later episodes can reuse it. If that is right, task competence is not only a matter of training data and model scale; it can also be grown at deployment time through control organization and externally stored experience. The paper reports that, on 54 RoboDojo-Sim task entries, the Refinement stage scores 57.10 (49.44% native success) versus 49.74 (40.83%) in Warmup, above the top published entries on the archived leaderboard. The authors are explicit, in Sections 4.1 and 6, that these numbers characterize outcome-selected, retrospectively curated runs with unmatched protocols, and that controlled trials are still needed to isolate the contribution of cross-episode experience.
What carries the argument. The load-bearing machinery is a three-level revision loop, none of which is trained. Harness RSI decides control allocation with the warmup gate $c_k = \text{DIRECT}$ when $\bar{s}_W < 0.30$, else HYBRID. Intervention RSI separates proposal from execution: the policy's chunk is previewed by robot-only forward kinematics before anything moves, and the Doctor chooses either a release $A_t[1:m]$ with $1 \le m \le 16$, or a correction $u_t$ with budget $1 \le b(u_t) \le 5$, discarding the unused suffix and re-proposing from the new observation. Operation RSI turns a decision into a grounded method: surfaces are located from pixels and depth, approach, contact region, wrist orientation, gripper timing, and arm roles are specified, and the observed effect (such as grasp retention under a test lift) verifies or revises the method. The experience document ties the levels together: an update rule $M_{t+1}$ appends a validated record or replaces one by identifier, and reuse checks applicability conditions and recomputes targets from fresh geometry before acting. The design's wager is that separating what the policy proposes from what the robot actually does lets a frozen agent correct local mismatches while preserving behavior that already works.
Core claim. RoboDoctor's central claim is that execution is itself a locus of adaptation: with both the policy and the agent frozen, a robot can still improve by changing three coupled things — who directs the motion, whether a proposed action is kept or corrected, and how a physical operation is performed and verified — with an external experience document carrying the lessons forward. Concretely, the system runs three HYBRID warmup episodes and then fixes a controller: if the mean native score $\bar{s}_W$ is below 0.30 it routes to DIRECT, where the agent plans and acts through grounded tools; otherwise it stays in HYBRID, where the PrismWAM policy proposes 32-step action chunks and the Doctor reviews a robot-only forward-kinematics preview before releasing up to $m \le 16$ unchanged steps or substituting a grounded correction of at most five physical steps. Every executed frame returns to the policy history, so later proposals respond to the achieved state rather than to the original plan. Experience entries link the diagnostic reason, the preserved policy behavior, the attempted method, the observed effect, and the conditions for reuse, and reuse requires re-grounding in the current scene rather than copying raw offsets. The authors report Refinement at 57.10 (five-dimension mean) and 49.44% native success, against 49.74 and 40.83% at Warmup, above the archived published references, with the largest gains in Generalization and Open instruction following and a drop in Long-Horizon. They state that the stage comparison summarizes score-selected outcomes that may come from different source runs and does not establish a causal contribution of cross-episode experience.
The premise it rests on. The load-bearing premise is that the curated archive is informative: candidate outcomes were kept by score-based selection with candidate counts unstated and episodes possibly drawn from different source runs and memory histories, so the 7.37-point gain and the 49.44% success rate support experience-guided adaptation only if that selection and run heterogeneity did not produce them.
If the paper is right (Pith's inferences, not the authors')
If the claim holds, capability can be added at deployment time: Refinement's 57.10 beats the top published leaderboard entry (53.18) under the paper's five-dimension aggregation, with no weight update on either model.
Intervention is intentionally partial: in HYBRID, up to 16 policy steps can pass per proposal and corrections are capped at five physical steps, so adaptation assists the policy instead of replacing it.
Experience is reusable only under its stated conditions: each lesson records its diagnostic trigger, preserved behavior, method, outcome, and applicability, and must be re-grounded, so a corrected alignment offset from one scene is not transplanted verbatim into another.
The gains are uneven: 24 of 54 tasks improve, 20 decline, and Long-Horizon falls from 54.58 to 52.92, indicating that execution-time adaptation trades off against tasks requiring long, consistent planning.
Editorial inference: the warmup gate (three episodes, threshold 0.30) is a coarse fixed router, so a natural extension is to test whether the threshold is near-optimal or whether an adaptive router that re-evaluates control allocation mid-run beats both fixed choices.
Editorial inference: the propose–preview–release-or-correct–verify–store loop is not tied to the PrismWAM policy, so the sharpest transfer test is wrapping a different frozen policy family and checking whether gains of similar size reappear; the paper reports such transfer as unmeasured.
Editorial inference: because the archive keeps the highest-scoring valid outcome among candidates, the reported numbers are an upper bound on what the system can do; a matched trial with one fixed route per task and persistent versus reset experience would give the lower bound that separates adaptation from run selection.
Check this review
Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.
How often reviews like this one are right
Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.
How often objections from reviews like this one are right: not yet measured
Reviews by people
This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.
The paper
Abstract
Generalist robot policies and language-model agents provide complementary capabilities, but completing a task also requires adapting their use to the consequences of physical interaction. We study execution as a locus of adaptation: feedback guides the current action and supplies evidence for revising subsequent decisions under fixed model weights. We introduce RoboDoctor, a training-free framework that connects diagnosis, grounded action, and persistent experience across three revision targets. The harness allocates control between policy and agent; intervention determines when to assist while preserving useful policy behavior; and operation refines physical methods through observed effects. Linked experience records retain the reason for a decision, the attempted method, its outcome, and conditions for reuse. On a curated archive of 54 RoboDojo-Sim task entries, RoboDoctor achieves a five-dimension mean score of 57.10, with a native success rate of 49.44%. Recorded interactions illustrate strategy changes, selective correction, and grasp revision. These findings characterize execution-time adaptation in the evaluated system; controlled trials remain necessary to isolate the contribution of cross-episode experience.
The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.
abstract compiled · 2026-10-27
The authors' main claim, as the classifier picked it out 0.93
“These findings characterize execution-time adaptation in the evaluated system; controlled trials remain necessary to isolate the contribution of cross-episode experience.”
How the main claim is stated: asserted 0.87
What the abstract itself states, as probabilities: claims first 0.05 · states limitation 0.96 · human participants 0.05 · controlled comparison 0.11 · randomized assignment 0.02 · states quantitative result 0.99 · compares with prior results 0.12 · mentions code or data availability 0.05
The abstract, sentence by sentence
This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.
| Sentence | Role | The authors' own work | States the main conclusion | Strength |
|---|---|---|---|---|
| Generalist robot policies and language-model agents provide complementary capabilities, but completing a task also requires adapting their use to the consequences of physical interaction. | background 0.92 | 0.06 | 0.05 | asserted 1.00 |
| We study execution as a locus of adaptation: feedback guides the current action and supplies evidence for revising subsequent decisions under fixed model weights. | contribution 0.48 | 0.35 | 0.10 | asserted 0.99 |
| We introduce RoboDoctor, a training-free framework that connects diagnosis, grounded action, and persistent experience across three revision targets. | contribution 0.98 | 0.88 | 0.12 | asserted 1.00 |
| The harness allocates control between policy and agent; intervention determines when to assist while preserving useful policy behavior; and operation refines physical methods through observed effects. | method 0.98 | 0.73 | 0.08 | asserted 0.99 |
| Linked experience records retain the reason for a decision, the attempted method, its outcome, and conditions for reuse. | method 0.98 | 0.81 | 0.05 | asserted 1.00 |
| On a curated archive of 54 RoboDojo-Sim task entries, RoboDoctor achieves a five-dimension mean score of 57.10, with a native success rate of 49.44%. | result 1.00 | 0.96 | 0.15 | asserted 1.00 |
| Recorded interactions illustrate strategy changes, selective correction, and grasp revision. | result 0.89 | 0.87 | 0.06 | asserted 1.00 |
| These findings characterize execution-time adaptation in the evaluated system; controlled trials remain necessary to isolate the contribution of cross-episode experience. | limitation 0.91 | 0.77 | 0.33 | asserted 0.87 |
What kind of paper the classifier reports this is: method or tool 1.00 · evidence from observation or experiment 0.53
What was examined, and what was not
Sources read
- arXiv listing abstract v1
Not examined
- full text
- figures and tables
- references and citing sentences
- relations to other papers
Levels run
- P abstract
Not run
- S sections
- T body sentences
- C citations
- R cross-paper relations
How the labels were made
Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-10-27: 1 request, 6,198 input tokens.
Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON
Figures (4)
Figures are the authors', reproduced from the paper.
References (30)
- [1] Su, Jiayi and Zheng, Yixin and Yan, Mi and Yi, Li and Zhang, Zhizheng and Wang, He , year = on Pith
- [2] Shinn, Noah and Cassano, Federico and Berman, Edward and Gopinath, Ashwin and Narasimhan, Karthik and Yao, Shunyu , year = on Pith
- [3] Liang, Jacky and Huang, Wenlong and Xia, Fei and Xu, Peng and Hausman, Karol and Ichter, Brian and Florence, Pete and Zeng, Andy , year = on Pith
- [4] Ahn, Michael and Brohan, Anthony and Brown, Noah and others , year = on Pith
- [5] Huang, Wenlong and Wang, Chen and Zhang, Ruohan and Li, Yunzhu and Wu, Jiajun and Fei-Fei, Li , year = on Pith
- [6] Yao, Shunyu and Zhao, Jeffrey and Yu, Dian and Du, Nan and Shafran, Izhak and Narasimhan, Karthik and Cao, Yuan , year = on Pith
- [7] Wang, Guanzhi and Xie, Yuqi and Jiang, Yunfan and Mandlekar, Ajay and Xiao, Chaowei and Zhu, Yuke and Fan, Linxi and Anandkumar, Anima , year = on Pith
- [8] Chi, Cheng and Xu, Zhenjia and Feng, Siyuan and Cousineau, Eric and Du, Yilun and Burchfiel, Benjamin and Tedrake, Russ and Song, Shuran , year = on Pith
- [9] Kim, Moo Jin and Pertsch, Karl and Karamcheti, Siddharth and others , year = on Pith
- [10] Chen, Tianxing and Chen, Yue and Li, Zixuan and others , year = on Pith
- [11] Liu, Fangcheng and Shen, Yeqing and Cheng, Anda and others , year = on Pith
- [12] Song, Python and Liang, Zhixuan and Fu, Kelsey and Wang, Mengdi and Yang, Junfeng and Liu, Shilong , year = on Pith
- [13] Xin, Tianyu and Zhong, Wanqi and Hu, Bowen and Guo, Zhangchi and Wang, Lijie and Wang, Yiming and Liao, Haoran and Yu, Heyang and Tian, Xiaoyu and Yu, Zhiding and Li, Yiming , year =. 2610.26564 , archivePrefix = on PithPith's reviewarXiv
- [14] Hongcheng Gao and Alex Zhou and Jay Zhu and Zelin Zheng and Shijia Ge and Xiping Li and Di Wu and Yazhe Wang and Jianshu Zeng and Xuan Shangguan and Yongli Wang and Yexing Wan and Lingyu He and Zhiqi Jia and Sihang Wu and Xiao He , year=. 2610.23479 , archivePrefix= on PithPith's reviewarXiv
- [15] Dongzhou Cheng and Taoran Yi and Ye Fang and Xingwu Zhang and Fan Feng and Yixuan Li and Gengxiong Zhuang and Rongze Wang and Shuai Yang and Wei Song and Weizhi Xue and Minyan Wu and Jie Gui and Jiaqi Wang and Tong Wu , year=. In-Context Robot Learning with. 2609.19138 , archi... on PithPith's reviewarXiv
- [16] 2026 , institution = on Pith
- [17] 2026 , howpublished = on Pith
- [18] Video Prediction Policy 2: Predict Better, Act Better , author =. 2026 , eprint = on Pith
- [19] Huang, Wenlong and Xia, Fei and Xiao, Ted and Chan, Harris and Liang, Jacky and Florence, Pete and Zeng, Andy and Tompson, Jonathan and Mordatch, Igor and Chebotar, Yevgen and Sermanet, Pierre and Brown, Noah and Jackson, Tomas and Luu, Linda and Levine, Sergey and Hausman, Ka... on Pith
- [20] Liu, Zeyi and Bahety, Arpit and Song, Shuran , booktitle =. 2023 , publisher = on Pith
show 10 more
- [21] Guo, Yanjiang and Wang, Yen-Jen and Zha, Lihan and Chen, Jianyu , booktitle =. 2024 , url = on Pith
- [22] Ghosh, Dibya and Walke, Homer Rich and Pertsch, Karl and Black, Kevin and Mees, Oier and Dasari, Sudeep and Hejna, Joey and Kreiman, Tobias and Xu, Charles and Luo, Jianlan and Tan, You Liang and Chen, Lawrence Yunliang and Vuong, Quan and Xiao, Ted and Sanketi, Pannag R and S... on Pith
- [23] Black, Kevin and Brown, Noah and Driess, Danny and Esmail, Adnan and Equi, Michael Robert and Finn, Chelsea and Fusai, Niccolo and Groom, Lachy and Hausman, Karol and Ichter, Brian and Jakubczak, Szymon and Jones, Tim and Ke, Liyiming and Levine, Sergey and Li-Bell, Adrian and... on Pith
- [24] Li, Wenyi and Chi, Yizhe and Zheng, Youjie and Liu, Chunyu and Wang, Xiaoqiu and Gao, Mingju and Jiang, Zheng and Hong, Deyao and Xiao, Calvin and Yang, Kaisen and Na, Qinhuai , year = on Pith
- [25] Hu, Kairui and Hu, Siyuan and Hong, Fangzhou and Chen, Zhaoxi and Liu, Ziwei , year = on Pith
- [26] Wang, Kailin and Jie, Haoxiang and Yan, Yaoyuan and Heng, Zhiyou and Li, Zhaosong , year = on Pith
- [27] Lang, Haoran and Lu, Haotao and Sang, Shiyu and Luo, Haoyang and Chen, Guo and Li, Qun and Yu, Jingyi and Shi, Ye and Wang, Jingya , year = on Pith
- [28] Ye, Seonghyeon and Ge, Yunhao and Zheng, Kaiyuan and Gao, Shenyuan and Yu, Sihyun and Kurian, George and Indupuru, Suneel and Tan,. 2026 , howpublished = on Pith
- [29] Black, Kevin and Brown, Noah and Darpinian, James and Dhabalia, Karan and Driess, Danny and Esmail, Adnan and Equi, Michael Robert and Finn, Chelsea and Fusai, Niccolo and Galliker, Manuel Y. and Ghosh, Dibya and Groom, Lachy and Hausman, Karol and Ichter, Brian and Jakubczak,... on Pith
- [30] Feng, Yunhai and Han, Jiaming and Yang, Zhuoran and Yue, Xiangyu and Levine, Sergey and Luo, Jianlan , booktitle =. 2025 , publisher = on Pith
Cited by 1 Pith paper
Reviewed papers on Pith that cite this one. The full citation record
- Flex-RSI: Benchmarking Recursive Self-Improvement of Frontier Agents cs.AI · Nov 2026
Challenges and discussion
Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.
Come back by email
A short list of the week's newly reviewed papers. Nothing is sent until you confirm from your inbox, and every email has a link that stops it. No account.
No comments yet.
Sign in to comment