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

3256519761,301 · Jun 202019922001200920172026
48 results for general comparators

The study optimizes bounds for comparing training and population loss.

problem Optimizing bounds for comparing training and population loss.
method Derives generic information-theoretic and PAC-Bayesian generalization bounds using convex comparator functions.
result The tightest possible bound is obtained with the comparator being the convex conjugate of the CGF of the bounding distribution.

Algorithm provides online learning guarantees against general comparators in full and bandit feedback.

problem Adversarial online learning with data-dependent regret guarantees.
method Completely online algorithm with data-dependent regret guarantees for full and bandit feedback.
result Algorithm achieves expected performance against arbitrary comparator sequences in full and bandit feedback settings.

The ability to represent and compare machine learning models is crucial in order to quantify subtle model changes, evaluate generative models, and gather insights on neural network architectures. Existing techniques for comparing data distributions focus on global data properties such as mean and covariance; in that se…

2019-05-27abs ↗pdf ↗

In this paper, we integrate VAEs and flow-based generative models successfully and get f-VAEs. Compared with VAEs, f-VAEs generate more vivid images, solved the blurred-image problem of VAEs. Compared with flow-based models such as Glow, f-VAE is more lightweight and converges faster, achieving the same performance und…

2018-09-16abs ↗pdf ↗

This study compares deep generative models to traditional methods for generating financial time series.

problem Generating realistic multivariate financial time series for risk management and portfolio optimization.
method Systematic comparison of deep generative models (DGMs) against state-of-the-art parametric models on synthetic and empirical data.
result Deep generative models outperform traditional parametric models in generating financial time series.

This study compares the largest claims from two insurance portfolios using stochastic orderings.

problem Comparing the largest claims from two heterogeneous insurance portfolios.
method Used various stochastic orderings and established sufficient conditions associated with model parameters.
result Established sufficient conditions for comparing the largest claims from two insurance portfolios.

A general definition of a bimodule connection in noncommutative geometry has been recently proposed. For a given algebra this definition is compared with the ordinary definition of a connection on a left module over the associated enveloping algebra. The corresponding curvatures are also compared.

1995-12-04abs ↗pdf ↗

The paper introduces new metrics for evaluating generative models of behavior.

problem Lack of quantitative evaluation criteria for unsupervised behavior discovery.
method Proposed and investigated several metrics for generative models of behavior.
result The proposed metrics correspond with biologists' intuitions and allow for model evaluation and bias understanding.

In this paper we demonstrate predicting electroencephalograpgy (EEG) features from acoustic features using recurrent neural network (RNN) based regression model and generative adversarial network (GAN). We predict various types of EEG features from acoustic features. We compare our results with the previously studied p…

2020-02-29abs ↗pdf ↗

Research compares ML and Time Series methods for generating trading signals.

problem Efficiency of on-line learning Algorithms in generating trading signals.
method Used technical indicators and ensemble of Random Forests, also Kalman Filter.
result Kalman Filter outperformed Random Forests in on-line learning predictions of stock prices.

Study compares mutation validation and cross-validation for model selection.

problem Comparing model selection methods for generalization performance and computational efficiency.
method Empirical comparison using benchmark and real-world datasets with Bayesian tests.
result Both methods select models with equivalent generalization performance but MV selects simpler models and is computationally cheaper.

In this paper, we propose a fast surrogate leverage weighted sampling strategy to generate refined random Fourier features for kernel approximation. Compared to the current state-of-the-art method that uses the leverage weighted scheme [Li-ICML2019], our new strategy is simpler and more effective. It uses kernel alignm…

2019-11-20abs ↗pdf ↗

Paper compares generative and discriminative models in uncertainty quantification.

problem Comparing generative and discriminative approaches in uncertainty quantification.
method Analysis of generative and discriminative models, focusing on posterior predictive distribution and prior distributions.
result Discriminative models struggle with imbalanced datasets, while generative models offer a more flexible prior distribution.

Variational inference relies on flexible approximate posterior distributions. Normalizing flows provide a general recipe to construct flexible variational posteriors. We introduce Sylvester normalizing flows, which can be seen as a generalization of planar flows. Sylvester normalizing flows remove the well-known single…

2018-03-15abs ↗pdf ↗

The goal of this paper is to deal with a data scarcity scenario where deep learning techniques use to fail. We compare the use of two well established techniques, Restricted Boltzmann Machines and Variational Auto-encoders, as generative models in order to increase the training set in a classification framework. Essent…

2019-03-21abs ↗pdf ↗

Empirical study compares finite- and infinite-width BNNs, revealing performance differences under model mismatch.

problem Comparing BNNs with different widths due to conflicting model properties and inference intractability.
method Empirical comparison of finite- and infinite-width BNNs, analyzing performance under model mismatch.
result Increasing width can hurt BNN performance when the model is mis-specified, and finite-width BNNs generalize better under model mismatch.

The study compares M6 competitors' performance to industry benchmarks and discusses incentives for investment managers.

problem Investors seek to understand the performance and skill of M6 competitors beyond the competition's metrics.
method Comparative analysis using financial metrics, factor models, and new strategies.
result Most competitors do not generate significant out-performance compared to industry benchmarks, but some show skill in recent performance.

This paper compares unstructured and structured EM-based semi-supervised learning methods.

problem Semi-supervised learning with EM algorithm for structured prediction.
method Comparative study between unstructured and structured EM-based semi-supervised learning methods.
result Structured EM is more robust to class confusion in flood mapping datasets.

