:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Rosato, Conor, Lehal, Harvinder, Maskell, Simon, Devlin, Lee, Strens, Malcolm
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2505.10448
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Hess-MC2: Sequential Monte Carlo Squared using Hessian Information and Second Order Proposals
by: Murphy, Joshua, et al.
Published: (2025)

Enhanced SMC$^2$: Leveraging Gradient Information from Differentiable Particle Filters Within Langevin Proposals
by: Rosato, Conor, et al.
Published: (2024)

An Entropic Metric for Measuring Calibration of Machine Learning Models
by: Sumler, Daniel James, et al.
Published: (2025)

Network Calculus Characterization of Congestion Control for Time-Varying Traffic
by: Lehal, Harvinder, et al.
Published: (2024)

Assessing the Impact of Vaccination on Rotavirus Transmission Dynamics Using Bayesian Inference
by: Rosato, Conor, et al.
Published: (2025)

On Cyclical MCMC Sampling
by: Wang, Liwei, et al.
Published: (2024)

Multifidelity Simulation-based Inference for Computationally Expensive Simulators
by: Krouglova, Anastasia N., et al.
Published: (2025)

HollowFlow: Efficient Sample Likelihood Evaluation using Hollow Message Passing
by: Gloy, Johann Flemming, et al.
Published: (2025)

Expected Diverse Utility (EDU): Diverse Bayesian Optimization of Expensive Computer Simulators
by: Miller, John Joshua, et al.
Published: (2024)

Efficient Sampling on Riemannian Manifolds via Langevin MCMC
by: Cheng, Xiang, et al.
Published: (2024)

Efficient Hyperdimensional Computing with Modular Composite Representations
by: Angioli, Marco, et al.
Published: (2025)

Utilising Gradient-Based Proposals Within Sequential Monte Carlo Samplers for Training of Partial Bayesian Neural Networks
by: Millard, Andrew, et al.
Published: (2025)

Investigating Batch Inference in a Sequential Monte Carlo Framework for Neural Networks
by: Millard, Andrew, et al.
Published: (2026)

Humble your Overconfident Networks: Unlearning Overfitting via Sequential Monte Carlo Tempered Deep Ensembles
by: Millard, Andrew, et al.
Published: (2025)

Entropy-MCMC: Sampling from Flat Basins with Ease
by: Li, Bolian, et al.
Published: (2023)

Incorporating the ChEES Criterion into Sequential Monte Carlo Samplers
by: Millard, Andrew, et al.
Published: (2025)

Uncertainty-Aware Surrogate-based Amortized Bayesian Inference for Computationally Expensive Models
by: Scheurer, Stefania, et al.
Published: (2025)

PolytopeWalk: Sparse MCMC Sampling over Polytopes
by: Sun, Benny, et al.
Published: (2024)

High-dimensional Adaptive MCMC with Reduced Computational Complexity
by: Hird, Max, et al.
Published: (2026)

Efficiently Vectorized MCMC on Modern Accelerators
by: Dance, Hugh, et al.
Published: (2025)

Integration of Active Learning and MCMC Sampling for Efficient Bayesian Calibration of Mechanical Properties
by: Riccius, Leon, et al.
Published: (2024)

NLP Sampling: Combining MCMC and NLP Methods for Diverse Constrained Sampling
by: Toussaint, Marc, et al.
Published: (2024)

Transition Path Sampling with Boltzmann Generator-based MCMC Moves
by: Plainer, Michael, et al.
Published: (2023)

MCMC Informed Neural Emulators for Uncertainty Quantification in Dynamical Systems
by: Haario, Heikki, et al.
Published: (2026)

A Novel Deep Learning Approach for Emulating Computationally Expensive Postfire Debris Flows
by: Patel, Palak, et al.
Published: (2025)

Temporal Graph ODEs for Irregularly-Sampled Time Series
by: Gravina, Alessio, et al.
Published: (2024)

IMLE Policy: Fast and Sample Efficient Visuomotor Policy Learning via Implicit Maximum Likelihood Estimation
by: Rana, Krishan, et al.
Published: (2025)

Training Greedy Policy for Proposal Batch Selection in Expensive Multi-Objective Combinatorial Optimization
by: Lee, Deokjae, et al.
Published: (2024)

EMC$^2$: Efficient MCMC Negative Sampling for Contrastive Learning with Global Convergence
by: Yau, Chung-Yiu, et al.
Published: (2024)

HD-CB: The First Exploration of Hyperdimensional Computing for Contextual Bandits Problems
by: Angioli, Marco, et al.
Published: (2025)

Neural Likelihood Surfaces for Spatial Processes with Computationally Intensive or Intractable Likelihoods
by: Walchessen, Julia, et al.
Published: (2023)

Experience-Based Evolutionary Algorithms for Expensive Optimization
by: Yu, Xunzhao, et al.
Published: (2023)

Constrained Sampling for Language Models Should Be Easy: An MCMC Perspective
by: Gonzalez, Emmanuel Anaya, et al.
Published: (2025)

Functional Latent Dynamics for Irregularly Sampled Time Series Forecasting
by: Klötergens, Christian, et al.
Published: (2024)

On Constructing Algorithm Portfolios in Algorithm Selection for Computationally Expensive Black-box Optimization in the Fixed-budget Setting
by: Yoshikawa, Takushi, et al.
Published: (2024)

On the Convergence of Irregular Sampling in Reproducing Kernel Hilbert Spaces
by: Iske, Armin
Published: (2025)

Temporal Dynamic Embedding for Irregularly Sampled Time Series
by: Kim, Mincheol, et al.
Published: (2025)

Limits of Generative Pre-Training in Structured EMR Trajectories with Irregular Sampling
by: Kuo, Nicholas I-Hsien, et al.
Published: (2025)

Reduce, Reuse, Recycle: Compositional Generation with Energy-Based Diffusion Models and MCMC
by: Du, Yilun, et al.
Published: (2023)

Efficient Offline Reinforcement Learning: First Imitate, then Improve
by: Jelley, Adam, et al.
Published: (2024)