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

86172257343 · Jun 202019922001200920172026
48 results for Abstract Properties

XIMP improves molecular property prediction by integrating multiple graph representations.

problem Graph neural networks struggle in data-scarce regimes and fail to surpass traditional methods.
method Cross-graph inter-message passing with multiple graph abstractions.
result XIMP outperforms state-of-the-art baselines across diverse molecular property tasks.

Enhances BO with expert preferences about abstract properties.

problem Lack of expert knowledge in BO for black-box experimental design.
method Human-AI collaboration to incorporate expert preferences into surrogate modeling.
result Superior performance compared to baselines in synthetic and real-world datasets.

Constellation learns group-level visual relationships for abstract reasoning.

problem Learning configurational properties of entire groups of objects.
method Introduces Constellation, a network that learns relational abstractions over static visual scenes.
result Offers a basis for abstract relational reasoning and sensory imagination.

Resolving abstract anaphora is an important, but difficult task for text understanding. Yet, with recent advances in representation learning this task becomes a more tangible aim. A central property of abstract anaphora is that it establishes a relation between the anaphor embedded in the anaphoric sentence and its (ty…

2017-06-07abs ↗pdf ↗

The paper introduces a method to learn Markov state abstractions for reinforcement learning.

problem Learning Markov state representations in complex environments.
method The paper introduces a novel set of conditions and a training procedure combining inverse model estimation and temporal contrastive learning.
result The approach learns representations that capture the underlying structure of the domain and improve sample efficiency.

O-minimal geometry generalizes both semialgebraic and subanalytic geometries, and has been very successful in solving special cases of some problems in arithmetic geometry, such as André-Oort conjecture. Among the many tools developed in an o-minimal setting are cohomology theories for abstract-definable continuous man…

2019-04-11abs ↗pdf ↗

The paper explores higher property T in lattices and its connections to geometric phenomena.

problem Understanding higher property T in lattices and related geometric phenomena.
method Operator-algebraic characterizations of higher property T and connections to lattice geometry.
result Unified framework for understanding higher property T and related geometric phenomena.

We give an up-to-date perspective with a general overview of the theory of causal properties, the derived causal structures, their classification and applications, and the definition and construction of causal boundaries and of causal symmetries, mostly for Lorentzian manifolds but also in more abstract settings.

2005-01-24abs ↗pdf ↗

The paper develops a framework for abstracting causal models using category theory.

problem Difficulties in changing the variables used to describe a system, especially from fine-grained to coarse-grained.
method Introduces a category of interventional causal models and uses enriched category theory to prove compositionality properties.
result Compositionality of model transformations is established, with bounded errors for each step.

simpcomp is an extension (a so called package) to GAP, the well known system for computational discrete algebra. The package enables the user to compute numerous properties of (abstract) simplicial complexes, provides functions to construct new complexes from existing ones and an extensive library of triangulations of …

2010-04-08abs ↗pdf ↗

The notion of chckerboard colorability for virtual links and abstract links is introduced. We study the Jones polynomials of virtual links and abstruct links. It is proved that a certain property of the Jones polynomials of classical links is valid for virtual links which admit checkerboard colorings.

2000-08-10abs ↗pdf ↗

SPEDER extracts state-action abstraction from dynamics for reinforcement learning.

problem Curse of dimensionality and limited applicability of spectral methods.
method Spectral Decomposition Representation (SPEDER) that extracts state-action abstraction from dynamics without policy dependence.
result Theoretical analysis establishes sample efficiency in online and offline settings.

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 abstract discusses p-harmonic forms and their geometric properties, proving new theorems about Lp-cohomology.

problem The abstract tackles the geometric properties of p-harmonic forms and their role in Lp-cohomology.
method The approach involves using p-harmonic and p-coclosed forms to reprove vanishing theorems and provide injectivity theorems.
result The main finding is the reproof of vanishing theorems and the provision of injectivity theorems for Lp-cohomology.

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.

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.

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.

TASID learns policies in high-dimensional settings with abstract simulator knowledge.

problem RL in high-dimensional settings with limited observation knowledge.
method TASID algorithm for transfer RL from abstract simulator with bounded perturbations.
result Sample complexity polynomial in horizon, independent of number of states.

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 ↗

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.