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.
Enhances neural networks with prior function values to improve accuracy.
Study proposes learning optimal priors from data for better Bayesian inference.
A novel approach uses an ensemble of Gaussian processes for robust and adaptive reinforcement learning.
Boosts Q-learning by using value function bounds.
Bayesian optimisation is improved by incorporating expert prior through space warping.
A new approach combines prior knowledge with learning to adapt quickly to new tasks.
New Gaussian priors for neural networks improve scalability and Bayesian inference stability.
Paper proves Shapley value convergence in Bayesian learning games.
Binary encoding enables neural networks to extrapolate periodic functions.
Multi-armed bandits are a quintessential machine learning problem requiring the balancing of exploration and exploitation. While there has been progress in developing algorithms with strong theoretical guarantees, there has been less focus on practical near-optimal finite-time performance. In this paper, we propose an …
Paper presents a robust transfer learning method for active level set estimation.
New meta-reinforcement learning method improves performance in finite-horizon MDPs.
Existing Bayesian treatments of neural networks are typically characterized by weak prior and approximate posterior distributions according to which all the weights are drawn independently. Here, we consider a richer prior distribution in which units in the network are represented by latent variables, and the weights b…
Proposes PE-GP-UCB for time-varying Bayesian optimisation.
ColaBO accelerates optimization with user beliefs.
PPG separates policy and value function training phases for better reinforcement learning efficiency.
tvGP-VAE models tensor-valued latent variables with Gaussian processes for better data structure representation.
Enhances RL with function approximation, improving regret bounds.
Imitation learning, followed by reinforcement learning algorithms, is a promising paradigm to solve complex control tasks sample-efficiently. However, learning from demonstrations often suffers from the covariate shift problem, which results in cascading errors of the learned policy. We introduce a notion of conservati…
The paper introduces a method to learn and apply value envelopes for faster online reinforcement learning.
A simple, flexible approach to creating expressive priors in Gaussian process (GP) models makes new kernels from a combination of basic kernels, e.g. summing a periodic and linear kernel can capture seasonal variation with a long term trend. Despite a well-studied link between GPs and Bayesian neural networks (BNNs), t…
In many signal detection and classification problems, we have knowledge of the distribution under each hypothesis, but not the prior probabilities. This paper is aimed at providing theory to quantify the performance of detection via estimating prior probabilities from either labeled or unlabeled training data. The erro…
We take prior-to-crash market prices (NASDAQ, Dow Jones Industrial Average) as a signal, a function of time, we project these discrete values onto a vertical axis, thus obtaining a Cantordust. We study said cantordust with the tools of multifractal analysis, obtaining spectra by definition and by lagrangian coordinates…
Low-rank matrix estimation from incomplete measurements recently received increased attention due to the emergence of several challenging applications, such as recommender systems; see in particular the famous Netflix challenge. While the behaviour of algorithms based on nuclear norm minimization is now well understood…
In machine learning, it is common to optimize the parameters of a probabilistic model, modulated by an ad hoc regularization term that penalizes some values of the parameters. Regularization terms appear naturally in Variational Inference, a tractable way to approximate Bayesian posteriors: the loss to optimize contain…
Most learning algorithms are not invariant to the scale of the function that is being approximated. We propose to adaptively normalize the targets used in learning. This is useful in value-based reinforcement learning, where the magnitude of appropriate value approximations can change over time when we update the polic…
Study connects Gaussian processes and regularization for sequence-function mappings.
Bayesian methods for machine learning have been widely investigated, yielding principled methods for incorporating prior information into inference algorithms. In this survey, we provide an in-depth review of the role of Bayesian methods for the reinforcement learning (RL) paradigm. The major incentives for incorporati…
Compressed imitation learning uses simplicity priors for efficient expert behavior copying.
We introduce a new method to explain Gaussian processes using Shapley values.
This work extends Gaussian process priors to neural operators for function space mappings.
We characterize value functions in partially observable MDPs as semi-algebraic sets.
In sparse Bayesian learning (SBL), Gaussian scale mixtures (GSMs) have been used to model sparsity-inducing priors that realize a class of concave penalty functions for the regression task in real-valued signal models. Motivated by the relative scarcity of formal tools for SBL in complex-valued models, this paper propo…
The goal of imitation learning is for an apprentice to learn how to behave in a stochastic environment by observing a mentor demonstrating the correct behavior. Accurate prior knowledge about the correct behavior can reduce the need for demonstrations from the mentor. We present a novel approach to encoding prior knowl…
Additive Bayesian networks are types of graphical models that extend the usual Bayesian generalized linear model to multiple dependent variables through the factorisation of the joint probability distribution of the underlying variables. When fitting an ABN model, the choice of the prior of the parameters is of crucial…
Study optimizes insurance liability cash flows with regulatory capital requirements.
Gaussian processes are flexible function approximators, with inductive biases controlled by a covariance kernel. Learning the kernel is the key to representation learning and strong predictive performance. In this paper, we develop functional kernel learning (FKL) to directly infer functional posteriors over kernels. I…
Bayesian optimization improved for high-dimensional outputs using randomized priors.
This paper investigates optimal consumption in the stochastic Ramsey problem with the Cobb-Douglas production function. Contrary to prior studies, we allow for general consumption processes, without any a priori boundedness constraint. A non-standard stochastic differential equation, with neither Lipschitz continuity n…
Submodular functions can be exactly minimized in polynomial time, and the special case that graph cuts solve with max flow \cite{KZ:PAMI04} has had significant impact in computer vision \cite{BVZ:PAMI01,Kwatra:SIGGRAPH03,Rother:GrabCut04}. In this paper we address the important class of sum-of-submodular (SoS) function…
Berry et al. (1997) initiated the development of the infinite arms bandit problem. They derived a regret lower bound of all allocation strategies for Bernoulli rewards with uniform priors, and proposed strategies based on success runs. Bonald and Proutière (2013) proposed a two-target algorithm that achieves the regret…
Transformers can approximate Bayesian inference efficiently.
New research challenges the flatness-generalization link in deep neural networks.
Method recovers complex-valued signals from speckle-noised measurements.
In this paper, we study the effects of different prior and likelihood choices for Bayesian matrix factorisation, focusing on small datasets. These choices can greatly influence the predictive performance of the methods. We identify four groups of approaches: Gaussian-likelihood with real-valued priors, nonnegative prio…
Proposes a VAE variant for ordinal content factors.
This paper tackles the challenge presented by small-data to the task of Bayesian inference. A novel methodology, based on manifold learning and manifold sampling, is proposed for solving this computational statistics problem under the following assumptions: 1) neither the prior model nor the likelihood function are Gau…
We compute the expected value of the Kullback-Leibler divergence to various fundamental statistical models with respect to canonical priors on the probability simplex. We obtain closed formulas for the expected model approximation errors, depending on the dimension of the models and the cardinalities of their sample sp…