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,657 papers · 148 categories

Trend · papers per month

4795142189 · Jun 202019922001200920172026
48 results for Action phases

A novel framework interprets driving patterns using Action phases clustering.

problem Challenges in comprehending driving heterogeneity from underlying behavior mechanisms.
method Resampling and Downsampling Method (RDM) followed by iterative clustering calibration.
result Six driving patterns identified in real-world datasets, revealing dynamic nature of driving.

Describes reconstructing Poisson structures from Lie group actions.

problem Reconstructing invariant Poisson structures from Lie group actions.
method Describes reconstruction of invariant Poisson structures from canonical actions of compact Lie groups on fibered phase spaces.
result Derives symmetry properties of Wong's type equations from main results.

Detects anomalies in product health metrics at eBay for better alerts.

problem Detecting anomalies in unsupervised product health metrics at eBay.
method Developed a Moving Metric Detector (MMD) for anomaly detection and a point-wise ranking model for alert retrieval.
result Improves alert precision and avoids alert spamming in eBay production.

Bandit algorithms have various application in safety-critical systems, where it is important to respect the system constraints that rely on the bandit's unknown parameters at every round. In this paper, we formulate a linear stochastic multi-armed bandit problem with safety constraints that depend (linearly) on an unkn…

2019-08-16abs ↗pdf ↗

Poisson and symplectic structures discussed in lecture notes.

problem Exploring Poisson and symplectic structures in mathematics.
method Presentation of Poisson and symplectic structures, group actions, moment maps, and phase space reduction.
result Comprehensive review of Poisson and symplectic structures, group actions, and reduction.

The stability of money value is an important requisite for a functioning economy, yet it critically depends on the actions of participants in the market themselves. Here we model the value of money as a dynamical variable that results from trading between agents. The basic trading scenario can be recast into an Ising t…

2001-10-10abs ↗pdf ↗

Maximizes Rényi entropy for efficient exploration in reward-free RL.

problem Challenges of exploration in reward-free reinforcement learning.
method Maximizes Rényi entropy over state-action space in exploration phase; uses batch RL for planning phase.
result Effective and sample-efficient exploration leading to superior policies.

Improved regret bounds for bandit phase retrieval.

problem Minimizing cumulative and simple regret in a bandit phase retrieval problem.
method Proved minimax cumulative and simple regret bounds using adaptive algorithms.
result Minimax cumulative regret is ildeΘ(dn) ilde{\Theta}(d \sqrt{n}) and minimax simple regret is ildeΘ(d/n) ilde{\Theta}(d / \sqrt{n}).

In this paper, we investigate cost-aware joint learning and optimization for multi-channel opportunistic spectrum access in a cognitive radio system. We investigate a discrete time model where the time axis is partitioned into frames. Each frame consists of a sensing phase, followed by a transmission phase. During the …

2018-04-11abs ↗pdf ↗

Reinforcement learning (RL) in discrete action space is ubiquitous in real-world applications, but its complexity grows exponentially with the action-space dimension, making it challenging to apply existing on-policy gradient based deep RL algorithms efficiently. To effectively operate in multidimensional discrete acti…

2020-02-10abs ↗pdf ↗

The Lie algebroids are generalization of the Lie algebras. They arise, in particular, as a mathematical tool in investigations of dynamical systems with the first class constraints. Here we consider canonical symmetries of Hamiltonian systems generated by a special class of Lie algebroids. The ``coordinate part'' of th…

2002-01-21abs ↗pdf ↗

In this paper we propose new algorithm to reduce autocorrelation in Markov chain Monte-Carlo algorithms for euclidean field theories on the lattice. Our proposing algorithm is the Hybrid Monte-Carlo algorithm (HMC) with restricted Boltzmann machine. We examine the validity of the algorithm by employing the phi-fourth t…

2017-12-11abs ↗pdf ↗

We consider the classical stochastic multi-armed bandit problem with a constraint that limits the total cost incurred by switching between actions to be no larger than a given switching budget. For this problem, we prove matching upper and lower bounds on the optimal (i.e., minimax) regret, and provide efficient rate-o…

2019-05-26abs ↗pdf ↗

New algorithm for reward-free RL with linear function approximation, reducing sample complexity.

problem Efficiently learning optimal policies without prior reward information in complex environments.
method Developed an algorithm for reward-free RL in linear Markov decision processes, proving sample complexity bounds.
result Polynomial sample complexity in feature dimension and planning horizon, independent of states and actions.

PHASE dataset simulates complex social interactions in physical environments.

problem Lack of datasets for evaluating physically grounded perception of complex social interactions.
method Created PHASE dataset of 2D animations with procedural generation and physics engine.
result SIMPLE model outperforms neural networks in recognizing complex social interactions.

An artificial stock market is established based on multi-agent . Each agent has a limit memory of the history of stock price, and will choose an action according to his memory and trading strategy. The trading strategy of each agent evolves ceaselessly as a result of self-teaching mechanism. Simulation results exhibit …

2004-06-07abs ↗pdf ↗

New method deforms function algebras on manifolds using spectral decomposition.

problem Deforming function algebras on compact Riemannian manifolds.
method Introducing a bilinear product on the finite spectral core of smooth functions using unimodular phases.
result The product extends to a Sobolev algebra and admits iteration under certain conditions.

