Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

70140209279 · Jun 202019922001200920172026
48 results for inference engines

Bayesian inference engines improve density estimation accuracy and scalability.

problem Constructing accurate and scalable probability density functions.
method Bayesian inference engines (no-U-turn sampling and expectation propagation) with binning strategy.
result Density estimates have excellent comparative performance and scale well to large sample sizes.

Engine for Likelihood-Free Inference (ELFI) is a Python software library for performing likelihood-free inference (LFI). ELFI provides a convenient syntax for arranging components in LFI, such as priors, simulators, summaries or distances, to a network called ELFI graph. The components can be implemented in a wide vari…

2017-08-02abs ↗pdf ↗

The article explores how organisms and machines learn and recognize the world using Bayesian inference and thermodynamics.

problem Understanding how organisms and machines learn and recognize the world.
method Introducing a thermodynamic view of the Bayesian brain hypothesis, using a simple generative model of spiking neural populations.
result The process of Bayesian inference can be quantified using entropy, revealing the perceptual capacity of neural activity.

Unified framework for robust causal directionality in quantum systems under MNAR observation.

problem Determining causal directionality in quantum systems under MNAR observation.
method Integrates CVAE-based latent constraints, MNAR-aware selection models, GEE-stabilized regression, penalized empirical likelihood, and Bayesian optimization.
result Achieves lower bias and variance, near-nominal coverage, and superior quantum-specific diagnostics.

State-space models (SSMs) provide a flexible framework for modelling time-series data. Consequently, SSMs are ubiquitously applied in areas such as engineering, econometrics and epidemiology. In this paper we provide a fast approach for approximate Bayesian inference in SSMs using the tools of deep learning and variati…

2018-11-20abs ↗pdf ↗

This paper tackles real-time Bayesian inverse problems using neural networks.

problem Real-time inference of posterior distributions from experimental data.
method Amortized variational inference with Gaussian and Flow guides.
result The approach provides posterior estimates in real-time at the cost of a forward pass.

NP-HMC extends HMC for nonparametric models in probabilistic programming.

problem Inference for nonparametric models in probabilistic programming.
method Introduces NP-HMC, a generalization of HMC for nonparametric models using tree representable functions.
result Empirically shows significant performance improvements over existing approaches.

Unified framework improves robust causal inference, overcoming Gaussian barriers and optimization issues.

problem Improving robust causal inference in non-Gaussian settings.
method Combines gamma-Divergence, GNC, and Gatekeeper mechanism.
result Enhanced robustness and global optimization in causal effect estimation.

This paper introduces Probability Engineering to improve deep learning models.

problem Challenges in traditional probabilistic modeling for AI applications.
method Treats learned probability distributions as engineering artifacts and actively modifies them.
result Improves robustness, efficiency, adaptability, and trustworthiness of deep learning models.

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…

2012-10-16abs ↗pdf ↗

Transformer models can approximate smooth functions with prompts, enhancing LLMs' dynamic capabilities.

problem Lack of theoretical framework for prompt engineering in transformer models.
method Formal framework demonstrating transformer models can approximate ββ-times differentiable functions with prompts.
result Transformer models can approximate ββ-times differentiable functions with arbitrary precision using appropriately structured prompts.

Develops fully Bayesian LVGP for better uncertainty quantification.

problem Uncertainty in qualitative inputs for GP models.
method Maps qualitative inputs to latent variables, uses standard GP over LVs, estimates LVs through ML, develops fully Bayesian approach.
result Significant improvements in prediction accuracy and uncertainty quantification over plug-in approach.

Variational Bayes (VB) inference is one of the most important algorithms in machine learning and widely used in engineering and industry. However, VB is known to suffer from the problem of local optima. In this Letter, we generalize VB by using quantum mechanics, and propose a new algorithm, which we call quantum annea…

2017-12-13abs ↗pdf ↗

AIF improves physical AI agents' performance in dynamic environments.

problem Physical AI agents are less capable than biological agents in open-ended real-world environments.
method Developed from probability theory, Bayesian machine learning, variational inference, and Active Inference (AIF), grounded in the Free Energy Principle.
result AIF minimizes variational free energy and is well-suited to physical constraints.

Developing active inference agents for edge devices with limited resources.

problem Creating effective active inference agents on edge devices with limited computational resources.
method Introducing a software toolbox to accelerate the development of active inference agents by non-experts.
result Accelerates the democratization of active inference agents for edge devices.

