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.

169,051 papers · 148 categories

Trend · papers per month

65131196261 · Jun 202019922001200920182026
48 results for action sequence

A new method learns disentangled macro actions from sequences for reinforcement learning.

problem Curse of dimensionality in reinforcement learning action space.
method Autonomously learns disentangled factor representation of actions to generate macro actions.
result Higher scores in complex environments compared to other reinforcement learning algorithms.

Hybridizes CEM and gradient descent for efficient model-predictive control.

problem Efficiently planning optimal action sequences in high-dimensional spaces.
method Interleaves Cross-Entropy Method (CEM) and gradient descent steps.
result Faster convergence and avoidance of local optima compared to CEM.

Study braid group actions on exceptional sequences using branched coverings.

problem Transitivity of braid group action on full exceptional sequences.
method Relate exceptional sequences to branched coverings, apply Birman--Hilden theory.
result Counterexamples to Bondal--Polishchuk conjecture on braid group transitivity.

A method to generate long-range human actions by leveraging graph convolutional networks and self-attention.

problem Generating long-range skeleton-based human actions is challenging due to small frame deviations.
method Proposes a variant of GCNs with self-attention to adaptively sparsify action graphs and capture structure information.
result Extensive experiments show superior performance compared to existing methods on human action datasets.

A new method for disentangling action sequences improves model stability.

problem Challenges in unsupervised disentanglement learning due to incomplete theories and abstract notions.
method Introducing disentangling action sequences and a novel fractional variational autoencoder (FVAE) framework.
result FVAE improves the stability of disentanglement for action sequences.

Deep network predicts action sequences for complex tasks from a scene image.

problem Scalable task and motion planning from initial scene images.
method Deep convolutional recurrent neural network that predicts action sequences.
result Predicts promising action sequences, reducing motion planning problems.

Study of orbifold mapping class groups via arc and curve actions.

problem Understanding the structure of orbifold mapping class groups.
method Defined orbifold mapping class groups and studied their actions on arcs and curves. Established a Birman exact sequence and derived finite presentations.
result Finite presentations of orbifold mapping class groups established.

SocialInteractionGAN generates realistic human interactions from low-dimensional data.

problem Generating realistic human interactions from limited data.
method Adversarial architecture with a recurrent encoder-decoder generator and dual-stream discriminator.
result SocialInteractionGAN produces high-quality action sequences of interacting people.

Improves text-to-speech speed by interleaving character reading and audio synthesis.

problem Latency in text-to-speech models limits their use in time-sensitive tasks.
method Reinforcement learning to train an agent to choose the order of character reading and audio synthesis.
result The proposed method successfully balances latency and audio quality.

The curve graph and related graphs are hyperbolic and have quasi-tree fibers.

problem Understanding the structure of the curve graph and related graphs.
method Analyzing a sequence of graphs with Lipschitz maps and proving hyperbolicity and quasi-tree properties.
result The graphs in the sequence are hyperbolic and have quasi-tree fibers, leading to bounds on asymptotic dimension and acylindrical actions.

AGAIL learns policies from incomplete demonstrations by separating state and action trajectories.

problem Learning policies from incomplete demonstrations where actions are partially available.
method Action-Guided Adversarial Imitation Learning (AGAIL) separates state and action trajectories, using actions as auxiliary information to guide policy training.
result AGAIL consistently delivers comparable performance to state-of-the-art methods even with partially available action sequences.

A 2-manifold's group structure is deduced from orbit configuration spaces.

problem Understanding the fundamental groups of orbit configuration spaces.
method Relating the four-term exact sequence of orbifold pure braid groups to the fundamental groups of the orbit configuration spaces.
result Fundamental groups of orbit configuration spaces form a four-term exact sequence.

Future autonomous systems need reliable world models and complex action sequences.

problem Current automated systems lack reliable world models and complex action sequences.
method Introduce energy-based and latent variable models combined in a hierarchical joint embedding predictive architecture (H-JEPA).
result Combining energy-based and latent variable models in H-JEPA can lead to reliable world models and complex action sequences.

Researchers establish a connection between knot homology and Lie algebra actions.

problem Understanding the HOMFLY-PT homology of (n,n+1)(n,n+1) torus knots.
method Constructing an explicit isomorphism and computing tautological class actions.
result The tautological class action extends to Hamiltonian vector fields and differentials in spectral sequences.

Intelligent agents can learn to represent the action spaces of other agents simply by observing them act. Such representations help agents quickly learn to predict the effects of their own actions on the environment and to plan complex action sequences. In this work, we address the problem of learning an agent's action…

