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

173346518691 · Jun 202019922001200920172026
48 results for Critical States

New method identifies critical states to improve RL agent explainability and speed.

problem Challenges in RL agent explainability and action selection timing.
method Identify critical states based on action-based variance in Q-function, prioritize exploitation on these states.
result Identified critical states accelerate RL in grid worlds and deep RL tasks.

Enhances reinforcement learning with partial state information.

problem Improving learning under partial observability with limited privileged signals.
method Introduced informed asymmetric actor-critic framework that uses arbitrary state-dependent privileged signals.
result Unbiased policy gradient estimates with arbitrary privileged signals.

We prove sharp pointwise decay estimates for critical Dirac equations on Rn\mathbb{R}^n with n2n\geq 2. They appear for instance in the study of critical Dirac equations on compact spin manifolds, describing blow-up profiles, and as effective equations in honeycomb structures. For the latter case, we find excited state…

2018-09-05abs ↗pdf ↗

Researchers identify critical protein residues using advanced graph theory.

problem Identifying essential residues in proteins for function.
method Learning Random Geometric Graphs (RGG) with Cramer's V correlation and organic thresholding.
result Advanced RGG methods accurately identify critical residues compared to existing techniques.

Theoretical justification for asymmetric actor-critic algorithms in reinforcement learning.

problem Lack of precise theoretical justification for asymmetric actor-critic algorithms in reinforcement learning.
method Adapting a finite-time convergence analysis to the asymmetric actor-critic setting with linear function approximators.
result A finite-time bound reveals that the asymmetric critic eliminates aliasing errors in the agent state.

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.

Soft Actor-Critic is a state-of-the-art reinforcement learning algorithm for continuous action settings that is not applicable to discrete action settings. Many important settings involve discrete actions, however, and so here we derive an alternative version of the Soft Actor-Critic algorithm that is applicable to dis…

2019-10-16abs ↗pdf ↗

Improved sample complexity for actor-critic algorithms in MDPs.

problem Achieving optimal policies with limited data in reinforcement learning.
method Single-timescale actor-critic with STORM (STOchastic Recursive Momentum) and a sample buffer.
result Optimal sample complexity of O(ε2)O(ε^{-2}) for εε-optimal policies.

We propose a new algorithm, Mean Actor-Critic (MAC), for discrete-action continuous-state reinforcement learning. MAC is a policy gradient algorithm that uses the agent's explicit representation of all action values to estimate the gradient of the policy, rather than using only the actions that were actually executed. …

2017-09-01abs ↗pdf ↗

Study uses actor-critic method for continuous-time mean-field control with entropy regularisation.

problem Continuous-time mean-field control in reinforcement learning.
method Actor-critic approach with entropy regularisation, value function alternation, and Wasserstein space parametrisation.
result Derives exact parametrisation of actor and critic functions in linear-quadratic mean-field framework.

First we provide a simple set of sufficient conditions for the weak convergence of scaled affine processes with state space R+×RdR_+ \times R^d. We specialize our result to one-dimensional continuous state branching processes with immigration. As an application, we study the asymptotic behavior of least squares estimators…

2012-10-05abs ↗pdf ↗

Actor-critic methods, a type of model-free Reinforcement Learning, have been successfully applied to challenging tasks in continuous control, often achieving state-of-the art performance. However, wide-scale adoption of these methods in real-world domains is made difficult by their poor sample efficiency. We address th…

2019-10-28abs ↗pdf ↗

Reinforcement learning methods carry a well known bias-variance trade-off in n-step algorithms for optimal control. Unfortunately, this has rarely been addressed in current research. This trade-off principle holds independent of the choice of the algorithm, such as n-step SARSA, n-step Expected SARSA or n-step Tree bac…

2018-10-16abs ↗pdf ↗

Band-limited SAC improves learning efficiency and stability in simulated environments.

problem Improving sample efficiency and stability in SAC algorithms.
method Artificially bandlimiting the target critic's spatial resolution using a convolutional filter.
result Bandlimited SAC outperforms classic twin-critic SAC in various Gym environments and is more stable.

USAC balances pessimism and optimism in actor-critic training for better exploration and performance.

problem Excessive pessimism limits exploration, while excessive optimism leads to high-risk behaviors.
method Utility Soft Actor-Critic (USAC) dynamically adapts exploration based on critic uncertainty.
result USAC consistently outperforms state-of-the-art algorithms in continuous control tasks.

