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

136272408544 · Jun 202019922001200920172026
48 results for Quasi-Periodic Gaussian Processes

This work uses QPGPs to improve ILC performance in repetitive tasks.

problem Performance degradation in repetitive motion tasks due to environmental changes and robot wear.
method Incorporates Quasi-Periodic Gaussian Processes into a predictive ILC framework.
result The proposed approach achieves faster convergence and robustness under disturbances.

Paper proposes TBSD for efficient anomaly detection in textured images.

problem Challenges in anomaly detection for textured images, especially in manufacturing systems.
method Texture basis integrated smooth decomposition (TBSD) approach.
result TBSD surpasses benchmarks with less misidentification and superior performance.

By and large the behavior of stochastic gradient is regarded as a challenging problem, and it is often presented in the framework of statistical machine learning. This paper offers a novel view on the analysis of on-line models of learning that arises when dealing with a generalized version of stochastic gradient that …

2018-07-14abs ↗pdf ↗

The M and A transactions represent a wide range of unique business optimization opportunities in the corporate transformation deals, which are usually characterized by the high level of total risk. The M and A transactions can be successfully implemented by taking to an account the size of investments, purchase price, …

2015-02-06abs ↗pdf ↗

We show the existence of 1-parameter families of non-periodic, complete, embedded minimal surfaces in euclidean space with infinitely many parallel planar ends. In particular we are able to produce finite genus examples and quasi-periodic examples of infinite genus.

2010-11-30abs ↗pdf ↗

The paper proposes a method to improve Bayesian inference for periodic data using data-driven priors.

problem Efficiency in approximating posterior distribution in models with periodicity.
method Construct a prior distribution from data using a Gaussian process with a periodic kernel, approximated using adaptive importance sampling.
result The proposed method improves the marginal posterior distribution of the period parameter.

The paper explores the geometry of level lines of quasiperiodic functions with many periods.

problem Describing the geometry of level lines of quasi-periodic functions with a large number of periods.
method Generalizes the Novikov problem to the multidimensional case of quasiperiodic functions.
result Arises of open or closed level lines of arbitrarily large sizes.

