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

10.7%21.4%32.1%42.8% · Jun 202019922001200920172026
48 results for real-life data

End-to-end deep learning detects emotions in real-life emergency calls.

problem Recognizing emotions in real-life emergency call center recordings.
method Used an end-to-end deep learning architecture trained on IEMOCAP and CEMO datasets.
result Obtained 45.6% Unweighted Accuracy Recall on CEMO with 4 classes, 76.9% on 2 classes (Anger, Neutral).

A new model predicts spatio-temporal data using adaptive decision trees and point processes.

problem Predicting spatio-temporal data with real-life applications.
method Hawkes process, adaptive decision tree, joint optimization algorithm.
result Significant improvement in predictions compared to standard methods.

We analyze empirical data for 4,000 real-life trading portfolios (U.S. equities) with holding periods of about 0.7-19 trading days. We find a simple scaling C ~ 1/T, where C is cents-per-share, and T is the portfolio turnover. Thus, the portfolio return R has no statistically significant dependence on the turnover T. W…

2015-09-27abs ↗pdf ↗

Physics-informed denoising improves sensor data accuracy without needing clean data.

problem Noise in real-life sensor data affects system performance and reliability.
method Physics-informed denoising model that uses algebraic relationships between sensor measurements governed by physical laws.
result Achieved state-of-the-art performance in various real-world applications.

K-nearest neighbors (KNN) method is used in many supervised learning classification problems. Potential Energy (PE) method is also developed for classification problems based on its physical metaphor. The energy potential used in the experiments are Yukawa potential and Gaussian Potential. In this paper, I use both app…

2012-11-05abs ↗pdf ↗

In medical risk modeling, typical data are "scarce": they have relatively small number of training instances (N), censoring, and high dimensionality (M). We show that the problem may be effectively simplified by reducing it to bipartite ranking, and introduce new bipartite ranking algorithm, Smooth Rank, for robust lea…

2011-08-13abs ↗pdf ↗

The study examines denoising and noisy-input regression under distribution shift, revealing double descent behavior and insights for data augmentation.

problem Understanding denoising in machine learning, especially under noisy inputs and distribution shift.
method Theoretical analysis of supervised denoising and noisy-input regression, considering low-rank data and proportional regime.
result The test error exhibits double descent under general distribution shift, indicating that overfitting the noise can be benign, tempered, or catastrophic.

Markovian RNN adapts to nonstationary data using HMM for better time series prediction.

problem Nonstationary sequential data in real-life applications.
method Markovian RNN with HMM for regime switching and end-to-end optimization.
result Significant performance gains over vanilla RNN and Markov Switching ARIMA.

New method detects communities in hypergraphs by embedding them into a vector space.

problem Detecting communities in hypergraphs with multi-way interactions.
method Augmenting non-uniform hypergraphs, embedding into a vector space, using an alternative updating scheme.
result Asymptotic consistencies in community detection and hypergraph estimation established.

We introduce a new class of nonstationary kernels, which we derive as covariance functions of a novel family of stochastic processes we refer to as string Gaussian processes (string GPs). We construct string GPs to allow for multiple types of local patterns in the data, while ensuring a mild global regularity condition…

2015-06-07abs ↗pdf ↗

Missing data is a significant problem impacting all domains. State-of-the-art framework for minimizing missing data bias is multiple imputation, for which the choice of an imputation model remains nontrivial. We propose a multiple imputation model based on overcomplete deep denoising autoencoders. Our proposed model is…

2017-05-08abs ↗pdf ↗

Missing data is an important challenge when dealing with high dimensional data arranged in the form of an array. In this paper, we propose methods for estimation of the parameters of array variate normal probability model from partially observed multiway data. The methods developed here are useful for missing data impu…

2012-09-12abs ↗pdf ↗

