Value-filtered decoding selectively steers LLM generation using a value-based safety criterion with explicit false-intervention bounds, improving safety-utility trade-offs over baselines.
STRABLE introduces 108 real-world string-and-number tables and benchmarks 445 pipelines, finding simple embeddings with advanced learners suffice for categorical tables while LLMs help on free-text tables.
MulTaBench benchmarks 40 multimodal tabular datasets and shows target-aware tuning of text and image embeddings improves predictive performance over frozen embeddings.
Deriving reduced ODEs for low-rank RNN learning reveals loss-invisible overlaps that encode training history and expose hidden connectivity differences.
Controllable user simulation is formalized as causal inference, proving supervised fine-tuning injects look-ahead bias causing geometric variance explosion and controllability collapse, with proposed mitigations restoring consistency and robust generalization.
Applying CVaR to the immediate belief cost targets per-step state uncertainty while preserving standard MDP structure, enabling any expectation-based planner to become risk-sensitive with unchanged algorithms and end-to-end finite-time guarantees.
Graph Sparse Sampling shares sampled futures across actions to avoid exponential horizon dependence in continuous MDP planning, with polynomial sample bounds and strong long-horizon control performance.
SP-CACW minimizes an upper bound on a target client's convergence error via convergence-aware weighting that trades peer bias against variance and excludes harmful peers.
DEMASK predicts token dependencies in discrete diffusion language models to select weakly dependent masked positions for parallel unmasking, bounding sampling error and accelerating Dream-7B by 1.7, 2.2× with preserved accuracy.