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

4691137182 · Jun 202019922001200920172026
48 results for component composition

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 ↗

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 ↗

We consider in this paper a class of composite optimization problems whose objective function is given by the summation of a general smooth and nonsmooth component, together with a relatively simple nonsmooth term. We present a new class of first-order methods, namely the gradient sliding algorithms, which can skip the…

2014-06-04abs ↗pdf ↗

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 ↗

This work theoretically investigates the performance of a composite neural network. A composite neural network is a rooted directed acyclic graph combining a set of pre-trained and non-instantiated neural network models, where a pre-trained neural network model is well-crafted for a specific task and targeted to approx…

2019-10-18abs ↗pdf ↗

System learns to combine multiple model components for personalized text generation.

problem Adapting and biasing language models for personal preferences.
method Combines model-defined components, learns activation and probability combination from unlabeled text.
result Directly generates text with personalized components from unlabeled data.

This paper explores the non-convex composition optimization in the form including inner and outer finite-sum functions with a large number of component functions. This problem arises in some important applications such as nonlinear embedding and reinforcement learning. Although existing approaches such as stochastic gr…

2017-11-13abs ↗pdf ↗

New method estimates effects of multiple nutrients on blood glucose.

problem Estimating physiological response to multiple nutrient treatments.
method Convolution-based multi-output Gaussian process model.
result Improved prediction accuracy and better interpretation of individual nutrient effects.

Composite development indicators used in policy making often subjectively aggregate a restricted set of indicators. We show, using dimensionality reduction techniques, including Principal Component Analysis (PCA) and for the first time information filtering and hierarchical clustering, that these composite indicators m…

2019-11-25abs ↗pdf ↗

The intuition of risk is based on two main concepts: loss and variability. In this paper, we present a composition of risk and deviation measures, which contemplate these two concepts. Based on the proposed Limitedness axiom, we prove that this resulting composition, based on properties of the two components, is a cohe…

2015-11-22abs ↗pdf ↗

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 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.

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.

Develops consistent approximations for composite optimization problems.

problem Significant errors in solutions due to approximations in optimization problems.
method Specifies conditions for well-behaved approximations in minimizers, stationary points, and level-sets for a broad class of composite problems.
result Framework of consistent approximations for composite problems, including stochastic, neural-network, and multi-objective optimization.

The ERI is a new index for measuring exam readiness.

problem Measuring exam readiness in a clear and actionable way.
method The ERI combines six signals derived from practice and mock tests, formalizing axioms for component maps and the composite.
result The ERI is a composite score interpretable and actionable for exam readiness.

CARE method estimates precision matrix for compositional data, achieving optimality in high dimensions.

problem Challenges in inferring conditional dependence relationships in high-dimensional compositional data.
method Composition adaptive regularized estimation (CARE) method for sparse basis precision matrix.
result CARE estimator achieves minimax optimality in high dimensions, performing as well as if the basis were observed.

Efficient algorithm finds fast Transformer models.

problem Slow inference time of Transformer models.
method Decompose Transformer architecture into components, use sampling-based one-shot search.
result Achieved 10% to 30% speedup on pre-trained BERT and 70% on top of a previous state-of-the-art model.

A virtual string can be defined as an equivalence class of planar diagrams under certain kinds of diagrammatic moves. Virtual strings are related to virtual knots in that a simple operation on a virtual knot diagram produces a diagram for a virtual string. In this paper we consider three operations on a virtual string …

2008-08-04abs ↗pdf ↗

Algorithmic fairness, and in particular the fairness of scoring and classification algorithms, has become a topic of increasing social concern and has recently witnessed an explosion of research in theoretical computer science, machine learning, statistics, the social sciences, and law. Much of the literature considers…

2018-06-15abs ↗pdf ↗

New algorithms improve tensor CP decomposition under mild conditions.

problem Improving tensor CP decomposition with theoretical guarantees under mild incoherence conditions.
method Composite PCA and Concurrent Orthogonalization algorithms.
result Theoretical guarantees and practical superiority over existing methods.

Paper combines geometry and time-series analysis for spatiotemporal data.

problem Multivariate time-series data from multiple sensors.
method Combines manifold learning, Riemannian geometry, and spectral analysis.
result Proposes Riemannian multi-resolution analysis (RMRA) for dynamic mode extraction.

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.

Optimizes natural frequencies of cellular composites with various microstructures.

problem Designing cellular composites with diverse microstructures for maximizing natural frequencies.
method Data-driven topology optimization with a latent-variable Gaussian process model.
result Cellular designs with multiclass microstructures achieve higher natural frequencies.

Training on mixed distributions improves test performance even when components are unrelated.

problem Improving test performance with mismatched training and test distributions.
method Analyzing mixture distributions with different training and test proportions.
result Distribution shift can be beneficial, improving test performance even when components are unrelated.

UCB-TQL learns from multiple tasks with shared dynamics and adapts to task-specific variations.

problem Transfer reinforcement learning with composite MDPs where tasks share core dynamics but have sparse differences.
method UCB-TQL, a novel transfer RL algorithm for composite MDPs.
result Achieved a regret bound of ildeO(eH5N) ilde{O}(\sqrt{eH^5N}) that scales independently of the ambient dimension.

