arXiv:2510. 03745v2 Announce Type: replace Abstract: Low-discrepancy points are designed to efficiently fill the space in a uniform manner.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.
CF‑VLA introduces a two‑stage coarse‑to‑fine approach for vision‑language‑action policies, replacing multi‑step sampling with a coarse initialization that constructs an action‑aware starting point and a single‑step refinement that corrects residual errors. The coarse stage learns a conditional posterior over endpoint velocity to transform Gaussian noise into a structured initialization, while the fine stage performs a fixed‑time refinement. Experiments on CALVIN and LIBERO demonstrate that CF‑VLA achieves a strong efficiency‑performance trade‑off, reducing action sampling latency by 75.4 % and achieving an 83.0 % real‑robot success rate, outperforming existing NFE=2 methods and matching or surpassing NFE=10 baselines.
CoDA is a framework that lets a simulation data engine and an action policy evolve together using a shared memory of environment construction, policy failures, and learning progress. The memory stores validated diagnoses from a vision‑language critic, which are turned into generation programs that recreate challenging scenarios and training programs that help the policy improve. Using this approach, CoDA boosts out‑of‑distribution success on several manipulation tasks, raising success rates from 5.3 % to 27.6 % and achieving up to 84 % success on LIBERO‑Pro under perturbations.
arXiv:2606. 22776v2 Announce Type: replace-cross Abstract: Non-autoregressive neural solvers amortize computation across traveling salesman problem (TSP) instances, but models trained on random Euclidean instances can degrade when the number or spatial distribution of nodes changes.
arXiv:2510. 22021v3 Announce Type: replace Abstract: Safety-critical applications of machine learning require uncertainty estimates that support reliable worst-case analysis.
arXiv:2606. 04860v1 Announce Type: cross Abstract: Finding optimal solution paths for combinatorial puzzles like the Rubik's Cube, sliding tile puzzles, and Lights Out remains a classical challenge in artificial intelligence.
arXiv:2606. 18844v1 Announce Type: new Abstract: Self-distillation improves reasoning in large language models by using the model's own rollouts as training signal, typically through implicit logit-level alignment that minimizes KL divergence toward a privileged target distribution.