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

60120179239 · Jun 202019922001200920172026
48 results for shared components

New method identifies shared components from unpaired multimodal mixtures.

problem Identify shared components from unpaired multimodal mixtures.
method Distribution divergence minimization-based loss with sufficient conditions for identifiability.
result Sufficient conditions for shared component identifiability from unaligned multimodal mixtures.

Quaternion self-attention reduces computational cost and improves performance.

problem Existing quaternion self-attention increases computational cost and diverges attention distributions.
method Proposes a shared-score quaternion self-attention mechanism.
result Reduces score-computation multiplications by 75% and softmax operations from four to one.

The increased availability of the multi-view data (data on the same samples from multiple sources) has led to strong interest in models based on low-rank matrix factorizations. These models represent each data view via shared and individual components, and have been successfully applied for exploratory dimension reduct…

2017-07-20abs ↗pdf ↗

This paper proposes a novel learning method for multi-task applications. Multi-task neural networks can learn to transfer knowledge across different tasks by using parameter sharing. However, sharing parameters between unrelated tasks can hurt performance. To address this issue, we propose a framework to learn fine-gra…

2019-10-10abs ↗pdf ↗

This work explains how maximizing latent correlations across multiple data views helps in identifying shared and private components.

problem Understanding how to identify shared and private components in multiview data.
method An intuitive generative model of multiview data is adopted, and latent correlation maximization is shown to guarantee the extraction of shared components.
result Latent correlation maximization guarantees the extraction of shared components across views and disentangles private information.

Multitask learning, i.e. taking advantage of the relatedness of individual tasks in order to improve performance on all of them, is a core challenge in the field of machine learning. We focus on matrix regression tasks where the rank of the weight matrix is constrained to reduce sample complexity. We introduce the comm…

2019-10-27abs ↗pdf ↗

PerPCA separates unique and shared features from heterogeneous data.

problem Extracting shared and unique features from data collected from different sources with varying trends.
method Personalized PCA (PerPCA) uses orthogonal global and local principal components to encode both unique and shared features.
result PerPCA can identify and recover both unique and shared features under mild conditions.

In this paper, we develop a parameter estimation method for factorially parametrized models such as Factorial Gaussian Mixture Model and Factorial Hidden Markov Model. Our contributions are two-fold. First, we show that the emission matrix of the standard Factorial Model is unidentifiable even if the true assignment ma…

2015-08-18abs ↗pdf ↗

For a risk vector VV, whose components are shared among agents by some random mechanism, we obtain asymptotic lower and upper bounds for the individual agents' exposure risk and the aggregated risk in the market. Risk is measured by Value-at-Risk or Conditional Tail Expectation. We assume Pareto tails for the componen…

2015-03-12abs ↗pdf ↗

Method estimates shared and study-specific factors for multi-study data.

problem Covariance estimation for multi-study data with shared and study-specific components.
method Spectral decomposition for latent factors, surrogate Bayesian regressions for loadings and variances.
result Strong frequentist guarantees and superior performance in simulations and real data.

The paper improves classification accuracy by leveraging a shared signal across domains in high-dimensional classification.

problem Improving classification accuracy in high-dimensional data with shared signals across domains.
method Transfer learning for linear discriminant analysis, decomposing mean differences into common and domain-specific components.
result Deterministic limits for transfer performance, leading to optimal weights and corrections for bias.

Proposes joint LCA for multiview data to identify shared and view-specific components.

problem Extracting shared components sequentially from multiview data.
method Formulates a matrix decomposition model with joint and individual structures, proposes a penalty term objective function, and employs a refitting procedure.
result Achieves simultaneous estimation and rank selection for cross covariance.

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.

This paper introduces a cross adversarial source separation (CASS) framework via autoencoder, a new model that aims at separating an input signal consisting of a mixture of multiple components into individual components defined via adversarial learning and autoencoder fitting. CASS unifies popular generative networks l…

2019-05-23abs ↗pdf ↗

Multi-modal data collections, such as corpora of paired images and text snippets, require analysis methods beyond single-view component and topic models. For continuous observations the current dominant approach is based on extensions of canonical correlation analysis, factorizing the variation into components shared b…

2012-10-16abs ↗pdf ↗

The paper defines fair profit sharing ratios in Islamic PL contracts.

problem Determining fair profit sharing ratios in Islamic PL contracts.
method Introduces cc-fair profit sharing ratios and uses econometrics models to compute or approximate them.
result Elucidates the relation between profit sharing ratios and economic factors.

Study examines value relevance of oil and gas reserve disclosures in London Stock Exchange.

problem Uncertainty in oil and gas reserves poses accounting challenges for investors.
method Empirical analysis using archival data and multifactor framework.
result Changes in reserves and their components are associated with share returns, but insignificantly due to oil price and longitudinal effects. Quality of disclosures positively impacts share returns.

The paper proposes methods to find a shared active subspace for multivariate vector-valued functions.

problem Minimizing the deviation between function evaluations in the original and reconstructed spaces.
method Manipulating gradients or SPD matrices to identify a shared structure.
result Summing SPD matrices often identifies the best shared active subspace.

HCL learns shared and modality-specific latent representations for multimodal data.

problem Binary shared-private decomposition inadequately represents shared information across subsets of modalities.
method Hierarchical Contrastive Learning framework combining latent-variable formulation, structural sparsity, and contrastive objective.
result HCL accurately recovers hierarchical structure and improves predictive performance on multimodal data.

