C-ADAM is a new adaptive solver for complex nested problems.
problem Solving compositional problems involving nested expected values.
method Adaptive solver for non-linear functional nesting of expected values.
result C-ADAM converges to a stationary point in O(δ−2.25). Study on risk contributions of portfolios using lambda quantile risk measures.
problem No known allocation rule for non-positively homogeneous risk measures.
method Defined lambda quantiles on portfolio compositions, derived derivatives, and introduced generalized Euler contributions.
result Explicit formulae for the derivatives of lambda quantiles, showing their homogeneity properties.
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 tackles automatic interpretation of manifold coordinates.
problem Finding physical meaning of abstract manifold coordinates.
method Proposes a method to explain embedding coordinates as compositions of functions from a dictionary.
result Demonstrates the effectiveness of the method on data.
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.
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.
Extends OC-KSR for multi-task one-class classification.
problem Improving one-class classification performance with shared information.
method Linear and non-linear structure learning mechanisms for multi-task one-class classification.
result Improved performance on multiple one-class problems.
New proof of generalized Chow-Rashevskii theorem for non-linear systems.
problem Generalized Chow-Rashevskii Theorem for non-linear systems.
method Independent proof structure allowing generalizations to orbits of compositions of flows.
result Proof structure applicable to applications in Control Theory and controllability criteria.
The study uses CoDa to analyze family business financial ratios, highlighting methodological issues.
problem Asymmetry, non-normality, and non-linearity in financial ratios of family businesses.
method Compositional data analysis (CoDa) and classical analysis strategies.
result Results are sensitive to the methodology used, emphasizing the need for appropriate methodologies.
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.
Proposes a new prior for deep generative models to capture latent properties.
problem Complex non-linear relationships between data and latent properties.
method Factorial mixture prior with Gaussian mixture models for quantization.
result Empirically evaluated method for learning discrete properties in unsupervised or semi-supervised settings.
AFP-CKSAAP predicts antifreeze proteins using k-spaced amino acid pairs with deep neural networks.
problem Predicting antifreeze proteins due to their diverse sequence characteristics.
method Deep neural network with skipped connections and ReLU non-linearity to learn protein sequence descriptors.
result AFP-CKSAAP achieves excellent prediction scores and high Youden's index (0.82) on independent dataset.
We present a signal representation framework called the sparse manifold transform that combines key ideas from sparse coding, manifold learning, and slow feature analysis. It turns non-linear transformations in the primary sensory signal space into linear interpolations in a representational embedding space while maint…
A neural network model tackles high-dimensional data with latent structures.
problem Modeling high-dimensional data with latent low-dimensional structures.
method Integrates PCA and Soft PCA layers into neural network architecture for factor modeling and non-linear transformations.
result Demonstrates improved performance in forecasting and nowcasting with real-world data.
A framework to compare atomistic descriptors and their transformations.
problem Comparing and understanding different atomistic descriptors and their transformations.
method Introducing a framework to compare different sets of descriptors and their transformations by metrics and kernels.
result Diagnostic tools to determine equivalent information and distorted common information between feature spaces.
Paper proposes MSSDDPG for better financial trading strategies.
problem Extracting accurate features from noisy, non-stationary financial time series.
method Multi-scale stroke deep deterministic policy gradient reinforcement learning model (MSSDDPG).
result MSSDDPG outperforms other strategies in China's CSI 300 and SSE Composite.
New methods prove controllability of non-linear systems, extending classical results.
problem Controllability of non-linear control systems.
method Analytic control system, graph completions, flows of vector fields, pseudogroup of local diffeomorphisms.
result Sufficient conditions for local controllability and accessibility of non-linear systems.
Enhances multi-fidelity modeling with DGPs for different input domains.
problem Improving prediction accuracy with multi-fidelity models using different input domains.
method Extends Deep Gaussian Processes (DGPs) to handle different input domains for high and low-fidelity models.
result Demonstrates improved performance on real-world physical problems.
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 …
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.
Uses art composition attributes to guide CycleGAN image translation.
problem Improving image-to-image translation quality.
method Trained ACAN on art composition attributes to influence CycleGAN.
result CycleGAN translations improved with ACAN constraints.
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.
This paper proves hyperbolicity of virtual knot compositions.
problem Proving hyperbolicity of virtual knot compositions.
method Exploring the composition of hyperbolic virtual knots.
result Strong lower bounds on the volume of compositions.
Develops methods for causal inference in compositional data using instrumental variables.
problem Interpreting summary statistics like diversity indices as causal effects in compositional data.
method Statistical data transformations and regression techniques tailored for compositional data.
result Advantages and limitations of the proposed methods demonstrated on synthetic and real microbiome data.
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…
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.
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.
New algorithm reduces complexity for optimizing complex machine learning tasks.
problem Optimizing complex machine learning objectives like reinforcement learning and portfolio management.
method Developed SARAH-Compositional algorithm using Stochastic Recursive Gradient Descent.
result Achieved optimal IFO complexity bounds for stochastic compositional optimization.
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.
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.
Composite neural network improves PM2.5 prediction.
problem Improving PM2.5 prediction accuracy.
method Composite neural network framework with pre-trained models.
result Composite neural network outperforms individual models and new components added.
New filters match advanced composition for adaptive privacy, with practical constants.
problem Limitations of existing adaptive composition methods.
method Constructed new filters and odometers that match advanced composition rates, including constants.
result Achieved fully adaptive privacy with practical filters and odometers.
Paper develops momentum schemes with variance reduction for non-convex composition optimization.
problem Lack of convergence guarantee and efficient momentum design in existing algorithms.
method Develops various momentum schemes with SPIDER-based variance reduction.
result Achieves near-optimal sample complexity and linear convergence rate.
Extends knockoff filter for composite null hypotheses in variable selection.
problem Handling composite null hypotheses in variable selection.
method Developed two methods for composite inference with knockoffs: S-OLS and FRPP.
result Proposed heuristic variants of S-OLS outperforming BH procedure for composite nulls.
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.
In this paper we study n-composition series of affine manifolds. One composition series are classified using gerbe theory. It is natural to think that n-composition series must be classified using n-gerbe theory. In the last section of this, we propose a notion of abelian n-gerbe theory
Study on when RLVR can learn compositional problems.
problem Understanding when RLVR can learn compositional problems.
method Theoretical analysis of task-advantage ratio to characterize learnability.
result Identified conditions for learnability of compositional problems.
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.
Tree-SMU enables strong compositional generalization in neural networks.
problem Zero-shot generalization to novel compositions of concepts.
method Tree Stack Memory Units (Tree-SMU) with Stack Memory Units (SMU).
result Tree-SMU achieves strong empirical results on mathematical reasoning benchmarks.
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.
Composite fluxbrane and S-brane solutions for a wide class of intersection rules are considered. These solutions are defined on a product manifold R_{*} x M_1 x ... x M_n which contains n Ricci-flat spaces M_1, ..., M_n with 1-dimensional factor spaces R_{*} and M_1. They are determined up to a set of functions obeying…
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.
Using quilted Floer cohomology and relative quilt invariants, we define a composition functor for categories of Lagrangian correspondences in monotone and exact symplectic Floer theory. We show that this functor agrees with geometric composition in the case that the composition is smooth and embedded. As a consequence …
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.
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.
The paper studies tunnel and bridge numbers of composite genus 2 spatial graphs.
problem Understanding the tunnel and bridge numbers of composite genus 2 spatial graphs.
method Analyzes connected sum and trivalent vertex sum operations on genus 2 spatial graphs, proving bounds for tunnel and bridge numbers.
result Sharp bounds for the tunnel number of composite genus 2 spatial graphs, including lower bounds for bridge numbers.
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.