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

125250375500 · Jun 202019922001200920172026
48 results for Abstract Spaces

This paper simplifies OPE in large state spaces using state abstractions.

problem Accurately evaluating policies offline in large state spaces.
method Developed a backward-model-irrelevance condition and an iterative state abstraction procedure.
result Deeply-abstracted states substantially simplify OPE sample complexity.

moment maps arise as a generalization of genuine moment maps on symplectic manifolds when the symplectic structure is discarded, but the relation between the mapping and the action is kept. Particular examples of abstract moment maps had been used in Hamiltonian mechanics for some time, but the abstract notion originat…

1999-04-21abs ↗pdf ↗

Can simple algorithms with a good representation solve challenging reinforcement learning problems? In this work, we answer this question in the affirmative, where we take "simple learning algorithm" to be tabular Q-Learning, the "good representations" to be a learned state abstraction, and "challenging problems" to be…

2020-02-08abs ↗pdf ↗

Abstraction of Markov Decision Processes is a useful tool for solving complex problems, as it can ignore unimportant aspects of an environment, simplifying the process of learning an optimal policy. In this paper, we propose a new algorithm for finding abstract MDPs in environments with continuous state spaces. It is b…

2018-11-30abs ↗pdf ↗

Deep neural network learns discrete state abstractions for efficient planning.

problem Efficient sequential decision making in large state spaces.
method Information bottleneck method for learning approximate bisimulations using deep neural encoders and action-conditioned HMM.
result Trained method efficiently plans for unseen goals in multi-goal reinforcement learning.

We present an encoder-powered generative adversarial network (EncGAN) that is able to learn both the multi-manifold structure and the abstract features of data. Unlike the conventional decoder-based GANs, EncGAN uses an encoder to model the manifold structure and invert the encoder to generate data. This unique scheme …

2019-06-03abs ↗pdf ↗

A site-specific Gordian distance between two spatial embeddings of an abstract graph is the minimal number of crossing changes from one to another where each crossing change is performed between two previously specified abstract edges of the graph. It is infinite in some cases. We determine the site-specific Gordian di…

2017-03-28abs ↗pdf ↗

Representation costs in data science: Unifying function-space views of parametric methods

problem Analyzing representation costs of parametric data-fitting methods
method Developing a general framework for analyzing representation costs through parameter-space regularizers
result Proving that many natural results hold in this abstract setting, including representer theorems for parametric methods on their native spaces

A self-contained introduction is presented of the notion of the (abstract) differentiable manifold and its tangent vector fields. The way in which elementary topological ideas stimulated the passage from Euclidean (vector) spaces and linear maps to abstract spaces (manifolds) and diffeomorphisms is emphasized. Necessar…

2012-04-10abs ↗pdf ↗

Abstract MDPs enable strategic exploration and fast reward transfer in complex environments.

problem Challenging to learn accurate MDPs for high-dimensional states.
method Learn an abstract MDP over low-dimensional coarse states, using an abstraction function.
result Achieves superhuman performance on Pitfall! and higher reward with fewer samples.

The paper characterizes biconservative surfaces in hyperbolic 4-space.

problem Characterizing biconservative surfaces in hyperbolic 4-space.
method Establishing intrinsic conditions and analyzing geometric properties.
result Biconservative surfaces in hyperbolic 4-space satisfy a specific intrinsic condition.

Our objective is to develop a stratified Morse theory with tangential conditions. We define a continuous strata-wise smooth Morse function on an abstract stratified space by using control conditions and radiality assumptions on the gradient vector field. For critical points of a Morse function one can show that the loc…

2003-10-02abs ↗pdf ↗

Abstract perspective on quadratic programming for optimal portfolio allocation.

problem Optimal allocation problems in long portfolio theory.
method Using maximum principles and distinguished boundaries in reproducing kernel Hilbert spaces.
result Support of an optimal distribution lies in a variety intersecting a distinguished boundary.

Predicting stochastic cellular dynamics as emerging from the mechanistic models of molecular interactions is a long-standing challenge in systems biology: low-level chemical reaction network (CRN) models give raise to a highly-dimensional continuous-time Markov chain (CTMC) which is computationally demanding and often …

2020-01-30abs ↗pdf ↗

Abstract: Generalizes SGMs to infinite-dimensional Hilbertian setting.

problem Difficulties in extending SGMs to infinite-dimensional settings.
method Uses Gamma and Malliavin Calculus, Dirichlet forms, Wiener chaoses, and time-reversal formula.
result Generalized SGMs to Hilbertian setting with finite-dimensional entropic convergence bounds.

New approach to abstract neural network representations using renormalization group.

problem Developing truly abstract representations in neural networks.
method Renormalization group approach to expand representations to encompass broader data sets.
result Representations in neural networks become more abstract as data breadth increases and depth increases.

Study investigates how simple speech sounds can form abstract categories.

problem How do abstract categories like phonemes emerge from speech exposure?
method Used modeling techniques to test Memory-Based Learning and Error-Correction Learning.
result Error-Correction Learning models can learn abstractions, identifying phone inventory and grouping.

Algorithm finds latent structure in value functions for improved reinforcement learning.

problem Finding latent structure in value functions for efficient reinforcement learning.
method Proposes a practical algorithm using two posterior distributions over state abstractions and abstract-state values.
result Substantial performance gains in multi-task settings where tasks share a common, low-dimensional representation.

Mid-training improves RL by identifying compact action abstractions.

problem Unlocking full potential of RL with large language models.
method RA3 algorithm that optimizes sequential variational lower bound and discovers latent structures via RL.
result Improves performance by 8 points on HumanEval and 4 points on MBPP.

A collection of the accepted abstracts for the Machine Learning for Health (ML4H) workshop at NeurIPS 2019. This index is not complete, as some accepted abstracts chose to opt-out of inclusion.

2020-02-05abs ↗pdf ↗

The paper proposes a principle for dynamically adjusting the granularity of reinforcement learning abstractions.

problem Lack of general principles for dynamically adjusting the granularity of reinforcement learning abstractions.
method The paper proposes a principle based on rate-distortion theory, formalized through a performance certificate decomposing value error into learning and abstraction error bounds.
result Soft state-action abstractions can achieve near-optimal performance under substantial lossy compression of state and action information.

We describe a general framework for measuring risks, where the risk measure takes values in an abstract cone. It is shown that this approach naturally includes the classical risk measures and set-valued risk measures and yields a natural definition of vector-valued risk measures. Several main constructions of risk meas…

2006-06-21abs ↗pdf ↗

We prove a definable version of the Whitney embedding theorem for abstract-definable Cp\mathcal{C}^p manifolds with 1p<1\leq p<\infty, namely: every abstract-definable Cp\mathcal{C}^p manifold is abstract-definable CpC^p embedded into RNR^N, for some positive integer NN. As a consequence, we show that every abstract-de…

2019-04-10abs ↗pdf ↗

Let B_n be the braid group on n strands, with n at least 4, and let Mod(S) be the extended mapping class group of the sphere with n+1 punctures. We show that the abstract commensurator of B_n is isomorphic to a semidirect product of Mod(S) with a group we refer to as the transvection subgroup, Tv(B_n). We also show tha…

2005-01-26abs ↗pdf ↗