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,657 papers · 148 categories

Trend · papers per month

99199298397 · Jun 202019922001200920172026
48 results for operator inference

Variational inference is an umbrella term for algorithms which cast Bayesian inference as optimization. Classically, variational inference uses the Kullback-Leibler divergence to define the optimization. Though this divergence has been widely used, the resultant posterior approximation can suffer from undesirable stati…

2016-10-27abs ↗pdf ↗

We present Spectral Inference Networks, a framework for learning eigenfunctions of linear operators by stochastic optimization. Spectral Inference Networks generalize Slow Feature Analysis to generic symmetric operators, and are closely related to Variational Monte Carlo methods from computational physics. As such, the…

2018-06-06abs ↗pdf ↗

LSCI provides locally adaptive prediction sets for operator models with tighter coverage.

problem Generating robust, calibrated uncertainty quantification for operator models.
method Local Sliced Conformal Inference (LSCI) for operator models.
result LSCI yields tighter prediction sets with stronger adaptivity compared to conformal baselines.

ICON learns differential equation operators from examples, revealing probabilistic inference.

problem Learning operators for differential equations from limited examples.
method Probabilistic operator learning using ICON architectures trained on diverse datasets.
result ICON implicitly performs Bayesian inference on solution operators.

Unified framework for tractable inference scenarios in machine learning models.

problem Complex inference scenarios in machine learning models.
method Characterization of tractable modular operations over circuits and derivation of a unified framework.
result Unified framework for reasoning about tractable models.

Develops inference combinators for probabilistic programs using neural networks.

problem Creating efficient proposals for probabilistic program inference.
method Inference combinators using neural network parameterization of proposals.
result Correct by construction variational methods tailored to specific models.

PRISMA uses PDE residuals for fast, robust, and accurate inference.

problem Slow gradient-based optimization and instability in PDE residual-based methods.
method Integrates PDE residuals directly into the model's architecture via attention mechanisms in the spectral domain.
result Competitive accuracy with significantly lower inference costs and faster speeds.

Improved diffusion sampling for inverse problems with faster and more robust inference.

problem High computational cost and lack of robustness in diffusion posterior sampling.
method Amortized variational inference with explicit likelihood guidance.
result Improved trade-off between inference speed and robustness to unseen degradations.

Hybrid approach combines VI and HMC for efficient Bayesian inference in neural networks.

problem Computational demands and inaccuracies in Bayesian inference for neural networks.
method Combines VI and HMC, reducing parameter space and accelerating inference.
result Significantly reduces inference time for large neural networks, improving uncertainty quantification.

Framework improves data-driven ROMs for complex systems using Bayesian operator inference.

problem Improving the quality of data-driven reduced-order models for complex dynamical systems.
method Develops an active learning framework using Bayesian operator inference to identify and select training parameters.
result The proposed adaptive sampling strategy consistently yields more stable and accurate ROMs than random sampling.

This paper introduces a neural operator for probabilistic conditioning.

problem Probabilistic conditioning of random variables XX given YY.
method Develops a single operator that maps any joint density to its conditional, approximated by neural operators.
result Neural operators can approximate the conditioning operator to arbitrary accuracy.

Paper tackles uncertainties in reduced-order modeling of complex systems.

problem Model-form uncertainties in reduced-order modeling of complex systems.
method Combines Riemannian projection and retraction operators on a subset of the Stiefel manifold with an information-theoretic formulation.
result Identifies and quantifies the impact of model-form uncertainties on inferred operators.

VB-DeepONet uses Bayesian inference to improve DeepONet's predictions and uncertainty quantification.

problem Overfitting and lack of uncertainty quantification in DeepONet.
method Variational Bayes approach to approximate posterior distribution, reducing computational cost.
result VB-DeepONet alleviates DeepONet's limitations and provides uncertainty quantification.

BI-EqNO improves Bayesian inference with flexible neural operators.

problem Inaccurate estimation of marginal likelihoods in approximate Bayesian methods.
method Equivariant neural operator framework for generalized approximate Bayesian inference.
result BI-EqNO enhances both deterministic and stochastic approaches to Bayesian inference.

