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

Trend · papers per month

52104155207 · Jun 202019922001200920172026
48 results for data-based metrics

Detects project management anti-patterns using code and issue data.

problem Detecting project management anti-patterns requires expert judgment and is expensive.
method Convert descriptions to detectable metrics, quantify deviations, and optimize patterns.
result Automatic calibration enhances pattern detection and severity assessment.

A new geometric method for clustering SPD data improves upon Euclidean and Riemannian approaches.

problem Skewed interpretations of SPD data in Euclidean analysis and computational inefficiency of Riemannian methods.
method Proposes a geometric method based on the Thompson metric for unsupervised clustering of SPD data.
result Demonstrates improved clustering results using inductive midrange centroid computation.

We propose two related unsupervised clustering algorithms which, for input, take data assumed to be sampled from a uniform distribution supported on a metric space XX, and output a clustering of the data based on the selection of a topological model for the connected components of XX. Both algorithms work by selectin…

2015-06-08abs ↗pdf ↗

New method uses randomised signatures for generating financial time series data.

problem Generating synthetic financial time series data accurately.
method Introduced a Wasserstein-type distance based on discrete-time randomised signatures.
result Demonstrated universal approximation for randomised signatures on continuous functions.

Paper introduces a new performance metric for class imbalance datasets.

problem Challenges in selecting and comparing models for imbalanced datasets.
method Proposes a new performance measure based on the harmonic mean of Recall and Selectivity normalized in class labels.
result The proposed measure is less sensitive to changes in the majority class and more sensitive to changes in the minority class.

Study develops a data-based model for in-cylinder pressure and cyclic variations in RCCI engines.

problem Lack of models capturing cyclic variations in combustion concepts like RCCI.
method Combines Principle Component Decomposition and Gaussian Process Regression.
result Model predicts combustion measures with high accuracy, especially peak-pressure rise-rate.

In an earlier work we identified the types and numbers of static equilibrium points of solids arising from fine, equidistant nn-discretrizations of smooth, convex surfaces. We showed that such discretizations carry equilibrium points on two scales: the local scale corresponds to the discretization, the global scale to…

2014-10-20abs ↗pdf ↗

We present GraphTSNE, a novel visualization technique for graph-structured data based on t-SNE. The growing interest in graph-structured data increases the importance of gaining human insight into such datasets by means of visualization. Among the most popular visualization techniques, classical t-SNE is not suitable o…

2019-04-15abs ↗pdf ↗

The paper tackles physical constraints in probabilistic machine learning for CG models of high-dimensional systems.

problem Introducing physical constraints in probabilistic machine learning objectives for coarse-graining dynamical systems.
method Formulating coarse-graining process using probabilistic state-space model and accounting for constraints as virtual observables.
result Probabilistic inference tools can identify coarse-grained variables without needing a fine-to-coarse projection or time-derivatives.

The paper highlights how machine learning calibrations can be biased by training data.

problem Machine learning calibrations can be biased by the training data, affecting downstream analyses.
method The paper examines simulation-based and data-based calibrations, highlighting their prior dependence and proposing solutions.
result A recently proposed Gaussian Ansatz approach can avoid some biases in simulation-based calibrations.

TS-K-means improves financial data clustering with dynamic time warping.

problem Inadequate handling of temporal dependencies in financial time series data.
method Integrates Dynamic Time Warping into Time Series K-means for financial data.
result TS-K-means outperforms traditional K-means in financial data analysis.

