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,742 papers · 148 categories

Trend · papers per month

265379105 · May 202619922001200920172026
48 results for multi-view alignment

A new multi-view clustering method using deep matrix decomposition and partition alignment.

problem Improving multi-view clustering methods to better utilize data representations and view-specific structures.
method Deep matrix decomposition for partition representations, joint use of partition representations, and alternating optimization.
result Demonstrated effectiveness on six benchmark datasets compared to state-of-the-art methods.

A new method for drone-based geo-localization using style and spatial alignment.

problem Geo-localization of drone-view images with satellite-view images using pre-annotated GPS tags.
method Orientation-based method to align patterns, new branch to extract aligned partial features, style alignment strategy.
result The proposed method outperforms state-of-the-art alternatives in geo-localization accuracy.

Proposes Gromov-Wasserstein methods for multi-view embedding.

problem Integrating multiple representations of the same samples in heterogeneous geometries.
method Gromov-Wasserstein optimal transport for multi-view embedding.
result Preserves intrinsic relational structure across views effectively.

Nowadays, multi-view clustering has attracted more and more attention. To date, almost all the previous studies assume that views are complete. However, in reality, it is often the case that each view may contain some missing instances. Such incompleteness makes it impossible to directly use traditional multi-view clus…

2019-03-07abs ↗pdf ↗

Unified framework improves deep multi-view clustering by addressing self-supervision and contrastive alignment issues.

problem Variations in self-supervision-based methods for deep multi-view clustering.
method Unified DeepMVC framework that includes recent methods and leverages self-supervision and contrastive alignment.
result Contrastive alignment negatively impacts cluster separability, especially with many views.

Multi-view clustering is an important yet challenging task due to the difficulty of integrating the information from multiple representations. Most existing multi-view clustering methods explore the heterogeneous information in the space where the data points lie. Such common practice may cause significant information …

2019-09-13abs ↗pdf ↗

SpecRaGE learns robust multi-view representations using graph Laplacians and neural networks.

problem Challenges in generalizing and scaling multi-view representation learning methods.
method SpecRaGE integrates graph Laplacian methods with neural networks to learn robust representations.
result SpecRaGE outperforms state-of-the-art methods in noisy and contaminated data scenarios.

New PAC-Bayesian bounds for multi-view learning using Rényi divergence.

problem Applying PAC-Bayesian theory to multi-view learning.
method Introducing novel PAC-Bayesian bounds based on Rényi divergence for multi-view learning.
result Efficient optimization algorithms that align with theoretical bounds.

Proposes HOT method for robust multi-view learning.

problem Inability of traditional methods to handle unaligned and non-distributionally aligned views.
method Hierarchical optimal transport (HOT) method that penalizes sliced Wasserstein distances between different views.
result HOT method achieves robust performance on both synthetic and real-world tasks.

FAML addresses biased evidence learning in multi-view learning, improving fairness and prediction reliability.

problem Biased evidence learning in multi-view learning, leading to unreliable uncertainty estimation.
method FAML introduces an adaptive prior and fairness constraint to balance evidence allocation across views.
result FAML enhances fairness and improves prediction reliability compared to state-of-the-art methods.

DMFAW improves multi-view clustering with adaptive weights and feature selection.

problem Lack of effective feature selection and empirical hyperparameter selection in existing deep matrix factorization methods.
method Introduces Deep Matrix Factorization with Adaptive Weights (DMFAW) for multi-view clustering, incorporating feature selection and dynamically updating weights using Control Theory.
result DMFAW outperforms state-of-the-art methods in clustering performance.

LargeMvC-Net improves scalability of multi-view clustering.

problem Scalability issues in multi-view clustering.
method Deep unfolding of multi-view clustering into a network architecture with three modules.
result LargeMvC-Net consistently outperforms state-of-the-art methods in scalability and effectiveness.

New method estimates covariance in multi-view data with better accuracy and uncertainty.

problem Estimating covariance in multi-view data with shared and view-specific latent factors.
method Spectral decompositions and conditional conjugate priors for factor loadings and residual variances.
result Proves favorable asymptotic properties and excellent performance in simulations and real data.

Merlin improves robustness of MTSF models to missing data.

problem Suboptimal forecasting performance due to unfixed missing rates in MTSF models.
method Offline knowledge distillation and multi-view contrastive learning.
result Merlin enhances robustness of MTSF models while preserving accuracy.

Canonical Correlation Analysis (CCA) is a classic technique for multi-view data analysis. To overcome the deficiency of linear correlation in practical multi-view learning tasks, various CCA variants were proposed to capture nonlinear dependency. However, it is non-trivial to have an in-principle understanding of these…

2019-07-04abs ↗pdf ↗

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 MvLPE for better multi-view representation learning.

problem Learning representations from multi-view data with varying correlations.
method Integrates multi-view data into a centroid view while maintaining low-rank reconstruction relations.
result MvLPE outperforms existing methods on benchmark datasets.

Error-robust multi-view clustering tackles noisy data across multiple sources.

problem Error in multi-view data degrades clustering performance.
method Blind clustering without error consideration is ineffective. Various approaches like sparsity, graph, subspace, and deep learning are reviewed.
result Error-robust multi-view clustering improves clustering accuracy even with corrupted data.

