:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Moore, James
Format:	Preprint
Published:	2025
Subjects:	Artificial Intelligence
Online Access:	https://arxiv.org/abs/2511.12759
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Autocovariance and Optimal Design for Random Walk Metropolis-Hastings Algorithm
by: Zhang, Jingyi, et al.
Published: (2025)

Learning to Control Dynamical Agents via Spiking Neural Networks and Metropolis-Hastings Sampling
by: Safa, Ali, et al.
Published: (2025)

Co-Creative Learning via Metropolis-Hastings Interaction between Humans and AI
by: Okumura, Ryota, et al.
Published: (2025)

Emerging Human-like Strategies for Semantic Memory Foraging in Large Language Models
by: Lacosse, Eric, et al.
Published: (2026)

Metropolis-Hastings Captioning Game: Knowledge Fusion of Vision Language Models via Decentralized Bayesian Inference
by: Matsui, Yuta, et al.
Published: (2025)

Optimizing Blockchain Analysis: Tackling Temporality and Scalability with an Incremental Approach with Metropolis-Hastings Random Walks
by: Luo, Junliang, et al.
Published: (2025)

Unconstrained Metropolis–Hastings Sampling of Covariance Matrices
by: Daniel Turek
Published: (2025)

Uniform Memory Retrieval with Larger Capacity for Modern Hopfield Models
by: Wu, Dennis, et al.
Published: (2024)

Meta-Memory: Retrieving and Integrating Semantic-Spatial Memories for Robot Spatial Reasoning
by: Mao, Yufan, et al.
Published: (2025)

Random Walk in Random Permutation Set Theory
by: Zhou, Jiefeng, et al.
Published: (2024)

Metropolis-Hastings Sampling for 3D Gaussian Reconstruction
by: Kim, Hyunjin, et al.
Published: (2025)

Efficient Algorithms for Computing Random Walk Centrality
by: Liu, Changan, et al.
Published: (2025)

Quantum Metropolis-Hastings algorithm
by: Moussa, Jonathan E.
Published: (2025)

Metropolis--Hastings with Scalable Subsampling
by: Prado, Estevão, et al.
Published: (2024)

World Models Unlock Optimal Foraging Strategies in Reinforcement Learning Agents
by: Fonseca, Yesid, et al.
Published: (2025)

Revisiting Random Walks for Learning on Graphs
by: Kim, Jinwoo, et al.
Published: (2024)

Memanto: Typed Semantic Memory with Information-Theoretic Retrieval for Long-Horizon Agents
by: Abtahi, Seyed Moein, et al.
Published: (2026)

Beyond Fact Retrieval: Episodic Memory for RAG with Generative Semantic Workspaces
by: Rajesh, Shreyas, et al.
Published: (2025)

QUEST: Quality-Aware Metropolis-Hastings Sampling for Machine Translation
by: Faria, Gonçalo R. A., et al.
Published: (2024)

Quantum Metropolis-Hastings via Penalised Qubitized Walks: Spectral Filtering and Circuit Implementation
by: Carrasco-Arango, Miguel, et al.
Published: (2026)

Modernizing Facebook Scoped Search: Keyword and Embedding Hybrid Retrieval with LLM Evaluation
by: Su, Yongye, et al.
Published: (2025)

Quantum Circuits for the Metropolis-Hastings Algorithm
by: Claudon, Baptiste, et al.
Published: (2025)

Multi-Marginal Couplings for Metropolis-Hastings
by: Phan, Buu, et al.
Published: (2026)

Intrepid MCMC: Metropolis-Hastings with Exploration
by: Chakroborty, Promit, et al.
Published: (2024)

Convergence rates of Metropolis–Hastings algorithms
by: Austin Brown, et al.
Published: (2024)

Score-Based Metropolis-Hastings Algorithms
by: Aloui, Ahmed, et al.
Published: (2024)

Provably Optimal Memory Capacity for Modern Hopfield Models: Transformer-Compatible Dense Associative Memories as Spherical Codes
by: Hu, Jerry Yao-Chieh, et al.
Published: (2024)

Graph Neural Networks with Feature and Structure Aware Random Walk
by: Zhuo, Wei, et al.
Published: (2021)

Backpropagation-Free Metropolis-Adjusted Langevin Algorithm
by: Cobb, Adam D., et al.
Published: (2025)

Coverage, Not Averages: Semantic Stratification for Trustworthy Retrieval Evaluation
by: Klearman, Andrew, et al.
Published: (2026)

Breadth-First Search vs. Restarting Random Walks for Escaping Uninformed Heuristic Regions
by: Platnick, Daniel, et al.
Published: (2025)

Beyond Semantics: How Temporal Biases Shape Retrieval in Transformer and State-Space Models
by: Bajaj, Anooshka, et al.
Published: (2025)

Large deviations for Independent Metropolis Hastings and Metropolis-adjusted Langevin algorithm
by: Milinanni, Federica, et al.
Published: (2024)

Projection by Convolution: Optimal Sample Complexity for Reinforcement Learning in Continuous-Space MDPs
by: Maran, Davide, et al.
Published: (2024)

EngramaBench: Evaluating Long-Term Conversational Memory with Structured Graph Retrieval
by: Acuna, Julian
Published: (2026)

Stochastic Streets: A Walk Through Random LLM Address Generation in four European Cities
by: Fu, Tairan, et al.
Published: (2025)

Expected Runtime Comparisons Between Breadth-First Search and Constant-Depth Restarting Random Walks
by: Platnick, Daniel, et al.
Published: (2024)

On randomized step sizes in Metropolis-Hastings algorithms
by: Grazzi, Sebastiano, et al.
Published: (2026)

Gradient Estimation via Differentiable Metropolis-Hastings
by: Arya, Gaurav, et al.
Published: (2024)

A categorical account of the Metropolis-Hastings algorithm
by: Cornish, Rob, et al.
Published: (2026)