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,695 papers · 148 categories

Trend · papers per month

153307460613 · Jun 202019922001200920172026
48 results for real-data applications

New method ensures generated data statistics match real data distributions.

problem Ensuring generated data statistics match real data distributions in GANs.
method Added a new loss term to the generator loss function using f-divergences and kernel density estimation.
result Improved performance on synthetic and real-world datasets.

The paper introduces negative controls to evaluate causal discovery algorithms, improving their reliability.

problem Lack of a general guideline for evaluating causal discovery algorithms.
method Derive exact distributional results under random guessing for evaluation metrics and propose a pipeline for using negative controls.
result Evaluation metrics can achieve very favorable values under random guessing, highlighting the need for negative control results.

Particle physics or High Energy Physics (HEP) studies the elementary constituents of matter and their interactions with each other. Machine Learning (ML) has played an important role in HEP analysis and has proven extremely successful in this area. Usually, the ML algorithms are trained on numerical simulations of the …

2019-12-17abs ↗pdf ↗

A framework schedules hyperparameters for model-based reinforcement learning, improving performance.

problem Inadequate scheduling of hyperparameters in model-based reinforcement learning.
method Theoretical analysis and AutoMBPO framework to automatically schedule real data ratio and other hyperparameters.
result Training with hyperparameters scheduled by AutoMBPO significantly improves performance.

Paper develops approximation and statistical theory for signature-based path regression.

problem Understanding how fast signatures approximate continuous path functionals.
method Develops \(L^2\) approximation rate for smooth functionals of Itô diffusions and establishes consistency of statistical learning procedures.
result Signature-based methods improve prediction over handcrafted features in various real-data applications.

This paper provides an entry point to the problem of interpreting a deep neural network model and explaining its predictions. It is based on a tutorial given at ICASSP 2017. It introduces some recently proposed techniques of interpretation, along with theory, tricks and recommendations, to make most efficient use of th…

2017-06-24abs ↗pdf ↗

The paper presents a framework to quantify the trade-off between synthetic and real data.

problem Improving generalization with synthetic data when real data is scarce.
method Learning-theoretic framework leveraging algorithmic stability to derive generalization error bounds.
result Optimal synthetic-to-real data ratio minimizing expected test error as a function of Wasserstein distance.

Proposes a new simulator for complex arrival processes.

problem Modeling and simulating complex arrival processes with non-stationary and multi-dimensional rates.
method Integrates Monte Carlo and GANs to model a broad class of arrival processes.
result Consistent and efficient estimation of the simulator using Wasserstein distance.

Clustering is an essential data mining tool that aims to discover inherent cluster structure in data. As such, the study of clusterability, which evaluates whether data possesses such structure, is an integral part of cluster analysis. Yet, despite their central role in the theory and application of clustering, current…

2016-02-22abs ↗pdf ↗

There is a need for the development of models that are able to account for discreteness in data, along with its time series properties and correlation. Our focus falls on INteger-valued AutoRegressive (INAR) type models. The INAR type models can be used in conjunction with existing model-based clustering techniques to …

2019-01-26abs ↗pdf ↗

Evaluation of the marginal likelihood plays an important role in model selection problems. The widely applicable Bayesian information criterion (WBIC) and singular Bayesian information criterion (sBIC) give approximations to the log marginal likelihood, which can be applied to both regular and singular models. When the…

2019-06-04abs ↗pdf ↗

RealUID distills matching models using real data without GANs.

problem Slow inference in matching models like diffusion and flow.
method RealUID is a universal distillation framework that incorporates real data into the distillation procedure without using GANs.
result RealUID offers a simple theoretical foundation that covers previous distillation methods for Flow Matching and Diffusion models.

Ensemble of regression trees have become popular statistical tools for the estimation of conditional mean given a set of predictors. However, quantile regression trees and their ensembles have not yet garnered much attention despite the increasing popularity of the linear quantile regression model. This work proposes a…

2016-07-10abs ↗pdf ↗

We analyze the theory of optimal investment in risky assets, developed recently by Marsili, Maslov and Zhang [Physica A 253 (1998) 403]. When the real data are used instead of abstract stochastic process, it appears that a non-trivial investment strategy is rarely possible. We show that non-zero transaction costs make …

1999-05-05abs ↗pdf ↗

In this paper, we consider the variational regularization of manifold-valued data in the inverse problems setting. In particular, we consider TV and TGV regularization for manifold-valued data with indirect measurement operators. We provide results on the well-posedness and present algorithms for a numerical realizatio…

2018-04-27abs ↗pdf ↗

Two new regularization methods improve neural network performance and complexity control.

problem Improving neural network performance and complexity control with correlated or high-dimensional features.
method Two regularization strategies: covariance-aware ridge and covariance-aware lasso.
result Improves predictive performance and complexity control over standard penalties.

The paper tackles uncertainty in multi-objective decision-making.

problem Learning Pareto-efficient decisions with statistical confidence in uncertain outcomes.
method Adapting Pareto-efficient decisions to uncertainty, using conformal prediction.
result Statistical guarantees for efficient decisions in uncertain contexts.

Clustering is one of the most common unsupervised learning tasks in machine learning and data mining. Clustering algorithms have been used in a plethora of applications across several scientific fields. However, there has been limited research in the clustering of point patterns - sets or multi-sets of unordered elemen…

2017-02-08abs ↗pdf ↗

We propose a methodology for clustering financial time series of stocks' returns, and a graphical set-up to quantify and visualise the evolution of these clusters through time. The proposed graphical representation allows for the application of well known algorithms for solving classical combinatorial graph problems, w…

2011-11-14abs ↗pdf ↗

A method is developed to estimate the parameters of a Levy copula of a discretely observed bivariate compound Poisson process without knowledge of common shocks. The method is tested in a small sample simulation study. Also, the method is applied to a real data set and a goodness of fit test is developed. With the meth…

2012-12-01abs ↗pdf ↗

Proposes a neural density estimator that adapts to low-dimensional structures and integrates into generative models.

problem Challenges in implementing neural density estimators and lack of theoretical understanding.
method Structure-agnostic neural density estimator that is easy to implement and provably adaptive.
result Adapts to low-dimensional structures and achieves faster convergence rates.

Spectral methods of moments provide a powerful tool for learning the parameters of latent variable models. Despite their theoretical appeal, the applicability of these methods to real data is still limited due to a lack of robustness to model misspecification. In this paper we present a hierarchical approach to methods…

2018-10-17abs ↗pdf ↗

Machine learning (ML) has become a vital part in many aspects of our daily life. However, building well performing machine learning applications requires highly specialized data scientists and domain experts. Automated machine learning (AutoML) aims to reduce the demand for data scientists by enabling domain experts to…

2019-04-26abs ↗pdf ↗

We propose a variable metric framework for minimizing the sum of a self-concordant function and a possibly non-smooth convex function, endowed with an easily computable proximal operator. We theoretically establish the convergence of our framework without relying on the usual Lipschitz gradient assumption on the smooth…

2013-08-13abs ↗pdf ↗