This work optimizes statistical inference with neural networks for high-energy physics data.

problem Optimal dimensionality reduction with minimal loss of information in the presence of systematic uncertainties.
method Neural network optimization based on binned Poisson likelihoods with nuisance parameters.
result Estimates of parameters of interest close to optimal.

The paper develops a method to infer model parameters and shared dynamics from related physical systems using data.

problem Calibrating models to match data when detailed system properties and laws are unknown.
method Hierarchical Bayesian framework, adaptive surrogate models, bilevel optimization.
result Joint estimation of individual model parameters and shared dynamics using data from related systems.

New method ensures consistent inference across different tensor parallel sizes for large language models.

problem Non-deterministic inference in large language models due to inconsistent reduction orders across GPUs.
method Tree-Based Invariant Kernels (TBIK) that align intra- and inter-GPU reduction orders through a unified hierarchical binary tree structure.
result Bit-wise identical results across different tensor parallel sizes for RL training.

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.

Paper shows how to infer hidden states in neural networks analytically.

problem Intractability of Bayesian inference for neural networks.
method Leverage tractable approximate Gaussian inference (TAGI) for hidden states inference.
result Demonstrates inference of hidden states through constraints for various applications.

Automates feature extraction from JSON data for machine learning.

problem Manual feature engineering for JSON data is laborious, lossy, and prone to bias.
method Automates feature extraction using Mill.jl and JsonGrinder.jl.
result Creates a differentiable machine learning model from raw JSON samples.

Orpheus simplifies deep learning deployment on edge devices.

problem Optimizing deep learning inference on edge devices for efficiency.
method Orpheus is a new framework with a small codebase, minimal dependencies, and easy integration.
result Preliminary results show the effectiveness of Orpheus for inference optimisations.

Training of the neural autoregressive density estimator (NADE) can be viewed as doing one step of probabilistic inference on missing values in data. We propose a new model that extends this inference scheme to multiple steps, arguing that it is easier to learn to improve a reconstruction in kk steps rather than to lea…

2014-06-05abs ↗pdf ↗

We introduce a method for using deep neural networks to amortize the cost of inference in models from the family induced by universal probabilistic programming languages, establishing a framework that combines the strengths of probabilistic programming and deep learning methods. We call what we do "compilation of infer…

2016-10-31abs ↗pdf ↗

Proposes a model for predicting events from event streams.

problem Predicting events like part replacement and failure in manufacturing and teleservice systems.
method Non-parametric prognostic framework using MGCP modulated Poisson processes.
result MGCP prior facilitates sharing of information and analysis of flexible event patterns.

PriorGuide adapts diffusion models to new priors at test time.

problem Limited applicability of prior distributions in diffusion-based inference.
method PriorGuide uses a guidance approximation to adapt diffusion models to new priors at test time.
result Enhances the versatility of pre-trained inference models by allowing flexible adaptation to new priors.

GPflow is a Gaussian process library that uses TensorFlow for its core computations and Python for its front end. The distinguishing features of GPflow are that it uses variational inference as the primary approximation method, provides concise code through the use of automatic differentiation, has been engineered with…

2016-10-27abs ↗pdf ↗

Bayesian model transfers knowledge across different engineering fleets.

problem Data sparsity in predictive models for engineering infrastructure.
method Hierarchical Bayesian approach with multitask learning.
result Improves survival analysis and power prediction in truck fleets and wind farms.

Inference-Time Scaling can be extended to domains prone to systematic failure using intrinsic statistics.

problem Scaling inference time in domains prone to systematic failure
method Intrinsic Selection (iS), Intrinsic Particle Filtering (iPF), and Particle Distillation (dPF)
result Intrinsic Selection improves engineering design selection by 20% and pass@1 by 6.1 points on average.

A new method for efficient inference in probabilistic programs with mixed support.

problem Challenges in inference for programs with both continuous and discrete latent variables.
method Stochastic gradient Markov Chain Monte Carlo algorithms.
result Outperforms existing composing inference baselines and works almost as well as inference in marginalized versions.

Agents learn state ambiguity from non-linear sensor data using Gaussian approximations.

problem Learning state representation from non-linear sensor data.
method Second-order Taylor approximation of Gaussian distribution for non-linear measurement functions.
result Induces a preference for states based on inferability from observations.