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

136272407543 · May 202619922001200920172026
48 results for shared structure

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.

New algorithm reduces multi-agent bandit regret by sharing data.

problem Designing efficient collaboration between multi-agent linear bandits.
method Bandit Adaptive Sample Sharing (BASS) algorithm, without assumptions on bandit parameters structure.
result Validated through theoretical analysis and empirical evaluations, BASS outperforms current state-of-the-art.

Model improves covariance estimation from shared and distinct datasets.

problem Limited sample sizes and shared covariance structure across related datasets.
method Spiked covariance model with shared subspace, closed-form pooling weight, and asymptotic guarantees.
result Improves estimation of high-dimensional covariance matrices from related datasets.

We study the problem of distributed multi-task learning with shared representation, where each machine aims to learn a separate, but related, task in an unknown shared low-dimensional subspaces, i.e. when the predictor matrix has low rank. We consider a setting where each task is handled by a different machine, with sa…

2016-03-07abs ↗pdf ↗

New model extracts shared brain activity patterns from fMRI data.

problem Challenges in aggregating multi-subject fMRI data due to variability.
method Shared Gaussian Process Factor Analysis (S-GPFA) incorporating temporal information.
result Model reveals ground truth latent structures and replicates experimental performance.

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 ↗

We learn multiple hypotheses for related tasks under a latent hierarchical relationship between tasks. We exploit the intuition that for domain adaptation, we wish to share classifier structure, but for multitask learning, we wish to share covariance structure. Our hierarchical model is seen to subsume several previous…

2014-08-09abs ↗pdf ↗

The large majority of risk-sharing transactions involve few agents, each of whom can heavily influence the structure and the prices of securities. This paper proposes a game where agents' strategic sets consist of all possible sharing securities and pricing kernels that are consistent with Arrow-Debreu sharing rules. F…

2014-12-13abs ↗pdf ↗

MT-HAL learns features and task associations for multiple tasks with a shared sparse structure.

problem Learning features and task associations for multiple tasks with shared structure.
method Fully nonparametric approach that learns features, samples, and task associations with a shared sparse structure.
result MT-HAL achieves a powerful convergence rate and outperforms other methods across various simulation settings.

The paper addresses risk sharing and variability measures among agents with general risk preferences.

problem Risk sharing and variability measures among agents with general risk preferences.
method Characterizes Pareto-optimal allocations using Gini deviation, mean-median deviation, and inter-quantile difference as variability measures.
result Optimal allocations are not comonotonic and feature a mixture of pairwise counter-monotonic structures.

Researchers develop a method to measure treatment effects in settings with shared states.

problem Measuring treatment effects in settings with shared states like prices, recommendations, or social signals.
method Double machine learning (DML) theorem with conditions for efficient inference under shared-state interference.
result Efficient estimation of average direct effect (ADE) and global average treatment effect (GATE) in various models.

CMF is a technique for simultaneously learning low-rank representations based on a collection of matrices with shared entities. A typical example is the joint modeling of user-item, item-property, and user-feature matrices in a recommender system. The key idea in CMF is that the embeddings are shared across the matrice…

2013-12-20abs ↗pdf ↗

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 analyzes P2P collaborative insurance products and network structure impact.

problem Analyzing P2P collaborative insurance products and their network structure impact.
method Examined a P2P insurance product with reciprocal risk sharing contracts, studied network structure impact on risk reduction, and discussed optimal reciprocal commitments.
result The network structure, particularly the distribution of degrees, significantly impacts risk reduction in P2P insurance products.

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.

Paper tackles robust decision-making from multiple sites with shared structure.

problem Learning robust sequential decisions from heterogeneous multi-site datasets.
method Group-Robust MDPs with d-rectangular uncertainty sets, feature-wise worst-case aggregation, and cluster-level pooling.
result Proves suboptimality bound for robust planning policy under robust partial coverage assumption.

Paper provides new bounds for risk aggregation and sharing.

problem Quantitative risk management and robust risk aggregation with dependence uncertainty.
method Established new inequality for RVaR, derived extended convolution bounds, and analyzed risk sharing for averaged quantiles.
result Extended convolution bounds for robust risk aggregation and risk sharing, providing sharpness conditions and explicit expressions.

