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

Trend · papers per month

3527051,0571,409 · Jun 202019922001200920182026
48 results for Multi-view models

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.

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.

Semi-supervised model learns multi-view data representations.

problem Learning discriminative representations with limited labeled data.
method Multi-view Discriminative Neural Network (MDNN) with coupled deep networks.
result MDNN effectively separates and clusters samples from different and same classes.

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.

New GP model for multi-view learning combining views with regularization.

problem Lack of multi-view learning applications in Gaussian processes.
method Regularizes marginal likelihood with consistency among latent functions from different views, and improves model with point selection scheme.
result Improves performance in multi-view learning across multiple real-world datasets.

A new framework learns shared features from multi-view data with many-to-many associations.

problem Learning shared features from multi-view data with many-to-many associations.
method Probabilistic Multi-view Graph Embedding (PMvGE) using neural networks.
result PMvGE outperforms existing multi-view methods in large-scale datasets.

Enhances robustness of multi-view clustering via partition fusion.

problem Dealing with noises and inconsistency in multi-view data.
method Generates multiple partitions, integrates them, and co-evolves graph learning, partition generation, and view weight learning.
result Empirical results verify the effectiveness and robustness of the proposed approach.

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.

We propose a nonparametric Bayesian probabilistic latent variable model for multi-view anomaly detection, which is the task of finding instances that have inconsistent views. With the proposed model, all views of a non-anomalous instance are assumed to be generated from a single latent vector. On the other hand, an ano…

2014-11-13abs ↗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.

End-to-end method learns geometry and appearance for multi-view object detection.

problem Challenges in multi-view object detection, including viewpoint, lighting, and scale variability.
method Jointly learns multi-view geometry and warping for robust cross-view object detection.
result Superior performance compared to baselines on a new street-level panorama data set.

Proposes a novel method to identify complex effects in multi-view datasets.

problem Challenges in analyzing multi-view biomedical datasets with complex interactions.
method Generalized kernel machine approach considering marginal and joint effects of features from different views.
result Effective identification of higher-order composite effects in multi-view datasets.

FCMSC combines multi-view data through feature concatenation for improved clustering.

problem Clustering multi-view data with diverse and sometimes incompatible views.
method FCMSC concatenates multi-view data, integrates l2,1l_{2,1}-norm, and uses graph regularization to explore consensus and complementary information.
result FCMSC outperforms state-of-the-art multi-view clustering methods on six real-world datasets.

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.

A new clustering method learns shared hidden space and fuzzy partition between multi-view data.

problem Effective exploitation of relationship between different views in multi-view data.
method Hidden space sharing multi-view fuzzy clustering (HSS-MVFC) method based on fuzzy c-means.
result The proposed method outperforms many related clustering methods in experiments.

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.

Enhances GPLVM for multi-view data with scalable latent representation learning.

problem Limited kernel expressiveness and computational inefficiency in multi-view GPLVM.
method Introduces a new duality between spectral density and kernel function, uses NG-SM kernel, and applies random Fourier feature approximation for scalability.
result Consistently outperforms state-of-the-art models in learning meaningful latent representations across diverse datasets.

DICCA maps multi-view data into a shared latent space with interpretable components.

problem Learning from multiple related but distinct data views.
method DICCA extends CCA to deep generative networks and uses sparsity-inducing priors for interpretability.
result DICCA effectively disentangles shared and view-specific variations in multi-view data.

R package `mvs` handles multi-view data for better model performance.

problem Classical machine learning ignores multi-view data structure, limiting interpretability and performance.
method Multi-view stacking (MVS) framework, training on each view separately, cross-validation for weights, ensemble learning.
result MVS improves model performance on multi-view data.

Model integrates multi-view temporal data for better understanding of latent dynamics.

problem Understanding time-dependent heterogeneous properties from multi-view data.
method Generative model using variational autoencoder and recurrent neural network.
result Identifies disentangled latent embeddings across views while accounting for time factor.

Proposes a multi-view DR algorithm to improve learning performance.

problem Improving learning performance with multi-view high-dimensional data.
method Smooth Preserve Projection extended to multi-view using Hilbert-Schmidt Independence Criterion.
result Excellent performance on multi-view 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.

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.

MuVI models multi-view data with structured sparsity, integrating domain knowledge.

problem Disentangling variation across multiple data views in complex systems.
method Multi-view latent variable model with structured sparsity using a modified horseshoe prior.
result MuVI outperforms state-of-the-art methods in structured sparsity modeling and integrates noisy domain expertise.

Proposes MV-Co-VH for multi-view clustering using visible and hidden views.

problem Lack of efficient algorithms for fully utilizing multi-view data.
method Projects multiple views to a common hidden space using NMF, then applies collaborative learning.
result Competitive clustering performance on UCI and real-world datasets.

Gen-RKM framework generates multi-view data with uncorrelated features.

problem Joint multi-view generation and disentangled feature learning.
method Joint multi-view generation using shared representation; primal and dual formulations; novel training procedure for neural networks.
result Joint multi-view generation and uncorrelated feature learning achieved.

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.

DMClusts discovers multiple clusterings from multi-view data.

problem Finding multiple meaningful and diverse clusterings from multi-view data.
method Deep matrix factorization to gradually factorize multi-view data into representational subspaces and generate one clustering per layer, enforcing diversity through proximity minimization.
result DMClusts outperforms state-of-the-art multiple clustering solutions.

This paper tackles incomplete multi-view clustering with spectral perturbation theory.

problem Realistic clustering scenario where data instances are missing in certain views.
method Spectral perturbation theory and matrix completion method for incomplete similarity matrix.
result The minimization of perturbation risk bounds maximizes the final fusion result across all views.

Unified multi-view sentence representation improves downstream tasks.

problem Improving sentence representation learning from diverse views.
method Unified multi-view sentence representation learning framework using RNN and linear model, maximizing agreement with adjacent context.
result Improved representations and transferability on downstream tasks.

Unified framework for multi-view diffusion geometries using intertwined diffusion trajectories.

problem Constructing multi-view diffusion geometries with flexible view interaction and fusion.
method Intertwined multi-view diffusion trajectories (MDTs) as a class of inhomogeneous diffusion processes.
result Established theoretical properties and derived diffusion distances and embeddings.

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.

This paper proposes a multi-view learning framework for dimension reduction.

problem Challenges in learning low-dimensional spaces from multiple heterogeneous features.
method Similarity-consensus regularized multi-view learning framework.
result The proposed method achieves comparable performance to previous multi-view learning approaches.

End-to-end deep learning for multi-view clustering improves accuracy across various data types.

problem Limited multi-view clustering methods for general data types and suboptimal two-stage process.
method Permutation-based canonical correlation objective for fused representations; pseudo-labels for clustering; theoretical error bound.
result Proposed model provides meaningful fused representations and effective clustering across multiple views.