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.

169,051 papers · 148 categories

Trend · papers per month

2825638451,126 · Jun 202019922001200920182026
48 results for Composed data

Differentiable Algorithm Networks (DAN) enable composable robot learning.

problem Training robots to learn from limited data and imperfect models.
method Composable architecture of neural network modules, each encoding a differentiable robot algorithm and model, trained end-to-end from data.
result DAN modules adapt to one another and compensate for imperfect models and algorithms, achieving best overall system performance.

Improved code translation by preserving structure with composed fine-tuning.

problem Improving code translation accuracy with unlabeled code outputs.
method Pre-trained denoiser to capture output structure, composed fine-tuning to fine-tune predictor.
result Composed fine-tuning significantly improves generalization over standard fine-tuning.

New method improves data efficiency in reinforcement learning by composing skills.

problem Improving data efficiency in reinforcement learning by composing previously mastered skills.
method Extending policy improvement to maximum entropy framework, introducing successor features, and explicitly learning divergence between base policies.
result Proposes a novel approach that outperforms or matches existing methods in various tasks.

The paper proposes a deep learning technique for structured and composable representations.

problem Learning structured and composable representations from input images and discrete labels.
method End-to-end deep learning to learn representations based on distance estimates between class label and contextual information.
result The representations have a clear structure allowing for class and environment decomposition.

Probabilistic techniques are central to data analysis, but different approaches can be difficult to apply, combine, and compare. This paper introduces composable generative population models (CGPMs), a computational abstraction that extends directed graphical models and can be used to describe and compose a broad class…

2016-08-18abs ↗pdf ↗

New measure shows how LSTM models compose hierarchical representations.

problem Understanding how LSTM models capture compositional structure in language.
method Novel measure of interdependence between word meanings in LSTM internal gates.
result High interdependence can hurt generalization and reveals hierarchical structure learning.

Paper proposes a method to compose task-agnostic skills for solving new problems.

problem Learning task-specific policies for solving new problems.
method Deep reinforcement learning-based skill transfer and composition method.
result Method transfers skills to new problem settings and solves challenging environments with high data efficiency.

In this paper, we explicitly construct the Calabi composition of multiple affine hyperspheres possibly including some points viewing as 0-dimensional hypersheres. Then we compute all the basic affine invariants of the composed affine hyperspheres, proving that the composed affine hypersphere is symmetric one if and onl…

2013-10-18abs ↗pdf ↗

Meta-materials simulation sped up with energy surrogates.

problem Challenging simulation of complex meta-materials due to high-fidelity PDEs.
method Learned component-level surrogates using neural networks to model stored potential energy.
result Surrogates enable accurate macroscopic behavior simulation without full structure simulation.

This work proposes a method to compose visual relations more faithfully.

problem Composing relations between objects in images is challenging due to their entanglement.
method Represent each relation as an unnormalized density (energy-based model) to compose relations factorizedly.
result The proposed method generates and edits scenes with multiple sets of relations more faithfully.

We analyze the hitting time distributions of stock price returns in different time windows, characterized by different levels of noise present in the market. The study has been performed on two sets of data from US markets. The first one is composed by daily price of 1071 stocks trade for the 12-year period 1987-1998, …

2006-08-19abs ↗pdf ↗

Bardo Composer generates tabletop RPG music based on player speech.

problem Creating immersive background music for tabletop RPGs.
method Speech recognition, emotion classification, and music generation using a novel beam search algorithm.
result Generated music pieces can be accurately identified by human subjects as conveying the intended emotion.

Paper proposes a statistical test for feature selection pipelines using selective inference.

problem Assessing the significance of feature selection pipelines in data analysis.
method Selective inference technique applied to feature selection pipelines composed of various algorithms.
result The proposed statistical test controls false positive feature selection probabilities.

Model-free deep reinforcement learning has been shown to exhibit good performance in domains ranging from video games to simulated robotic manipulation and locomotion. However, model-free methods are known to perform poorly when the interaction time with the environment is limited, as is the case for most real-world ro…

2018-03-19abs ↗pdf ↗

The paper explores fairness in multi-component recommender systems.

problem How to ensure fairness in recommender systems composed of multiple models.
method Study of fairness ranking metrics, theoretical analysis, and empirical evaluation.
result Fairness in recommendation systems can be achieved by improving individual components.

SympNets identify Hamiltonian systems from data using linear, activation, and gradient modules.

problem Identifying Hamiltonian systems from data.
method Composition of linear, activation, and gradient modules; universal approximation theorems.
result SympNets can approximate arbitrary symplectic maps and generalize well to various Hamiltonian systems.

We study a spectral generalization of classical combinatorial graph spanners to the spectral setting. Given a set of vectors VdV\subseteq \Re^d, we say a set UVU\subseteq V is an αα-spectral spanner if for all vVv\in V there is a probability distribution μvμ_v supported on UU such that $$vv^\intercal \preceq α\cdot\m…

