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

2575147701,027 · Jun 202019922001200920172026
48 results for compositional generalization

We establish conditions for compositional generalization in machine learning.

problem Achieving compositional generalization in machine learning models.
method We reformulate compositionality as a property of the data-generating process and derive mild conditions on the training distribution and model architecture.
result Our theoretical framework enables compositional generalization under mild conditions.

Study challenges neural models in compositional learning tasks.

problem Challenges in neural models for compositional and relational learning.
method Introduced ConceptWorld environment for generating images from compositional concepts, tested various neural architectures.
result Neural models struggle with longer compositional chains and substitutivity tests.

New samplers improve compositional generation with diffusion models.

problem Improving compositional generation with diffusion models.
method Score-based interpretation, energy-based parameterization, Metropolis-corrected samplers.
result New samplers enable successful compositional generation across various tasks.

NeSS combines neural and symbolic approaches for better compositional generalization.

problem Lack of compositional generalization in deep learning models.
method NeSS uses a neural network to generate traces, executed by a symbolic stack machine with sequence manipulation.
result Achieves 100% generalization performance across multiple domains.

Paper analyzes stability and generalization of SCO algorithms.

problem Understanding how SCO algorithms perform on unseen data.
method Algorithmic stability analysis in statistical learning theory.
result Derives dimension-independent excess risk bounds for SCGD and SCSC.

We study compositional generalization, viz., the problem of zero-shot generalization to novel compositions of concepts in a domain. Standard neural networks fail to a large extent on compositional learning. We propose Tree Stack Memory Units (Tree-SMU) to enable strong compositional generalization. Tree-SMU is a recurs…

2019-11-05abs ↗pdf ↗

SCL discovers compositional structures in analogical reasoning tasks.

problem Discovering compositional structures in analogical reasoning tasks like Raven's Progressive Matrices.
method Proposes Scattering Compositional Learner (SCL) that composes neural networks in sequence.
result Achieves state-of-the-art performance on RPM datasets with significant improvements.

In this work, we propose a composition/decomposition framework for adversarially training generative models on composed data - data where each sample can be thought of as being constructed from a fixed number of components. In our framework, samples are generated by sampling components from component generators and fee…

2019-01-23abs ↗pdf ↗

CFA improves model's ability to generalize across unseen domain-class combinations.

problem Challenges in real-world machine learning applications due to data distribution shifts and limited training data.
method Developed Compositional Feature Alignment (CFA) technique to improve CG ability of pretrained models.
result CFA outperforms common finetuning techniques in compositional generalization.

This work investigates the framework and performance issues of the composite neural network, which is composed of a collection of pre-trained and non-instantiated neural network models connected as a rooted directed acyclic graph for solving complicated applications. A pre-trained neural network model is generally well…

2019-10-22abs ↗pdf ↗

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.

The study reveals simplicity bias in neural networks leading to better compositional mappings.

problem Understanding when and how to encourage neural networks to learn compositional mappings.
method Examined compositional mappings through coding length and gradient descent dynamics.
result Neural networks tend to learn the simplest bijections, explaining their good generalization.

Compositional structures between parts and objects are inherent in natural scenes. Modeling such compositional hierarchies via unsupervised learning can bring various benefits such as interpretability and transferability, which are important in many downstream tasks. In this paper, we propose the first deep latent vari…

2019-10-21abs ↗pdf ↗

The p-index improves investment performance for NYSE stocks but not for SSE stocks.

problem Improving investment performance for stocks using the p-index.
method Comparing different p-ratio strategies and empirical efficient frontiers for SSE and NYSE stocks.
result The p-index enhances investment performance for NYSE stocks but not for SSE stocks.

This paper analyzes how diffusion models learn and generalize concepts.

problem Learning and generalizing concepts in compositional data-generating processes.
method Introduced a structured identity mapping (SIM) task to analyze neural network learning dynamics.
result SIM task captures key empirical observations on compositional generalization.

