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.
This paper presents a new algorithm, termed \emph{truncated amplitude flow} (TAF), to recover an unknown vector x from a system of quadratic equations of the form yi=∣⟨ai,x⟩∣2, where ai's are given random measurement vectors. This problem is known to be \emph{NP-hard} in genera…
Blind deconvolution is a ubiquitous problem of recovering two unknown signals from their convolution. Unfortunately, this is an ill-posed problem in general. This paper focuses on the {\em short and sparse} blind deconvolution problem, where the one unknown signal is short and the other one is sparsely and randomly sup…
As in standard linear regression, in truncated linear regression, we are given access to observations (Ai,yi)i whose dependent variable equals yi=AiT⋅x∗+ηi, where x∗ is some fixed unknown vector of interest and ηi is independent noise; except we are only given an observation if its dep…
We provide an efficient algorithm for the classical problem, going back to Galton, Pearson, and Fisher, of estimating, with arbitrary accuracy the parameters of a multivariate normal distribution from truncated samples. Truncated samples from a d-variate normal N(μ,Σ) means a samples is only re…
In structured output prediction tasks, labeling ground-truth training output is often expensive. However, for many tasks, even when the true output is unknown, we can evaluate predictions using a scalar reward function, which may be easily assembled from human knowledge or non-differentiable pipelines. But searching th…
The paper presents a method to infer unknown forcing functions in differential equations using Gaussian processes and adjoints.
problem Inferring unknown forcing functions in differential equations from noisy observations.
method Using adjoint methods to efficiently infer Gaussian process (GP) driven differential equations, with truncated basis expansions of the GP kernel.
result Efficient Bayesian inference of forcing functions modeled as GPs using adjoints, with lower computation than MCMC methods.
Optimality of TS with noninformative priors proven for Pareto model.
problem Optimality of Thompson Sampling with noninformative priors for Pareto bandits.
method Proved optimality of TS with certain probability matching priors, showed suboptimality with others, and found effectiveness of truncation procedures.
result TS with certain probability matching priors achieves optimal regret bound for Pareto model.
We show how to compute lower bounds for the supremum Bayes error if the class-conditional distributions must satisfy moment constraints, where the supremum is with respect to the unknown class-conditional distributions. Our approach makes use of Curto and Fialkow's solutions for the truncated moment problem. The lower …
The problem of an arbitrary truncated Levy flight description using the method of cumulant approach has been solved. The set of cumulants of the truncated Levy distribution given the assumption of arbitrary truncation has been found. The influence of truncation shape on the truncated Levy flight properties in the Gauss…
A novel approach termed \emph{stochastic truncated amplitude flow} (STAF) is developed to reconstruct an unknown n-dimensional real-/complex-valued signal x from m `phaseless' quadratic equations of the form ψi=∣⟨ai,x⟩∣. This problem, also known as phase retrieval from magnitude-onl…
In the paper "On Truncated Variation of Brownian Motion with Drift" (Bull. Pol. Acad. Sci. Math. 56 (2008), no.4, 267 - 281) we defined truncated variation of Brownian motion with drift, Wt=Bt+μt,t≥0, where (Bt) is a standard Brownian motion. Truncated variation differs from regular variation by neglect…
Truncated backpropagation through time (TBPTT) is a popular method for learning in recurrent neural networks (RNNs) that saves computation and memory at the cost of bias by truncating backpropagation after a fixed number of lags. In practice, choosing the optimal truncation length is difficult: TBPTT will not converge …
We consider an appoximation of a catenoid constructed from "odd" truncated cones that maintains minimality in a certain sense. Thorough this procedure, we obtain a discrete curve approximating a catenary by exploiting the fact that it is the function that generates a catenoid. In this investigation, the theory of the G…
The generalized correlation approach, which has been successfully used in statistical radio physics to describe non-Gaussian random processes, is proposed to describe stochastic financial processes. The generalized correlation approach has been used to describe a non-Gaussian random walk with independent, identically d…