The Levy-Gromov inequality states that round spheres have the least isoperimetric profile (normalized by total volume) among Riemannian manifolds with a fixed positive lower bound on the Ricci tensor. In this note we study critical metrics corresponding to the Levy-Gromov inequality and prove that, in two-dimensions, t…

2016-12-13abs ↗pdf ↗

We reformulate the option framework as two parallel augmented MDPs. Under this novel formulation, all policy optimization algorithms can be used off the shelf to learn intra-option policies, option termination conditions, and a master policy over options. We apply an actor-critic algorithm on each augmented MDP, yieldi…

2019-04-29abs ↗pdf ↗

New findings on Chern flat metrics and their criticality.

problem Understanding critical Hermitian metrics on Chern flat manifolds.
method Analyzing Chern flat manifolds as compact quotients of complex Lie groups and studying their criticality.
result Chern flat metrics on semi-simple Lie groups are torsion-critical and vice versa.

A simple model economy with locally interacting producers and consumers is introduced. When driven by extremal dynamics, the model self-organizes {\em not} to an attractor state, but to an asymptote, on which the economy has a constant rate of deflation, is critical, and exhibits avalanches of activity with power-law d…

2000-05-19abs ↗pdf ↗

PBVFs generalize across policies using learned value functions.

problem RL algorithms forget information about old policies when updating value functions to track the learned policy.
method Introduce Parameter-Based Value Functions (PBVFs) that include policy parameters in their inputs, enabling them to generalize across different policies.
result PBVFs enable zero-shot learning of new policies that outperform any policy seen during training.

The paper studies the smoothness of critical points of variational integrals on Hessian spaces.

problem The study focuses on the regularity of critical points of variational integrals defined on Hessian spaces.
method The approach involves solving a fourth order nonlinear equation and analyzing the Hessian of the critical points.
result Smooth critical points with bounded Hessian are shown to be smooth provided their Hessian has small BMO.

Paper tackles overestimation bias in continuous control, improving performance by 25%.

problem Overestimation bias in off-policy learning.
method Truncated Quantile Critics (TQC) combines distributional representation, truncation, and ensembling of critics.
result TQC outperforms state-of-the-art methods by 25% on the Humanoid environment.

DMs emerge from DenseAMs, transitioning from memorization to generalization.

problem Hindered memory retrieval in DenseAMs due to spurious states.
method Examined diffusion models through the lens of DenseAMs, focusing on their generative process.
result Identified a critical phase in DMs transitioning from memorization to generalization.

In this paper, we investigate how to learn to control a group of cooperative agents with limited sensing capabilities such as robot swarms. The agents have only very basic sensor capabilities, yet in a group they can accomplish sophisticated tasks, such as distributed assembly or search and rescue tasks. Learning a pol…

2017-09-18abs ↗pdf ↗

Markov Decision Processes (MDPs), the mathematical framework underlying most algorithms in Reinforcement Learning (RL), are often used in a way that wrongfully assumes that the state of an agent's environment does not change during action selection. As RL systems based on MDPs begin to find application in real-world sa…

2019-11-11abs ↗pdf ↗

This paper considers the actor-critic contextual bandit for the mobile health (mHealth) intervention. The state-of-the-art decision-making methods in mHealth generally assume that the noise in the dynamic system follows the Gaussian distribution. Those methods use the least-square-based algorithm to estimate the expect…

2017-08-17abs ↗pdf ↗

After presenting Actor Critic Methods (ACM), we show ACM are control variate estimators. Using the projection theorem, we prove that the Q and Advantage Actor Critic (A2C) methods are optimal in the sense of the L2L^2 norm for the control variate estimators spanned by functions conditioned by the current state and acti…

2019-07-23abs ↗pdf ↗

The Stock Market is a complex self-interacting system, characterized by an intermittent behaviour. Periods of high activity alternate with periods of relative calm. In the present work we investigate empirically about the possibility that the market is in a self-organized critical state (SOC). A wavelet transform metho…

2004-05-12abs ↗pdf ↗

MAGE optimizes policies using action gradients from model-based learning.

problem Lack of direct gradient information from critics in actor-critic methods.
method Model-based actor-critic algorithm that learns action-value gradient.
result MAGE outperforms model-free and model-based baselines on continuous control tasks.

New analysis shows actor-critic method converges efficiently in practical settings.

problem Understanding finite-time convergence of single-timescale actor-critic methods.
method Investigated online single-timescale actor-critic algorithm with linear function approximation and Markovian sampling.
result Proved convergence to ε-approximate stationary point with sample complexity of O(ε^(-2)).