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

71142212283 · Jun 202019922001200920172026
48 results for probabilistic smoothing

We present a general probabilistic perspective on Gaussian filtering and smoothing. This allows us to show that common approaches to Gaussian filtering/smoothing can be distinguished solely by their methods of computing/approximating the means and covariances of joint probabilities. This implies that novel filters and …

2010-06-10abs ↗pdf ↗

Paper introduces methods to handle missing data in probabilistic regression trees.

problem Handling missing data in probabilistic regression trees.
method Three approaches: uniform probability, partial observation, and dimension-reduced smoothing.
result Preserves interpretability while extending applicability to incomplete datasets.

Probabilistic proof of smooth boundaries in optimal stopping problems.

problem Continuous differentiability of time-dependent optimal boundaries in optimal stopping problems.
method Local probabilistic arguments for a wider range of conditions.
result First probabilistic proof of continuous differentiability under general conditions.

The paper provides a uniform convergence bound for smooth calibration error and its relationship with functional gradient.

problem Limited theoretical understanding of learning algorithms achieving high accuracy and good calibration.
method Focuses on smooth calibration error, providing a uniform convergence bound and proving the relationship with functional gradient.
result Derives conditions for simultaneous classification and calibration guarantees in gradient boosting trees, kernel boosting, and neural networks.

Researchers propose better probabilistic models for deep learning.

problem Using cross-entropy loss for non-categorical data.
method Introducing continuous-categorical distribution and proposing probabilistic alternatives.
result Potential for outperformance in deep learning models with proper probabilistic treatment.

Parallel-in-time solver reduces ODE simulation time from linear to logarithmic.

problem Efficiently solving ordinary differential equations (ODEs) with reduced computational cost.
method Formulated a parallel-in-time probabilistic numerical ODE solver using time-parallel formulation of iterated extended Kalman smoothers.
result Reduces span cost from linear to logarithmic in the number of time steps.

SQR Averaging improves probabilistic electricity price forecasting.

problem Accurate short-term price forecasting in electricity markets.
method Smoothing Quantile Regression Averaging.
result SQR Averaging leads to profit increases of up to 3.5% in day-ahead power trading.

SPH-ParVI uses fluid dynamics to sample unknown densities efficiently.

problem Sampling partially known densities or using gradients in probabilistic models.
method Smoothed Particle Hydrodynamics (SPH) for modeling fluid dynamics to approximate target densities.
result SPH-ParVI provides fast, flexible, scalable, and deterministic sampling for Bayesian inference and generative models.

Proposes PSCs for UQ in deep nets without retraining.

problem Estimating uncertainty in deep nets with a single pass.
method Identifies sensitive, smooth intermediate layer, fits probabilistic model.
result PSCs achieve UQ and OOD detection performance matching existing methods.

VIR model improves regression accuracy and uncertainty estimation for imbalanced data.

problem Imbalanced regression datasets lead to poor model accuracy and uncertainty estimation.
method VIR model uses probabilistic smoothing and reweighting to estimate latent representations and uncertainty.
result VIR model outperforms state-of-the-art models in accuracy and uncertainty estimation.

KalMamba improves RL efficiency with probabilistic SSMs.

problem Efficiency in learning and inference for probabilistic SSMs in RL.
method Combines Mamba's scalability with Kalman filtering for efficient probabilistic SSMs.
result KalMamba outperforms state-of-the-art SSMs in RL, especially on longer sequences.

Probabilistic models with discrete latent variables naturally capture datasets composed of discrete classes. However, they are difficult to train efficiently, since backpropagation through discrete variables is generally not possible. We present a novel method to train a class of probabilistic models with discrete late…

2016-09-07abs ↗pdf ↗

Distributions over rankings are used to model data in various settings such as preference analysis and political elections. The factorial size of the space of rankings, however, typically forces one to make structural assumptions, such as smoothness, sparsity, or probabilistic independence about these underlying distri…

2012-02-14abs ↗pdf ↗

Probabilistic theory counts intersections in Riemannian spaces.

