Follow-up: does offline RL estimator selection need singular value bounds?
nanjiang_cs · x · 2026-10-29
Nan Jiang follows up on the offline RL model selection paper, asking whether there are new theoretical insights—e.g., whether a lower bound on singular values of the LSTD matrix is still required, and noting this condition might be improvable. A deeper technical exchange on the method's theoretical foundations.
Related event: PBV Method for Offline RL Model Selection Draws Peer Scrutiny(3 posts)→
More from Research
- New paper challenges JEPA feature-selection theory: unpredictable features can be kept — andreea7b · 2026-10-29
- SREGym to debut at Bench Summit, targeting AI SRE evaluation frontier — tianyin_xu · 2026-10-29
- AA-Robotics benchmark: GPT-6 Astra tops robot-arm control, still ~100x slower than humans — ArtificialAnlys · 2026-10-29
- Delta-Matching closes the FP8 attention gap: all 7 core matmuls in FP8, loss matches BF16 — songhan_mit · 2026-10-29
- RFD4-Proteina lands on Hugging Face as HF publishes its October AI for Science roundup — AllThingsApx · 2026-10-29
- Google's PLE: 85 real engineering tasks, best agent config scores only 50.6% — rohanpaul_ai · 2026-10-29