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

105210315420 · Jun 202019922001200920172026
48 results for empirical draws

We study a bad arm existing checking problem in which a player's task is to judge whether a positive arm exists or not among given K arms by drawing as small number of arms as possible. Here, an arm is positive if its expected loss suffered by drawing the arm is at least a given threshold. This problem is a formalizati…

2019-01-31abs ↗pdf ↗

CSP improves time-series forecasting without training, outperforming DeepNPTS in speed and accuracy.

problem Improving probabilistic time-series forecasting without training.
method Mixing empirical and residual draws around a seasonal naive forecast.
result CSP significantly outperforms DeepNPTS on CRPS, normalized mean quantile loss, and coverage metrics.

Euler and Delisle developed a map method for the Russian Empire, which is now outperformed by the Lambert conformal conical projection.

problem Mapping a country onto a flat map while minimizing distortion.
method Developed a heuristic method for mapping the Russian Empire, which was later named Delisle--Euler map.
result The Lambert conformal conical projection outperforms the Delisle--Euler map in several respects.

Despite the huge empirical success of deep learning, theoretical understanding of neural networks learning process is still lacking. This is the reason, why some of its features seem "mysterious". We emphasize two mysteries of deep learning: generalization mystery, and optimization mystery. In this essay we review and …

2019-05-17abs ↗pdf ↗

The modern scale of data has brought new challenges to Bayesian inference. In particular, conventional MCMC algorithms are computationally very expensive for large data sets. A promising approach to solve this problem is embarrassingly parallel MCMC (EP-MCMC), which first partitions the data into multiple subsets and r…

2015-06-10abs ↗pdf ↗

In this paper, I present VQ-DRAW, an algorithm for learning compact discrete representations of data. VQ-DRAW leverages a vector quantization effect to adapt the sequential generation scheme of DRAW to discrete latent variables. I show that VQ-DRAW can effectively learn to compress images from a variety of common datas…

2020-03-03abs ↗pdf ↗

New method predicts binary matrix entries using empirical Bayes and low-rank structure.

problem Predicting unobserved entries in binary matrices.
method Empirical Bayes method motivated by Efron--Morris estimator, exploiting low-rank structure.
result Superior performance in predictive accuracy, calibration, and efficiency compared to existing methods.

We draw a formal connection between using synthetic training data to optimize neural network parameters and approximate, Bayesian, model-based reasoning. In particular, training a neural network using synthetic data can be viewed as learning a proposal distribution generator for approximate inference in the synthetic-d…

2017-03-02abs ↗pdf ↗

We present a new Markov chain Monte Carlo method for estimating posterior probabilities of structural features in Bayesian networks. The method draws samples from the posterior distribution of partial orders on the nodes; for each sampled partial order, the conditional probabilities of interest are computed exactly. We…

2012-02-14abs ↗pdf ↗

In this paper, we propose FedGP, a framework for privacy-preserving data release in the federated learning setting. We use generative adversarial networks, generator components of which are trained by FedAvg algorithm, to draw privacy-preserving artificial data samples and empirically assess the risk of information dis…

2019-10-18abs ↗pdf ↗

The paper improves semi-supervised learning using ff-divergences and αα-Rényi divergences.

problem Improving semi-supervised learning with noisy pseudo-labels.
method Inspired by ff-divergences and αα-Rényi divergences, the paper develops new empirical risk functions and regularization techniques.
result The new methods show better performance than traditional self-training methods, especially in noisy pseudo-label scenarios.

We present sketch-rnn, a recurrent neural network (RNN) able to construct stroke-based drawings of common objects. The model is trained on thousands of crude human-drawn images representing hundreds of classes. We outline a framework for conditional and unconditional sketch generation, and describe new robust training …

2017-04-11abs ↗pdf ↗

In this paper, we propose generating artificial data that retain statistical properties of real data as the means of providing privacy with respect to the original dataset. We use generative adversarial network to draw privacy-preserving artificial data samples and derive an empirical method to assess the risk of infor…

2018-03-08abs ↗pdf ↗

YOASOVI improves stochastic VI for large models with fast, self-correcting sampling.