Consider a Riemannian metric on two-torus. We prove that the question of existence of polynomial first integrals leads naturally to a remarkable system of quasi-linear equations which turns out to be a Rich system of conservation laws. This reduces the question of integrability to the question of existence of smooth (q…

2009-07-29abs ↗pdf ↗

Latent force models (LFM) are principled approaches to incorporating solutions to differential equations within non-parametric inference methods. Unfortunately, the development and application of LFMs can be inhibited by their computational cost, especially when closed-form solutions for the LFM are unavailable, as is …

2013-10-23abs ↗pdf ↗

For the class of quasi-periodic solutions of the vortex filament equation, we study connections between the algebro-geometric data used for their explicit construction and the geometry of the evolving curves. We give a complete description of genus one solutions, including geometrically interesting special cases such a…

2004-11-30abs ↗pdf ↗

Probabilistic programming aids in automatically dating ice cores, reducing manual error and uncertainty.

problem Automatically dating ice cores with high accuracy and capturing uncertainty.
method Probabilistic models and probabilistic programming for automatic inference.
result Demonstrated the use of probabilistic programming for ice core dating, showcasing its benefits and limitations.

Multi-dimensional state-integrals of products of Faddeev's quantum dilogarithms arise frequently in Quantum Topology, quantum Teichmüller theory and complex Chern--Simons theory. Using the quasi-periodicity property of the quantum dilogarithm, we evaluate 1-dimensional state-integrals at rational points and express the…

2014-11-22abs ↗pdf ↗

Study shows invariant curves in tubular origami dynamics, revealing geometric barriers to folding transitions.

problem Understanding the dynamics and geometric barriers in tubular origami structures.
method Kolmogorov--Arnold--Moser (KAM) theory and numerical simulations.
result Invariant curves persist in large module limits, providing phase-space interpretation of folding modes.

In this paper, we study two classes of planar self-similar fractals TεT_\varepsilon with a shifting parameter ε\varepsilon. The first one is a class of self-similar tiles by shifting xx-coordinates of some digits. We give a detailed discussion on the disk-likeness ({\it i.e., the property of being a topological disk}…

2017-01-05abs ↗pdf ↗

Gaussian processes struggle with compositional functions, but deep Gaussian processes can outperform.

problem Gaussian process regression struggles with compositional functions.
method We study information-theoretic lower bounds for posterior contraction rates in Gaussian process regression for a continuous regression model.
result Posterior based on any mean-zero Gaussian process can only recover the truth at a rate strictly slower than the minimax rate for generalized additive functions.

New sparse Gaussian process method tackles unconstrained regression problems.

problem Dealing with physical systems that satisfy inequality constraints.
method Extends constrained Gaussian process by redefining hat basis functions.
result Reduces computational complexity from O(n3)O(n^{3}) to O(nm2)O(nm^{2}).

Elliptical processes generalize Gaussian and Student-t models with fat tails and computational efficiency.

problem Need for models with fat tails and computational tractability.
method Represent elliptical distributions as continuous mixtures of Gaussian distributions, derive closed-form expressions for marginal and conditional distributions.
result Elliptical processes offer advantages in robust regression compared to Gaussian processes.

Gaussian process priors are commonly used in aerospace design for performing Bayesian optimization. Nonetheless, Gaussian processes suffer two significant drawbacks: outliers are a priori assumed unlikely, and the posterior variance conditioned on observed data depends only on the locations of those data, not the assoc…

2018-01-18abs ↗pdf ↗

Gaussian processes are used in machine learning to learn input-output mappings from observed data. Gaussian process regression is based on imposing a Gaussian process prior on the unknown regressor function and statistically conditioning it on the observed data. In system identification, Gaussian processes are used to …

2019-07-13abs ↗pdf ↗

This note explains when neural networks can be seen as Gaussian processes.

problem Understanding the relationship between neural networks and Gaussian processes.
method Formulating a Gaussian process regression based on neural network outputs and analyzing the resulting posterior mean functions.
result The posterior mean functions of neural networks follow a Gaussian process in certain cases, providing an interpretation of reproducing kernel Hilbert spaces.

Graph Gaussian processes use Matérn models for better function learning.

problem Lack of Gaussian process models for graph input spaces.
method Stochastic partial differential equation characterization of Matérn Gaussian processes.
result Graph Matérn Gaussian processes inherit properties of Euclidean and Riemannian models and can be trained efficiently.

Gaussian processes adapted for non-Euclidean spaces enhance decision-making.

problem Applying Gaussian processes in non-Euclidean spaces.
method Developed pathwise conditioning and Gaussian process models over non-Euclidean spaces.
result Efficient Gaussian process models for non-Euclidean spaces.

We investigate the Student-t process as an alternative to the Gaussian process as a nonparametric prior over functions. We derive closed form expressions for the marginal likelihood and predictive distribution of a Student-t process, by integrating away an inverse Wishart process prior over the covariance kernel of a G…

2014-02-18abs ↗pdf ↗

Pitch or fundamental frequency (f0) extraction is a fundamental problem studied extensively for its potential applications in speech and clinical applications. In literature, explicit mode specific (modal speech or singing voice or emotional/ expressive speech or noisy speech) signal processing and deep learning f0 ext…

2019-04-22abs ↗pdf ↗

This paper speeds up Gaussian process regression for autocorrelated data.

problem Temporal overfitting in Gaussian process models for autocorrelated data.
method Modifying existing Gaussian process approximations to handle blocked, de-correlated data.
result Proposed methods accelerate Gaussian process regression on autocorrelated data without sacrificing performance.

Optimizes Gaussian process hyperparameters using Bayesian autoregression.

problem Optimizing hyperparameters for Matérn kernel temporal Gaussian processes.
method Recursive Bayesian estimation for autoregressive parameters.
result Outperforms traditional optimization methods in runtime and accuracy.

Deep Gaussian Processes with polynomial kernels can collapse rapidly without proper hyperparameter tuning.

problem The collapse of Deep Gaussian Processes with polynomial kernels without careful hyperparameter tuning.
method Analysis using the Berry-Esseen Theorem and observation of prior behavior.
result The prior of a Deep Gaussian Process collapses rapidly towards zero or places negligible mass on low norm functions without proper hyperparameter tuning.

Gaussian processes adapted for Riemannian manifolds using gauge-independent kernels.

problem Deploying Gaussian processes on non-Euclidean domains like Riemannian manifolds.
method Developed techniques to generalize Gaussian processes to vector fields on Riemannian manifolds using gauge-independent kernels.
result Enabled training of vector-valued Gaussian processes on Riemannian manifolds using standard Gaussian process methods.

The paper introduces a non-linear version of the process convolution formalism for building covariance functions for multi-output Gaussian processes. The non-linearity is introduced via Volterra series, one series per each output. We provide closed-form expressions for the mean function and the covariance function of t…

2018-10-10abs ↗pdf ↗

In this manuscript we introduce numerical Gaussian process Kalman filtering (GPKF). Numerical Gaussian processes have recently been developed to simulate spatiotemporal models. The contribution of this paper is to embed numerical Gaussian processes into the recursive Kalman filter equations. This embedding enables us t…

2019-12-03abs ↗pdf ↗

New Gaussian min-max theorem extends classical results to non-i.i.d. Gaussian matrices.

problem Extending classical Gaussian min-max theorems to non-i.i.d. Gaussian matrices.
method Identifying a new pair of Gaussian processes that satisfy comparison inequalities.
result New Gaussian min-max and convex Gaussian min-max theorems with applications in multi-source Gaussian regression and binary classification.

This paper proposes a method to approximate non-Gaussian likelihoods in Gaussian Processes.

problem Approximating non-Gaussian likelihoods in Gaussian Processes.
method Proposes a piece-wise constant approximation for the inverse-link function.
result Yields a closed form solution for the SVGP lower bound.

This paper shows how infinitely wide Tensor Networks converge to Gaussian Processes.

problem Understanding the relationship between Tensor Networks and Gaussian Processes.
method Analyzing the infinite-width limit of Tensor Networks and comparing them to Gaussian Processes.
result Infinitely wide Tensor Networks converge to Gaussian Processes, proving their equivalence.