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

82164246328 · Jun 202019922001200920172026
48 results for exploration capabilities

Deep Reinforcement Learning (DRL) has emerged as a powerful control technique in robotic science. In contrast to control theory, DRL is more robust in the thorough exploration of the environment. This capability of DRL generates more human-like behaviour and intelligence when applied to the robots. To explore this capa…

2019-10-16abs ↗pdf ↗

AER dynamically adjusts entropy regularization for better LLM reinforcement learning.

problem Policy entropy collapse in RLVR training limits exploration and reasoning performance.
method Adaptive Entropy Regularization (AER) with difficulty-aware coefficient allocation, initial-anchored target entropy, and dynamic global coefficient adjustment.
result AER consistently outperforms baselines on mathematical reasoning benchmarks, improving both accuracy and exploration.

Recursive KalmanNet generalizes well in noisy, out-of-distribution scenarios.

problem Generalization in noisy, out-of-distribution scenarios.
method Recurrent neural network guided by a Kalman filter.
result Recursive KalmanNet performs well in scenarios with different temporal dynamics from training data.

Paper examines LLM capability benchmarks through construct validity, favoring nomological account.

problem Linking theoretical capabilities to empirical measurements in LLMs.
method Contrasts three frameworks: nomological, inferential, and causal.
result Nomological account provides best foundation for LLM research.

Meta-Reinforcement learning approaches aim to develop learning procedures that can adapt quickly to a distribution of tasks with the help of a few examples. Developing efficient exploration strategies capable of finding the most useful samples becomes critical in such settings. Existing approaches towards finding effic…

2019-11-11abs ↗pdf ↗

AutoBayes automates Bayesian graph exploration for robust machine learning.

problem Learning representations invariant to nuisance variations in machine learning.
method Automated Bayesian inference framework exploring different graphical models.
result Significant performance improvement with nuisance-invariant machine learning pipelines.

In this paper, we explore new approaches to combining information encoded within the learned representations of auto-encoders. We explore models that are capable of combining the attributes of multiple inputs such that a resynthesised output is trained to fool an adversarial discriminator for real versus synthesised da…

2019-03-07abs ↗pdf ↗

DiCE uses diverse agents to explore and learn, avoiding local minima.

problem Local minima in RL due to limited exploration and correlated behavior.
method DiCE employs a group of heterogeneous agents to explore simultaneously and share experiences, with a diversity regularization mechanism.
result DiCE achieves substantial improvement over baselines in MuJoCo locomotion tasks.

Due to the growing demand for improving surveillance capabilities in smart cities, systems need to be developed to provide better monitoring capabilities to competent authorities, agencies responsible for strategic resource management, and emergency call centers. This work assumes that, as a complementary monitoring so…

2019-10-27abs ↗pdf ↗

The ever-increasing demand from mobile Machine Learning (ML) applications calls for evermore powerful on-chip computing resources. Mobile devices are empowered with heterogeneous multi-processor Systems-on-Chips (SoCs) to process ML workloads such as Convolutional Neural Network (CNN) inference. Mobile SoCs house sever…

2019-08-24abs ↗pdf ↗

Bio-inspired neuromorphic hardware is a research direction to approach brain's computational power and energy efficiency. Spiking neural networks (SNN) encode information as sparsely distributed spike trains and employ spike-timing-dependent plasticity (STDP) mechanism for learning. Existing hardware implementations of…

2018-09-18abs ↗pdf ↗

PBCS combines RL and motion planning for better exploration.

problem RL algorithms struggle with versatile exploration in complex environments.
method PBCS uses motion planning to find a good trajectory, then trains RL on a curriculum derived from it.
result PBCS outperforms state-of-the-art RL algorithms in 2D maze environments.

In this work we present a novel approach for transfer-guided exploration in reinforcement learning that is inspired by the human tendency to leverage experiences from similar encounters in the past while navigating a new task. Given an optimal policy in a related task-environment, we show that its bisimulation distance…

2019-06-27abs ↗pdf ↗

Study of deep neural networks using finite-time Lyapunov exponents.

problem Understanding the geometric structures in input space formed by deep neural networks.
method Analogy with dynamical systems, computing finite-time Lyapunov exponents.
result Ridges of large positive exponents divide input space into regions associated with different classes.

