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

295887116 · Jun 202019922001200920172026
48 results for probabilists

Probabilistic deep learning uses neural networks and models to handle uncertainty.

problem Handling uncertainty in deep learning models.
method Two approaches: probabilistic neural networks and deep probabilistic models.
result TensorFlow Probability library supports both approaches.

We introduce the notion of a stochastic probabilistic program and present a reference implementation of a probabilistic programming facility supporting specification of stochastic probabilistic programs and inference in them. Stochastic probabilistic programs allow straightforward specification and efficient inference …

2020-01-08abs ↗pdf ↗

Recent advances in statistical inference have significantly expanded the toolbox of probabilistic modeling. Historically, probabilistic modeling has been constrained to (i) very restricted model classes where exact or approximate probabilistic inference were feasible, and (ii) small or medium-sized data sets which fit …

2019-08-09abs ↗pdf ↗

We propose design guidelines for a probabilistic programming facility suitable for deployment as a part of a production software system. As a reference implementation, we introduce Infergo, a probabilistic programming facility for Go, a modern programming language of choice for server-side software development. We argu…

2019-06-20abs ↗pdf ↗

Probabilistic programming allows specification of probabilistic models in a declarative manner. Recently, several new software systems and languages for probabilistic programming have been developed on the basis of newly developed and improved methods for approximate inference in probabilistic models. In this contribut…

2013-06-02abs ↗pdf ↗

We present a new algorithm for approximate inference in probabilistic programs, based on a stochastic gradient for variational programs. This method is efficient without restrictions on the probabilistic program; it is particularly practical for distributions which are not analytically tractable, including highly struc…

2013-01-07abs ↗pdf ↗

Forward inference techniques such as sequential Monte Carlo and particle Markov chain Monte Carlo for probabilistic programming can be implemented in any programming language by creative use of standardized operating system functionality including processes, forking, mutexes, and shared memory. Exploiting this we have …

2014-03-03abs ↗pdf ↗

The paper extends calibration to sets of probabilistic classifiers, finding many ensembles are poorly calibrated.

problem Evaluating the validity of epistemic uncertainty in sets of probabilistic classifiers.
method Proposed a novel nonparametric calibration test for sets of probabilistic classifiers.
result Ensembles of deep neural networks are often not well calibrated.

D2PCCA integrates deep learning and probabilistic modeling for nonlinear dynamical systems.

problem Analyzing nonlinear dynamical systems with probabilistic understanding.
method Combines deep learning and probabilistic modeling, using KL annealing and normalizing flows.
result Captures latent dynamics in sequential datasets with improved convergence and flexibility.

PGBM creates probabilistic predictions efficiently.

problem Creating probabilistic predictions for large-scale data.
method Approximates leaf weights as random variables, learns moments via stochastic tree ensemble update equations.
result PGBM offers significant speedup and accuracy improvements over existing methods.

We develop a technique for generalising from data in which models are samplers represented as program text. We establish encouraging empirical results that suggest that Markov chain Monte Carlo probabilistic programming inference techniques coupled with higher-order probabilistic programming languages are now sufficien…

2014-07-09abs ↗pdf ↗

We introduce an approximate search algorithm for fast maximum a posteriori probability estimation in probabilistic programs, which we call Bayesian ascent Monte Carlo (BaMC). Probabilistic programs represent probabilistic models with varying number of mutually dependent finite, countable, and continuous random variable…

2015-04-26abs ↗pdf ↗

Probabilistic techniques are central to data analysis, but different approaches can be difficult to apply, combine, and compare. This paper introduces composable generative population models (CGPMs), a computational abstraction that extends directed graphical models and can be used to describe and compose a broad class…

2016-08-18abs ↗pdf ↗

Probabilistic programming is a powerful abstraction for statistical machine learning. Applying static analysis methods to probabilistic programs could serve to optimize the learning process, automatically verify properties of models, and improve the programming interface for users. This field of static analysis for pro…

2019-09-10abs ↗pdf ↗

Probabilistic modeling enables combining domain knowledge with learning from data, thereby supporting learning from fewer training instances than purely data-driven methods. However, learning probabilistic models is difficult and has not achieved the level of performance of methods such as deep neural networks on many …

2017-05-15abs ↗pdf ↗

