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.

169,051 papers · 148 categories

Trend · papers per month

4590135180 · Jun 202019922001200920172026
48 results for unscented transformation

The unscented transformation (UT) is an efficient method to solve the state estimation problem for a non-linear dynamic system, utilizing a derivative-free higher-order approximation by approximating a Gaussian distribution rather than approximating a non-linear function. Applying the UT to a Kalman filter type estimat…

2016-08-26abs ↗pdf ↗

This study improves state estimation for nonlinear systems using conditional normalizing flows.

problem Performance degradation of traditional filtering algorithms in nonlinear systems with non-Gaussian uncertainty.
method Uses conditional normalizing flows with MLP, transformer, or state-space models for state and parameter estimation.
result Optimal-transport-inspired kinetic loss mitigates overparameterization in flows.

Many nonlinear extensions of the Kalman filter, e.g., the extended and the unscented Kalman filter, reduce the state densities to Gaussian densities. This approximation gives sufficient results in many cases. However, this filters only estimate states that are correlated with the observation. Therefore, sequential esti…

2012-07-18abs ↗pdf ↗

RCUKF combines data-driven modeling and Bayesian estimation for accurate system state estimation.

problem Challenges in obtaining reliable process models for complex systems.
method Integrates reservoir computing with unscented Kalman filtering.
result Demonstrated effectiveness on benchmark problems and real-time vehicle trajectory estimation.

A new method for estimating adversarial strategies in nonlinear systems.

problem Inferring an intelligent adversarial agent's strategy in highly nonlinear systems.
method Formulated inverse cognition as a nonlinear Gaussian state-space model and developed an inverse UKF (IUKF) system.
result The estimation error of IUKF converges and closely follows the recursive Cramér-Rao lower bound.

Paper uses UKS to improve BLE RSSI for proximity inference in mobile phone apps.

problem Improper BLE RSSI for accurate proximity inference during pandemics.
method Single-dimensional Unscented Kalman Smoother (UKS) with Gaussian process observation transforms.
result UKS outperforms traditional methods in predicting infection risk from BLE RSSI.

Robust optimization and statistical robustness improve robot navigation policies.

problem Efficiently finding optimal robot navigation policies in uncertain environments.
method Combining robust optimization and statistical robustness with improved Bayesian optimization techniques.
result Safe and repeatable robot navigation policies are achieved with improved robust optimization methods.

Novel digital twin for complex systems improves performance.

problem Lack of practical implementation details for stochastic nonlinear MDOF systems.
method Decouples time-scales, uses physics-based model, Bayesian filtering, and machine learning.
result Excellent performance of proposed digital twin framework validated by examples.

Convolutional Bayesian filtering generalizes state estimation by incorporating inequality conditions.

problem Standard Bayesian filtering assumes exact conditional probabilities, limiting its applicability.
method Introducing inequality conditions transforms conditional probabilities into convolutional forms, expanding the filtering framework.
result Convolutional Bayesian filtering encompasses standard Bayesian filtering and allows for more nuanced model consideration.

Novel F2NARX model improves surrogate modeling for stochastic dynamical systems.

problem Challenges in constructing accurate and efficient surrogate models for stochastic dynamical systems.
method Function-on-Function Nonlinear AutoRegressive model with eXogenous inputs (F2NARX) combining PCA and Gaussian process regression.
result F2NARX outperforms state-of-the-art NARX models in efficiency and accuracy.

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.

Many sensors, such as range, sonar, radar, GPS and visual devices, produce measurements which are contaminated by outliers. This problem can be addressed by using fat-tailed sensor models, which account for the possibility of outliers. Unfortunately, all estimation algorithms belonging to the family of Gaussian filters…

2015-09-14abs ↗pdf ↗

PDSim simulates and estimates commodity futures prices using polynomial diffusion models.

problem Simulating and estimating commodity futures prices using polynomial diffusion models.
method Developed an R package with a Shiny app for simulation and estimation of commodity futures prices using polynomial diffusion models.
result PDSim is the only package specifically designed for the simulation and estimation of the polynomial diffusion model.

Unified deep sequential and state-space models for robust option pricing with uncertainty.

problem Combining robustness to noise and uncertainty measurement in option pricing models.
method Unscattered reservoir smoother (URS) integrating deep sequential and state-space models.
result URS achieves competitive forecasting accuracy and uncertainty measurement in noisy datasets.

Develops a new model to better predict corporate bond yields.

problem Persistent shifts in interest rates undermine single-regime models.
method Regime-switching generalized CIR model with two-state short-rate process and credit factors.
result The model improves joint curve fit and delivers interpretable probabilities.

