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

73146218291 · Jun 202019922001200920172026
48 results for action potentials

Geodesics on Kähler manifold potentials are paths of least action.

problem Understanding geodesics on the space of Kähler potentials.
method Study Lagrangians and geodesics on the Fréchet manifold of Kähler potentials, showing geodesics are paths of least action.
result Geodesics on the space of Kähler potentials are paths of least action, and conversely under suitable conditions.

The paper introduces metrics to rank potential outcomes for better decision-making.

problem Optimal action selection in uncertain situations using causal reasoning.
method Introducing two new metrics: probabilities of potential outcome ranking (PoR) and probability of achieving the best potential outcome (PoB). Establishing identification theorems and deriving bounds for these metrics, and presenting estimation methods.
result The estimators' finite-sample properties and their application to a real-world dataset are demonstrated.

hyperSBINN improves drug cardiosafety assessment by efficiently modeling cardiac action potentials.

problem Complexity and limited data in modeling cardiac effects of drugs.
method Combining meta-learning with SBINNs to solve parameterized cardiac action potential models.
result hyperSBINN outperforms traditional solvers in speed and accuracy for predicting APD90 values.

The Ma-Trudinger-Wang curvature --- or cross-curvature --- is an object arising in the regularity theory of optimal transportation. If the transportation cost is derived from a Hamiltonian action, we show its cross-curvature can be expressed in terms of the associated Jacobi fields. Using this expression, we show the l…

2009-08-31abs ↗pdf ↗

New method minimizes decision errors in large treatment spaces.

problem Improving decision-making in large treatment spaces with biased observational data.
method Loss minimizes classification error of actions in large action space.
result Proves improved decision-making performance in large combinatorial action spaces.

We identify action representations from video data, proving their statistical benefits.

problem Identifying latent action policies from video data.
method Entropy-regularized LAPO objective, formalizing desiderata for action representations.
result Entropy-regularized LAPO identifies action representations satisfying desiderata under suitable conditions.

Let M be a Kaehler manifold with a free, holomorphic and Hamiltonian action of the standard n-torus T. We give a simple, explicit and canonical formula for the Kaehler potential on the Kaehler reduction of M. As a consequence we can derive improvements of several classical results known for more general Hamiltonian red…

2003-02-27abs ↗pdf ↗

Optimal maps, solutions to the optimal transportation problems, are completely determined by the corresponding c-convex potential functions. In this paper, we give simple sufficient conditions for a smooth function to be c-convex when the cost is given by minimizing a Lagrangian action.

2010-06-20abs ↗pdf ↗

We utilize the Ozsvath-Szabo contact invariant to detect the action of involutions on certain homology spheres that are surgeries on symmetric links, generalizing a previous result of Akbulut and Durusoy. Potentially this may be useful to detect different smooth structures on 4-manifolds by cork twisting operation.

2011-04-12abs ↗pdf ↗

Improved Bayesian regret bound for linear Thompson sampling with general distributions.

problem Proving an improved Bayesian regret bound for linear Thompson sampling with general distributions.
method Generalized elliptical potential lemma for non-Gaussian noise and prior distributions.
result Minimax optimal regret bound for changing action sets with general prior and noise distributions.

A second order self-adjoint operator Δ=S2+UΔ=S\partial^2+U is uniquely defined by its principal symbol SS and potential UU if it acts on half-densities. We analyse the potential UU as a compensating field (gauge field) in the sense that it compensates the action of coordinate transformations on the second derivatives in…

2015-09-18abs ↗pdf ↗

UTE improves reinforcement learning by measuring action uncertainty, enhancing policy learning efficiency.

problem Degrading performance of action repetition in reinforcement learning, especially with sub-optimal actions.
method UTE uses ensemble methods to measure uncertainty during action extension, allowing strategic exploration or certainty.
result UTE outperforms existing action repetition algorithms, significantly enhancing policy learning efficiency.

In this technical note we give a purely geometric understanding of discrete torsion, as an analogue of orbifold Wilson lines for two-form tensor field potentials. In order to introduce discrete torsion in this context, we describe gerbes and the description of certain type II supergravity tensor field potentials as con…

1999-09-15abs ↗pdf ↗

We study the Liouville action for quasi-Fuchsian groups with parabolic and elliptic elements. In particular, when the group is Fuchsian, the contribution of elliptic elements to the classical Liouville action is derived in terms of the Bloch-Wigner functions. We prove the first and second variation formulas for the cla…

2017-09-26abs ↗pdf ↗

For a compact Riemannian manifold with boundary, endowed with a magnetic potential αα, we consider the problem of restoring the metric gg and the magnetic potential αα from the values of the Mañé action potential between boundary points and the associated linearized problem. We study simple magnetic systems. In this…

2006-11-25abs ↗pdf ↗

Paper uses sparse learning to estimate quasi-potential and drift components in stochastic systems.