problem Counting intersections in Riemannian homogeneous spaces.
method Introduces probabilistic intersection ring HE(M)\mathrm{H}_{\mathbb E}(M), a graded commutative and associative real Banach algebra.
result Probabilistic intersection ring structure defined for spheres, real projective space, and complex projective space.

Bayesian Probabilistic Integration uses BART for high-dimensional, non-smooth functions.

problem Bayesian quadrature's limitations in high-dimensional or non-smooth functions.
method Bayesian Additive Regression Trees (BART) priors for numerical integration.
result Explicit convergence rates can be obtained in various settings.

We study a "div-grad type" sub-Laplacian with respect to a smooth measure and its associated heat semigroup on a compact equiregular sub-Riemannian manifold. We prove a short time asymptotic expansion of the heat trace up to any order. Our main result holds true for any smooth measure on the manifold, but it has a spec…

2017-06-08abs ↗pdf ↗

Paper proposes a probabilistic alignment method for domain adaptation.

problem Latent distribution mismatch and miscalibrated uncertainty in adapting large-scale models.
method Bayesian latent transport framework with PAC-Bayesian regularization.
result Reduction in latent manifold discrepancy and improved uncertainty calibration.

A new probabilistic polygonal curve representation using Gaussian Mixture Models.

problem Capturing curves with uncertainty in both tangent and normal directions.
method Probabilistic polygonal approximation with Gaussian Mixture Model (GMM).
result The GMM accurately captures the local geometry and uncertainty of curves.

As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a universal computational procedure for probabilistic inference. We investigate the com…

2010-05-17abs ↗pdf ↗

In audio signal processing, probabilistic time-frequency models have many benefits over their non-probabilistic counterparts. They adapt to the incoming signal, quantify uncertainty, and measure correlation between the signal's amplitude and phase information, making time domain resynthesis straightforward. However, th…

2018-11-06abs ↗pdf ↗

A novel GPUM constructs Gaussian Processes for unknown manifolds with probabilistic metrics.

problem High-dimensional data on unknown manifolds with non-Euclidean geometry.
method Bayesian Gaussian Processes latent variable models (BGPLVM), Riemannian geometry, probabilistic metric tensor, Brownian Motion.
result GPUM provides more accurate predictions on unknown manifolds compared to traditional methods.

Enhanced probabilistic sampling on manifolds using Double Diffusion Maps and Geometric Harmonics.

problem Overfitting and loss of generalization in PLoM when N is small and dimensionality approaches N.
method Extending PLoM with Double Diffusion Maps and Geometric Harmonics to handle small N and high-dimensional data.
result Effective and robust method for generating statistically consistent realizations from limited data.

Improves convergence speed in compressive sensing with a new probabilistic approach.

problem Efficiently solving the best subset selection problem in compressive sensing.
method Smooth probabilistic reformulation of 0\ell_0 regularized regression.
result Empirically outperforms existing compressive sensing algorithms across various settings.

The task of calibration is to retrospectively adjust the outputs from a machine learning model to provide better probability estimates on the target variable. While calibration has been investigated thoroughly in classification, it has not yet been well-established for regression tasks. This paper considers the problem…

2018-06-20abs ↗pdf ↗

Unified approach to path planning using probabilistic inference on factor graphs.

problem Path planning problems using probabilistic inference.
method Unified framework using probabilistic factor graphs and message composition rules.
result Unified approach includes various algorithms like Sum-product, Max-product, Dynamic programming, and mixed criteria.

New algorithm for contextual combinatorial bandits with probabilistic arm triggering.

problem Optimizing decisions in dynamic environments with probabilistic arm availability.
method C^2-UCB-T and VAC^2-UCB algorithms with TPM and VM conditions.
result Achieved improved regret bounds for contextual combinatorial bandits.

We present a novel probabilistic clustering model for objects that are represented via pairwise distances and observed at different time points. The proposed method utilizes the information given by adjacent time points to find the underlying cluster structure and obtain a smooth cluster evolution. This approach allows…

2015-04-14abs ↗pdf ↗