There are two variants of the classical multi-armed bandit (MAB) problem that have received considerable attention from machine learning researchers in recent years: contextual bandits and simple regret minimization. Contextual bandits are a sub-class of MABs where, at every time step, the learner has access to side in…

2018-10-17abs ↗pdf ↗

In this paper we analyze the obstructions to the existence of global action-angle variables for regular non-commutative integrable systems (NCI systems) on Poisson manifolds. In contrast with local action-angle variables, which exist as soon as the fibers of the momentum map of such an integrable system are compact, gl…

2015-02-28abs ↗pdf ↗

Reward hacking exploits misspecified rewards, affecting agent capabilities and true performance.

problem Reward hacking in RL models exploiting reward misspecifications.
method Constructed four RL environments with misspecified rewards; analyzed agent capabilities and behavior.
result More capable agents exploit reward misspecifications, achieving higher proxy reward but lower true reward.

In 1974, Berezin proposed a quantum theory for dynamical systems having a Kähler manifold as their phase space. The system states were represented by holomorphic functions on the manifold. For any homogeneous Kähler manifold, the Lie algebra of its group of motions may be represented either by holomorphic differential …

1994-07-15abs ↗pdf ↗

The paper tackles fair sequential decision making with biased linear bandit feedback.

problem Fair sequential decision making with biased linear bandit feedback.
method Phased elimination algorithm to correct unfair evaluations, establishing upper bounds on regret.
result The worst-case regret is smaller than O(κ1/3log(T)1/3T2/3)\mathcal{O}(κ_*^{1/3}\log(T)^{1/3}T^{2/3}).

We study the problem of designing AI agents that can robustly cooperate with people in human-machine partnerships. Our work is inspired by real-life scenarios in which an AI agent, e.g., a virtual assistant, has to cooperate with new users after its deployment. We model this problem via a parametric MDP framework where…

2019-10-05abs ↗pdf ↗

Reinforcement learning is considered to be a strong AI paradigm which can be used to teach machines through interaction with the environment and learning from their mistakes, but it has not yet been successfully used for automotive applications. There has recently been a revival of interest in the topic, however, drive…

2016-12-13abs ↗pdf ↗

The paper analyzes the current state of the world economy and offers a short-term forecast of its development. Our analysis of log-periodic oscillations in the DJIA dynamics suggests that in the second half of 2017 the United States and other more developed countries could experience a new recession, due to the third p…

2016-12-29abs ↗pdf ↗

We prove a theorem on singular symplectic cotangent bundle reduction in the Fréchet setting and apply it to Yang-Mills-Higgs theory with special emphasis on the Higgs sector of the Glashow-Weinberg-Salam model. For the latter model we give a detailed description of the reduced phase space and show that the singular str…

2018-12-11abs ↗pdf ↗

Foliate systems are those which preserve some (possibly singular) foliation of phase space, such as systems with integrals, systems with continuous symmetries, and skew product systems. We study numerical integrators which also preserve the foliation. The case in which the foliation is given by the orbits of an action …

2002-09-27abs ↗pdf ↗

We extend the AKSZ formulation of the Poisson sigma model to more general target spaces, and we develop the general theory of graded geometry for poly-symplectic and poly-Poisson structures. In particular we prove a Schwarz-type theorem and transgression for graded poly-symplectic structures, recovering the action func…

2019-12-16abs ↗pdf ↗

Paper uses deep reinforcement learning for better control of rocket engines during start-up phases.

problem Lack of optimal control during transient phases of liquid rocket engines.
method Deep reinforcement learning approach for optimal control of a gas-generator engine's continuous start-up phase.
result Deep reinforcement learning controller achieves highest performance and minimal computational effort.

Neural Architecture Search (NAS) has emerged as a promising technique for automatic neural network design. However, existing MCTS based NAS approaches often utilize manually designed action space, which is not directly related to the performance metric to be optimized (e.g., accuracy), leading to sample-inefficient exp…

2019-06-17abs ↗pdf ↗

Quantum CNNs can be efficiently simulated classically on simple datasets.

problem Quantum CNNs' success on simple datasets is due to low-bodyness measurements.
method Classical simulation using Pauli shadows on low-bodyness subspace.
result Quantum CNNs' action on low-bodyness subspace can be efficiently simulated classically.

Improved formulation of spinfoam quantum gravity with cosmological constant, ensuring all amplitudes are finite and providing semiclassical asymptotics.

problem Ensuring the finiteness of spinfoam amplitudes and providing semiclassical asymptotics for quantum gravity.
method Using state-integral model of PSL(2, C\mathbb{C}) Chern-Simons theory and implementing simplicity constraint.
result All spinfoam amplitudes are finite and provide semiclassical asymptotics with oscillatory terms related to the Regge action.

We discuss a class of (local and non-local) theories of gravity that share same properties: i) they admit the Einstein spacetime with arbitrary cosmological constant as a solution; ii) the on-shell action of such a theory vanishes and iii) any (cosmological or black hole) horizon in the Einstein spacetime with a positi…

2012-03-13abs ↗pdf ↗

A Poisson realization of the simple real Lie algebra so(4n)\mathfrak {so}^*(4n) on the phase space of each Sp(1)\mathrm {Sp}(1)-Kepler problem is exhibited. As a consequence one obtains the Laplace-Runge-Lenz vector for each classical Sp(1)\mathrm{Sp}(1)-Kepler problem. The verification of these Poisson realizations is greatly s…

2016-08-26abs ↗pdf ↗