2018-07-31abs ↗pdf ↗

An important property for lifelong-learning agents is the ability to combine existing skills to solve unseen tasks. In general, however, it is unclear how to compose skills in a principled way. We provide a "recipe" for optimal value function composition in entropy-regularised reinforcement learning (RL) and then exten…

2018-07-12abs ↗pdf ↗

It is expected that matter composed of a perfect fluid cannot be at rest outside of a black hole if the spacetime is asymptotically flat and static (non-rotating). However, there has not been a rigorous proof for this expectation without assuming spheical symmetry. In this paper, we provide a proof of non-existence of …

2006-05-05abs ↗pdf ↗

A framework for designing and evaluating new GCN variants.

problem Designing and evaluating new graph convolutional network (GCN) variants.
method Propose a framework to compose networks using building blocks of GCN.
result Several newly composed variants are useful alternatives and competitive with original GCNs.

New neural network learns to transfer across environments and tasks from sparse data.

problem Learning transfer across environments and tasks with limited data.
method Compositional neural network architecture and novel training methods to learn embeddings.
result High success rates on all (ENV, TASK) pairs after learning from only 40% of them.

A Boolean algebra formalizes task composition for reinforcement learning.

problem Formalizing task composition for efficient learning and problem-solving.
method Formalized tasks as a Boolean algebra, learning goal-oriented value functions, and composing them to solve new tasks.
result Agents can solve new tasks without additional learning by composing value functions in specific ways.

Diffusion models reveal a phase transition in reconstructing high-level features.

problem Understanding the hierarchical structure of natural data.
method Study of hierarchical generative models of data using diffusion models.
result The backward diffusion process shows a phase transition at a threshold time, where high-level features suddenly drop in reconstructibility.

MCP learns reusable skills for complex tasks by combining simple ones.

problem Learning complex tasks with many skills requires impractical amounts of data.
method Factorizes skills into primitives that can be combined multiplicatively.
result MCP can learn and reuse skills for novel tasks from pre-training.

Given a sweepout of a Riemannian 2-sphere which is composed of curves of length less than L, we construct a second sweepout composed of curves of length less than L which are either constant curves or simple curves. This result, and the methods used to prove it, have several consequences; we answer a question of M. Fre…

2014-11-24abs ↗pdf ↗

Paper studies how to combine regret minimizers for solving complex games.

problem Solving large-scale extensive-form games with constraints.
method Derives a calculus for constructing regret minimizers for composite convex sets.
result Local regret minimizers for simpler sets can be combined into an aggregate for composite sets.

New findings show disentangled latent representations are not enough for robust compositional generalization.

problem Deep learning models struggle with compositional generalization, especially in out-of-distribution samples.
method Investigated a 2D Gaussian generation task with fully disentangled inputs, then forced disentangled latent representations into full-dimensional output space.
result Forcing disentangled latent representations into full-dimensional output space enables robust compositional generalization.

A Gaussian restricted Boltzmann machine (GRBM) is a Boltzmann machine defined on a bipartite graph and is an extension of usual restricted Boltzmann machines. A GRBM consists of two different layers: a visible layer composed of continuous visible variables and a hidden layer composed of discrete hidden variables. In th…

2015-12-03abs ↗pdf ↗

The problem of pursuing a moving target is always one of the main topics in navigation. In the literatures, there are two well-known algorithms called Pure Pursuit and Pure Rendezvous navigation in the 3-dimensional space R3\mathbb{R}^3. In this paper, these two methods are combined to introduce a novel family of pursu…

2012-05-20abs ↗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 ↗

Recurrent neural networks (RNNs) are powerful architectures to model sequential data, due to their capability to learn short and long-term dependencies between the basic elements of a sequence. Nonetheless, popular tasks such as speech or images recognition, involve multi-dimensional input features that are characteriz…

2018-06-12abs ↗pdf ↗

We interpret the setting for a Radon transform as a submanifold of the space of generalized functions, and compute its extrinsic curvature: it is the Hessian composed with the Radon transform.

1992-10-01abs ↗pdf ↗

We show that any group that is hyperbolic relative to virtually nilpotent subgroups, and does not admit peripheral splittings, contains a quasi-isometrically embedded copy of the hyperbolic plane. In natural situations, the specific embeddings we find remain quasi-isometric embeddings when composed with the inclusion m…

2011-11-10abs ↗pdf ↗

New approach learns causally disentangled latent structures in generative models.

problem Fundamental tension between expressivity and structure in latent structure learning.
method Added a context module to an arbitrarily complex model to learn causally disentangled concepts.
result Causally disentangled representations can be composed for out-of-distribution generation.