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

Trend · papers per month

64128191255 · Jun 202019922001200920172026
48 results for high-dimensional environments

HashReward improves imitation learning in high-dimensional environments by balancing reward generation and dimensionality reduction.

problem Making policies generalize well in high-dimensional state-action spaces, especially in game playing with raw pixel inputs.
method HashReward uses supervised hashing to balance reward generation and dimensionality reduction.
result HashReward outperforms state-of-the-art methods in high-dimensional environments.

Models that can simulate how environments change in response to actions can be used by agents to plan and act efficiently. We improve on previous environment simulators from high-dimensional pixel observations by introducing recurrent neural networks that are able to make temporally and spatially coherent predictions f…

2017-04-07abs ↗pdf ↗

New approach predicts under latent shifts using high-dimensional images.

problem Prediction under latent subgroup shifts with high-dimensional observations.
method Recognition-parametrised model (RPM) for identifying causal latent structure.
result Successfully adapts predictions for high-dimensional image data.

Study on meta-reinforcement learning generalization in high-dimensional tasks.

problem Generalization performance of meta-reinforcement learning algorithms in high-dimensional tasks.
method High-dimensional, procedurally generated environments.
result Meta-reinforcement learning algorithms exhibit strong overfitting on challenging tasks.

Reinforcement learning algorithms, though successful, tend to over-fit to training environments hampering their application to the real-world. This paper proposes WR2L\text{W}\text{R}^{2}\text{L} -- a robust reinforcement learning algorithm with significant robust performance on low and high-dimensional control tasks. Ou…

2019-07-30abs ↗pdf ↗

Paper analyzes AIRL in high-dimensional spaces using random matrix theory.

problem AIRL's performance challenges in high-dimensional environments.
method Examined the rank of the matrix derived from transition matrix, applied random matrix theory.
result High-dimensional scenarios reveal transfer limitations not inherent to AIRL framework.

Randomized value functions offer a promising approach towards the challenge of efficient exploration in complex environments with high dimensional state and action spaces. Unlike traditional point estimate methods, randomized value functions maintain a posterior distribution over action-space values. This prevents the …

2018-06-06abs ↗pdf ↗

Deep RL algorithm trades high-dimensional stock portfolios.

problem Trading high-dimensional stock portfolios with data gaps and non-unique history lengths.
method Deep Q-learning algorithm, sequentially setting up environments, rewarding based on asset returns and cash reservation.
result Algorithm outperforms all passive and active benchmarks by a large margin.

Study on estimating causal effects with limited data and multiple environments.

problem Estimating causal effects under hidden confounding with unpaired data and sparse effects.
method Instrumental variable (IV) regression with cross-fold sample splitting and 1\ell_1-regularized estimation.
result Proposed GMM-type estimator is consistent as the number of environments grows.

Self-supervised reward prediction improves RL in sparse reward settings.

problem Data efficiency and sparse reward signals in reinforcement learning.
method Learning a state representation for reward prediction and using it to shape rewards.
result Self-supervised reward prediction enhances RL algorithms in single-goal environments.

Proposes a method to improve few-shot transfer in off-dynamics RL.

problem Traditional RL struggles with transferring policies between environments with different dynamics.
method Introduces a penalty to regulate source-trained policies in target environments with limited data.
result Improves performance in various off-dynamics RL scenarios compared to existing methods.

Novel AMP framework for multi-environment transfer learning.

problem Characterizing risk of Lasso-based transfer learning estimators.
method Multi-Environment Generalized Long AMP (multi-environment GLAMP) framework.
result Precise characterization of the risk of three Lasso-based transfer learning estimators.

ATLAS separates invariant and transferable latent factors across diverse environments.

problem Transfer learning and robust prediction in heterogeneous environments.
method ATLAS leverages invariance principle to disentangle latent factors and uses auxiliary labels for robust prediction.
result Near-oracle performance and robust transferable prediction in new environments.

Teacher algorithm helps DRL learn diverse environments efficiently.

problem Teach DRL to learn in various, unknown environments efficiently.
method Transformed into a bandit problem, learns to sample environments.
result ALP-GMM models learning progress, improving curriculum design.

Intrinsically motivated goal exploration processes enable agents to autonomously sample goals to explore efficiently complex environments with high-dimensional continuous actions. They have been applied successfully to real world robots to discover repertoires of policies producing a wide diversity of effects. Often th…

