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.

169,181 papers · 148 categories

Trend · papers per month

8162432 · Jun 202019922001200920182026
48 results for decentralized fusion

New algorithms for distributed perception using Gaussian processes and transfer learning.

problem Scaling distributed perception to large-scale environments.
method Gaussian process decentralized data fusion with dynamic support sets and transfer learning.
result Agents can dynamically choose support sets and share summaries to predict large-scale phenomena.

New clustering algorithms for sensor networks reduce data exchange.

problem Minimize data exchange in decentralized sensor networks.
method Propose two clustering algorithms working on compressed data without prior cluster count.
result Reduce data exchange by at least 2x compared to K-means and DB-Scan.

Improved robustness in multi-modal sensor fusion with deep learning.

problem Inconsistency in fusion weights leading to poor performance under sensor failures.
method Proposes deep multi-modal sensor fusion architectures with fusion weight regularization and target learning.
result Proposed architectures outperform existing deep learning methods under sensor failures.

This study compares decentralized banks and finds some lack decentralization.

problem Decentralized banks do not fully decentralize transactions as expected.
method Network analysis of transaction data from four banks using core-periphery features.
result MakerDao and Compound are more decentralized than Aave and Liquity.

Meta Fusion integrates various multimodal data fusion strategies into a unified framework.

problem Improving predictive power of machine learning methods across diverse applications.
method Meta Fusion constructs a cohort of models based on latent representations across modalities, sharing soft information to boost performance.
result Meta Fusion consistently outperforms conventional fusion strategies in simulation and real-world applications.

Study improves robustness of deep fusion models against single source noise.

problem Ensuring robustness of deep fusion models against noise added to a single input source.
method Proposed two approaches: a carefully designed loss function and a convolutional fusion layer.
result Deep fusion models become robust against noise applied to a single source, preserving performance on clean data.

A new memory-based fusion layer improves multi-modal deep learning performance.

problem Improving performance of multi-modal deep learning by addressing long-term dependencies.
method Introducing a Memory based Attentive Fusion (MBAF) layer that incorporates both current and long-term dependencies.
result The MBAF layer enhances fusion and improves performance across different modalities and networks.

Study finds Aave token network has core-periphery structure, with high decentralization predicting better returns.

problem Understanding the actual decentralization in DeFi token transactions on the Ethereum blockchain.
method Applied social network analysis to measure decentralization in Aave token transactions.
result A more decentralized Aave token network predicts higher returns and lower volatility.

MakerDAO's governance is centralized despite its decentralized claim.

problem Decentralization illusion in Decentralized Finance (DeFi) governance.
method Empirical analysis using financial, transaction, network, and sentiment indicators.
result Centralized governance impacts Maker protocol and voting power distribution.

This paper improves model fusion by training-time neuron alignment, reducing barriers in multi-model fusion.

problem Diverse neuron permutations across different settings hinder model fusion performances.
method Training-time neuron alignment using fixed neuron anchors to reduce training-time permutations.
result Training-time neuron alignment improves fusion of pretrained models and federated learning performances.

We classify all fusion categories for a given set of fusion rules with three simple object types. If a conjecture of Ostrik is true, our classification completes the classification of fusion categories with three simple object types. To facilitate the discussion we describe a convenient, concrete and useful variation o…

2007-04-02abs ↗pdf ↗

Novel fusion network combines polarization and radiomics features for liver cancer classification.

problem Challenges in histopathological diagnosis of HCC and ICC.
method Two-tier fusion approach: feature-level and classification-level.
result Significantly enhances classification accuracy, even at reduced resolutions.

Study fusion methods for financial image views to improve robustness against attacks.

problem Improving robustness of financial image views for next-day direction prediction.
method Same-source multi-view learning with early fusion and late fusion, using OHLCV and technical-indicator views, and evaluating pixel-space L-infinity attacks.
result Early fusion can suffer negative transfer under noisy settings, while late fusion is more reliable once labels stabilize.

Proposes a new CNN approach for multimodal biometric identification.