(ABRIDGED) In previous work, two platforms have been developed for testing computer-vision algorithms for robotic planetary exploration (McGuire et al. 2004b,2005; Bartolo et al. 2007). The wearable-computer platform has been tested at geological and astrobiological field sites in Spain (Rivas Vaciamadrid and Riba de S…

2009-10-28abs ↗pdf ↗

Meta-learning agents excel at rapidly learning new tasks from open-ended task distributions; yet, they forget what they learn about each task as soon as the next begins. When tasks reoccur - as they do in natural environments - metalearning agents must explore again instead of immediately exploiting previously discover…

2018-05-24abs ↗pdf ↗

Transformers learn to play games in-context, proving Nash equilibrium.

problem Understanding in-context game-playing capabilities of pre-trained transformers.
method Theoretical guarantees and constructional results for transformer architecture in multi-agent games.
result Pre-trained transformers can learn Nash equilibrium in-context for two-player zero-sum games.

This work proposes a MFO framework for simultaneously evolving DQL models.

problem Complex DQL models struggle to converge to optimal policies due to exploration and sparse rewards.
method Combines meta-heuristic optimization, Transfer Learning, and DQL to automate knowledge transfer and policy learning.
result Framework automates knowledge transfer and policy learning of distributed RL agents.

Recent studies in the literature have paid much attention to the sparsity in linear classification tasks. One motivation of imposing sparsity assumption on the linear discriminant direction is to rule out the noninformative features, making hardly contribution to the classification problem. Most of those work were focu…

2014-12-26abs ↗pdf ↗

Paper explores generalization of AID-based bi-level optimization methods.

problem Uncertainty in generalization properties of AID-based bi-level optimization methods.
method Uniform stability analysis and convergence study of AID-based methods.
result AID-based methods can achieve similar generalization as single-level nonconvex problems.

Bayesian RL enhances LLMs to reflectively explore and correct errors.

problem LLMs trained via RL lack reflective behaviors like rethinking and error correction.
method Bayesian RL framework that optimizes expected return under posterior distribution over Markov decision processes.
result BARL algorithm improves LLM performance in reasoning tasks.

SSMs combined with neural networks match Transformers in dynamic token selection.

problem Understanding the capabilities of SSMs in dynamic token selection.
method Exploring SSMs combined with fully connected neural networks.
result SSMs combined with nonlinear layers can efficiently solve challenging tasks and estimate functions.

In this work we describe a novel deep reinforcement learning architecture that allows multiple actions to be selected at every time-step in an efficient manner. Multi-action policies allow complex behaviours to be learnt that would otherwise be hard to achieve when using single action selection techniques. We use both …

2018-03-14abs ↗pdf ↗

This paper uses deep learning to value derivatives. The approach is broadly applicable, and we use a call option on a basket of stocks as an example. We show that the deep learning model is accurate and very fast, capable of producing valuations a million times faster than traditional models. We develop a methodology t…

2018-09-06abs ↗pdf ↗

Improved exploration in RL with latent state marginalization.

problem Complexity of deep probabilistic models limits their practical use in reinforcement learning.
method Adopting latent variable policies within the MaxEnt framework, with low-cost marginalization of latent states.
result Effective marginalization leads to better exploration and more robust training.

Deep reinforcement learning algorithms have been successfully applied to a range of challenging control tasks. However, these methods typically struggle with achieving effective exploration and are extremely sensitive to the choice of hyperparameters. One reason is that most approaches use a noisy version of their oper…

2019-05-02abs ↗pdf ↗

New approach uses autoregressive models to explore and quantify uncertainty in decision-making.

problem Quantifying and exploring uncertainty in online decision-making.
method Reformulates uncertainty as missing future outcomes, training autoregressive models for next-outcome prediction.
result Establishes a reduction from online learning to offline next-outcome prediction, controlling Bayesian regret by sequence prediction loss.

ANN with GA optimizes flexible disc design for lower mass and stress.

problem Design flexible disc elements for lower mass and stress without compromising torque transmission and misalignment.
method Artificial Neural Network (ANN) coupled with Genetic Algorithm (GA) for design exploration.
result Optimized designs meet specified criteria with minimum mass and stress.

This work tackles uncertainty quantification in tomography reconstruction.

problem Ill-posed nature of tomographic reconstruction leading to no unique solution.
method Gaussian process modeling to incorporate prior knowledge and experimental noises.
result Efficient uncertainty quantification in tomographic reconstruction.

Reduced numerical precision is a common technique to reduce computational cost in many Deep Neural Networks (DNNs). While it has been observed that DNNs are resilient to small errors and noise, no general result exists that is capable of predicting a given DNN system architecture's sensitivity to reduced precision. In …

2018-05-03abs ↗pdf ↗