2018-06-25abs ↗pdf ↗

Study finite group actions on exotic aspherical space forms.

problem Classify finite group actions on M#ΣM\#Σ where MM is a closed aspherical space form and ΣΣ is an exotic nn-sphere.
method Combines geometric and topological rigidity results with smoothing theory and spectral sequence computations.
result Classification of free actions of finite groups on M#ΣM\#Σ when MM is 7-dimensional.

Study how actions affect perception in embodied agents using group theory.

problem Understanding how actions influence perception in autonomous agents.
method Mathematical formalism of group theory applied to sensory commutativity of action sequences.
result Introduced Sensory Commutativity Probability (SCP) to measure action effects on perception.

Improved action recognition in live videos with hybrid FR-DL method.

problem High computational costs and lack of temporal information in conventional action recognition.
method Automated selection of representative frames, feature extraction, background subtraction, HOG, deep neural network, LSTM, Softmax-KNN classifier.
result Significant improvement in accuracy and speed compared to state-of-the-art methods.

The paper examines the topology of quaternionic toric actions on manifolds.

problem Understanding the global topology of manifolds with quaternionic toric actions.
method Established toric, differential, and tetraplectic foundations. Constructed spectral sequences for the orbit projection to describe cohomology and K-theory.
result Explicit descriptions of cohomology and K-theory for manifolds with quaternionic toric actions, extending complex toric topology.

Sequences of Hitchin representations on surfaces are studied to describe their limits on trees.

problem Understanding the limits of sequences of Hitchin representations on surfaces.
method Using Fock-Goncharov coordinates on moduli spaces of flags.
result Non-trivial sufficient conditions for describing the limit of a sequence of Hitchin representations as an action on a tree.

In this paper we present the construction of explicit quasi-isomorphisms that compute the cyclic homology and periodic cyclic homology of crossed-product algebras associated with (discrete) group actions. In the first part we deal with algebraic crossed-products associated with group actions on unital algebras over any…

2017-06-27abs ↗pdf ↗

Let T be a torus. We present an exact sequence relating the relative equivariant cohomologies of the skeletons of an equivariantly formal T-space. This sequence, which goes back to Atiyah and Bredon, generalizes the so-called Chang-Skjelbred lemma. As coefficients, we allow prime fields and subrings of the rationals, i…

2003-07-09abs ↗pdf ↗

New braid group actions on nn-adic integers linked to real algebraic links.

problem Understanding braid group actions on nn-adic integers.
method Constructing an infinite tower of covering spaces over configuration spaces and associating braids to infinite sequences of braids.
result An infinite family of braids close to real algebraic links.

We introduce a new class of reinforcement learning methods referred to as {\em episodic multi-armed bandits} (eMAB). In eMAB the learner proceeds in {\em episodes}, each composed of several {\em steps}, in which it chooses an action and observes a feedback signal. Moreover, in each step, it can take a special action, c…

2015-08-04abs ↗pdf ↗

PLOTS learns procedural actions from observed sequences, up to 100x faster.

problem Learning procedural actions from observed sequences efficiently.
method Exploits subtask structure to incrementally build action plans, optimistically explores actions.
result Explicit procedural learning is 100x faster than policy-gradient methods and model-based approaches.

Develops methods for finding counterfactual explanations in sequential decision making.

problem Finding counterfactual explanations for sequential decision making processes.
method Formal characterization of sequential actions and states using Markov decision processes and Gumbel-Max structural causal model. Introduces a polynomial time algorithm based on dynamic programming.
result Algorithm finds optimal counterfactual explanations for sequential decision making.

The paper tackles finding optimal treatment sequences in continuous state spaces.

problem Finding counterfactually optimal action sequences in continuous state spaces.
method Formalizes the problem using finite horizon Markov decision processes and structural causal models. Develops a search method based on the A* algorithm.
result The method can find optimal action sequences in polynomial time under certain conditions.

The principal group of a Klein geometry has canonical left action on the homogeneous space of the geometry and this action induces action on the spaces of sections of vector bundles over the homogeneous space. This paper is about construction of differential operators invariant with respect to the induced action of the…

2012-01-01abs ↗pdf ↗

Paper proposes a hybrid AI method to optimize pandemic actions.

problem Optimizing government actions to balance public health and economy.
method Combines Deep Q-Learning and Genetic Algorithms for optimal sequences of actions.
result Deep Q-Learning outperforms Genetic Algorithms in optimizing action sequences.