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

120241361481 · Jun 202019922001200920172026
48 results for shared information

A new framework forecasts stock trends by mining shared information from concepts.

problem Forecasting stock trends using static concept information limits accuracy.
method Proposes a graph-based framework that mines concept-oriented shared information from both predefined and hidden concepts.
result Improves stock trend forecasting performance through dynamic concept relevance and hidden concept information.

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 ↗

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.

The study examines how formal index insurance compares to informal risk sharing in managing natural disasters.

problem The challenges of natural disasters and the effectiveness of index insurance in risk management.
method A three-strategy evolutionary game model to analyze the competitive relationship between formal index insurance, informal risk sharing, and non-insurance.
result Basis risk and loss ratio significantly impact the adoption rate of index insurance, with different strategies preferred under varying conditions.

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.

Proposes a method to integrate learner models robustly against misspecifications.

problem Misspecifications in learner models and parameter sharing patterns degrade prediction accuracy.
method Sequentially incorporates additional learners based on user-specified parameter sharing patterns.
result Data-adaptively selects the most suitable way of parameter sharing to enhance predictive performance.

The paper optimizes private data sharing by selecting statistics and using MCMC for Bayesian inference.

problem Optimizing private data sharing by selecting statistics and performing Bayesian inference.
method Promotes Fisher information for statistic selection and proposes MCMC algorithms for inference.
result The Fisher information of the privatized statistic predicts the relative performance of the statistic in Bayesian estimation.

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.

We present a multi-task learning formulation for Deep Gaussian processes (DGPs), through non-linear mixtures of latent processes. The latent space is composed of private processes that capture within-task information and shared processes that capture across-task dependencies. We propose two different methods for segmen…

2019-05-29abs ↗pdf ↗

PIMA autoencoders discover shared features in multimodal scientific data.

problem Discovering shared information in high-throughput scientific datasets.
method Physics-informed multimodal autoencoders (PIMA) with Gaussian mixture prior and product of experts formulation.
result Accurate cross-modal inference between images and mechanical stress-strain response in lattice metamaterials.

NFT royalties boost creator earnings by sharing risk, reducing info asymmetry, and enabling price discrimination.

problem NFTs' royalties are criticized for being neutralized by speculators.
method Analyzes NFTs' royalties in various market conditions and their effects on creators.
result Royalties enable creators to capitalize on speculators' presence through risk sharing, info reduction, and price discrimination.

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.

A framework for anonymized risk sharing without revealing identities or preferences.

problem Risk sharing without revealing individual identities or preferences.
method Axiomatic framework with four key axioms: actuarial fairness, risk fairness, risk anonymity, and operational anonymity.
result The conditional mean risk sharing rule is uniquely characterized by these axioms.

Amortized Causal Discovery learns to infer causal graphs from time-series data, improving performance.

problem Inference of causal graphs from time-series data is inefficient due to fitting new models for each sample.
method Proposes Amortized Causal Discovery, a variational model that leverages shared dynamics across samples with different causal graphs.
result Significant improvements in causal discovery performance demonstrated experimentally.

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.

Bayesian model transfers knowledge across different engineering fleets.

problem Data sparsity in predictive models for engineering infrastructure.
method Hierarchical Bayesian approach with multitask learning.
result Improves survival analysis and power prediction in truck fleets and wind farms.

In this paper we present an econophysic model for the description of shares transactions in a capital market. For introducing the fundamentals of this model we used an analogy between the electrical field produced by a system of charges and the overall of economic and financial information of the shares transactions fr…

2011-01-24abs ↗pdf ↗

Despite significant progress, deep reinforcement learning (RL) suffers from data-inefficiency and limited generalization. Recent efforts apply meta-learning to learn a meta-learner from a set of RL tasks such that a novel but related task could be solved quickly. Though specific in some ways, different tasks in meta-RL…

2019-05-16abs ↗pdf ↗

Graph-coupled causal Bayesian optimization transfers information across related interventions.

problem Optimizing expensive systems where interventions are costly and causal effects are confounded.
method Ties intervention effects together through shared causal parameters, improving estimation.
result Information-gain and regret bounds show improved performance with shared mechanisms.

