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

2805608401,120 · Jun 202019922001200920172026
48 results for exploratory data

The increasing availability of large but noisy data sets with a large number of heterogeneous variables leads to the increasing interest in the automation of common tasks for data analysis. The most time-consuming part of this process is the Exploratory Data Analysis, crucial for better domain understanding, data clean…

2019-03-27abs ↗pdf ↗

Study finds key investing characteristics for success in equity markets.

problem Understanding what traits lead to financial success in equity markets.
method Exploratory factor analysis and multiple linear regression on 403 respondents' data.
result Investing characteristics significantly impact individual investors' excess return.

In this paper, we propose a new algorithm for exploratory projection pursuit. The basis of the algorithm is the insight that previous approaches used fairly narrow definitions of interestingness / non interestingness. We argue that allowing these definitions to depend on the problem / data at hand is a more natural app…

2011-12-19abs ↗pdf ↗

Action chunking and data exploration improve behavior cloning in robotics.

problem Exponential errors in learning from demonstrations for continuous control tasks.
method Action chunking and exploratory data collection.
result Control-theoretic stability is key to improving imitation learning.

Making sense of a dataset in an automatic and unsupervised fashion is a challenging problem in statistics and AI. Classical approaches for {exploratory data analysis} are usually not flexible enough to deal with the uncertainty inherent to real-world data: they are often restricted to fixed latent interaction models an…

2018-07-24abs ↗pdf ↗

New method explains high-dimensional sphere data with latent factors.

problem Understanding intricate dependence structure in high-dimensional sphere data.
method Exploratory factor analysis of the projected normal distribution with a fast alternating expectation profile conditional maximization algorithm.
result Uniformly excellent results on various data types, including tweets, brain imaging, and cancer gene expression.

Study speculative trading using RL with exploratory framework.

problem Sequential optimal stopping problem over entry and exit times with general utility function and price process.
method Formulated as a sequential optimal stopping problem, solved using Cox processes driven by bounded, non-randomized intensity controls. Characterized randomized control via probability measure over jump intensities and regularized objective function by Shannon's entropy. Established error estimates and convergence of RL objective to value function.
result Closed-form solutions for optimal policy and value function are derived.

Social media analytics allows us to extract, analyze, and establish semantic from user-generated contents in social media platforms. This study utilized a mixed method including a three-step process of data collection, topic modeling, and data annotation for recognizing exercise related patterns. Based on the findings,…

2018-12-08abs ↗pdf ↗

This describes a statistical technique called "tonsuring" for exploratory data analysis in finance. Instead of rejecting "outlier" data that conflicts with the model, this strips out "inlier" data to get a clearer picture of how the market changes for larger moves.

2011-10-20abs ↗pdf ↗

Since time immemorial, people have been looking for ways to organize scientific knowledge into some systems to facilitate search and discovery of new ideas. The problem was partially solved in the pre-Internet era using library classifications, but nowadays it is nearly impossible to classify all scientific and popular…

2018-11-15abs ↗pdf ↗

This study analyzes data science vocabulary changes over 13 years.

problem Understanding evolution of data science terms over time.
method Exploratory Data Analysis, Latent Semantic Analysis, Latent Dirichlet Analysis, N-grams Analysis.
result Identified new vocabulary and its incorporation into scientific literature.

We introduce an exploratory study on Mutation Validation (MV), a model validation method using mutated training labels for supervised learning. MV mutates training data labels, retrains the model against the mutated data, then uses the metamorphic relation that captures the consequent training performance changes to as…

2019-05-24abs ↗pdf ↗

A framework for robust exploration in reinforcement learning under ambiguity.

problem Optimal stopping under ambiguity in reinforcement learning.
method Continuous-time robust reinforcement learning framework using gg-expectation and backward stochastic differential equations.
result Constructs a robust exploratory stopping time approximating the optimal stopping time under ambiguity.

In conventional supervised learning, a training dataset is given with ground-truth labels from a known label set, and the learned model will classify unseen instances to known labels. This paper studies a new problem setting in which there are unknown classes in the training data misperceived as other labels, and thus …

2020-02-05abs ↗pdf ↗

Study on utility maximization with Tsallis entropy in reinforcement learning.

problem Exploring utility maximization with Tsallis entropy in reinforcement learning.
method Introducing Tsallis entropy regularizer to induce exploration, investigating specific examples, characterizing well-posedness, designing reinforcement learning algorithm.
result Characterized well-posedness and provided semi-closed-form solutions for specific examples, found distinct optimal strategies.