problem Estimating quasi-potential and drift components in stochastic systems.
method Sparse identification of non-linear dynamics (SINDy) combined with action minimization methods.
result Evaluation of quasi-potential landscape from a single trajectory.

The universal Liouville action equals the renormalized volume of a hyperbolic 3-manifold.

problem Understanding the geometric significance of the universal Liouville action.
method Analyzing the Weil-Petersson universal Teichmüller space and its relation to hyperbolic 3-manifolds.
result The gradient flow of the universal Liouville action converges to the origin, providing a bound on Weil-Petersson distance.

New algorithm reduces regret in private online learning with optimal gap-dependent rate.

problem Optimal gap-dependent regret rate for private stochastic decision-theoretic online learning.
method Horizon-free pure-DP algorithm with exponential block partitioning and softmax selection.
result Explicit regret bound of 1000(logKΔmin+logKε)1000 \cdot (\frac{\log K}{Δ_{\min}}+\frac{\log K}{\varepsilon}).

Paper tackles optimal policy learning with observational data in multi-action scenarios.

problem Optimal policy learning in multi-action settings with observational data.
method Review of estimation approaches, analysis of risk preference, discussion of potential failures.
result Average regret of a policy with multi-valued treatment is contingent on the decision-maker's attitude towards risk.

MaxMax Q-Learning improves coordination in multi-agent reinforcement learning by refining action selection.

problem Relative over-generalization in decentralized multi-agent reinforcement learning.
method MaxMax Q-Learning employs iterative sampling and evaluation of potential next states to refine approximations of ideal state transitions.
result MaxMax Q-Learning frequently outperforms existing baselines, demonstrating enhanced convergence and sample efficiency.

The Markov decision process (MDP) formulation used to model many real-world sequential decision making problems does not efficiently capture the setting where the set of available decisions (actions) at each time step is stochastic. Recently, the stochastic action set Markov decision process (SAS-MDP) formulation has b…

2019-06-05abs ↗pdf ↗

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.

We study relations between quaternionic Riemannian manifolds admitting different types of symmetries. We show that any hyperKahler manifold admitting hyperKahler potential and triholomorphic action of S^1 can be constructed from another hyperKahler manifold (of lower dimention) with an action of S^1 which fixes one com…

2007-06-29abs ↗pdf ↗

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 ↗

Let O be a nilpotent orbit in g^C where G is a compact, simple group and g=Lie(G). It is known that O carries a unique G-invariant hyperKähler metric admitting a hyperKähler potential compatible with the Kirillov-Kostant-Souriau symplectic form. In this work, the hyperKähler potential is explicitly calculated when O is…

2004-06-01abs ↗pdf ↗

Gradient flow in a potential energy (or Euclidean action) landscape provides a natural set of paths connecting different saddle points. We apply this method to General Relativity, where gradient flow is Ricci flow, and focus on the example of 4-dimensional Euclidean gravity with boundary S^1 x S^2, representing the can…

2006-06-09abs ↗pdf ↗

In recent works, the authors considered various Lagrangians, which are invariant under a Lie group action, in the case where the independent variables are themselves invariant. Using a moving frame for the Lie group action, they showed how to obtain the invariantized Euler-Lagrange equations and the space of conservati…

2013-06-04abs ↗pdf ↗

New algorithm optimizes online decision-making with dynamically generated actions.

problem Balancing action generation costs with optimal decision-making in online learning.
method Doubly-optimistic algorithm using LCB for action selection and UCB for action generation.
result Achieves optimal regret bound of O(Tdd+2ddd+2+dTlogT)O(T^{\frac{d}{d+2}}d^{\frac{d}{d+2}} + d\sqrt{T\log T}).

We study the motion of a particle in the hyperbolic plane (embedded in Minkowski space), under the action of a potential that depends only on one variable. This problem is the analogous to the spherical pendulum in a unidirectional force field. However, for the discussion of the hyperbolic plane one has to distinguish …

2013-05-16abs ↗pdf ↗

Training deep reinforcement learning agents complex behaviors in 3D virtual environments requires significant computational resources. This is especially true in environments with high degrees of aliasing, where many states share nearly identical visual features. Minecraft is an exemplar of such an environment. We hypo…

2019-08-02abs ↗pdf ↗

Under the action of the c-map, special Kahler manifolds are mapped into a class of quaternion-Kahler spaces. We explicitly construct the corresponding Swann bundle or hyperkahler cone, and determine the hyperkahler potential in terms of the prepotential of the special Kahler geometry.

2006-03-02abs ↗pdf ↗

Motivated by the recent applications of game-theoretical learning techniques to the design of distributed control systems, we study a class of control problems that can be formulated as potential games with continuous action sets, and we propose an actor-critic reinforcement learning algorithm that provably converges t…

2014-12-01abs ↗pdf ↗