We make a new attempt at the recently suggested program to express knot polynomials through topological vertices, which can be considered as a possible approach to the tangle calculus: we discuss the Macdonald deformation of the relation between the convolution of two topological vertices and the HOMFLY-PT invariant of…

2019-05-01abs ↗pdf ↗

The study visualizes Spanish fish and meat processing companies using financial, environmental, and social ratios.

problem Mapping financial, environmental, and social performance of Spanish processing companies.
method Used compositional data and principal-component analysis biplot for statistical analysis.
result Identified clusters of companies with similar financial, environmental, and social performance.

We assume that a high-dimensional datum, like an image, is a compositional expression of a set of properties, with a complicated non-linear relationship between the datum and its properties. This paper proposes a factorial mixture prior for capturing latent properties, thereby adding structured compositionality to deep…

2018-12-18abs ↗pdf ↗

Transformers learn to generalize unseen tasks by composing self-attention layers.

problem How Transformers generalize to unseen, out-of-distribution tasks.
method Examined synthetic examples and pretrained LLMs, focusing on induction heads and latent subspace.
result Transformers can learn hidden rules for unseen tasks by composing self-attention layers, achieving OOD generalization.

A distance-squared function is one of the most significant functions in the application of singularity theory to differential geometry. Moreover, distance-squared mappings are naturally extended mappings of distance-squared functions, wherein each component is a distance-squared function. In this paper, compositions of…

2018-01-04abs ↗pdf ↗

Develops minibatch stochastic proximal gradient for large-scale learning models.

problem Finding optimal predictors with complex regularizers in large-scale learning models.
method Minibatch variants of stochastic proximal gradient algorithm for composite objective functions.
result Minibatch size NN after O(1Nε)\mathcal{O}(\frac{1}{Nε}) iterations achieves εε-suboptimality in expected quadratic distance.

Enhances neural forecasting for hierarchically organized time series data.

problem Probabilistic coherent forecasting of time series data across different levels of aggregation.
method Proposes a coherent multivariate mixture output for neural forecasting architectures, optimizing with a composite likelihood objective.
result 13.2% average accuracy improvements on most datasets compared to state-of-the-art baselines.

Bayesian ARMA model with directional shifts captures structural breaks in compositional time series.

problem Structural breaks in compositional time series due to external shocks or policy changes.
method Developed a Bayesian Dirichlet ARMA model augmented with a directional-shift intervention mechanism.
result The model captures structural breaks through interpretable parameters and produces coherent probabilistic forecasts.

The construction of invariants of three-dimensional manifolds with a triangulated boundary, proposed earlier by the author for the case when the boundary consists of not more than one connected component, is generalized to any number of components. These invariants are based on the torsion of acyclic complexes of geome…

2008-06-16abs ↗pdf ↗

We provide a very brief review of the description of colored invariants for the Hopf link in terms of characters, which need to be taken at a peculiar deformation of the topological locus, depending on one of the two representations associated with the two components of the link. Most important, we extend the descripti…

2018-04-26abs ↗pdf ↗

If f is a conformal mapping defined on a connected open subset of a Carnot group G, then either f is the composition of a translation, a dilation and an isometry, or G is the nilpotent Iwasawa component of a real rank 1 simple Lie group S, and f arises from the action of S on G, viewed as an open subset of S/P, where P…

2013-12-22abs ↗pdf ↗

Study non-oblivious adversarial bandits with delayed feedback and propose algorithms with improved regret bounds.

problem Adversarial bandit problem with delayed, composite anonymous feedback.
method Propose wrapper algorithm for non-oblivious delay setting, achieving o(T)o(T) policy regret.
result Achieve o(T)o(T) policy regret for many adversarial bandit problems with bounded memory loss sequences.

Reinforcement learning (RL) tasks are challenging to implement, execute and test due to algorithmic instability, hyper-parameter sensitivity, and heterogeneous distributed communication patterns. We argue for the separation of logical component composition, backend graph definition, and distributed execution. To this e…

2018-10-21abs ↗pdf ↗

Trade networks, across which countries distribute their products, are crucial components of the globalized world economy. Their structure is strongly heterogeneous across products, given the different features of the countries which buy and sell goods. By using a diversified pool of indicators from network science and …

2018-02-23abs ↗pdf ↗

We consider two connected aspects of maximum likelihood estimation of the parameter for high-dimensional discrete graphical models: the existence of the maximum likelihood estimate (mle) and its computation. When the data is sparse, there are many zeros in the contingency table and the maximum likelihood estimate of th…

2015-04-21abs ↗pdf ↗

KernelBiome tackles microbiome research by improving predictive performance and interpretability.

problem Challenges in analyzing high-throughput sequencing data, especially in microbiome research.
method KernelBiome is a kernel-based nonparametric regression and classification framework for compositional data, incorporating prior knowledge and capturing complex signals.
result Improved predictive performance compared to state-of-the-art machine learning methods, with two novel quantities for interpretability.