problem Improving biometric identification accuracy across multiple modalities.
method Uses a bank of modality-specific CNNs, fuses their outputs, and optimizes the system.
result Significantly outperforms unimodal systems and demonstrates reduction in parameters.

Study on decentralization in DAOs and its effect on financial efficiency in DeFi.

problem Understanding the impact of decentralization on financial efficiency in blockchain-based governance.
method Analysis using Gini coefficient as an inequality indicator, comparing ROI of token owners.
result Real decentralization affects financial efficiency positively in DeFi.

This paper analyzes voter coalitions in MakerDAO's decentralized governance.

problem Understanding the governance structure and influence of voter coalitions in DAOs.
method Applied clustering algorithm to voting history of MakerDAO to identify voter coalitions.
result The emergence of a dominant voter coalition signals governance centralization in DAOs.

Paper proposes a new method for Bayesian linear regression using spike-and-slab priors.

problem Identifying predictors with similar relationships in linear regression models.
method Hierarchical Bayesian models with spike-and-slab priors and a Gibbs sampler.
result The proposed method outperforms previous methods in simulations and real data analysis.

Paper proposes RMFN for multimodal language analysis.

problem Modeling interactions between language, visual, and acoustic modalities.
method Recurrent Multistage Fusion Network (RMFN) decomposes fusion into stages focusing on subsets of multimodal signals.
result RMFN achieves state-of-the-art performance across multimodal sentiment analysis, emotion recognition, and speaker traits recognition datasets.

A lot of attention has been devoted to multimedia indexing over the past few years. In the literature, we often consider two kinds of fusion schemes: The early fusion and the late fusion. In this paper we focus on late classifier fusion, where one combines the scores of each modality at the decision level. To tackle th…

2012-07-04abs ↗pdf ↗

The paper analyzes stability and generalization of decentralized SGD.

problem Stability and generalization of decentralized stochastic gradient descent.
method Novel formulation of decentralized stochastic gradient descent combined with non/convex optimization theory.
result First stability and generalization guarantees for decentralized stochastic gradient descent.

NFTs raise concerns like scams, racism, and sexism; centralization vs decentralization debate.

problem Concerns and value judgments of stakeholders in NFT market.
method Mixed quantitative and qualitative methods: social media analysis and interviews.
result Identified financial scams, counterfeit NFTs, hacking, and unethical NFTs as major issues.

Proposes a new algorithm to reduce communication costs in decentralized training.

problem How to apply error-compensated compression to decentralized training.
method Error-compensated stochastic gradient descent for decentralized training.
result Proposed algorithm outperforms existing methods in communication cost reduction.

A decentralized approach for multi-source domain adaptation.

problem Transfer knowledge from multiple related domains to an unlabeled target domain.
method Federated Dataset Dictionary Learning (FedDaDiL) framework, eliminating central server, using Wasserstein barycenters.
result Our decentralized approach effectively adapts source domains to an unlabeled target domain.

Bayesian fusion improves radar target recognition for UAVs.

problem Improving radar target recognition for UAVs using multistatic radar configurations.
method Proposes a fully Bayesian RATR framework using Optimal Bayesian Fusion (OBF) to aggregate classification probability vectors from multiple radars.
result Empirical results show that the OBF method significantly enhances classification accuracy compared to other fusion methods and single radar configurations.

Adversarial approach enhances sensor fusion for robust target detection.

problem Improving target detection and classification using multi-modal sensor fusion.
method Generative network learns latent space from various sensor modalities, then detects damaged sensors and safeguards performance.
result Automatic robustness against noisy/damaged sensors achieved.

D-SPIDER-SFO solves nonconvex optimization problems faster on decentralized networks.

problem Finding a decentralized algorithm with similar convergence rate to SPIDER-SFO.
method Proposed D-SPIDER-SFO, a decentralized variant of SPIDER-SFO.
result Achieves a similar gradient computation cost to centralized SPIDER-SFO.

Partial fusion combines neural networks to balance accuracy and efficiency.

problem Balancing accuracy and computational cost in neural networks.
method Extending weight aggregation methods based on neuron-level similarity, using partial optimal transport to match similar neurons.
result Achieves a flexible tradeoff between computational cost and performance.