Despite its popularity, it is widely recognized that the investigation of some theoretical aspects of clustering has been relatively sparse. One of the main reasons for this lack of theoretical results is surely the fact that, whereas for other statistical problems the theoretical population goal is clearly defined (as…

2014-08-06abs ↗pdf ↗

This paper examines the intra-day seasonality of transacted limit and market orders in the DEM/USD foreign exchange market. Empirical analysis of completed transactions data based on the Dealing 2000-2 electronic inter-dealer broking system indicates significant evidence of intraday seasonality in returns and return vo…

2011-03-29abs ↗pdf ↗

Framework for pricing data products in data-poor markets.

problem Challenges in pricing advanced data products due to lack of transaction data.
method Prior-predictive Monte Carlo framework for generating probabilistic price bands.
result Stable probabilistic price bands for data products in data-poor markets.

As regulators pay more attentions to losses rather than gains, we are able to derive a new class of risk statistics, named regulator-based risk statistics with scenario analysis in this paper. This new class of risk statistics can be considered as a kind of risk extension of risk statistics introduced by Kou et al. \ci…

2019-04-16abs ↗pdf ↗

This paper describes a general framework for learning Higher-Order Network Embeddings (HONE) from graph data based on network motifs. The HONE framework is highly expressive and flexible with many interchangeable components. The experimental results demonstrate the effectiveness of learning higher-order network represe…

2018-01-28abs ↗pdf ↗

Sparse non-Gaussian component analysis (SNGCA) is an unsupervised method of extracting a linear structure from a high dimensional data based on estimating a low-dimensional non-Gaussian data component. In this paper we discuss a new approach to direct estimation of the projector on the target space based on semidefinit…

2011-06-01abs ↗pdf ↗

Preprocessing data is an important step before any data analysis. In this paper, we focus on one particular aspect, namely scaling or normalization. We analyze various scaling methods in common use and study their effects on different statistical learning models. We will propose a new two-stage scaling method. First, w…

2017-09-02abs ↗pdf ↗

Improves data-driven reachability estimation for complex systems.

problem Estimating reachable states in complex dynamical systems with unknown parameters.
method Uses Christoffel functions and conformal prediction to improve sample efficiency and robustness.
result Guaranteed convergence to the true reach set with improved sample efficiency and robustness.

This paper provides a new unimodality test with application in hierarchical clustering methods. The proposed method denoted by signature test (Sigtest), transforms the data based on its statistics. The transformed data has much smaller variation compared to the original data and can be evaluated in a simple proposed un…

2014-01-09abs ↗pdf ↗

A new method using energy distance for ensemble and scenario reduction.

problem Solving complex dynamic and stochastic programs, especially in energy systems.
method Proposes a new method based on energy distance for ensemble and scenario reduction.
result Reduced scenario sets exhibit better statistical properties for energy distance than Wasserstein distance.

We explore the performance of several automatic bandwidth selectors, originally designed for density gradient estimation, as data-based procedures for nonparametric, modal clustering. The key tool to obtain a clustering from density gradient estimators is the mean shift algorithm, which allows to obtain a partition not…

2013-10-29abs ↗pdf ↗

The study uses neural networks to classify and predict coronavirus data.

problem Classifying and predicting coronavirus data from input variables.
method Artificial neural networks with logcosh loss function to classify branches of set-valued mappings.
result Successfully classified and predicted coronavirus data for each German district.

Learning-based hashing algorithms are ``hot topics" because they can greatly increase the scale at which existing methods operate. In this paper, we propose a new learning-based hashing method called ``fast supervised discrete hashing" (FSDH) based on ``supervised discrete hashing" (SDH). Regressing the training exampl…

2019-04-07abs ↗pdf ↗

Causal discovery algorithms infer causal relations from data based on several assumptions, including notably the absence of measurement error. However, this assumption is most likely violated in practical applications, which may result in erroneous, irreproducible results. In this work we show how to obtain an upper bo…

2018-10-18abs ↗pdf ↗

Both theoretical and applied economics have a great deal to say about many aspects of the firm, but the literature on the extinctions, or demises, of firms is very sparse. We use a publicly available data base covering some 6 million firms in the US and show that the underlying statistical distribution which characteri…

2002-12-09abs ↗pdf ↗

In this work we study the properties of deep neural networks (DNN) with random weights. We formally prove that these networks perform a distance-preserving embedding of the data. Based on this we then draw conclusions on the size of the training data and the networks' structure. A longer version of this paper with more…

2014-12-18abs ↗pdf ↗

Paper addresses inconsistency between offline and online LTR performance.

problem Inconsistency between offline and online LTR performance in E-commerce.
method Proposes an evaluator-generator framework to maximize evaluator score using reinforcement learning.
result Significant improvement in Conversion Rate (CR) over existing models.