Multi-view clustering is a learning paradigm based on multi-view data. Since statistic properties of different views are diverse, even incompatible, few approaches implement multi-view clustering based on the concatenated features straightforward. However, feature concatenation is a natural way to combine multi-view da…

2019-01-30abs ↗pdf ↗

Federated multi-view matrix factorization learns from multiple data sources without centralizing user data.

problem Cold-start federated recommendations and multi-view data structure.
method Federated learning framework extended to multi-view matrix factorization.
result Federated multi-view matrix factorization outperforms simpler methods in cold-start federated recommendations.

Dual adversarial domain adaptation improves knowledge transfer between labeled and unlabeled domains.

problem Transfer knowledge from labeled to unlabeled domains using unsupervised methods.
method Adopt a discriminator with 2K-dimensional output for both domain-level and class-level alignments. Design a dual adversarial mechanism to pit two discriminators against each other.
result Our method outperforms state-of-the-art domain adaptation methods on real-world datasets.

DEMVC improves multi-view clustering with collaborative training and deep autoencoders.

problem Existing multi-view clustering methods have high computation and space complexities or lack representation capability.
method DEMVC learns embedded representations of multiple views individually using deep autoencoders and collaboratively trains all views.
result DEMVC achieves significant improvements over state-of-the-art methods on multi-view datasets.

Proposes KMvDA for object recognition from multi-view data.

problem Recognizing objects from different views, even when views are heterogeneous.
method Introduces kernel multi-view discriminant analysis (KMvDA) and uses random Fourier features (RFF) for large-scale learning.
result KMvDA and RFF approximation improve object recognition from multi-view data.

Proposes a new multi-view graph learning framework to model consistency and inconsistency.

problem Graph learning methods often neglect inconsistency across multiple views, making them vulnerable to noisy datasets.
method Proposes a unified objective function to simultaneously model consistency and inconsistency, iteratively learning consistent and unified graphs.
result Demonstrates robustness and efficiency of the proposed approach on twelve multi-view datasets.

With advances in information acquisition technologies, multi-view data become ubiquitous. Multi-view learning has thus become more and more popular in machine learning and data mining fields. Multi-view unsupervised or semi-supervised learning, such as co-training, co-regularization has gained considerable attention. A…

2017-12-18abs ↗pdf ↗

PROTOCOL tackles imbalanced multi-view clustering by enhancing contrastive learning.

problem Class imbalance in real-world multi-view data.
method PROTOCOL uses partial optimal transport to perceive and mitigate imbalance, enhancing contrastive learning.
result PROTOCOL significantly improves clustering performance on imbalanced multi-view data.

Multi-view clustering is an important approach to analyze multi-view data in an unsupervised way. Among various methods, the multi-view subspace clustering approach has gained increasing attention due to its encouraging performance. Basically, it integrates multi-view information into graphs, which are then fed into sp…

2019-12-03abs ↗pdf ↗

Unified framework for multi-view autoencoders simplifies model implementation and evaluation.

problem Inconsistent notation and implementation of multi-view autoencoders.
method Unified mathematical framework, documentation, and Python library.
result Comparable or superior performance in benchmarking experiments.

Proposes a deep probabilistic multi-view model for multi-view learning.

problem Learning from multiple related views with shared latent structure.
method Probabilistic Canonical Correlation Analysis (CCA) in latent space, deep generative networks, variational inference.
result Efficient variational inference approximates posterior distributions of latent multi-view layer.

OpenViewer tackles multi-view learning challenges with interpretability and generalization.

problem Lack of interpretability and insufficient generalization in multi-view learning models.
method OpenViewer introduces a Pseudo-Unknown Sample Generation Mechanism, Expression-Enhanced Deep Unfolding Network, and Perception-Augmented Open-Set Training Regime.
result OpenViewer effectively addresses openness challenges and enhances recognition performance for both known and unknown samples.

While neural networks for learning representation of multi-view data have been previously proposed as one of the state-of-the-art multi-view dimension reduction techniques, how to make the representation discriminative with only a small amount of labeled data is not well-studied. We introduce a semi-supervised neural n…

2018-11-11abs ↗pdf ↗

Multiple clustering aims at exploring alternative clusterings to organize the data into meaningful groups from different perspectives. Existing multiple clustering algorithms are designed for single-view data. We assume that the individuality and commonality of multi-view data can be leveraged to generate high-quality …

2019-05-13abs ↗pdf ↗

Multi-view clustering has received much attention recently. Most of the existing multi-view clustering methods only focus on one-sided clustering. As the co-occurring data elements involve the counts of sample-feature co-occurrences, it is more efficient to conduct two-sided clustering along the samples and features si…

2019-05-25abs ↗pdf ↗

New method clusters multi-view data by squeezing hybrid knowledge.

problem Removal of redundant information and fusion of multi-view features.
method Low-rank subspace multi-view clustering with adaptive graph regularization.
result Our method outperforms state-of-the-art algorithms on multi-view benchmarks.

Proposes CRG_IMSC for better clustering of multi-view data.

problem Lack of effective connectivity in clustering results.
method Directly obtains clustering result with nonnegative constraint; constructs connectivity matrix based on spectral clustering result; uses multiplicative update algorithm.
result Improves clustering performance on benchmark datasets.