Unified multitask learning framework for mixed-type outcomes.

problem Difficulty in formulating a unified objective for tasks with different outcomes.
method Multitask transformation framework with shared sparsity, using deep neural networks and rank-based optimization.
result Improved prediction and variable selection across continuous, binary, and mixed outcomes.

Paper tackles entity matching over multi-source data, optimizing alignment and mitigating negative transfer.

problem Learning effective entity matching models over multi-source large-scale data with relaxed assumptions.
method Proposes a Relaxed Multi-source Large-scale Entity-matching (RMLE) problem and Incentive Compatible Pareto Alignment (ICPA) method.
result Optimized cross-source alignments and mitigated negative transfer, improving entity matching accuracy.

With the success of deep neural networks, Neural Architecture Search (NAS) as a way of automatic model design has attracted wide attention. As training every child model from scratch is very time-consuming, recent works leverage weight-sharing to speed up the model evaluation procedure. These approaches greatly reduce …

2020-01-06abs ↗pdf ↗

IndiSeek learns disentangled representations by balancing independence and completeness.

problem Learning disentangled representations with mutual information in multi-modal data.
method Combines independence-enforcing objective with a reconstruction loss that bounds conditional mutual information.
result Demonstrates effectiveness on synthetic data, CITE-seq, and real-world multi-modal benchmarks.

CLIP dataset helps extract action items from hospital discharge notes.

problem Lost action items in long discharge notes hinder information sharing.
method Created CLIP dataset of annotated discharge notes, used multi-aspect extractive summarization, trained models on pre-trained language models and context.
result Best models improved by incorporating context and pre-trained language models.

ComEx protocol reduces communication costs in cooperative bandits.

problem Minimizing communication costs in cooperative bandits while maintaining optimal performance.
method Developed ComEx protocol to reduce communication from Θ(T)Θ(T) to O(logT)O(\log T) messages.
result Achieves state-of-the-art performance with significantly reduced communication cost.

In the paradigm of multi-task learning, mul- tiple related prediction tasks are learned jointly, sharing information across the tasks. We propose a framework for multi-task learn- ing that enables one to selectively share the information across the tasks. We assume that each task parameter vector is a linear combi- nat…

2012-06-27abs ↗pdf ↗

This work addresses privacy issues in IoT data sharing by balancing information disclosure and user privacy.

problem Balancing privacy and utility in time-series data sharing from IoT devices.
method Formulated as POMDPs, solved using A2C DRL, evaluated with synthetic and real data.
result Proposed policies achieve a good balance between privacy and utility.

Method captures shared information across many views robustly.

problem Modeling hundreds of views per event and learning robust embeddings without view knowledge.
method View bootstrapping using multi-view correlation and matrix concentration theory.
result View bootstrapping captures shared information across many views robustly.

New method identifies shared topics in LLM inputs and outputs for better detection of hallucinations.

problem Detecting semantic drift in LLM responses from context.
method Transformed Deterministic Information Bottleneck (DIB) into UDIB for high-dimensional data.
result UDIB generates more informative topic representations for SDM, improving hallucination detection.

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.

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.

A novel approach tackles sparse linear bandits with reduced communication costs and minimal cumulative regret.

problem Sparse linear bandits with high-dimensional feature vectors and limited relevant features.
method Cooperative Thresholded Lasso using Lasso and ridge regression for dimension reduction and aggregation.
result Regret bound of O(s0logd+s0T)\mathcal{O}(s_0 \log d + s_0 \sqrt{T}) with high probability.

Learning from multiple sources of information is an important problem in machine-learning research. The key challenges are learning representations and formulating inference methods that take into account the complementarity and redundancy of various information sources. In this paper we formulate a variational autoenc…

2018-11-11abs ↗pdf ↗

Nowadays, privacy preserving machine learning has been drawing much attention in both industry and academy. Meanwhile, recommender systems have been extensively adopted by many commercial platforms (e.g. Amazon) and they are mainly built based on user-item interactions. Besides, social platforms (e.g. Facebook) have ri…

2020-02-06abs ↗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.