First-order ANIL learns shared representations even with overparametrization.

problem Lack of theoretical evidence for model-agnostic meta-learning (ANIL) learning shared representations.
method First-order ANIL with a linear two-layer network architecture, showing asymptotically low-rank solutions with overparametrization.
result First-order ANIL learns linear shared representations, even with overparametrization, and performs well in adaptation.

CoreFlow models matrix-valued distributions efficiently, preserving shared low-rank structure.

problem Learning matrix-valued distributions from high-dimensional and incomplete data.
method Low-rank flow model that learns shared row/column subspaces and trains a normalizing flow on the core.
result CoreFlow improves generation quality in few-sample regimes and remains competitive in data-rich settings.

Consensus dimension reduction combines multiple visualizations to identify shared patterns.

problem Conflicting visualizations from different dimension reduction methods.
method Multi-view learning to identify stable patterns across multiple views.
result Consensus visualization effectively identifies shared low-dimensional data structure.

Analyzing multivariate time series data is important to predict future events and changes of complex systems in finance, manufacturing, and administrative decisions. The expressiveness power of Gaussian Process (GP) regression methods has been significantly improved by compositional covariance structures. In this paper…

2017-03-28abs ↗pdf ↗

GDA-HIN adapts across heterogeneous networks by aligning shared and private node types.

problem Domain adaptation challenges in heterogeneous networks with shared and private node types.
method Generalized Domain Adaptive model across HINs (GDA-HIN) that aligns identical-type nodes and edges while utilizing different-type nodes and edges.
result GDA-HIN outperforms state-of-the-art methods in various domain adaptation tasks across heterogeneous networks.

Diffusion models adapt to low-dimensional structures for nonparametric density estimation.

problem High-dimensional statistical inference challenges.
method Viewing diffusion models as implicit density estimators and exploiting their low-dimensional structure.
result Achieves minimax optimal rate for total variation distance with factorizable density.

Kernel method embeds noisy datasets, capturing shared structures.

problem Limited power in capturing nonlinear structures, noisiness, high-dimensionality, and interpretability issues.
method Kernel spectral joint embeddings using duo-landmark integral operators.
result Consistent recovery of low-dimensional noiseless signals and convergence to eigenfunctions of integral operators.

IPGP framework improves psychological assessment by integrating shared and unique traits.

problem Tackles the debate on shared vs unique personality traits across individuals.
method Uses Gaussian process coregionalization model for non-Gaussian ordinal data, with stochastic variational inference for scalability.
result Improves prediction and estimation of individualized factor structures compared to existing methods.

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.

The paper explores methods to better estimate treatment effects by leveraging shared structure in potential outcomes.

problem Estimating treatment effects when outcomes may vary widely and existing methods often assume heterogeneity.
method Investigates and compares three learning strategies: regularization, reparametrization, and a multi-task architecture.
result All three approaches improve upon existing baselines, providing insights into their relative strengths.

A new model detects common patterns in pollination networks.

problem Comparing organization of bipartite networks to understand community structure.
method colBiSBM, a family of probabilistic models for collections of bipartite networks.
result The method uncovers shared ecological roles and partitions networks.

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.

Proposes EOT eigenmaps for aligning and embedding multiple datasets.

problem Aligning and embedding multiple datasets with shared structures but individual distortions.
method Entropic Optimal Transport (EOT) eigenmaps, leveraging leading singular vectors of EOT plan matrix.
result Proves theoretical guarantees and favorable properties for aligning and embedding datasets.

A new method for analyzing multi-source, multi-way data reduces dimensionality and reveals shared and individual structures.

problem Analyzing multi-source, multi-way data from different high-throughput technologies.
method Multiple Linked Tensor Factorization (MULTIFAC) extending CP decomposition with L2 penalties and EM algorithm for incomplete data.
result MULTIFAC approximates underlying signal, identifies shared and unshared structures, and imputes missing data.

Unified MTL framework for heterogeneous data integrates shared and task-specific encoders.

problem Efficiently sharing information across multiple tasks with heterogeneous data.
method Dual-encoder framework with task-shared and task-specific encoders.
result Unified algorithm alternates learning task-specific and shared encoders and coefficients.