Sequential Monte Carlo (SMC), or particle filtering, is a popular class of methods for sampling from an intractable target distribution using a sequence of simpler intermediate distributions. Like other importance sampling-based methods, performance is critically dependent on the proposal distribution: a bad proposal c…

2015-06-10abs ↗pdf ↗

Paper develops efficient recursive learning for multi-channel systems with heterogeneous dynamics.

problem Accurately learning system dynamics in complex, multi-channel systems with nonlinear and noisy data.
method Formulates system as Gaussian process state-space models (GPSSMs), introduces heterogeneous multi-output kernel, and develops recursive inference framework.
result Matches SOTA offline GPSSMs in accuracy with 1/100 runtime, and outperforms SOTA online GPSSMs by 70% in accuracy under noise with 1/20 runtime.

Adaptive operator learning reduces costs in Bayesian inverse problems.

problem Reducing computational costs in Bayesian inverse problems governed by PDEs.
method Adaptive operator learning framework that gradually reduces modeling error.
result The approach significantly reduces computational costs while maintaining inversion accuracy.

Novel method uses Bayesian filters and PCRLB for state estimation of option prices.

problem Estimating unobserved latent variables from option prices.
method Posterior Cramer-Rao Lower Bound (PCRLB) based adaptive state estimation using various Bayesian filters.
result Proposed method outperforms individual filters and improves forecasting.

Study extends geodesic ray transform results to orientable surfaces.

problem Characterize and stabilize mixed and transverse ray transforms on surfaces.
method Algebraic arguments applied to various geometries and ray transforms.
result Characterization of kernel and stability for mixed and transverse ray transforms on orientable surfaces.

The paper introduces models to learn generalized transformation equivariant representations.

problem Capturing intrinsic visual structures equivariant to various transformations.
method Deterministic and probabilistic AutoEncoding Transformations (AET and AVT) models trained to learn visual representations from generic groups of transformations.
result Generalized TERs (GTERs) that are equivariant to transformations in a more general fashion.

This paper investigates efficient Transformers and finds they scale with problem size.

problem Finding suitable replacements for standard Transformers in large-scale tasks.
method Modeling efficient Transformers (Sparse and Linear) as Dynamic Programming problems and analyzing their reasoning capabilities.
result Efficient Transformers scale with problem size, but can be more efficient for certain DP problems.

Data is said to follow the transform (or analysis) sparsity model if it becomes sparse when acted on by a linear operator called a sparsifying transform. Several algorithms have been designed to learn such a transform directly from data, and data-adaptive sparsifying transforms have demonstrated excellent performance i…

2018-03-06abs ↗pdf ↗

Study normal operators of double fibration transforms with conjugate points.

problem Normal operators of double fibration transforms with conjugate points.
method Stable conditions on the distribution of conjugate points, splitting into elliptic and Fourier integral operators.
result Normal operator splits into an elliptic pseudodifferential operator and Fourier integral operators.

Transformer-MGK replaces redundant heads with Gaussian key mixtures, improving efficiency and performance.

problem Redundant attention heads in transformers degrade performance and efficiency.
method Transformer-MGK replaces redundant heads with a mixture of Gaussian keys.
result Transformer-MGK accelerates training and inference, reduces parameters and FLOPs, and achieves comparable or better accuracy.

Adversarial learning improves image augmentation for neural networks.

problem Improving data augmentation for neural networks with limited data.
method Adversarial learning using an encoder-decoder architecture with a spatial transformer network.
result Our approach outperforms previous generative data augmentation methods.

We study the dynamics of the discrete bicycle (Darboux, Backlund) transformation of polygons in n-dimensional Euclidean space. This transformation is a discretization of the continuous bicycle transformation, recently studied by Foote, Levi, and Tabachnikov. We prove that the respective monodromy is a Moebius transform…

2012-11-10abs ↗pdf ↗

Transformers struggle to approximate smooth functions, relying on piecewise constant approximations.

problem Understanding the expressivity of Transformers for function approximation.
method Theoretical analysis and experimental validation of Transformer's ability to approximate smooth functions.
result Transformers cannot reliably approximate smooth functions, relying on piecewise constant approximations.

We propose a new class of transforms that we call {\it Lehmer Transform} which is motivated by the {\it Lehmer mean function}. The proposed {\it Lehmer transform} decomposes a function of a sample into their constituting statistical moments. Theoretical properties of the proposed transform are presented. This transform…

2018-05-13abs ↗pdf ↗

The Weyl transform is introduced as a rich framework for data representation. Transform coefficients are connected to the Walsh-Hadamard transform of multiscale autocorrelations, and different forms of dyadic periodicity in a signal are shown to appear as different features in its Weyl coefficients. The Weyl transform …

2014-12-18abs ↗pdf ↗