We examined the use of modern Generative Adversarial Nets to generate novel images of oil paintings using the Painter By Numbers dataset. We implemented Spectral Normalization GAN (SN-GAN) and Spectral Normalization GAN with Gradient Penalty, and compared their outputs to a Deep Convolutional GAN. Visually, and quantit…

2019-03-06abs ↗pdf ↗

One of the biggest challenges in the research of generative adversarial networks (GANs) is assessing the quality of generated samples and detecting various levels of mode collapse. In this work, we construct a novel measure of performance of a GAN by comparing geometrical properties of the underlying data manifold and …

2018-02-07abs ↗pdf ↗

The ability to accurately predict the fit of fashion items and recommend the correct size is key to reducing merchandise returns in e-commerce. A critical prerequisite of fit prediction is size normalization, the mapping of product sizes across brands to a common space in which sizes can be compared. At present, size n…

2019-08-27abs ↗pdf ↗

New Physics Learning Machine compares generative models for scientific research.

problem Evaluating the fidelity of generative models in high-energy physics.
method Two-sample hypothesis testing using machine learning.
result The New Physics Learning Machine outperforms alternative approaches in classification-based tests.

Paper introduces S3W distance for spherical probability distributions.

problem Comparing spherical probability distributions efficiently and accurately.
method S3W distance using stereographic projection and generalized Radon transform.
result Extensive theoretical analysis and evaluation of S3W performance.

We introduce two kernels that extend the mean map, which embeds probability measures in Hilbert spaces. The generative mean map kernel (GMMK) is a smooth similarity measure between probabilistic models. The latent mean map kernel (LMMK) generalizes the non-iid formulation of Hilbert space embeddings of empirical distri…

2010-05-03abs ↗pdf ↗

We develop a generic data-driven method for estimator selection in off-policy policy evaluation settings. We establish a strong performance guarantee for the method, showing that it is competitive with the oracle estimator, up to a constant factor. Via in-depth case studies in contextual bandits and reinforcement learn…

2020-02-18abs ↗pdf ↗

We compare various different definitions of "the category of smooth objects". The definitions compared are due to Chen, Frölicher, Sikorski, Smith, and Souriau. The method of comparison is to construct functors between the categories that enable us to see how the categories relate to each other. This produces a diagram…

2008-02-15abs ↗pdf ↗

We study the Lipschitz metric on Teichmuller space (defined by Thurston) and compare it with the Teichmuller metric. We show that in the thin part of Teichmuller space the Lipschitz metric is approximated up to bounded additive distortion by the sup metric on a product of lower-dimensional spaces (similar to the Teichm…

2005-10-07abs ↗pdf ↗

We compare the star surgery operations introduced in [KS] to the generalized rational blow-down. We show that star surgery shares the properties that make rational blow-down useful for constructions of small exotic symplectic 4-manifolds. Then we show that star surgery operations provide a strictly more general class o…

2014-07-11abs ↗pdf ↗

Deep generative models are powerful tools that have produced impressive results in recent years. These advances have been for the most part empirically driven, making it essential that we use high quality evaluation metrics. In this paper, we provide new insights into the Inception Score, a recently proposed and widely…

2018-01-06abs ↗pdf ↗

Generative models are known to be difficult to assess. Recent works, especially on generative adversarial networks (GANs), produce good visual samples of varied categories of images. However, the validation of their quality is still difficult to define and there is no existing agreement on the best evaluation process. …

2018-06-28abs ↗pdf ↗

Proposes a score to compare rule-based algorithms' interpretability.

problem Lack of consensus on interpretability for predictive models.
method Defines a score with three terms: predictivity, stability, and simplicity, each quantified by simple formulas.
result Compares interpretability of rule-based and tree-based algorithms for regression and classification.

Study benchmarks methods for learning non-Cartesian k-space trajectories and reconstruction.

problem Benchmarking methods for learning non-Cartesian k-space trajectories and reconstruction.
method Comparing PILOT, BJORK, and HybLearn schemes to learn non-Cartesian k-space trajectories and reconstruction.
result HybLearn scheme outperforms other methods in learning and comparing non-Cartesian k-space trajectories and reconstruction.

PolyGraph Discrepancy improves graph generative model evaluation.

problem Inability of existing metrics to provide an absolute performance measure and comparability across different graph descriptors.
method Approximates Jensen-Shannon distance using binary classifiers trained to distinguish between real and generated graphs.
result PGD provides a more robust and insightful evaluation compared to MMD metrics.

We present a new autoencoder-type architecture that is trainable in an unsupervised mode, sustains both generation and inference, and has the quality of conditional and unconditional samples boosted by adversarial learning. Unlike previous hybrids of autoencoders and adversarial networks, the adversarial game in our ap…

2017-04-07abs ↗pdf ↗

New metric compares noisy neural trajectories using optimal transport.

problem Existing metrics fail to capture differences in noisy, dynamic neural responses.
method Proposed an optimal transport distance metric for Gaussian processes.
result Metric effectively compares neural dynamics in different systems.

Proposes GDTW for aligning time series on different, incomparable spaces.

problem Dynamic time warping requires comparable spaces, but time series can live on different, incomparable spaces.
method Gromov dynamic time warping (GDTW) considers intra-relational geometry to avoid comparability requirements.
result Demonstrates effectiveness of GDTW in aligning, combining, and comparing time series on incomparable spaces.

Unified study of nine multi-output conformal methods with generalized scores.

problem Challenges in extending conformal prediction to multi-output problems.
method Nine conformal methods with generalized multi-output conformity scores.
result Generalized scores ensure asymptotic conditional coverage and exact finite-sample marginal coverage.