problem Efficiently performing stochastic Variational Inference on large Bayesian models.
method YOASOVI uses acceptance sampling to draw only one sample per iteration, improving convergence speed and accuracy.
result YOASOVI converges faster and more accurately than regular Monte Carlo and Quasi-Monte Carlo methods.

There are three main thrusts to this article: a new proof of Levi's Enlargement Lemma for pseudoline arrangements in the real projective plane; a new characterization of pseudolinear drawings of the complete graph; and proofs that pseudolinear and convex drawings of KnK_n have n2+n^2+{}O(nlogn)(n\log n) and O(n2)(n^2), respect…

2015-11-21abs ↗pdf ↗

Unified calibration metrics improve forecast sharpness and accuracy.

problem Improving the sharpness of probabilistic forecasts while maintaining calibration.
method Kernel-based calibration metrics that unify and generalize existing methods for classification and regression.
result Enhanced calibration, sharpness, and decision-making across various tasks.

Randomized control methods improve asset pricing and performance analysis.

problem Challenges in drawing inferences from traditional random portfolios in performance evaluation.
method Geometric random walks and Markov chain Monte Carlo methods to construct flexible control groups.
result Captured premia associated with size, value, quality, and momentum in a constrained setting.

Monte Carlo methods are essential tools for Bayesian inference. Gibbs sampling is a well-known Markov chain Monte Carlo (MCMC) algorithm, extensively used in signal processing, machine learning, and statistics, employed to draw samples from complicated high-dimensional posterior distributions. The key point for the suc…

2016-11-21abs ↗pdf ↗

Bayesian Empirical Bayes extends EB to complex structures using probabilistic symmetry.

problem Improving simultaneous inference in complex settings like arrays and graphs.
method Generalized empirical Bayes approach based on probabilistic symmetry.
result BEB outperforms existing methods in denoising arrays and spatial data.

Sub-sampling is a common and often effective method to deal with the computational challenges of large datasets. However, for most statistical models, there is no well-motivated approach for drawing a non-uniform subsample. We show that the concept of an asymptotically linear estimator and the associated influence func…

2017-09-06abs ↗pdf ↗

We introduce a data-driven order reduction method for nonlinear control systems, drawing on recent progress in machine learning and statistical dimensionality reduction. The method rests on the assumption that the nonlinear system behaves linearly when lifted into a high (or infinite) dimensional feature space where ba…

2011-08-14abs ↗pdf ↗

New method learns high-quality Laplacian representations for reinforcement learning.

problem Lack of accurate Laplacian representations in large or continuous state spaces.
method Reformulated spectral graph drawing objective to have eigenvectors as unique global minimizer.
result Learned Laplacian representations more faithfully approximate the ground truth.

In Bayesian inference, the posterior distributions are difficult to obtain analytically for complex models such as neural networks. Variational inference usually uses a parametric distribution for approximation, from which we can easily draw samples. Recently discrete approximation by particles has attracted attention …

2018-05-21abs ↗pdf ↗

A new method for spotting symbols in CAD images reduces annotation costs and improves accuracy.

problem Challenging task of labeling symbols from CAD drawings.
method Pixel-wise point location via Progressive Gaussian Kernels (PGK) and local offset.
result The proposed method achieves good generalization on real-world CAD images.

The paper evaluates index-based allocation policies using data from randomized control trials.

problem Evaluating index-based allocation policies in resource-scarce scenarios.
method Using data from randomized control trials, the paper introduces an efficient estimator and methods for computing asymptotically correct confidence intervals.
result Valid statistical conclusions can be drawn for index-based allocation policies.

We suggest an empirical model of investment strategy returns which elucidates the importance of non-Gaussian features, such as time-varying volatility, asymmetry and fat tails, in explaining the level of expected returns. Estimating the model on the (former) Lehman Brothers Hedge Fund Index data, we demonstrate that th…

2011-12-05abs ↗pdf ↗

Distributional approaches to value-based reinforcement learning model the entire distribution of returns, rather than just their expected values, and have recently been shown to yield state-of-the-art empirical performance. This was demonstrated by the recently proposed C51 algorithm, based on categorical distributiona…

2018-02-22abs ↗pdf ↗