New method for portfolio management learns from past wealth evolution.

problem Optimizing portfolio selection based on past performance.
method Simulated annealing clustering for asset selection, considering past wealth evolution.
result Strategy effectively learns from past performance and performs well in practice.

ClusterGraph visualizes and simplifies multidimensional data clusters for better understanding.

problem Lack of global structure information in clustering results.
method Combining clustering with Topological Data Analysis to provide global structure.
result ClusterGraph provides global layout information about clusters.

Paper introduces probabilistic methods to approximate archetypal analysis, reducing complexity.

problem Inherent computational complexity of archetypal analysis limits its practical applicability.
method Two preprocessing techniques: dimensionality reduction and representation cardinality reduction, using probabilistic geometry.
result The method effectively reduces scaling and provides near-optimal solutions for prediction errors.

Exploratory data analysis is crucial for developing and understanding classification models from high-dimensional datasets. We explore the utility of a new unsupervised tree ensemble called uncharted forest for visualizing class associations, sample-sample associations, class heterogeneity, and uninformative classes fo…

2018-02-11abs ↗pdf ↗

Study uses RL to optimize investment with financial constraints, showing exploration benefits.

problem Optimal investment with financial constraints in continuous time.
method Reinforcement learning framework, focusing on Gaussian and truncated Gaussian distributions.
result Exploration leads to more dispersed wealth distribution with heavier tails, especially with smaller exploration parameters.

Biarchetype analysis identifies extreme instances of observations and features.

problem Representing complex data structures in a more interpretable form.
method Solves biarchetype analysis through an algorithm that identifies biarchetypes as mixtures of observations and features.
result Biarchetypes enhance interpretability of data structures compared to traditional methods.

The abstract warns against flawed empirical research in machine learning.

problem Flawed empirical research in machine learning leading to unreliable results.
method Call for more awareness of experimental knowledge plurality and epistemic limitations.
result Current empirical machine learning research should be exploratory, not confirmatory.

The paper tackles confidence calibration for exploratory machine learning problems.

problem Difficulty in curating datasets and confusion about category validity.
method Introduces four new algorithms for category-specific confidence estimation, including kernel density ratios.
result Kernel density ratios provide a novel approach to confidence calibration, especially for exploratory problems.

Hidden Markov Models analyze mobile health data to identify APNS states.

problem Subjective self-report measures of APNS lead to errors and biases.
method Exploratory hidden Markov factor models and Stabilized Expectation-Maximization algorithm.
result Identified homogeneous APNS states and dynamic transitions.

Wasserstein t-SNE embeds hierarchical datasets considering within-unit distributions.

problem Exploring hierarchical datasets where units are compared based on means of sample distributions.
method Uses Wasserstein distance metric for 2D embeddings of units, approximating Gaussian distributions for efficiency.
result Demonstrates effective embedding of hierarchical datasets, uncovering meaningful structure.

Neural model with parameterized algorithms improves graph CO problem solving.

problem Solving NP-hard graph combinatorial optimization problems efficiently and accurately.
method Combining neural models and parameterized algorithms to identify and handle hard and easy parts of CO instances.
result Framework produces superior solution quality and out-of-distribution generalization.

Performing diagnosis or exploratory analysis during the training of deep learning models is challenging but often necessary for making a sequence of decisions guided by the incremental observations. Currently available systems for this purpose are limited to monitoring only the logged data that must be specified before…

2020-01-05abs ↗pdf ↗

The paper tackles optimal stopping problems using reinforcement learning and singular control.

problem Continuous-time and state-space optimal stopping problems.
method Formulated as a singular control problem with randomized stopping times and penalized cumulative residual entropy.
result Identified unique optimal exploratory strategy through dynamic programming.

XPO enhances RLHF by encouraging diverse responses, offering improved sample efficiency.

problem Limited exploration in RLHF leads to suboptimal models and bottlenecks.
method XPO is a simple one-line change to DPO, introducing a novel exploration bonus.
result XPO achieves strong theoretical guarantees and promising empirical performance.

Despite the availability of ever more data enabled through modern sensor and computer technology, it still remains an open problem to learn dynamical systems in a sample-efficient way. We propose active learning strategies that leverage information-theoretical properties arising naturally during Gaussian process regres…

2019-11-22abs ↗pdf ↗