This work offers a broad perspective on probabilistic modeling and inference in light of recent advances in probabilistic programming, in which models are formally expressed in Turing-complete programming languages. We consider a typical workflow and how probabilistic programming languages can help to automate this wor…

2018-10-02abs ↗pdf ↗

Proposes a method to reconcile count time series forecasts.

problem No formal framework for probabilistic reconciliation of count time series.
method Generalizes Bayes' rule for reconciling real-valued and count variables.
result Improves forecast accuracy for count variables compared to Gaussian reconciliation.

In this paper we formulate a probabilistic model for class-specific discriminant subspace learning. The proposed model can naturally incorporate the multi-modal structure of the negative class, which is neglected by existing class-specific methods. Moreover, it can be directly used to define a class-specific probabilis…

2018-12-14abs ↗pdf ↗

Probabilistic programming languages represent complex data with intermingled models in a few lines of code. Efficient inference algorithms in probabilistic programming languages make possible to build unified frameworks to compute interesting probabilities of various large, real-world problems. When the structure of mo…

2016-07-04abs ↗pdf ↗

The paper studies the concepts of hedging and arbitrage in a non probabilistic framework. It provides conditions for non probabilistic arbitrage based on the topological structure of the trajectory space and makes connections with the usual notion of arbitrage. Several examples illustrate the non probabilistic arbitrag…

2011-03-05abs ↗pdf ↗

Probabilistic modeling is a powerful approach for analyzing empirical information. We describe Edward, a library for probabilistic modeling. Edward's design reflects an iterative process pioneered by George Box: build a model of a phenomenon, make inferences about the model given data, and criticize the model's fit to …

2016-10-31abs ↗pdf ↗

Probabilistic method combines space and time uncertainties in PDEs.

problem Separate treatment of space and time in PDE solvers obscures interactions and error quantification.
method Gaussian process interpretation of finite difference methods interacting with probabilistic ODE solvers.
result Joint quantification of space- and time-uncertainty possible without sacrificing ODE solver performance.

Pyro is a probabilistic programming language built on Python as a platform for developing advanced probabilistic models in AI research. To scale to large datasets and high-dimensional models, Pyro uses stochastic variational inference algorithms and probability distributions built on top of PyTorch, a modern GPU-accele…

2018-10-18abs ↗pdf ↗

Improved probabilistic solar irradiance forecasting models for grid integration.

problem Enhancing accuracy of solar irradiance forecasts for grid integration.
method Developed and calibrated probabilistic models using post-hoc calibration techniques.
result NGBoost model with CRUDE calibration achieves comparable performance to numerical weather prediction models.

Short-term load forecasting is a critical element of power systems energy management systems. In recent years, probabilistic load forecasting (PLF) has gained increased attention for its ability to provide uncertainty information that helps to improve the reliability and economics of system operation performances. This…

2019-03-26abs ↗pdf ↗

We extend probabilistic programming to handle conditioning on marginal distributions.

problem Conditioning probabilistic programs on marginal distributions of observable variables.
method We define and implement stochastic conditioning, allowing inference in probabilistic programs conditioned on marginal distributions.
result We demonstrate the effectiveness of stochastic conditioning in various real-life scenarios.

End-to-end deep model for coherent probabilistic forecasts in hierarchical time series.

problem Hierarchical probabilistic forecasting for coherent predictions.
method Dirichlet proportions model for learning root and child distributions.
result Significant improvements over state-of-the-art baselines (up to 26%).

Probabilistic learning for binary classification with categorical variables.

problem Binary classification with categorical covariates.
method Probabilistic analysis and two algorithms for learning boolean functions.
result Effective learning of boolean functions from binary data.

Transformers interpreted as probabilistic Laplacian Eigenmaps steps.

problem Improving transformer performance through probabilistic interpretation.
method Probabilistic Laplacian Eigenmaps model derivation and graph diffusion step.
result Subtracting identity from attention matrix improves transformer performance.

Proposes a deep probabilistic multi-view model for multi-view learning.

problem Learning from multiple related views with shared latent structure.
method Probabilistic Canonical Correlation Analysis (CCA) in latent space, deep generative networks, variational inference.
result Efficient variational inference approximates posterior distributions of latent multi-view layer.