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

51103154205 · Jun 202019922001200920172026
48 results for multiply transitive actions

Classifies multiply-transitive (2,3,5)-distributions using modern Cartan geometry.

problem Classifying multiply-transitive (2,3,5)(2,3,5)-distributions.
method Modern Cartan-geometric approach, incorporating G2G_2 structure theory.
result Complete classifications in both complex and real settings, with full curvature and infinitesimal holonomy.

New unoriented versions of Schur and Bogomolov multipliers for finite groups.

problem Defining and analyzing unoriented versions of Schur and Bogomolov multipliers.
method Using cohomology groups and quotient groups to define unoriented multipliers.
result Triviality of unoriented Bogomolov multiplier for certain groups, nontriviality for others.

Following the spirit of a previous work of ours, we investigate the group of those General Coordinate Transformations (GCTs) which preserve manifest spatial homogeneity. In contrast to the case of Bianchi Type Models we, here, permit an isometry group of motions G4=SO(3)TrG_{4}=SO(3)\otimes T_{r}, where TrT_{r} is the translat…

2002-02-04abs ↗pdf ↗

New method constructs relative invariants for group actions on extended manifolds.

problem Constructing relative invariants for Lie group actions.
method Developed a constructive modification of the moving frame method for extended manifolds.
result Invariantization of the multiplier yields a canonical relative invariant of weight -1.

Study groups acting on trees with specific local actions, proving cohomology vanishing or infinite.

problem Understanding bounded cohomology of groups with prescribed local actions.
method Proving vanishing or infinite bounded cohomology based on the 2-transitivity of FF'.
result Vanishing or infinite bounded cohomology depending on FF''s 2-transitivity.

New classification of conformal structures with maximal G2G_2 symmetry.

problem Classifying conformal structures with maximal G2G_2 symmetry.
method Complete local classification of homogeneous 4D split-conformal structures.
result Established a complete local classification of conformal structures with maximal G2G_2 symmetry.

This paper studies actions of solvable Lie groups on nilpotent Lie groups.

problem Characterizing which solvable Lie groups can act simply transitively on nilpotent Lie groups.
method Using Lie algebra properties and semisimple splitting, the paper provides methods to check for such actions.
result A full description of possibilities for actions up to dimension 4.

A transitive smooth action of a connected Lie group G on a manifold M is called almost primitive (resp. primitive) if G doesn't contain any proper subgroup (resp. any proper normal subgroup) whose induced action on M is transitive as well. The aim of the present work is to investigate some combinatory properties of sym…

2002-02-25abs ↗pdf ↗

To any connected and simply connected nilpotent Lie group N, one can associate its group of affine transformations Aff(N). In this paper, we study simply transitive actions of a given nilpotent Lie group G on another nilpotent Lie group N, via such affine transformations. We succeed in translating the existence questio…

2007-11-30abs ↗pdf ↗

Semisimple Lie groups act transitively on pseudo-Riemannian manifolds, making them flat.

problem Understanding actions of semisimple Lie groups on pseudo-Riemannian manifolds.
method Analyzing the pseudo-Riemannian Lichnerowicz conjecture in homogeneous settings.
result Compact pseudo-Riemannian manifolds on which a semisimple group acts conformally, essentially and transitively, are conformally flat.

PQR estimates reward functions from actions and states without assuming state-only rewards.

problem Estimating reward functions from actions and states without state-only assumptions.
method Deep learning approach that sequentially estimates policy, Q-function, and reward.
result PQR uniquely recovers true reward with known transitions and bounds error with unknown transitions.

This paper shows how post-Lie algebra structures can be induced by simply transitive NIL-affine actions.

problem Understanding which solvable Lie groups can act simply transitively on nilpotent Lie groups.
method Introducing post-Lie algebra structures and showing their correspondence with simply transitive actions.
result Simply transitive NIL-affine actions induce complete post-Lie algebra structures in the 2-step nilpotent case.

New algorithm reduces regret and constraint violation in adversarial CMDP learning.

problem Online learning for episodic stochastically constrained Markov decision processes (CMDPs) with adversarial loss.
method Upper Confidence Primal-Dual Reinforcement Learning (UC-PDL) algorithm.
result Achieves O~(LSAT)\widetilde{\mathcal{O}}(L|\mathcal{S}|\sqrt{|\mathcal{A}|T}) upper bounds of both regret and constraint violation.

A new RL paradigm reduces state-action-value function approximation inefficiency.

problem Challenges in state-action-value function approximation for RL.
method State Action Separable Reinforcement Learning (sasRL) decouples action space from value function learning.
result sasRL achieves up to 75% better performance than state-of-the-art MDP-based RL algorithms.

We classify the polar actions on the complex hyperbolic plane up to orbit equivalence. Apart from the trivial and transitive polar actions, there are five polar actions of cohomogeneity one and four polar actions of cohomogeneity two.

