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

25.0%50.0%75.0%100.0% · Feb 199419922001200920182026
48 results for composite models

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.

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.

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.

In classical field theory, the composite fibred manifolds Y -> Z -> X provides the adequate mathematical formulation of gauge models with broken symmetries, e.g., the gauge gravitation theory. This work is devoted to connections on composite fibred manifolds. In particular, we get the horizontal splitting of the vertic…

1994-12-17abs ↗pdf ↗

Model predicts composite structures assembly quality with input uncertainty.

problem Accurate prediction of dimensional deviations and residual stress in composite structures assembly.
method Neural Network Gaussian Process considering input uncertainty.
result NNGPIU model outperforms other methods for nonsmooth, nonlinear responses.

Model estimates foreign exchange reserve compositions of undisclosed central banks.

problem Limited information on central bank reserve compositions hinders analysis.
method Hidden Markov Model relating portfolio valuation to exchange rates.
result China's reserve composition likely matches global average, while Singapore holds fewer US dollars.

RICH models scenes as hierarchical tree to learn and generate complex compositions.

problem Learning compositional structures between parts and objects in natural scenes.
method RICH uses a latent scene graph to organize entities into a tree structure and employs a top-down inference approach.
result RICH learns and generates complex scene hierarchies from unlabeled data.

This work proves composite neural networks outperform their components under certain conditions.

problem Understanding the performance of composite neural networks.
method Theoretical investigation of a composite neural network combining pre-trained models.
result A composite neural network, with high probability, performs better than any of its pre-trained components.

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.

This paper introduces compositional data analysis for financial ratios, improving industry-level analysis.

problem Statistical issues with standard financial ratios at industry level.
method Compositional data analysis techniques for financial ratios.
result Improved analysis of financial ratios using compositional data methods.

Efficient algorithm for analyzing compositional data.

problem Compositional data analysis with nonnegative values summing to one.
method Proposes an efficient solution path algorithm for l1l_1 regularized regression with compositional data.
result The proposed algorithm is faster than existing methods, especially in high-dimensional cases.

This paper improves neural network explanations by quantifying and visualizing semantic compositions.

problem Improving neural network explanations for natural language processing tasks.
method Proposes a formal way to quantify word and phrase importance, introduces SCD and SOC algorithms.
result Our algorithms outperform prior methods in explaining neural network predictions.

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.

Routing networks tackle challenges in modular and compositional computation.

problem Challenges in learning and training compositional models with module parameters and their composition.
method Routing networks as a general approach to address these challenges, examining the interplay of algorithmic decisions.
result Empirical analysis of routing networks reveals the interplay of challenges and design decisions.

Adapts Altman's model to compositional data for bankruptcy prediction.

problem Predicting business default using standard financial ratios has issues.
method Uses compositional data methodology with log-ratios and machine learning.
result Compositional methods improve predictive performance, especially random forests.

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.

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.

Proposes a new model for clustering multiplex networks with compositional data.

problem Clustering multiplex networks with multiple types of relations and compositional data.
method Multiplex Dirichlet stochastic block model for compositional networks.
result Validated through simulation and applied to international export data.

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.

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 analyzes word embedding composition using tensor decomposition.

problem Given vector representations of two words, compute a vector for the entire phrase.
method Generative model with low rank Tucker decomposition of word embedding correlations.
result Word embeddings and a core tensor can be derived from the Tucker decomposition.

DeepCoDA provides personalized interpretability for complex health data.

problem Interpreting complex health data, especially compositional data, is challenging.
method DeepCoDA framework for high-dimensional compositional data, personalized interpretability through patient-specific weights.
result DeepCoDA maintains state-of-the-art performance and provides coherent, personalized interpretations.

A new geometry-preserving method for interpreting compositional data.

problem Statistical challenges in high-dimensional compositional data.
method Geometry-preserving framework for dimension reduction of compositional data.
result Identification of a central compositional subspace for compositional predictors.

This paper extends compositional data analysis using graph signal processing.

problem Traditional log-ratios between all variables are not suitable for specific variable relationships.
method Linking compositional data analysis with graph signal processing, it considers only selected log-ratios.
result The approach retains desirable properties of scale invariance and compositional coherence.

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.

CompVAE handles multi-ensemble data with compositional generative model.

problem Handling multi-ensemble data with control and generative models.
method Derived from Bayesian variational principles, CompVAE learns a latent representation leveraging observational and symbolic information.
result Supports compositional generative model enabling multi-ensemble operations.

Neural networks learn symbolic structure to perform compositional tasks.

problem How neural networks perform well on compositional tasks without explicit representations.
method ROLE analysis to uncover symbolic structure in recurrent neural networks.
result Neural networks converge to solutions that implicitly represent symbolic structure.

This paper studies robust estimation methods in high dimensions, comparing model-averaged and composite quantile estimators.

problem Understanding robustness in high-dimensional regularized estimation.
method Optimal weights are determined by minimizing the asymptotic mean squared error, incorporating regularization effects without perfect selection.
result Model-averaged and composite quantile estimators often outperform least-squares methods in prediction quality.

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.

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.

Deep learning model separates syntax and semantics for better language generalization.

problem Standard deep learning methods struggle with systematic generalization in natural language.
method Implemented a Syntactic Attention model that separates syntactic and semantic processing.
result The Syntactic Attention model outperforms standard methods on a compositional generalization task.

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 ↗

Deep learning can learn compositional functions more efficiently by breaking them into stages.

problem Understanding why deep learning performs better than shallow models in learning compositional functions.
method Analyzed learnability of compositional target functions using a three-layer fitting model trained with layer-wise spectral estimators.
result Learning compositional functions can be simplified by breaking them into stages, reducing the complexity of the learning problem.

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.

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.