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

19385675 · Jun 202019922001200920172026
48 results for abstracted shapes

The success of various applications including robotics, digital content creation, and visualization demand a structured and abstract representation of the 3D world from limited sensor data. Inspired by the nature of human perception of 3D shapes as a collection of simple parts, we explore such an abstract shape represe…

2017-08-04abs ↗pdf ↗

Improved reinforcement learning with deep learning.

problem Extending MultiGrid Reinforcement Learning to work with deep learning.
method Combining potential-based reward shaping with a learned potential function from interaction, and adapting it for deep learning algorithms.
result DQN augmented with the approach performs significantly better on continuous control tasks.

In shape analysis, the concept of shape spaces has always been vague, requiring a case-by-case approach for every new type of shape. In this paper, we give a general definition for an abstract space of shapes in a manifold. This notion encompasses every shape space studied so far in the literature, and offers a rigorou…

2015-04-07abs ↗pdf ↗

VQShape learns interpretable time-series representations and achieves comparable performance to specialist models.

problem Lack of interpretability in existing time-series models.
method Vector quantization of time-series data into abstracted shapes.
result VQShape achieves comparable performance to specialist models in classification tasks.

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.

The paper presents a method for analyzing shape graphs using specific features.

problem Analyzing geometric and topological variations in shape graphs.
method Curated set of topological, geometric, and directional features for shape graph analysis.
result The feature representation is effective for tasks like group comparison and classification.

The abstract introduces a new concept called flagfolds to model multi-dimensional shapes.

problem Modeling multi-dimensional shapes in a way that avoids going through higher dimensional spaces.
method Interpreting covariance matrices as nested subspaces and defining a Riemannian metric on the highest dimensional stratum.
result A Riemannian metric on the highest dimensional stratum allows for geodesics between subspaces of different dimensions.

Generative models learn distributions of continuous functions.

problem Training generative models on discretized grids limits model size and data type.
method Parameterize data points by continuous functions, learn distributions over these functions.
result Models can learn rich distributions of functions independently of data type and resolution.

Commissioned by MIT's in-house artist Jane Philbrick, we evolve an abstract 2D surface (resembling Marta Pan's 1961 "Sculpture Flottante I") under mean curvature, all the while calculating the eigenmodes and eigenvalues of the Laplace-Beltrami operator on the resulting shapes. These are then synthesized into a sound-wa…

2012-01-23abs ↗pdf ↗

Interprets how intrinsic motivation shapes behavior in RL agents.

problem Understanding how intrinsic motivation influences behavior in reinforcement learning agents.
method Analyzed five RL agents in procedurally generated environments using various interpretability techniques.
result Curiosity-driven agents exhibit broader and more dynamic attention than extrinsically motivated agents.

Constructs moduli stacks of quiver bundles and applies to Higgs bundles.

problem Classifying morphisms of vector bundles over a fixed base.
method General method for constructing moduli stacks of diagrams of vector bundles indexed by a simplicial set.
result Recovery of Nakajima quiver varieties and alternate construction of moduli stacks of Higgs bundles.

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.

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.

The abstract proves spherical surface decompositions with conical singularities.

problem Decomposing surfaces with spherical metrics and conical singularities.
method Geometric triangulations and irreducible components of standard shapes.
result Spherical polygons, including half-spherical concave polygons, can be arbitrarily complicated.

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.

Convolution is an efficient technique to obtain abstract feature representations using hierarchical layers in deep networks. Although performing convolution in Euclidean geometries is fairly straightforward, its extension to other topological spaces---such as a sphere (S2\mathbb{S}^2) or a unit ball (B3\mathbb{B}^3)---…

2019-01-03abs ↗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 ↗

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.

CIB compresses variables causally, preserving key causal interactions.

problem Constructing causal variable abstractions in complex systems.
method Causal Information Bottleneck (CIB) method, extending IB to include causal structures.
result CIB produces causally interpretable abstractions that accurately capture causal relations.

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.

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 ↗

We present a training system, which can provably defend significantly larger neural networks than previously possible, including ResNet-34 and DenseNet-100. Our approach is based on differentiable abstract interpretation and introduces two novel concepts: (i) abstract layers for fine-tuning the precision and scalabilit…

2019-03-29abs ↗pdf ↗

The study proves topological rigidity for certain geometric shapes using Poincaré inequalities.

problem Proving topological rigidity for translators and self-expanders in mean curvature flow.
method Abstract structure theorem for weighted manifolds, Poincaré inequality, and topological control.
result Full topological control on translators and self-expanders under stability or curvature assumptions.

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.

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 ↗