Efficient inference method for adaptive experiments with tighter confidence sequences.
problem Efficient inference of Average Treatment Effect in a changing policy sequential experiment.
method Semiparametric efficient inference using Adaptive Augmented Inverse-Probability Weighted estimator and asymptotic confidence sequences.
result Derives tighter confidence sequences for adaptive experiments under data-dependent stopping times.
Efficiently estimates marginal posteriors for complex simulations.
problem Bayesian inference in high-dimensional, intractable likelihood scenarios.
method Simulates and estimates low-dimensional marginal posteriors, using truncated indicators.
result Simulator efficiency and robustness testing of inference results.
The paper analyzes distributed Bayesian inference and its Frequentist guarantees.
problem Analyzing large decentralized datasets with distributed Bayesian inference.
method Establishes Frequentist properties for distributed (non-)Bayesian inference.
result Distributed Bayesian inference retains parametric efficiency and enhances robustness.
Unified framework for efficient Gaussian process inference.
problem Efficient inference in non-conjugate Gaussian process models.
method Combines expectation propagation with linearization for improved efficiency.
result Unified view of various inference schemes, including classical smoothers and EP.
We present a Communication-efficient Surrogate Likelihood (CSL) framework for solving distributed statistical inference problems. CSL provides a communication-efficient surrogate to the global likelihood that can be used for low-dimensional estimation, high-dimensional regularized estimation and Bayesian inference. For…
TSNPE improves SBI efficiency and scalability.
problem Efficient and scalable simulation-based inference for complex models.
method Sequential inference with truncated proposals.
result TSNPE performs on par with previous methods and scales to complex models.
New method improves statistical inference using machine learning-imputed data.
problem Improving statistical inference with imputed data from machine learning.
method Two-phase sampling approach for Z-estimation with ML-imputed outcomes.
result Guaranteed efficiency matching or exceeding classical inference, regardless of prediction quality.
XSPNs combine SPNs and MEVMs for efficient inference in data with repeated parts.
problem Efficient inference in data with repeated interchangeable parts.
method Introducing Exchangeability-Aware Sum-Product Networks (XSPNs) that combine SPNs and MEVMs.
result XSPNs can be more accurate than conventional SPNs when data contains repeated parts.
Paper improves statistical efficiency of median-of-means estimator for Byzantine robust distributed inference.
problem Byzantine robustness in distributed learning systems.
method Variance reduced median-of-means (VRMOM) estimator for Byzantine robust distributed inference.
result Achieves a fast convergence rate with only a constant number of rounds of communications.
The paper parallelizes HMM inference for efficient long-term computations.
problem Efficiently computing inference in long-term hidden Markov models.
method Parallelization using associative elements and operators for sum-product and max-product algorithms.
result The proposed parallel algorithms are computationally efficient for long time horizons.
L-HNNs improve Bayesian inference efficiency by reducing gradient computation.
problem Efficient Bayesian inference with minimal gradient computation.
method Integrating L-HNNs into NUTS with online error monitoring.
result L-HNNs in NUTS outperform NUTS in complex posterior densities.
Paper introduces md-vtrees for efficient probabilistic and causal inference.
problem Efficient inference in complex probabilistic models.
method Introduces md-vtrees to generalize tractability conditions for advanced inference queries.
result Derives first polytime algorithms for causal inference queries.
Paper proposes learnable topological features for efficient phylogenetic inference.
problem Finding appropriate topological structures for phylogenetic inference tasks requires significant design effort and domain expertise.
method Combines raw node features with graph neural networks to automatically adapt to different tasks.
result Demonstrates effectiveness and efficiency on simulated and real data phylogenetic inference tasks.
FPPI selectively uses predictions to improve inference efficiency.
problem Improving statistical inference with limited labeled data and heterogeneous prediction quality.
method Filtered Prediction-Powered Inference (FPPI) framework.
result FPPI achieves strictly improved asymptotic efficiency compared to existing methods.
New method uses EKI for efficient Bayesian inference in high-dimensional problems.
problem Efficient inference for high-dimensional posterior distributions in physics-informed neural networks.
method Ensemble Kalman Inversion (EKI) for high-dimensional posterior inference.
result EKI-based inference provides comparable uncertainty estimates to HMC-based methods but with reduced computational cost.
Improves diffusion model performance and efficiency through classical search.
problem Tackles inference-time control in diffusion models.
method Proposes a framework combining local and global search for efficient navigation.
result Significant gains in performance and efficiency across various domains.
Active inference framework improves U-statistic estimation efficiency.
problem Costly acquisition of labels for U-statistics. method Active inference framework with optimal sampling rule.
result Substantial gains in estimation efficiency over baseline methods.
Imputation-Powered Inference improves subpopulation efficiency in missing data settings.
problem Complex missing data patterns challenge standard inference methods.
method Imputation-Powered Inference (IPI) combines blackbox imputation with bias correction.
result IPI provides valid and efficient M-estimation under MCAR blockwise missingness.
Recent efforts on combining deep models with probabilistic graphical models are promising in providing flexible models that are also easy to interpret. We propose a variational message-passing algorithm for variational inference in such models. We make three contributions. First, we propose structured inference network…
The rising popularity of intelligent mobile devices and the daunting computational cost of deep learning-based models call for efficient and accurate on-device inference schemes. We propose a quantization scheme that allows inference to be carried out using integer-only arithmetic, which can be implemented more efficie…
Improves probabilistic programming by analyzing program structure.
problem Inefficiency and limitations of single inference algorithms in probabilistic programming.
method Three novel techniques: static and dynamic analyses to adapt programs for more efficient inference.
result Improves probabilistic programming by making inference more efficient.
VarFA efficiently estimates student skill levels with uncertainty for adaptive testing.
problem Efficiently estimating student skill levels with uncertainty for adaptive testing.
method VarFA uses variational inference to extend factor analysis models for educational data.
result VarFA efficiently handles large datasets and produces uncertainty estimates.
Allocation strategies improve the efficiency of crowdsourcing by decreasing the work needed to complete individual tasks accurately. However, these algorithms introduce bias by preferentially allocating workers onto easy tasks, leading to sets of completed tasks that are no longer representative of all tasks. This bias…
Efficiently updates beliefs with virtual observations.
problem Incremental belief updates in Bayesian models.
method Constructs weighted virtual observations to match posterior.
result Reconstructed posterior matches original posterior closely.
d3p package enables efficient Bayesian inference with differential privacy.
problem Efficiently performing Bayesian inference under differential privacy constraints.
method Differentially private variational inference for flexible probabilistic models.
result Achieves significant speed-up in runtime for complex models.
New method uses low-fidelity simulations to efficiently infer parameters of high-fidelity models.
problem Challenges in inferring parameters of computationally expensive high-fidelity models.
method Multifidelity simulation-based inference using transfer learning and adaptive selection of high-fidelity parameters.
result Significant reduction in the number of high-fidelity simulations required for inference.
A new method combines scores of individual observations to efficiently approximate posterior distributions.
problem Handling posterior distributions conditioned on multiple observations with neural methods.
method Conditional score modeling to combine learned scores from individual observations.
result Sample-efficient method that can aggregate multiple observations at inference time.
SOTERIA optimizes neural networks for secure inference with minimal overhead.
problem Protecting user privacy in ML-as-a-service models with low overhead.
method Neural architecture search with dual objectives of accuracy and cryptographic efficiency.
result SOTERIA constructs efficient models for secure inference.
Paper proposes an AutoML framework for efficient device-edge co-inference.
problem Finding optimal hyper-parameters for model sparsity and feature compression.
method Sequential decision problem solved using deep reinforcement learning (DRL).
result Achieves better communication-computation trade-off and significant speedup.
Proposes TAGI for efficient Gaussian inference in Bayesian neural networks.
problem Efficient inference in Bayesian neural networks with complex architectures.
method Analytical method for tractable approximate Gaussian inference (TAGI).
result Matches performance of gradient-based methods with O(n) computational complexity. GEnBP combines EnKF and GaBP for efficient high-dimensional inference.
problem Efficient inference in high-dimensional models.
method Gaussian Ensemble Belief Propagation algorithm combining EnKF and GaBP.
result GEnBP outperforms existing methods in accuracy and efficiency.
New method for efficient inference over complex parameter spaces.
problem Challenges in Bayesian inference for high-dimensional, intractable likelihoods.
method Arbitrary Marginal Neural Ratio Estimation (AMNRE) for simulation-based inference.
result Efficient inference over arbitrary subsets of parameters without numerical integration.
Study trade-offs between statistical and computational efficiency in variational inference.
problem Optimizing statistical accuracy vs. computational efficiency in Bayesian inference.
method Case study on Gaussian inferential models with diagonal plus low-rank precision matrices, analyzing Bayesian posterior inference and frequentist uncertainty quantification errors.
result Lower-rank models reduce variance and accelerate convergence but increase posterior inference error.
VISA improves inference efficiency for complex models.
problem Efficient approximate inference in computationally intensive models.
method Sequential sample-average approximations within a trust region.
result VISA achieves comparable accuracy with computational savings.
Efficient tensor decomposition for count data models achieves near-optimal multiway analysis.
problem Efficient tensor decomposition for count data models.
method Rank-constrained maximum-likelihood estimator for tensor decomposition.
result Achieves multiway analysis with variance matching Cramér-Rao Lower Bound up to constants and logarithmic factors.
This paper analyzes Local SGD for federated learning, achieving both statistical and communication efficiency.
problem Statistical estimation and inference in federated learning with decentralized data.
method Local SGD, a multi-round estimation procedure using intermittent communication.
result Local SGD achieves both statistical efficiency and communication efficiency.
New method improves sample-efficiency in neural posterior estimation using simulator gradients.
problem High-fidelity posterior estimation with complex physical simulations is time-consuming.
method Neural Posterior Estimation (NPE) with differentiable simulators and gradient information.
result Improves sample-efficiency in posterior density estimation.
Geometric Variational Inference improves efficiency in complex probability distributions.
problem Efficiently accessing information in non-linear and high-dimensional probability distributions.
method Geometric Variational Inference (geoVI) uses Riemannian geometry and the Fisher information metric to construct a coordinate transformation.
result geoVI provides a more efficient variational approximation by a normal distribution, demonstrated on various problems.
Efficient inference for adaptive data with directional stability condition.
problem Efficient inference on scalar targets after adaptive data collection.
method Introduces directional stability, a weaker condition than i.i.d. data, and shows asymptotic normality and efficiency of estimators.
result Estimators remain asymptotically normal and semiparametrically efficient under directional stability.
sGPO optimizes RLVR training by balancing inference FLOPs and training efficiency.
problem RLVR training allocates rollout budget without considering query difficulty.
method sGPO trades inference FLOPs for reduced training FLOPs.
result sGPO matches or exceeds baseline performance while reducing training compute by a factor of three.
In this paper, we consider the sigmoid Gaussian Hawkes process model: the baseline intensity and triggering kernel of Hawkes process are both modeled as the sigmoid transformation of random trajectories drawn from Gaussian processes (GP). By introducing auxiliary latent random variables (branching structure, Pólya-Gamm…
New method handles missing data using AI for efficient inference.
problem Parameter estimation and inference with blockwise missing data.
method Tractable solution using AI models and semiparametric theory.
result IBM(RAY) and IBM(Adaptive) estimators achieve efficiency gains.
SNVI combines likelihood estimation with variational inference for efficient Bayesian inference.
problem Bayesian inference in models with intractable likelihoods.
method Sequential Neural Variational Inference (SNVI) that combines likelihood-estimation with variational inference.
result SNVI is more computationally efficient than previous algorithms without sacrificing accuracy.
Efficiently infers latent SDEs with scalable memory and time costs.
problem Inference of latent SDEs with high time and memory complexity.
method Amortized reparametrization of expectations under linear SDEs, coupled with efficient gradient approximation.
result Achieves similar performance to adjoint sensitivities with fewer model evaluations.
Proposes MIVI for efficient posterior estimation and design of MCMC transitions.
problem Efficiently estimating posterior distributions in constrained time.
method Combines variational inference and MCMC with a variational distribution and optimized Markov chain.
result Optimized Markov chain improves variational distribution and vice versa, leading to more accurate posteriors.
Hybrid continuous-discrete models naturally represent many real-world applications in robotics, finance, and environmental engineering. Inference with large-scale models is challenging because relational structures deteriorate rapidly during inference with observations. The main contribution of this paper is an efficie…
PPI++ uses machine learning predictions to improve inference from small datasets.
problem Efficient inference from small labeled datasets with high-quality predictions.
method Adapts prediction-powered inference (PPI) to compute confidence sets for any parameter dimensionality.
result Improves classical intervals using only labeled data, always yielding better results.
ARTree uses deep learning to infer tree topologies efficiently.
problem Efficient phylogenetic inference from tree topologies.
method Deep autoregressive model based on graph neural networks (GNNs).
result ARTree provides a flexible family of distributions over tree topologies.