Enhancing spectral embedding for low-dimensional embeddings in rare disease cohorts

problem Representing clinical concepts and patients in electronic health records
method Spectral-based unsupervised learning with flexible knowledge transfer
result Outperforms competing approaches in challenging scenarios

Enhances LLM quantization with MDBF, improving perplexity and accuracy.

problem Limited performance of Double Binary Factorization in extreme quantization.
method Introduces Multi-envelope DBF, retaining sign matrices and replacing single envelope with rank-ll envelope.
result Improves perplexity and zero-shot accuracy over previous binary formats.

Document clustering and topic modeling are two closely related tasks which can mutually benefit each other. Topic modeling can project documents into a topic space which facilitates effective document clustering. Cluster labels discovered by document clustering can be incorporated into topic models to extract local top…

2013-09-26abs ↗pdf ↗

In this paper, we investigate the problem of learning disentangled representations. Given a pair of images sharing some attributes, we aim to create a low-dimensional representation which is split into two parts: a shared representation that captures the common information between the images and an exclusive representa…

2019-12-09abs ↗pdf ↗

Many machine learning algorithms are based on the assumption that training examples are drawn independently. However, this assumption does not hold anymore when learning from a networked sample because two or more training examples may share some common objects, and hence share the features of these shared objects. We …

2014-05-11abs ↗pdf ↗

Algorithm reduces regret in distributed kernel bandits with shared randomness.

problem Minimizing regret in collaborative function maximization.
method Uniform exploration at local agents and shared randomness with central server.
result Achieves optimal regret order with sublinear communication cost.

Study proposes a tax-based system to share disaster risk among regions.

problem Systemic risk in catastrophic events and insurer insolvency.
method Public-private partnership with government intervention through taxation.
result Taxation system effectively shares residual claims in case of insurer insolvency.

DeepSeekMoE improves language model efficiency with shared experts and normalized gating.

problem Improving sample efficiency in language model architectures.
method Theoretical and empirical analysis of shared experts and normalized sigmoid gating.
result Theoretical and empirical evidence of improved sample efficiency with shared experts and normalized gating.

The waggle dance that honeybees perform is an astonishing way of communicating the location of food source. After over 60 years of its discovery, researchers still use manual labeling by watching hours of dance videos to detect different transitions between dance components thus extracting information regarding the dis…

2017-05-20abs ↗pdf ↗

We consider high-dimensional distribution estimation through autoregressive networks. By combining the concepts of sparsity, mixtures and parameter sharing we obtain a simple model which is fast to train and which achieves state-of-the-art or better results on several standard benchmark datasets. Specifically, we use a…

2015-11-15abs ↗pdf ↗

We propose to formulate multi-label learning as a estimation of class distribution in a non-linear embedding space, where for each label, its positive data embeddings and negative data embeddings distribute compactly to form a positive component and negative component respectively, while the positive component and nega…

2019-11-17abs ↗pdf ↗

Advances in molecular "omics'" technologies have motivated new methodology for the integration of multiple sources of high-content biomedical data. However, most statistical methods for integrating multiple data matrices only consider data shared vertically (one cohort on multiple platforms) or horizontally (different …

2019-06-09abs ↗pdf ↗

The paper analyzes PLS-SVD in high-dimensional data integration, revealing its strengths and limitations.

problem Understanding the behavior of PLS-SVD in high-dimensional data integration.
method Analysis using random matrix theory and singular value decomposition.
result PLS-SVD exhibits counter-intuitive or limiting behavior in certain regimes and outperforms PCA when detecting common latent subspace.

K-FAC speeds up training of modern neural networks with linear weight-sharing.

problem Efficiently training modern neural networks with linear weight-sharing layers.
method Kronecker-Factored Approximate Curvature (K-FAC) applied to linear weight-sharing layers.
result K-FAC-reduce is generally faster than K-FAC-expand for deep linear networks.

ARCO-BO optimizes multi-agent design under heterogeneity, improving efficiency and performance.

problem Heterogeneous multi-agent optimization challenges in resource use and information sharing.
method ARCO-BO integrates a consensus mechanism, budget-aware sampling, and partial input sharing for heterogeneous design spaces.
result ARCO-BO outperforms independent and collaborative BO methods in complex multi-agent settings.

Regularized MFPCA smooths multivariate functional data for clearer patterns.

problem Challenges in controlling roughness of multivariate functional PCs.
method ReMFPCA incorporates a roughness penalty in a penalized framework to smooth PCs.
result Smoothed multivariate functional PCs reveal clearer patterns.

Study reveals structure of local minima in GMMs, identifying key cluster centers.

problem Identifying optimal cluster centers in non-convex GMM landscapes.
method Analyzing the negative log-likelihood function of GMMs in the population limit.
result Local minima share a common structure that partially identifies true cluster centers.

Study shows changes in information sharing between Bitcoin markets during 2017 crash.

problem Understanding information dynamics in Bitcoin markets during the 2017 crash.
method Analysis of high-frequency market-microstructure observables using information theoretic measures.
result Temporal changes in information sharing across markets, including predictability, memory, and synchronous coupling.

Study shows investor sentiment boosts intraday trading in Chinese markets.

problem Impact of investor sentiment on intraday overtrading in Chinese A-share markets.
method High-frequency sentiment indices from social media analyzed for intraday overtrading in CSI 300 and CSI 500 constituents.
result Investor sentiment significantly increases intraday overtrading, especially among institutional investors.