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

3673109145 · Jun 202019922001200920172026
48 results for exploratory actions

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.

DECE visualizes machine learning decisions with counterfactual explanations.

problem Making machine learning models transparent and explainable.
method Interactive visualization system supporting counterfactual explanations at instance- and subgroup-levels.
result DECE enables users to explore and understand machine learning model decisions.

Deep reinforcement learning (RL) methods generally engage in exploratory behavior through noise injection in the action space. An alternative is to add noise directly to the agent's parameters, which can lead to more consistent exploration and a richer set of behaviors. Methods such as evolutionary strategies use param…

2017-06-06abs ↗pdf ↗

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.

We study an exploration method for model-free RL that generalizes the counter-based exploration bonus methods and takes into account long term exploratory value of actions rather than a single step look-ahead. We propose a model-free RL method that modifies Delayed Q-learning and utilizes the long-term exploration bonu…

2018-08-31abs ↗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.

Exploration is a fundamental aspect of Reinforcement Learning, typically implemented using stochastic action-selection. Exploration, however, can be more efficient if directed toward gaining new world knowledge. Visit-counters have been proven useful both in practice and in theory for directed exploration. However, a m…

2018-04-11abs ↗pdf ↗

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 ↗

This paper proposes a method to safely adjust exploration in RL to satisfy constraints.

problem Unsafe exploration in reinforcement learning violates constraints on controlled object states.
method Automatic adjustment of exploration inputs and variance-covariance matrix for safety.
result The method guarantees satisfaction of joint chance constraints with specified probability.

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 ↗

Curriculum learning has been successfully used in reinforcement learning to accelerate the learning process, through knowledge transfer between tasks of increasing complexity. Critical tasks, in which suboptimal exploratory actions must be minimized, can benefit from curriculum learning, and its ability to shape explor…

2019-06-13abs ↗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.

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.

Safe actions learned in finite trials, without infinite exploration.

problem Learning safe actions in unknown environments efficiently.
method Defining a handicap metric and using sequential probability ratio test for discarding unsafe actions.
result Achieves constant handicap, discarding unsafe machines with probability one in finite rounds.

Study optimal stopping in random exploration, deriving HJB and designing a reinforcement learning algorithm.

problem Optimal stopping problem in continuous time with random exploration.
method Transformed optimal stopping to optimal control problem, derived HJB equation, designed reinforcement learning algorithm.
result Convergence rate of policy iteration and comparison to classical optimal stopping.

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.

DE is a new exploration method that limits resource usage based on expected improvement and surprise.

problem Limited exploration in large action spaces when resources are scarce.
method Delight-gated exploration (DE) that limits exploration actions based on a gate price set by the product of expected improvement and surprise.
result DE outperforms ε\varepsilon-greedy and Thompson Sampling in terms of regret across various bandit and MDP settings.

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.

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 ↗

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.

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.

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 ↗

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.

Study shows high-dimensional sparse RL hardness and Lasso Q-iteration's nearly dimension-free regret.

problem Hardness of online sparse reinforcement learning in high-dimensional MDPs.
method Lower bound construction and Lasso fitted Q-iteration analysis.
result Lasso Q-iteration achieves nearly dimension-free regret of O~(s2/3N2/3)\tilde{O}(s^{2/3}N^{2/3}) with oracle access to a good exploratory policy.

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 ↗

A-DOGE embeds attributed graphs efficiently using density of states.

problem Efficiently represent node-attributed graphs with few numerical features.
method A-DOGE uses density of states to blend topology and attributes, leveraging efficient approximation algorithms.
result A-DOGE achieves competitive performance with modern supervised GNNs while being significantly faster.

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 ↗

We propose a reinforcement learning agent to solve hard exploration games by learning a range of directed exploratory policies. We construct an episodic memory-based intrinsic reward using k-nearest neighbors over the agent's recent experience to train the directed exploratory policies, thereby encouraging the agent to…

2020-02-14abs ↗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 ↗

Maximizes Rényi entropy for efficient exploration in reward-free RL.

problem Challenges of exploration in reward-free reinforcement learning.
method Maximizes Rényi entropy over state-action space in exploration phase; uses batch RL for planning phase.
result Effective and sample-efficient exploration leading to superior policies.