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.
Unified bounds for iterative algorithms with Gaussian data matrices.
Develops CLDS models to model neural activity with nonlinear dynamics.
Transformers can solve complex filtering problems for non-Gaussian signals.
New method speeds up inference for non-conjugate Gaussian processes.
Providing meaningful privacy to users of location based services is particularly challenging when multiple locations are revealed in a short period of time. This is primarily due to the tremendous degree of dependence that can be anticipated between points. We propose a Rényi differentially private framework for boundi…
Nonparametric regression for massive numbers of samples (n) and features (p) is an increasingly important problem. In big n settings, a common strategy is to partition the feature space, and then separately apply simple models to each partition set. We propose an alternative approach, which avoids such partitioning and…
The multiresolution Gaussian process (GP) has gained increasing attention as a viable approach towards improving the quality of approximations in GPs that scale well to large-scale data. Most of the current constructions assume full independence across resolutions. This assumption simplifies the inference, but it under…
We analyze the fluctuation of the loss from default around its large portfolio limit in a class of reduced-form models of correlated firm-by-firm default timing. We prove a weak convergence result for the fluctuation process and use it for developing a conditionally Gaussian approximation to the loss distribution. Nume…
TSFlow uses Gaussian processes to match priors for better time series forecasting.
We propose a new scalable multi-class Gaussian process classification approach building on a novel modified softmax likelihood function. The new likelihood has two benefits: it leads to well-calibrated uncertainty estimates and allows for an efficient latent variable augmentation. The augmented model has the advantage …
New method for Bayesian neural networks with unbounded weights.
Automated denoising score matching handles nonlinear diffusion processes.
We propose a family of models that enable predictive estimation of time-varying extreme event probabilities in heavy-tailed and nonlinearly dependent time series. The models are a white noise process with conditionally log-Laplace stochastic volatility. In contrast to other, similar stochastic volatility formalisms, th…
NCS enables efficient and accurate conditional simulation for complex spatial processes.
We study a well-known estimator of the fractal index of a stochastic process. Our framework is very general and encompasses many models of interest; we show how to extend the theory of the estimator to a large class of non-Gaussian processes. Particular focus is on clarity and ease of implementation of the estimator an…
Pre-conditioning is a well-known concept that can significantly improve the convergence of optimization algorithms. For noise-free problems, where good pre-conditioners are not known a priori, iterative linear algebra methods offer one way to efficiently construct them. For the stochastic optimization problems that dom…
We consider the problem of maximizing expected utility from terminal wealth in models with stochastic factors. Using martingale methods and a conditioning argument, we determine the optimal strategy for power utility under the assumption that the increments of the asset price are independent conditionally on the factor…
A new approach simplifies multitask Gaussian processes without rank approximations.
We consider multi-task regression models where observations are assumed to be a linear combination of several latent node and weight functions, all drawn from Gaussian process (GP) priors that allow nonzero covariance between grouped latent functions. We show that when these grouped functions are conditionally independ…
New bounds on neural network convergence using information theory.
We characterize the combinatorial structure of conditionally-i.i.d. sequences of negative binomial processes with a common beta process base measure. In Bayesian nonparametric applications, such processes have served as models for latent multisets of features underlying data. Analogously, random subsets arise from cond…
TERA method speeds up derivative Gaussian processes in high dimensions.
We revisit the Bayesian online inference problems for the linear dynamic systems (LDS) under non- Gaussian environment. The noises can naturally be non-Gaussian (skewed and/or heavy tailed) or to accommodate spurious observations, noises can be modeled as heavy tailed. However, at the cost of such noise robustness, the…
We develop constructions for exchangeable sequences of point processes that are rendered conditionally-i.i.d. negative binomial processes by a (possibly unknown) random measure called the base measure. Negative binomial processes are useful in Bayesian nonparametrics as models for random multisets, and in applications …
Improved speech enhancement using diffusion models with MSE loss.
A one-factor asset pricing model with an Ornstein--Uhlenbeck process as its state variable is studied under partial information: the mean-reverting level and the mean-reverting speed parameters are modeled as hidden/unobservable stochastic variables. No-arbitrage pricing formulas for derivative securities written on a …
Several important families of computational and statistical results in machine learning and randomized algorithms rely on uniform bounds on quadratic forms of random vectors or matrices. Such results include the Johnson-Lindenstrauss (J-L) Lemma, the Restricted Isometry Property (RIP), randomized sketching algorithms, …
New model captures time and mark inter-dependence in TPPs.
New bounds for kernel regression under non-Gaussian noise.
The class of Schoenberg transformations, embedding Euclidean distances into higher dimensional Euclidean spaces, is presented, and derived from theorems on positive definite and conditionally negative definite matrices. Original results on the arc lengths, angles and curvature of the transformations are proposed, and v…
Introduces CSLC models to bridge deep generative models and classical algorithms.
We describe a mechanism by which artificial neural networks can learn rapid adaptation - the ability to adapt on the fly, with little data, to new tasks - that we call conditionally shifted neurons. We apply this mechanism in the framework of metalearning, where the aim is to replicate some of the flexibility of human …
One of the major shortcomings of variational autoencoders is the inability to produce generations from the individual modalities of data originating from mixture distributions. This is primarily due to the use of a simple isotropic Gaussian as the prior for the latent code in the ancestral sampling procedure for the da…
The paper provides non-asymptotic Edgeworth expansions for neural network outputs.
New PFPPs based on rank-dependent utility for better performance control.
Gaussian graphical models (GGM) have been widely used in many high-dimensional applications ranging from biological and financial data to recommender systems. Sparsity in GGM plays a central role both statistically and computationally. Unfortunately, real-world data often does not fit well to sparse graphical models. I…
We investigate, focusing on the ruin probability, an adaptation of the Cramer-Lundberg model for the surplus process of an insurance company, in which, conditionally on their intensities, the two mixed Poisson processes governing the arrival times of the premiums and of the claims respectively, are independent. Such a …
Bayesian approach approximates probability functions of Gaussian mixtures.
Bayesian deep neural networks converge to processes with α-stable marginals under infinite variance weights.
In this work, we study stability of distributed filtering of Markov chains with finite state space, partially observed in conditionally Gaussian noise. We consider a nonlinear filtering scheme over a Distributed Network of Agents (DNA), which relies on the distributed evaluation of the likelihood part of the centralize…
Conditions for geometric ergodicity of multivariate autoregressive conditional heteroskedasticity (ARCH) processes, with the so-called BEKK (Baba, Engle, Kraft, and Kroner) parametrization, are considered. We show for a class of BEKK-ARCH processes that the invariant distribution is regularly varying. In order to accou…
We revisit the development of grid based recursive approximate filtering of general Markov processes in discrete time, partially observed in conditionally Gaussian noise. The grid based filters considered rely on two types of state quantization: The \textit{Markovian} type and the \textit{marginal} type. We propose a s…
New framework models neural systems with random architecture on manifolds.
Algorithm estimates parameters over time-varying graphs without special assumptions.
New Bayesian method for joint sparse parameter inference.
A new neural subsampling method reduces data volume for deep models.
The Multiplicative Error Model (Engle (2002)) for nonnegative valued processes is specified as the product of a (conditionally autoregressive) scale factor and an innovation process with nonnegative support. A multivariate extension allows for the innovations to be contemporaneously correlated. We overcome the lack of …
New algorithm optimizes PAC-Bayes bound without surrogate loss.