arXiv Machine Learning
Aug 11
Path-dependent Discrete Amortized Inference
arXiv:2608. 08644v1 Announce Type: new Abstract: We consider the problem of sampling compositional and discrete objects from a given unnormalized posterior distribution.
Path-dependent Discrete Amortized Inference
We consider the problem of sampling compositional and discrete objects from a given unnormalized posterior distribution. Notably, recent studies have shown that this problem can be efficiently solved by learning a deterministic Markov Decision Process (MDP) that progressively builds each object in proportion to the posterior.
Related stories
arXiv Machine Learning
Aug 3
Reinforced sequential Monte Carlo for amortised sampling
arXiv:2510. 11711v3 Announce Type: replace Abstract: This paper proposes a synergy of amortised and particle-based methods for sampling from distributions defined by unnormalised density functions.
arXiv AI
Jul 20
Energy-based Transport for Amortized Bayesian Inference
arXiv:2605. 15407v3 Announce Type: replace-cross Abstract: We consider amortized Bayesian inference for nonlinear inverse problems using only samples from the joint distribution of parameters and observations, including problems with unknown functions in a Banach space.
arXiv Machine Learning
Jun 25
Efficient Adaptive Data Acquisition via Pretrained Belief Representations
arXiv:2606. 25197v1 Announce Type: new Abstract: Learning effective policies for adaptive data acquisition remains challenging: posterior-based methods rely on surrogate models and posterior approximations that can be misspecified or biased, while direct policy-learning methods map from historical observations and fail to exploit available model representations, making learning harder.
arXiv Machine Learning
Jun 16
Learning Policy from a Single Trajectory in Average-Reward Markov Decision Process
arXiv:2606. 16729v1 Announce Type: new Abstract: While there is an extensive body of work characterizing the sample complexity of discounted cumulative-reward MDPs, finite sample analyses for average-reward MDPs have been limited, and most existing works rely on restrictive assumptions such as ergodicity or access to a generative model.
arXiv Machine Learning
Aug 5
Divide-and-Conquer: Towards Generalizable Amortized Bayesian Inference for the Drift Diffusion Model
arXiv:2608. 03566v1 Announce Type: cross Abstract: The drift diffusion model (DDM) is a cornerstone of cognitive decision-making research.
arXiv Machine Learning
Jun 16
Temporal Difference Learning for Diffusion Models
arXiv:2606. 15048v1 Announce Type: new Abstract: Diffusion models are typically trained with objectives that focus on local denoising targets at individual time steps (or adjacent pairs), which do not enforce consistency between predictions along the denoising trajectory.
Hugging Face Trending Papers
Jun 17
Can In-Context Learning Support Intrinsic Curiosity?
Effective machine learning depends not only on how we model data, but also on what data we choose to collect. While large sequence models have revolutionized data modeling, the problem of automated data selection, or "intrinsic curiosity", remains a significant challenge.
arXiv Machine Learning
Jun 2
Learning To Sample From Diffusion Models Via Inverse Reinforcement Learning
arXiv:2602. 08689v2 Announce Type: replace Abstract: Diffusion models generate samples through an iterative denoising process guided by a pretrained neural network.
arXiv Machine Learning
Jul 1
End-to-End Efficient RL for Linear Bellman Complete MDPs with Deterministic Transitions
arXiv:2603. 23461v2 Announce Type: replace Abstract: We study reinforcement learning (RL) with linear function approximation in Markov Decision Processes (MDPs) satisfying \emph{linear Bellman completeness} -- a fundamental setting where the Bellman backup of any linear value function remains linear.
arXiv AI
Jun 19
Can In-Context Learning Support Intrinsic Curiosity?
arXiv:2606. 19476v1 Announce Type: cross Abstract: Effective machine learning depends not only on how we model data, but also on what data we choose to collect.
arXiv AI
Jun 10
Model-Based Reinforcement Learning in Discrete-Action Non-Markovian Reward Decision Processes
arXiv:2512. 14617v2 Announce Type: replace-cross Abstract: Many practical decision-making problems involve tasks whose success depends on the entire system history, rather than on achieving a state with desired properties.