Energy-based models can generate complex images by combining simpler concepts.

problem Generating natural images that satisfy complex logical combinations of concepts.
method Energy-based models combine probability distributions of simpler concepts to generate compositions.
result Energy-based models can generate images that satisfy conjunctions, disjunctions, and negations of concepts.

Diffusion models learn hierarchical composition rules from data.

problem How many samples do generative models need to learn hierarchical composition rules?
method Theoretical and empirical investigation of diffusion models on probabilistic context-free grammars.
result Diffusion models learn hierarchical composition rules with sample complexity scaling polynomially with context size.

This research proves guarantees on sequence models' generalization to longer and novel sequences.

problem Generalization to longer sequences and novel token combinations in sequence models.
method Provable guarantees on length and compositional generalization for various sequence models.
result Limited capacity models achieve both length and compositional generalization with diverse training distributions.

This work is an analytical and numerical study of the composition of several fractals into one and of the relation between the composite dimension and the dimensions of the component fractals. In the case of composition of standard IFS with segments of equal size, the composite dimension can be expressed as a function …

2014-07-10abs ↗pdf ↗

Building on the universal covering group of the general linear group, we introduce the composite spinor bundle whose subbundles are Lorentz spin structures associated with different gravitational fields. General covariant transformations of this composite spinor bundle are canonically defined.

1997-05-21abs ↗pdf ↗

Unified framework for aligning and composing diffusion models to satisfy multiple constraints.

problem Improving quality and compliance of generated samples from diffusion models.
method Constrained optimization framework that unifies alignment and composition of diffusion models.
result Proposed framework effectively satisfies multiple constraints in image generation.

Generative Adversarial Networks (GANs) can produce images of remarkable complexity and realism but are generally structured to sample from a single latent source ignoring the explicit spatial interaction between multiple entities that could be present in a scene. Capturing such complex interactions between different ob…

2018-07-19abs ↗pdf ↗

We study losses for binary classification and class probability estimation and extend the understanding of them from margin losses to general composite losses which are the composition of a proper loss with a link function. We characterise when margin losses can be proper composite losses, explicitly show how to determ…

2009-12-17abs ↗pdf ↗

New geometric approach for analyzing compositional data like gut microbiomes.

problem Analyzing non-negative compositional data with relative values only.
method Reinterpret compositional data as quotient topology of a sphere, using spherical harmonics and reflection group actions.
result Construction of Reproducing Kernel Hilbert Space (RKHS) for compositional data.

Study on deep neural networks using branching processes and Mehler's formula.

problem Understanding the mathematical role of activation functions in compositional neural networks.
method Connection between compositional kernels and branching processes via Mehler's formula; new random features algorithm.
result Explicit formulas for eigenvalues of compositional kernels quantify complexity.

The paper explores local-correlation models for pricing complex financial contracts.

problem Calibrating synthetic quanto forward contracts and composite options.
method Design on-line calibration procedures for local and stochastic volatility models.
result Calibration performance of local-correlation models compared to simpler approximations.

Paper proposes iLPA for solving DC composite optimization problems, with applications to matrix completion with outliers.

problem Solving nonconvex and nonsmooth DC composite optimization problems.
method Inexact linearized proximal algorithm (iLPA) for DC composite optimization problems.
result The iLPA achieves local R-linear convergence rate under the Kurdyka-Łöjasiewicz property.

Transformers can generalize to a large task family with only a few demonstrations.

problem Can learning from a small set of tasks generalize to a large task family?
method Investigating autoregressive compositional structure where each task is a composition of TT operations, each from a finite family of DD subtasks.
result Transformers can generalize to DTD^T tasks with only O~(D)\widetilde{O}(D) demonstrations.

Many machine learning algorithms represent input data with vector embeddings or discrete codes. When inputs exhibit compositional structure (e.g. objects built from parts or procedures from subroutines), it is natural to ask whether this compositional structure is reflected in the the inputs' learned representations. W…

2019-02-19abs ↗pdf ↗