Inference-Time Control and Structured Constraints: ML Gains Are Moving Out of the Base Model
Across these eight papers, progress increasingly comes from wrapping frozen or fixed models with lightweight controllers, structured constraints, and causal or robustness layers rather than from scaling base models. The pattern rewards efficiency and verifiable guarantees, but most results are benchmark-bound and evaluated under narrow budgets.
Analiză aiqbench· Compus de AI din articolele-sursă enumerate mai jos. Nu se adaugă cunoștințe generale; afirmațiile sunt doar atât de bune cât sunt acele articole.
Surse folosite
8 surse · 1 publicațieDistribuie această analiză
Inference-Time Control and Structured Constraints: ML Gains Are Moving Out of the Base Model
Across these eight papers, progress increasingly comes from wrapping frozen or fixed models with lightweight controllers, structured constraints, and causal or robustness layers rather than from scaling base models. The pattern rewards efficiency and verifiable guarantees, but most results are benchmark-bound and evaluated under narrow budgets.
A clear pattern runs through this batch: the most interesting gains are coming from what sits around a model rather than from the model itself. The TIPS paper is the clearest example. It trains a roughly 600K-parameter controller to decide which tokens a masked diffusion language model reveals and re-masks at decode time, while the base model stays frozen. The headline numbers on GSM8K and MATH-500 are reported at a fixed budget of 32 decoder evaluations, which is a telling detail: the value proposition is spending compute more intelligently at inference, not training a bigger network. RoleQ follows a similar logic on the compression side. It is a post-training method that converts existing language models to about 1.59 bits per weight by assigning quantization scales according to functional role rather than matrix layout. Both papers treat the trained artifact as fixed and optimize the procedure that uses it.
A second thread concerns structure and guarantees imposed on learning. The distributionally robust regularization paper extends DRO, previously confined to convex models, to mixed-integer sparse programs, and ties its statistical guarantees to the sparsity parameter. Its practical payoff is avoiding expensive cross-validation for choosing sparsity. Causal Integrated Gradients similarly adds structure, routing feature attribution along a known causal graph so that direct effects can be separated from effects passed through descendants, while claiming to retain gradient-method efficiency. STAMP addresses distribution shift in chronologically split graphs by balancing neighborhood aggregation across timestamps, and it advertises a checkable property that practitioners can verify. In each case, the authors are trying to make a learned system's behavior legible and bounded instead of merely accurate on average.
The robotics and embodied papers show the same tension between capability and reliability. DemoStream batches GPU-accelerated task and motion planning to generate behavior-cloning data at 66 demonstrations per hour on real hardware. Whole-Body Dexterity uses reinforcement learning and policy distillation so a humanoid can use arms and torso as contact surfaces, reporting 90% task completion against 18% for direct retargeting and 4% for a generalist whole-body controller. X-Fly identifies a precise failure mode: executing whole action chunks cuts aerial navigation inference cost from 195 to 42 ms per waypoint, but the resulting states fall outside expert demonstration coverage, and agents then fail to stop. That result is a useful reminder that efficiency optimizations create new distribution gaps, and that the fix is often data and training design rather than raw model strength.
Why this matters now is that the cheap levers for capability, such as simply scaling pretraining, are less reliable for deployment-critical properties like cost, calibration, stopping behavior, and robustness to shift. Practitioners need methods that can be attached to existing models and audited. The opportunities are substantial: controllers that transfer across base models, guarantees that avoid tuning loops, and attribution methods that respect domain knowledge.
The tensions are equally visible. Many results are reported on established benchmarks under fixed budgets, and the comparisons depend heavily on those settings. Causal and robustness claims often hold only under assumed graphs or sparsity regimes that real data may not satisfy. Real-hardware robotics numbers are encouraging but narrow in task scope. Efficiency gains, such as chunked execution, can silently introduce failure modes that headline metrics miss.
Signals to watch include whether inference-time controllers hold up when the base model or compute budget changes, whether robustness guarantees survive misspecified structure, whether attribution methods are validated against ground truth, and whether embodied results generalize beyond curated tasks.
Surse
Articole folosite pentru a genera această analiză
- Machine Learning
TIPS: A Tiny Inference-time Policy for Scaling in Diffusion Language Models
arXiv - Machine Learning
Distributionally Robust Regularization of Sparse Integer Programming Trained Learning Models
arXiv - Machine Learning
Causal Integrated Gradients: Scalable Feature Attribution Along Causal Paths
arXiv - Machine Learning
DemoStream: Batched Task-and-Motion-Plan Optimization for Automated Learning from Demonstration
arXiv - Machine Learning
Whole-Body Dexterity
arXiv - Machine Learning
RoleQ: Role-Aligned Scales for Converting Language Models to Ternary
arXiv - Machine Learning
STAMP: Symmetric Temporal Averaging Message Passing for Domain Adaptation in Chronologically Split Graphs
arXiv - Machine Learning
X-Fly: Learning to Reach and Stop in Full-Chunk Aerial Vision-Language Navigation
arXiv