2011-08-02abs ↗pdf ↗

Compact complex manifolds with specific group actions are conformally flat.

problem Compact complex manifolds with invariant conformal holomorphic structures.
method Study of manifolds with transitive and essentially acting complex semi-simple Lie groups.
result If a complex semi-simple Lie group acts transitively and essentially, the manifold is conformally flat.

A homogeneous space is a manifold on which a Lie group acts transitively. Super generalization of this concept is also studied in [2] and [4]. In this paper we explicitly show that super Lie group GL(m|n) acts transitively on supergrassmannian G_{k|l}(m|n). In this regard, by using functor of point approach, this actio…

2018-01-07abs ↗pdf ↗

We introduce Dynamic Planning Networks (DPN), a novel architecture for deep reinforcement learning, that combines model-based and model-free aspects for online planning. Our architecture learns to dynamically construct plans using a learned state-transition model by selecting and traversing between simulated states and…

2018-12-28abs ↗pdf ↗

This work uses action equivariance to learn structured latent spaces for reinforcement learning.

problem Learning structured latent spaces for reinforcement learning.
method Introduced a contrastive loss function to enforce action equivariance on learned representations.
result Optimal policies in the abstract MDP can be successfully lifted to the original MDP.

Identifies latent actions and dynamics from offline data with diverse demonstrators.

problem Recovering latent actions and environment dynamics from action-free trajectories.
method Assumes distinct policies for each demonstrator, identifies latent transitions and policies via matrix factorization.
result Identifies latent transitions and demonstrator policies up to permutation.

It is shown that the Euler-Lagrange equations for a Lagrangian system on a Lie algebroid are obtained as the equations for the critical points of the action functional defined on a Banach manifold of curves. The theory of reduction and the relation with Lagrange multiplier method are also studied.

2006-03-09abs ↗pdf ↗

Study shows optimal RL with transition look-ahead is NP-hard for 2\ell \geq 2.

problem Optimal reinforcement learning with transition look-ahead is computationally hard.
method Proved NP-hardness for 2\ell \geq 2 using linear programming.
result There is a precise boundary between tractable and intractable cases for RL with look-ahead.

We study higher rank Cartan actions on compact manifolds preserving an ergodic measure with full support. In particular, we classify actions by Rk\R ^k with k3k \geq 3 whose one-parameter groups act transitively as well as nondegenerate totally nonsymplectic $\Zk$-actions for k3k \geq 3.

2004-11-10abs ↗pdf ↗

Quasi-vertex-transitive maps are the homogeneous maps on the plane with finitely many vertex orbits under the action of their automorphism groups. We show that there exist quasi-vertex-transitive maps of types [p3,3][p^3, 3] for p1p \equiv 1 (mod 66), but there doesn't exist vertex-transitive map of such types. In particu…

2019-09-19abs ↗pdf ↗

Paper introduces a new value function for state transitions and optimal policy learning.

problem Learning optimal policies from state transitions and actions.
method Develops a forward dynamics model to maximize a novel value function Q(s,s)Q(s, s').
result Demonstrates benefits in value function transfer, redundant action spaces, and off-policy learning.

Due to a result by Mackenzie, extensions of transitive Lie groupoids are equivalent to certain Lie groupoids which admit an action of a Lie group. This paper is a treatment of the equivariant connection theory and holonomy of such groupoids, and shows that such connections give rise to the transition data necessary for…

2003-07-21abs ↗pdf ↗

We classify compact homogeneous geometries of irreducible spherical type and rank at least 2 which admit a transitive action of a compact connected group, up to equivariant 2-coverings. We apply our classification to polar actions on compact symmetric spaces.

2012-05-10abs ↗pdf ↗

Deep reinforcement learning method finds rare events in complex systems.

problem Computing transition pathways in high-dimensional systems.
method Formulated as a cost minimization problem, solved using DDPG with physical properties.
result Efficiently samples and computes globally optimal transition pathways.

A critical and challenging problem in reinforcement learning is how to learn the state-action value function from the experience replay buffer and simultaneously keep sample efficiency and faster convergence to a high quality solution. In prior works, transitions are uniformly sampled at random from the replay buffer o…

2018-04-23abs ↗pdf ↗

New findings reveal discount regularization can be seen as a strong prior, leading to poor performance in unevenly sampled data.

problem Discount regularization leads to poor performance in unevenly sampled data.
method Equivalence theorem showing discount regularization as a strong prior, setting regularization parameters locally for individual state-action pairs.
result Discount regularization can be seen as a strong prior, leading to poor performance in unevenly sampled data.

We study the construction of quasimorphisms on groups acting on trees introduced by Monod and Shalom, that we call median quasimorphisms, and in particular we fully characterise actions on trees that give rise to non-trivial median quasimorphisms. Roughly speaking, either the action is highly transitive on geodesics, i…

2014-11-28abs ↗pdf ↗