In reinforcement learning (RL), agents often operate in partially observed and uncertain environments. Model-based RL suggests that this is best achieved by learning and exploiting a probabilistic model of the world. 'Active inference' is an emerging normative framework in cognitive and computational neuroscience that …

2019-11-24abs ↗pdf ↗

We propose to learn a kernel-based message operator which takes as input all expectation propagation (EP) incoming messages to a factor node and produces an outgoing message. In ordinary EP, computing an outgoing message involves estimating a multivariate integral which may not have an analytic expression. Learning suc…

2015-01-02abs ↗pdf ↗

Latent-IMH improves Bayesian inference for expensive operators.

problem Efficient sampling from posterior distributions in inverse problems with computationally expensive operators.
method Metropolis-Hastings independence sampler using approximate and exact operators.
result Latent-IMH outperforms existing methods in computational efficiency.

New method accelerates energetic variational inference using particle dynamics.

problem Efficiently solving variational inference problems with reduced computational cost.
method Particle-based variational inference with implicit scheme, inspired by energy quadratization and operator splitting.
result Significantly reduces computational cost compared to existing methods.

Most neural networks utilize the same amount of compute for every example independent of the inherent complexity of the input. Further, methods that adapt the amount of computation to the example focus on finding a fixed inference-time computational graph per example, ignoring any external computational budgets or vary…

2020-02-17abs ↗pdf ↗

Extends GP regression to complex Helmholtz problems, improving wavefield inference in brain elastography.

problem Infer complex Helmholtz wavefields from sparse, noisy data.
method Operator-informed Gaussian processes, realifying complex operator into real blocks, using PDE residuals and boundary traces.
result Competitive with finite-difference and neural-network methods, reconstructs brain shear curl field with high correlation.

Enhanced DeepONet framework with uncertainty quantification for complex operators.

problem Learning complex operators with uncertainty quantification.
method Generalised variational inference (GVI) using Rényi's α-divergence.
result Superior predictive accuracy and uncertainty quantification.

ICON-OCnet solves optimal execution problems with neural networks and few examples.

problem Optimal order execution in markets with unknown price impact.
method Transformer-based neural network architecture (ICON-OCnet) that learns price impact from few examples and applies it to optimal execution strategies.
result ICON-OCnet accurately infers price impact models and retrieves optimal execution strategies for various propagator kernels.

New methods for inferring, predicting, and estimating continuous-time, discrete-event processes.

problem Inferring, predicting, and estimating entropy rate of continuous-time, discrete-event processes.
method Bayesian structural inference extended with neural networks.
result Methods are competitive for prediction and entropy-rate estimation with state-of-the-art.

We present a particle flow realization of Bayes' rule, where an ODE-based neural operator is used to transport particles from a prior to its posterior after a new observation. We prove that such an ODE operator exists. Its neural parameterization can be trained in a meta-learning framework, allowing this operator to re…

2019-02-02abs ↗pdf ↗

The paper improves ODE solvers by integrating diverse information types.

problem Improving accuracy and physical meaningfulness of ODE solutions.
method Leveraging probabilistic solvers to include second-order information and physical conservation laws.
result Solutions become more accurate and physically meaningful with additional information.

VINNAS uses variational inference to avoid mode collapse in neural architecture search.

problem Mode collapse in gradient-based NAS methods, leading to suboptimal architectures.
method Differentiable variational inference with variational dropout and automatic relevance determination.
result State-of-the-art accuracy with up to twice fewer non-zero parameters.

The paper proposes a method to improve Koopman operator estimation using indicator functions.

problem Difficulty in identifying good observables for Koopman operator expansion.
method Clustering procedure based on Hidden Markov Model (HMM) to infer surrogate observables.
result Inferred indicator functions significantly improve estimation of Koopman operator eigenvalues and transition timescales.

Corrected moment-based methods improve inference in topic model regression.

problem Inferential difficulties in topic model plug-in workflow for regression.
method Corrected spectral moment methods for LDA, response-weighted word moments.
result Direct identification of regression coefficients without estimating topic shares.

Develops local elliptic regularity for geometrically-natural operators with low regularity coefficients.

problem Local elliptic regularity for operators with low regularity coefficients in Sobolev-type spaces.
method Rescaling estimates and multiplication results for function spaces.
result Unified set of interior estimates and regularity inference for operators with Sobolev-type coefficients.