direct parameter sampling

本文提出MarCo算法，通过从边缘分布进行Metropolis-Hastings采样并结合精确条件分布采样，解决了大尺度问题中MCMC算法计算成本高的问题，证明了其在混合时间和收敛性上的优越性能。

This work addresses the computational inefficiency in Bayesian semiparametric regression arising from complex design matrix structures. To mitigate this challenge, the authors propose an orthogonalization preprocessing step applied to the design日晚间 matrix prior to iterative inference, combined with a hybrid algorithm integrating Gibbs sampling and coordinate ascent variational inference. This approach reduces computational complexity to quadratic in the number of covariates, substantially accelerating both model fitting and posterior inference. Empirical evaluations across diverse experimental settings demonstrate speedups ranging from 5× to 60× compared to conventional methods, effectively alleviating the computational bottleneck induced by high-dimensional covariates.

This work addresses the challenge of conditional sampling in generative diffusion models for Bayesian inverse problems. It systematically surveys and unifies two dominant paradigms: end-to-end methods based on the joint distribution, and decoupled approaches combining a pre-trained marginal distribution with an explicit likelihood model. We propose, for the first time, a theoretically consistent unified framework that integrates Monte Carlo sampling, diffusion process reweighting, conditional probability construction, and fine-tuning techniques—rigorously characterizing the underlying assumptions and intrinsic relationships among these methods. The framework bridges theoretical gaps across disparate conditional generation strategies and delivers a scalable, interpretable, and theoretically grounded toolkit for conditional sampling in scientific computing inverse problems, including image reconstruction and physics-based simulation.

This work addresses the slow MCMC convergence in Gibbs posterior sampling under stochastic loss functions, which stems from spurious dependence on the number of pseudo-observations. We propose the first pseudo-sample-size–independent corrected piecewise deterministic Markov process (PDMP) sampler. By designing a novel jump-rate function and direction mechanism, our method rigorously ensures that the invariant measure remains invariant to the pseudo-observation count—thereby overcoming the inherent trade-off between asymptotic bias and slow convergence in conventional stochastic-loss inference. We prove that the sampler converges exactly to the target Gibbs posterior measure with a uniform convergence rate independent of pseudo-sample size. Empirical validation across three canonical settings—likelihood-intractable models, misspecified models, and stochastic losses—demonstrates elimination of pseudo-sample-size bias in posterior sampling, alongside substantial improvements in robustness and estimation accuracy.

This work addresses weak interpolation controllability and training instability in conditional generation. We propose Conditional Stochastic Interpolation (CSI), a framework that enables differentiable and controllable transport from a reference distribution to a target conditional distribution by modeling conditional probability flows or stochastic differential equations (SDEs). Key contributions include: (i) the first explicit formulation of the conditional drift and score function as conditional expectations; (ii) an adaptive diffusion term that enhances training stability; (iii) a non-asymptotic error bound guaranteeing convergence and generalization; and (iv) support for parameter-free regression estimation, deterministic ODE sampling, and adaptive-diffusion sampling. Extensive experiments on standard image datasets demonstrate high-quality, high-fidelity conditional generation. The method combines theoretical rigor—grounded in conditional probability flow theory—with practical effectiveness, offering improved controllability, stability, and flexibility over existing approaches.

Traditional inverse design methods are limited to point-wise target outputs and struggle to accommodate design requirements expressed as target distributions. This work formalizes, for the first time, the distribution-level inverse design problem and introduces a new paradigm termed Conditional Distribution Matching (CDM), defining two task variants: CDMS and CDMO. The authors propose MLGD-F, a plug-and-play inference algorithm that efficiently solves these tasks without additional training. MLGD-F leverages a pre-trained score-based diffusion model combined with a single-step conditional sampler, using a matching loss to guide gradient updates. The method successfully recovers inputs whose outputs align with complex target distributions—including discrete mixtures and continuous low-rank supports—demonstrating effectiveness across synthetic data, structured image transformation, and generative editing tasks.

Traditional hybrid experimental designs struggle to robustly control the frequentist operating characteristics of Bayesian decisions under model misspecification and lack efficient sample size determination methods applicable to generalized posteriors. This work proposes a computationally efficient experimental design framework that requires simulations at only two sample sizes and leverages extrapolation modeling of posterior summary functions to infer performance across the entire sample size space. This approach enables identification of the minimal sample size and decision rule satisfying desired operating characteristics. It represents the first general and scalable method for sample size planning under generalized posteriors, substantially reducing computational burden while enhancing robustness to model misspecification. The method’s validity and broad applicability within Bayesian M-estimation–type experiments are demonstrated through the redesign of an adaptive clinical trial with time-to-event outcomes.

本文提出两种贝叶斯方法解决信息抽样下的推断问题，第一种通过构建一致似然函数，第二种使用损失-似然自助法以提高稳健性。

本文通过提出p-CSMC算法，结合参数学习和祖先采样，解决了条件序列蒙特卡洛算法中静态参数和潜在状态联合估计的问题，提高了在强内部相关性情况下的探索效率。

This study addresses the scalability and statistical validity bottlenecks in likelihood approximation and inference for complex simulation models by proposing a novel framework based on aggregated normalizing flow chains. Methodologically, it integrates information-theoretic formalization with sequential decision-making paradigms to construct flexible probability distributions through the sequential optimization of bijective transformation parameters. Furthermore, an empirical likelihood estimator under moment constraints is employed to iteratively update and aggregate the global flow parameters. This research establishes a surrogate model that simultaneously ensures computational feasibility and statistical power, enabling efficient parameter exploration, hypothesis testing, and uncertainty quantification. Ultimately, the proposed approach provides a reliable Bayesian inference solution for complex systems.