2018-07-04abs ↗pdf ↗

Paper tackles efficient navigation in constrained environments using supervised and reinforcement learning.

problem Building learning agents that efficiently navigate in obstacle-cluttered environments.
method Synergistic use of supervised learning for path prediction and reinforcement learning for path following.
result Proposed method achieves good generalization and faster learning compared to existing work.

This research tackles intervention-centric causal reasoning in learning agents by using meta-learning.

problem Learning agents lack the concept of interventions, making causal learning challenging.
method A meta-reinforcement learning algorithm is used to learn causal relationships from observational data.
result The approach enables agents to learn and manipulate the environment effectively.

Imitation learning algorithms can be used to learn a policy from expert demonstrations without access to a reward signal. However, most existing approaches are not applicable in multi-agent settings due to the existence of multiple (Nash) equilibria and non-stationary environments. We propose a new framework for multi-…

2018-07-26abs ↗pdf ↗

High-dimensional always-changing environments constitute a hard challenge for current reinforcement learning techniques. Artificial agents, nowadays, are often trained off-line in very static and controlled conditions in simulation such that training observations can be thought as sampled i.i.d. from the entire observa…

2019-05-24abs ↗pdf ↗

Paper explores differential privacy in high-dimensional federated learning, tackling server trustworthiness and estimation.

problem Maintaining privacy in distributed environments with high-dimensional data.
method Investigates scenarios with untrusted and trusted central servers, introduces novel federated estimation algorithms for linear regression models.
result Tight minimax rates depend on high-dimensionality even with sparsity assumptions, and novel algorithms handle slight variations among distributed models.

Novel unsupervised MIG detectors improve signal detection in cluttered environments.

problem Signal detection in nonhomogeneous clutter environments.
method Developed novel discriminative MIG detectors using HPD matrices and geometric measures.
result Improved signal detection performance compared to conventional methods.

Paper develops a model-based RL framework for portfolio optimization in financial markets.

problem Complex, non-Gaussian environment dynamics in financial markets.
method Heavy-tailed preserving normalizing flows for environment simulation; model-based reinforcement learning framework.
result Proposed method outperforms in various financial markets, especially during the pandemic.

In this paper, we present our approach to solve a physics-based reinforcement learning challenge "Learning to Run" with objective to train physiologically-based human model to navigate a complex obstacle course as quickly as possible. The environment is computationally expensive, has a high-dimensional continuous actio…

2017-11-18abs ↗pdf ↗

In many real-world scenarios, rewards extrinsic to the agent are extremely sparse, or absent altogether. In such cases, curiosity can serve as an intrinsic reward signal to enable the agent to explore its environment and learn skills that might be useful later in its life. We formulate curiosity as the error in an agen…

2017-05-15abs ↗pdf ↗

Modeling agent behavior is central to understanding the emergence of complex phenomena in multiagent systems. Prior work in agent modeling has largely been task-specific and driven by hand-engineering domain-specific prior knowledge. We propose a general learning framework for modeling agent behavior in any multiagent …

2018-06-17abs ↗pdf ↗

Minimum attention improves reinforcement learning performance in high-dimensional dynamics.

problem Improving reinforcement learning performance in high-dimensional nonlinear dynamics.
method Applying minimum attention as a regularization technique in reinforcement learning, including model-based and model-free approaches.
result Minimum attention outperforms state-of-the-art algorithms in few-shot adaptation and variance reduction.

SPPCSO addresses multicollinearity in high-dimensional data, improving model stability and predictive accuracy.

problem Multicollinearity in high-dimensional data leads to unstable estimation and reduced predictive accuracy.
method SPPCSO integrates principal component regression and L1 regularization to adaptively adjust shrinkage factors.
result SPPCSO achieves stable and reliable estimation in high-noise settings, distinguishing signal variables from noise.

Efficient exploration is an unsolved problem in Reinforcement Learning which is usually addressed by reactively rewarding the agent for fortuitously encountering novel situations. This paper introduces an efficient active exploration algorithm, Model-Based Active eXploration (MAX), which uses an ensemble of forward mod…

2018-10-29abs ↗pdf ↗

Paper uses deep reinforcement learning for optimal stock portfolio management.

problem Optimizing stock portfolio choices in complex market environments.
method Direct deep reinforcement learning to learn factor representations and make optimal decisions.
result Deep learning outperforms average market performance in portfolio allocation.