Was it fair that Harry was hired but not Barry? Was it fair that Pam was fired instead of Sam? How can one ensure fairness when an intelligent algorithm takes these decisions instead of a human? How can one ensure that the decisions were taken based on merit and not on protected attributes like race or sex? These are t…

2019-05-17abs ↗pdf ↗

Change detection (CD) in time series data is a critical problem as it reveal changes in the underlying generative processes driving the time series. Despite having received significant attention, one important unexplored aspect is how to efficiently utilize additional correlated information to improve the detection and…

2016-03-31abs ↗pdf ↗

Local elasticity in neural networks makes predictions resilient to dissimilar updates.

problem Understanding resilience of neural network predictions to updates from dissimilar data.
method Simulation and geometric interpretation using neural tangent kernel.
result Local elasticity persists in neural networks with nonlinear activation functions, not in linear ones.

New algorithm predicts spatio-temporal events with improved accuracy.

problem Non-stationary spatio-temporal prediction on dense and sparse sequences.
method Probabilistic approach using point processes and self-organizing decision trees.
result Significant performance improvements over baseline and state-of-the-art methods.

Early time series classification (eTSC) is the problem of classifying a time series after as few measurements as possible with the highest possible accuracy. The most critical issue of any eTSC method is to decide when enough data of a time series has been seen to take a decision: Waiting for more data points usually m…

2019-08-09abs ↗pdf ↗

This paper studies how to capture dependency graph structures from real data which may not be Gaussian. Starting from marginal loss functions not necessarily derived from probability distributions, we utilize an additive over-parametrization with shrinkage to incorporate variable dependencies into the criterion. An ite…

2016-10-08abs ↗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 ↗

This paper evaluates how different imputation methods affect predictive models.

problem The impact of different imputation methods on predictive models' performance.
method Systematic evaluation of various imputation methods for different data sets and machine learning algorithms.
result Recommendation of a general method for empirical benchmarking of imputation methods.

Classification may not be reliable for several reasons: noise in the data, insufficient input information, overlapping distributions and sharp definition of classes. Faced with several possibilities neural network may in such cases still be useful if instead of a classification elimination of improbable classes is done…

2019-01-28abs ↗pdf ↗

A key challenge in developing and deploying Machine Learning (ML) systems is understanding their performance across a wide range of inputs. To address this challenge, we created the What-If Tool, an open-source application that allows practitioners to probe, visualize, and analyze ML systems, with minimal coding. The W…

2019-07-09abs ↗pdf ↗

We develop extensions to auction theory results that are useful in real life scenarios. 1. Since valuations are generally positive we first develop approximations using the log-normal distribution. This would be useful for many finance related auction settings since asset prices are usually non-negative. 2. We formulat…

2018-09-25abs ↗pdf ↗

AutoML frameworks outperform human data scientists on 7 out of 12 OpenML tasks.

problem Evaluating if AutoML can outperform human data scientists.
method Comparison of four AutoML frameworks on 12 popular OpenML datasets (6 supervised classification, 6 supervised regression).
result AutoML frameworks perform better or equal to human data scientists in 7 out of 12 tasks.

Deep generative models trained with large amounts of unlabelled data have proven to be powerful within the domain of unsupervised learning. Many real life data sets contain a small amount of labelled data points, that are typically disregarded when training generative models. We propose the Cluster-aware Generative Mod…

2017-04-03abs ↗pdf ↗

We propose a deep learning approach for discovering kernels tailored to identifying clusters over sample data. Our neural network produces sample embeddings that are motivated by--and are at least as expressive as--spectral clustering. Our training objective, based on the Hilbert Schmidt Information Criterion, can be o…

2019-08-09abs ↗pdf ↗

Class imbalance problem is commonly faced while developing machine learning models for real-life issues. Due to this problem, the fitted model tends to be biased towards the majority class data, which leads to lower precision, recall, AUC, F1, G-mean score. Several researches have been done to tackle this problem, most…

2019-08-18abs ↗pdf ↗