:: Library Catalog

Saved in:

Bibliographic Details
Main Authors:	Orseau, Laurent, Hutter, Marcus, Lelis, Levi H. S.
Format:	Preprint
Published:	2024
Subjects:	Artificial Intelligence
Online Access:	https://arxiv.org/abs/2412.05196
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Structure-Induced Information for Rerooting Levin Tree Search
by: Tuero, Jake, et al.
Published: (2026)

Levin Tree Search with Context Models
by: Orseau, Laurent, et al.
Published: (2023)

Isotuning With Applications To Scale-Free Online Learning
by: Orseau, Laurent, et al.
Published: (2021)

Super-Exponential Regret for UCT, AlphaGo and Variants
by: Orseau, Laurent, et al.
Published: (2024)

Subgoal-Guided Policy Heuristic Search with Learned Subgoals
by: Tuero, Jake, et al.
Published: (2025)

Searching for Programmatic Policies in Semantic Spaces
by: Moraes, Rubens O., et al.
Published: (2024)

Understanding Prompt Tuning and In-Context Learning via Meta-Learning
by: Genewein, Tim, et al.
Published: (2025)

Unveiling Options with Neural Decomposition
by: Alikhasi, Mahdi, et al.
Published: (2024)

Reclaiming the Source of Programmatic Policies: Programmatic versus Latent Spaces
by: Carvalho, Tales H., et al.
Published: (2024)

Assessing the Interpretability of Programmatic Policies with Large Language Models
by: Bashir, Zahra, et al.
Published: (2023)

Learning Universal Predictors
by: Grau-Moya, Jordi, et al.
Published: (2024)

Gradient-Based Program Synthesis with Neurally Interpreted Languages
by: Macfarlane, Matthew V., et al.
Published: (2026)

Formalizing Embeddedness Failures in Universal Artificial Intelligence
by: Wyeth, Cole, et al.
Published: (2025)

Value Under Ignorance in Universal Artificial Intelligence
by: Wyeth, Cole, et al.
Published: (2025)

Language Modeling Is Compression
by: Delétang, Grégoire, et al.
Published: (2023)

Affordances Enable Partial World Modeling with LLMs
by: Khetarpal, Khimya, et al.
Published: (2026)

Using Sequential Runtime Distributions for the Parallel Speedup Prediction of SAT Local Search
by: Arbelaez, Alejandro, et al.
Published: (2024)

Partition Tree Weighting for Non-Stationary Stochastic Bandits
by: Veness, Joel, et al.
Published: (2025)

Efficient Search for Customized Activation Functions with Gradient Descent
by: Strack, Lukas, et al.
Published: (2024)

Fast Monte Carlo Tree Diffusion: 100x Speedup via Parallel Sparse Planning
by: Yoon, Jaesik, et al.
Published: (2025)

Speedup Techniques for Switchable Temporal Plan Graph Optimization
by: Jiang, He, et al.
Published: (2024)

Minibatch and Local SGD: Algorithmic Stability and Linear Speedup in Generalization
by: Lei, Yunwen, et al.
Published: (2023)

Beyond Speedup -- Utilizing KV Cache for Sampling and Reasoning
by: Xing, Zeyu, et al.
Published: (2026)

Weight-Entanglement Meets Gradient-Based Neural Architecture Search
by: Sukthanker, Rhea Sanjay, et al.
Published: (2023)

Reverse Supervision at Scale: Exponential Search Meets the Economics of Annotation
by: Makrehchi, Masoud
Published: (2025)

Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search
by: Mehrabian, Abbas, et al.
Published: (2023)

c-TPE: Tree-structured Parzen Estimator with Inequality Constraints for Expensive Hyperparameter Optimization
by: Watanabe, Shuhei, et al.
Published: (2022)

ESPADA: Execution Speedup via Semantics Aware Demonstration Data Downsampling for Imitation Learning
by: Kim, Byung-ju, et al.
Published: (2025)

A Shapley Value Estimation Speedup for Efficient Explainable Quantum AI
by: Burge, Iain, et al.
Published: (2024)

Photon: Speedup Volume Understanding with Efficient Multimodal Large Language Models
by: Fang, Chengyu, et al.
Published: (2026)

DualFast: Dual-Speedup Framework for Fast Sampling of Diffusion Models
by: Yu, Hu, et al.
Published: (2025)

Improving LLM-based Global Optimization with Search Space Partitioning
by: Schwanke, Andrej, et al.
Published: (2025)

Up to 36x Speedup: Mask-based Parallel Inference Paradigm for Key Information Extraction in MLLMs
by: Wang, Xinzhong, et al.
Published: (2026)

Quantum Speedups in Regret Analysis of Infinite Horizon Average-Reward Markov Decision Processes
by: Ganguly, Bhargav, et al.
Published: (2023)

Towards Unsupervised Adversarial Document Detection in Retrieval Augmented Generation Systems
by: Levi, Patrick
Published: (2026)

Adaptive Evidence Weighting for Audio-Spatiotemporal Fusion
by: Ovanger, Oscar, et al.
Published: (2026)

AgentStepper: Interactive Debugging of Software Development Agents
by: Hutter, Robert, et al.
Published: (2026)

Toward Super-polynomial Quantum Speedup of Equivariant Quantum Algorithms with SU($d$) Symmetry
by: Zheng, Han, et al.
Published: (2022)

Speeding Up Multi-Objective Hyperparameter Optimization by Task Similarity-Based Meta-Learning for the Tree-Structured Parzen Estimator
by: Watanabe, Shuhei, et al.
Published: (2022)

Generalized Proof-Number Monte-Carlo Tree Search
by: Kowalski, Jakub, et al.
Published: (2025)