An RL-guided MCTS proof search for Tamarin finds more and shorter proofs than standard search across 16 protocol models.
Nature , year=
22 Pith papers cite this work. Polarity classification is still indexing.
22
Pith papers citing it
citation-role summary
background 2
method 1
citation-polarity summary
representative citing papers
RAT reformulates regularized natural policy gradients as vanilla gradients with a transformed advantage, computed efficiently via randomized block Kaczmarz iterations on on-policy data.
TESSERA combines LLMs as local policy and evaluator with MCTS on knowledge graphs to compose mechanistic drug-disease explanations.
Bandit algorithms can be adapted to Tree MDPs by treating policies as arms with shared-data confidence bounds, achieving polynomial memory and instance-dependent bounds on sample complexity and regret that depend on terminal-state gaps rather than all policies.
AMBer applies reinforcement learning with physics feedback to automate construction of neutrino flavor models that minimize free parameters, validated on known cases and extended to a new symmetry group.
Introduces parametric open-source games as continuous analogues of program equilibria, proves equilibrium existence, and derives an exact coupling threshold for cooperation in symmetric 2x2 games under gradient ascent.
Improved upper bound α_3 ≤ 0.2953 for Witsenhausen's problem in dimension 3 via harmonic analysis, geometric fractional chromatic number, and a computer-searched 33-point set.
ARC-RL is a new suite of four MuJoCo continuous-control environments featuring game-inspired hexapod and quadruped morphologies, a single closed-form multi-component reward function, CPG demonstrators, and empirical comparisons of online and offline-to-online RL algorithms.
SimpleTES scales test-time evaluation in LLMs to discover state-of-the-art solutions on 21 scientific problems across six domains, outperforming frontier models and optimization pipelines with examples like 2x faster LASSO and new Erdos constructions.
Vocabulary dropout prevents diversity collapse in LLM co-evolution by masking proposer logits, yielding average +4.4 point solver gains on mathematical reasoning benchmarks at 8B scale.
Language models show good calibration when asked to estimate the probability that their own answers are correct, with performance improving as models get larger.
Ranked preference modeling outperforms imitation learning for language model alignment and scales more favorably with model size.
Effective data transferred from pre-training to fine-tuning is described by a power law in model parameter count and fine-tuning dataset size, acting like a multiplier on the fine-tuning data.
The FIL Hypothesis claims that inductive biases outperform purely data-driven methods on GPU programming tasks with non-trivial feedback loops.
Introduces consensus objective aggregation for meta-optimization of scientific discovery and reports improved scaling and speedup for 3-SAT algorithm discovery using digital MemComputing machines.
DuDi is a dual-signal distillation method with cross-lingual verbalizer that improves multilingual SLM performance on SEA languages and outperforms baselines on SEA-HELM.
Introduces the VET framework to categorize and critique polarized AI narratives including hype, doom, denial, and normalcy.
GIFT fine-tunes deep RL policies with a stability-focused reward to improve global stability while preserving task performance.
A two-stage OMR pipeline decodes symbol candidates into polyphonic score structures via topology recognition with probability-guided search.
A survey of 87 agents for computer use and 33 datasets that introduces a three-dimensional taxonomy across domain, interaction, and agent perspectives and identifies six research gaps.
The chapter synthesizes the history of adaptive learning systems and examines how AI can provide instructional intelligence and real-time adaptivity in serious games while highlighting challenges such as explainability and limited long-term outcome data.
Advocates developing high-quality open-source scheduling software and linking observation planning with data analysis for future astronomical surveys.
citing papers explorer
-
Improved bounds for the double cap conjecture
Improved upper bound α_3 ≤ 0.2953 for Witsenhausen's problem in dimension 3 via harmonic analysis, geometric fractional chromatic number, and a computer-searched 33-point set.